Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published August 2011 | public
Journal Article

An Optimal Transport Approach to Robust Reconstruction and Simplification of 2D Shapes

Abstract

We propose a robust 2D shape reconstruction and simplification algorithm which takes as input a defect-laden point set with noise and outliers. We introduce an optimal-transport driven approach where the input point set, considered as a sum of Dirac measures, is approximated by a simplicial complex considered as a sum of uniform measures on 0- and 1-simplices. A fine-to-coarse scheme is devised to construct the resulting simplicial complex through greedy decimation of a Delaunay triangulation of the input point set. Our method performs well on a variety of examples ranging from line drawings to grayscale images, with or without noise, features, and boundaries.

Additional Information

© 2011 Author(s). © 2011 The Eurographics Association and Blackwell Publishing Ltd. Article first published online: 4 Aug. 2011. We thank Patrick Mullen for discussions along the way, and Xiaofeng Mi, Doug DeCarlo, and Ravish Mehra for providing data. This work was funded by the European Research Council (ERC Starting Grant "Robust Geometry Processing", Grant agreement 257474), and by NSF grants (CCF-0811373, CMMI-0757106, and CCF-1011944).

Additional details

Created:
August 19, 2023
Modified:
October 24, 2023