The Visual Computer

, Volume 27, Issue 3, pp 211–226 | Cite as

Ellipse-based principal component analysis for self-intersecting curve reconstruction from noisy point sets

  • O. Ruiz
  • C. VanegasEmail author
  • C. Cadavid
Original Article


Surface reconstruction from cross cuts usually requires curve reconstruction from planar noisy point samples. The output curves must form a possibly disconnected 1-manifold for the surface reconstruction to proceed. This article describes an implemented algorithm for the reconstruction of planar curves (1-manifolds) out of noisy point samples of a self-intersecting or nearly self-intersecting planar curve C. C:[a,b]⊂RR 2 is self-intersecting if C(u)=C(v), uv, u,v∈(a,b) (C(u) is the self-intersection point). We consider only transversal self-intersections, i.e. those for which the tangents of the intersecting branches at the intersection point do not coincide (C′(u)≠C′(v)). In the presence of noise, curves which self-intersect cannot be distinguished from curves which nearly self-intersect. Existing algorithms for curve reconstruction out of either noisy point samples or pixel data, do not produce a (possibly disconnected) Piecewise Linear 1-manifold approaching the whole point sample. The algorithm implemented in this work uses Principal Component Analysis (PCA) with elliptic support regions near the self-intersections. The algorithm was successful in recovering contours out of noisy slice samples of a surface, for the Hand, Pelvis and Skull data sets. As a test for the correctness of the obtained curves in the slice levels, they were input into an algorithm of surface reconstruction, leading to a reconstructed surface which reproduces the topological and geometrical properties of the original object. The algorithm robustly reacts not only to statistical non-correlation at the self-intersections (non-manifold neighborhoods) but also to occasional high noise at the non-self-intersecting (1-manifold) neighborhoods.


Self-intersecting curve reconstruction Elliptic support region Principal component analysis Noisy samples 



Piecewise Linear.


Planar open or closed, possibly self-intersecting or nearly self-intersecting, curve.


An unorganized noisy point sample of C.


Stochastic component of the point sample.


The disk of radius r centered at point p.


Parametric form of the straight line passing through p, directed by the unit vector \(\hat{v}\) with signed distance parameter λ.


Foci of an ellipse in R 2.


Ellipse {pR 2:d(p,f 1)+d(p,f 2)=2α}.


Linear regression correlation coefficient between variables Y and X.


Principal Component Analysis of the point set S E , rendering as a result the linear trend \(L(\lambda)=p+\lambda*\hat{v}\) with correlation coefficient ρ.


Queue whose elements are pairs [p,v] formed by a vector v anchored at point p.


