Fast and memory-efficient topological denoising of 2D and 3D scalar fields Journal Article

Author(s): Günther, David; Jacobson, Alec; Reininghaus, Jan; Seidel, Hans P; Sorkine-Hornung, Olga; Weinkauf, Tino
Article Title: Fast and memory-efficient topological denoising of 2D and 3D scalar fields
Affiliation IST Austria
Abstract: (Figure Presented) Data acquisition, numerical inaccuracies, and sampling often introduce noise in measurements and simulations. Removing this noise is often necessary for efficient analysis and visualization of this data, yet many denoising techniques change the minima and maxima of a scalar field. For example, the extrema can appear or disappear, spatially move, and change their value. This can lead to wrong interpretations of the data, e.g., when the maximum temperature over an area is falsely reported being a few degrees cooler because the denoising method is unaware of these features. Recently, a topological denoising technique based on a global energy optimization was proposed, which allows the topology-controlled denoising of 2D scalar fields. While this method preserves the minima and maxima, it is constrained by the size of the data. We extend this work to large 2D data and medium-sized 3D data by introducing a novel domain decomposition approach. It allows processing small patches of the domain independently while still avoiding the introduction of new critical points. Furthermore, we propose an iterative refinement of the solution, which decreases the optimization energy compared to the previous approach and therefore gives smoother results that are closer to the input. We illustrate our technique on synthetic and real-world 2D and 3D data sets that highlight potential applications.
Keywords: Numerical optimization; Scalar fields; Topology 3-D scalar; De-noising
Journal Title: IEEE Transactions on Visualization and Computer Graphics
Volume: 20
Issue 12
ISSN: 1077-2626
Publisher: IEEE  
Date Published: 2014-12-31
Start Page: 2585
End Page: 2594
DOI: 10.1109/TVCG.2014.2346432
Open access: no