Fast and Memory-Efficienty Topological Denoising of 2D and 3D Scalar Fields
- 6 November 2014
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Visualization and Computer Graphics
- Vol. 20 (12) , 2585-2594
Abstract
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
Funding Information
- RTRA Digiteoproject (2012¿063D)
- project (FP7-ICT-318493-STREP)
- ERC Grant (StG-2012¿306877)
- SNF award (200021_137879)
- Intel Doctoral Fellowship
- MPC-VCC
- Michael Sixt
- Kari Vaahtomeri
This publication has 22 references indexed in Scilit:
- Extraction of Dominant Extremal Structures in Volumetric Data Using Separatrix PersistenceComputer Graphics Forum, 2012
- Smooth Shape‐Aware Functions with Controlled ExtremaComputer Graphics Forum, 2012
- Efficient computation of 3D Morse–Smale complexes and persistent homology using discrete Morse theoryThe Visual Computer, 2012
- Bounded biharmonic weights for real-time deformation2011
- Enforcing topological constraints in random field image segmentation2011
- A Review of Image Denoising Algorithms, with a New OneMultiscale Modeling & Simulation, 2005
- Fair morse functions for extracting the topological structure of a surface meshACM Transactions on Graphics, 2004
- Topological Persistence and SimplificationDiscrete & Computational Geometry, 2002
- Morse Theory for Cell ComplexesAdvances in Mathematics, 1998
- A signal processing approach to fair surface design1995