Set of PL pairwise disjoint curves c 1,c 2,…,c m .


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Arora, S., Khot, S.: Fitting algebraic curves to noisy data. J. Comput. Syst. Sci. 67(2), 325–340 (2003) zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Bloomenthal, J.: Polygonization of implicit surfaces. Comput. Aided Geom. Des. 5(4), 341–355 (1988) zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Bloomenthal, J.: An implicit surface polygonizer. In: Graphics Gems IV, pp. 324–349. Academic Press, San Diego (1994) Google Scholar
  4. 4.
    Bloomenthal, J., Ferguson, K.: Polygonization of non-manifold implicit surfaces. In: SIGGRAPH ’95: Proceedings of the 22nd Annual Conference on Computer Graphics and Interactive Techniques, New York, NY, USA, pp. 309–316. ACM Press, New York (1995) CrossRefGoogle Scholar
  5. 5.
    Cheng, S.-W., Funke, S., Golin, M., Kumar, P., Poon, S.-H., Ramos, E.: Curve reconstruction from noisy samples. Comput. Geom. Theory Appl. 31(1–2), 63–100 (2005) zbMATHMathSciNetGoogle Scholar
  6. 6.
    Dey, T.K., Kumar, P.: A simple provable algorithm for curve reconstruction. In: SODA ’99: Proceedings of the tenth Annual ACM-SIAM Symposium on Discrete Algorithms, Philadelphia, PA, USA, pp. 893–894. Society for Industrial and Applied Mathematics, Philadelphia (1999) Google Scholar
  7. 7.
    Geiger, B.: Three-dimensional modeling of human organs and its application to diagnosis and surgical planning. Technical Report RR-2105 (1993) Google Scholar
  8. 8.
    Kegl, B., Krzyzak, A.: Piecewise linear skeletonization using principal curves. IEEE Trans. Pattern Anal. Mach. Intell. 24(1), 59–74 (2002) CrossRefGoogle Scholar
  9. 9.
    Klein, J., Zachmann, G.: Point cloud surfaces using geometric proximity graphs. Comput. Graph. 28(6), 839–850 (2004) CrossRefGoogle Scholar
  10. 10.
    KTgl, B.: Principal curves: learning, design, and applications. PhD thesis, Concordia University, Montreal, Canada (1999) Google Scholar
  11. 11.
    Lee, I.K.: Curve reconstruction from unorganized points. Comput. Aided Geom. Des. 17(2), 161–177 (2000) CrossRefGoogle Scholar
  12. 12.
    Liu, Y., Yang, H., Wang, W.: Reconstructing b-spline curves from point clouds – a tangential flow approach using least squares minimization. In: SMI ’05: Proceedings of the International Conference on Shape Modeling and Applications 2005, pp. 4–12, Washington, DC, USA. IEEE Computer Society, Los Alamitos (2005) Google Scholar
  13. 13.
    Lu, D., Zhao, H., Jiang, M., Zhou, S., Zhou, T.: A surface reconstruction method for highly noisy point clouds. In: Third International Workshop on Variational, Geometric and Level Set Methods in Computer Vision, VLSM, pp. 283–294 (2005) Google Scholar
  14. 14.
    Mukhopadhyay, A., Das, A.: Curve reconstruction in the presence of noise. In: CGIV ’07: Proceedings of the Computer Graphics, Imaging and Visualisation, Washington, DC, USA, pp. 177–182. IEEE Computer Society, Los Alamitos (2007) CrossRefGoogle Scholar
  15. 15.
    Niyogi, P., Smale, S., Weinberger, S.: Finding the homology of submanifolds with high confidence from random samples. Discrete Comput. Geom. 39(1), 419–441 (2008) zbMATHCrossRefMathSciNetGoogle Scholar
  16. 16.
    Nyquist, H.: Certain topics in telegraph transmission theory. Bell Syst. Tech. J., 47 (1928) Google Scholar
  17. 17.
    Nyquist, H.: Certain topics in telegraph transmission theory. Proc. IEEE 90(2), 617–644 (2002). Reprint as classic paper CrossRefGoogle Scholar
  18. 18.
    Osher, S., Fedkiw R.: Level set methods: An overview and some recent results. Technical report, University of California Los Angeles, Stanford University (2000) Google Scholar
  19. 19.
    Osher, S., Sethian, J.A.: Fronts propagating with curvature-dependent speed: algorithms based on Hamilton–Jacobi formulations. J. Comput. Phys. 79(1), 12–49 (1988) zbMATHCrossRefMathSciNetGoogle Scholar
  20. 20.
    Pauly, M., Mitra, N.J., Guibas, L.: Uncertainty and variability in point cloud surface data. In: Alexa, M., Rusinkiewicz, S. (eds.) Symposium on Point-Based Graphics, pp. 77–84. Eurographics, Geneve (2004) Google Scholar
  21. 21.
    Ruiz, O., Cadavid, C., Granados, M., Peña, S., Vásquez, E.: 2D shape similarity as a complement for Voronoi–Delone methods in shape reconstruction. Elsevier J. Comput. Graph. 29(1), 81–94 (2005) Google Scholar
  22. 22.
    Ruiz, O., Vanegas, C., Cadavid, C.: Principal component and Voronoi skeleton alternatives for curve reconstruction from noisy point sets. J. Eng. Des. 18(5), 437–457 (2007) CrossRefGoogle Scholar
  23. 23.
    Shannon, C.E.: Communication in presence of noise. Proc. IRE 37(1), 10–21 (1949) CrossRefMathSciNetGoogle Scholar
  24. 24.
    Shannon, C.E.: Communication in presence of noise. Proc. IEEE 86(2), 447–457 (1998). Reprint as classic paper CrossRefGoogle Scholar
  25. 25.
    Tagliasacchi, A., Zhang, H., Cohen-Or, D.: Curve skeleton extraction from incomplete point cloud. ACM Trans. Graph. 28(3), 1–9 (2009) CrossRefGoogle Scholar
  26. 26.
    Unnikrishnan, R., Lalonde, J.-F., Vandapel, N., Hebert, M.: Scale selection for the analysis of point-sampled curves. In: 3DPVT, pp. 1026–1033 (2006) Google Scholar
  27. 27.
    Uribe, D., Ruiz, O.: 2D curve reconstruction with heat transfer differential equations. Technical report, EAFIT University, CAD CAM CAE Laboratory, Nov. (2008) Google Scholar
  28. 28.
    Verbeek, J.J., Vlassis, N., Kröse, B.: A soft k-segments algorithm for principal curves. In: Proc. Int. Conf. on Artificial Neural Networks, pp. 450–456, Vienna, Austria August (2001) Google Scholar
  29. 29.
    Wang, W., Pottmann, H., Liu, Y.: Fitting b-spline curves to point clouds by curvature-based squared distance minimization. ACM Trans. Graph. 25(2), 214–238 (2006) CrossRefGoogle Scholar
  30. 30.
    Zhao, H.-K., Osher, S., Fedkiw, R.: Fast surface reconstruction using the level set method. In: VLSM ’01: Proceedings of the IEEE Workshop on Variational and Level Set Methods (VLSM’01), Washington, DC, USA, p. 194. IEEE Computer Society, Los Alamitos (2001) CrossRefGoogle Scholar
  31. 31.
    Zhao, H.k., Oshery, S., Merrimany, B., Kangy, M., Implicit and non-parametric shape reconstruction from unorganized points using variational level set method. Comput. Vis. Image Underst. 80, 295–319 (2000) zbMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag 2010

Authors and Affiliations

  1. 1.Department of Computer SciencePurdue UniversityWest LafayetteUSA
  2. 2.Laboratory of CAD CAM CAEEAFIT UniversityMedellinColombia

Personalised recommendations