论文信息 - Curve reconstruction in the presence of noise

Curve reconstruction in the presence of noise

In this paper we propose a heuristic for the reconstruction of a planar curve from a noisy sample. This is based on an earlier scheme we had proposed for reconstructing a curve from a noise-free sample, based on the relative neighbourhood graph. We also report on the performance of our heuristic on a variety of noisy samples.

Asish Mukhopadhyay | Augustus Das | A. Mukhopadhyay | A. Das

[1] Tamal K. Dey,et al. A simple provable algorithm for curve reconstruction , 1999, SODA '99.

[2] Kurt Mehlhorn,et al. Curve reconstruction: connecting dots with good reason , 1999, SCG '99.

[3] Dominique Attali,et al. r-regular shape reconstruction from unorganized points , 1997, SCG '97.

[4] David Eppstein,et al. The Crust and the beta-Skeleton: Combinatorial Curve Reconstruction , 1998, Graph. Model. Image Process..

[5] Stefan Funke,et al. Curve reconstruction from noisy samples , 2003, SCG '03.

[6] Christopher M. Gold,et al. Crust and anti-crust: a one-step boundary and skeleton extraction algorithm , 1999, SCG '99.

[7] Kurt Mehlhorn,et al. Curve reconstruction: Connecting dots with good reason , 2000, Comput. Geom..

[8] Son Dinh Tran,et al. Reconstructing Curves without Delaunay Computation , 2004, Algorithmica.

[9] Godfried T. Toussaint,et al. The relative neighbourhood graph of a finite planar set , 1980, Pattern Recognit..

[10] V. Ralph Algazi,et al. Continuous skeleton computation by Voronoi diagram , 1991, CVGIP Image Underst..

[11] W.. Relative Neighborhood Graphs and Their Relatives , 2004 .

[12] Asish Mukhopadhyay,et al. An RNG-based heuristic for curve reconstruction , 2006, 2006 3rd International Symposium on Voronoi Diagrams in Science and Engineering.