Skip to main content
Log in

Discrete plane segmentation and estimation from a point cloud using local geometric patterns

  • Published:
International Journal of Automation and Computing Aims and scope Submit manuscript

Abstract

This paper presents a method for segmenting a 3D point cloud into planar surfaces using recently obtained discrete-geometry results. In discrete geometry, a discrete plane is defined as a set of grid points lying between two parallel planes with a small distance, called thickness. In contrast to the continuous case, there exist a finite number of local geometric patterns (LGPs) appearing on discrete planes. Moreover, such an LGP does not possess the unique normal vector but a set of normal vectors. By using those LGP properties, we first reject non-linear points from a point cloud, and then classify non-rejected points whose LGPs have common normal vectors into a planar-surface-point set. From each segmented point set, we also estimate the values of parameters of a discrete plane by minimizing its thickness.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. R. Hartley, A. Zisserman. Multiple View Geometry in Computer Vision, 2nd Edition, Cambridge University Press, Cambridge, 2003.

    Google Scholar 

  2. H. Y. Shum, K. Ikeuchi, R. Reddy. Principal Component Analysis with Missing Data and Its Application to Polyhedral Object Modeling. IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 17, no. 9, pp. 854–867, 1995.

    Article  Google Scholar 

  3. G. Papaioannou, E. A. Karabassi, T. Theoharis. Segmentation and Surface Characterization of Arbitrary 3D Meshes for Object Reconstruction and Recognition. In Proceedings of the 15th International Conference on Pattern Recognition, IEEE Press, vol. 1, pp. 734–737, 2000.

    Google Scholar 

  4. G. Taylor, L. Kleeman. Robust Range Data Segmentation Using Geometric Primitives for Robotics Applications. In Proceedings of the IASTED International Conference on Signal and Image Processing, Hawaii, USA, pp. 467–472, 2003.

  5. P. J. Besl, R. C. Jain. Segmentation through Variable-order Surface Fitting. IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 10, no. 2, pp. 167–192, 1988.

    Article  Google Scholar 

  6. O. D. Faugeras, M. Hebert, E. Pauchon. Segmentation of Range Data into Planar and Quadric Patches. In Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition, Santa Barbara, USA, pp. 8–13, 1983.

  7. D. Cohen-Steiner, P. Alliez, M. Desbrun. Variational Shape Approximation. ACM Transactions on Graphics, vol. 23, no. 3, pp. 905–914, 2004.

    Article  Google Scholar 

  8. A. Hoover, G. Jean-Baptiste, X. Jiang, P. J. Flynn, H. Bunke, et al. An Experimental Comparison of Range Image Segmentation Algorithms. IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 18, no. 7, pp. 673–689, 1996.

    Article  Google Scholar 

  9. D. Marshall, G. Lukacs, R. Martin. Robust Segmentation of Primitives from Range Data in the Presence of Geometric Degeneracy. IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 23, no. 3, pp. 304–314, 2001.

    Article  Google Scholar 

  10. H. Chen, B. Bhanu. 3D Free-form Object Recognition in Range Images Using Local Surface Patches. Pattern Recognition Letters, vol. 28, no. 10, pp. 1252–1262, 2007.

    Article  Google Scholar 

  11. K. Haris, S. N. Efstratiadis, N. Maglaveras, A. K. Katsaggelos. Hybrid Image Segmentation UsingWatersheds and Fast Region Merging. IEEE Transactions on Image Processing, vol. 7, no. 12, pp. 1684–1699, 1998.

    Article  Google Scholar 

  12. K. Köster, M. Spann. MIR: An Approach to Robust Clustering — Application to Range Image Segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 22, no. 5, pp. 430–443, 2000.

    Article  Google Scholar 

  13. D. Zhao, X. Zhang. Range-data-based Object Surface Segmentation via Edges and Critical Points. IEEE Transactions on Image Processing, vol. 6, no. 6, pp. 826–830, 1997.

    Article  Google Scholar 

  14. I. Stamos, P. K. Allen. 3D Model Construction Using Range and Image Data. In Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition, Madison, vol. 1, pp. 531–536, 2003.

    Google Scholar 

  15. N. Yokoya, M. D. Levine. Range Image Segmentation Based on Differential Geometry: A Hybrid Approach. IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 11, no. 6, pp. 643–649, 1989.

    Article  Google Scholar 

  16. R. Klette, A. Rosenfeld. Digital Geometry: Geometric Methods for Digital Picture Analysis, Morgan Kauffmann, San Francisco, USA, 2004.

    MATH  Google Scholar 

  17. I. Debled-Rennesson. Etude et reconnaissance des droites et plans discrets, Ph. D. dissertation, Université Louis Pasteur, Strasbourg, France, 1995.

    MATH  Google Scholar 

  18. J. Vittone, J. M. Chassery. (n,m)-cubes and Farey Nets for Naive Planes Understanding. In Proceedings of Discrete Geometry for Computer Imagery, Lecture Notes in Computer Science, Springer-Verlag, Marne-la-Vallée, France, vol. 1568, pp. 76–87, 1999.

    Chapter  Google Scholar 

  19. Y. Kenmochi, L. Buzer, A. Sugimoto, I. Shimizu. Digital Planar Surface Segmentation Using Local Geometric Patterns. In Proceedings of Discrete Geometry for Computer Imagery, Lecture Notes in Computer Science, Springer-Verlag, Lyon, France, vol. 4992, pp. 322–333, 2008.

    Chapter  Google Scholar 

  20. D. Coeurjolly, I. Sivignon, F. Dupont, F. Feschet, J. M. Chassery. On Digital Plane Preimage Structure. Discrete Applied Mathematics, vol. 151 no. 1–3, pp. 78–92, 2005.

    Article  MathSciNet  MATH  Google Scholar 

  21. J. P. Reveillès. Combinatorial Pieces in Digital Lines and Planes. In Proceedings Vision Geometry IV, Proceedings of SPIE, Diego, USA, vol. 2573. pp. 23–34, 1995.

    Google Scholar 

  22. Y. Kenmochi, A. Imiya. Combinatorial Boundary of a 3D Lattice Point Set. Journal of Visual Communication and Image Representation, vol. 17, no. 4, pp. 738–766, 2006.

    Article  Google Scholar 

  23. G. M. Ziegler. Lectures on Polytopes, Springer-Verlag, New York, USA, 1998.

    Google Scholar 

  24. B. K. P. Horn. Extended Gaussian Images. Proceedings of the IEEE, vol. 72, no. 12, pp. 1671–1686, 1984.

    Article  Google Scholar 

  25. L. Provot, L. Buzer, I. Debled-Rennesson. Recognition of Blurred Pieces of Discrete Planes. In Proceedings of Discrete Geometry for Computer Imagery, Lecture Notes in Computer Science, Springer-Verlag, Szeged, Hungary, vol. 4245, pp. 65–76, 2006.

    Chapter  Google Scholar 

  26. lp_solve 5.5.0.12. http://lpsolve.sourceforge.net/5.5/.

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yukiko Kenmochi.

Additional information

Yukiko Kenmochi received her B. Eng., M. Eng., and D. Eng. degrees in information and computer sciences from Chiba University, Japan, in 1993, 1995, and 1998, respectively. She joined Japan Advanced Institute of Science and Technology as a research associate in 1998, and Okayama University, Japan, as a lecturer in 2003. Since 2004, she has been a CNRS researcher at Gaspard-Monge Institute, Université Paris-Est, France, and a member of the A2SI laboratory, ESIEE. She received a Best Paper Award of Information and System Society from IEICE in 2005. Her research interest includes discrete geometry for computer imagery.

Lilian Buzer received his Ingénieur’s degree in informatics from ISIMA, France, in 1999, and his Ph.D. degree in informatics from the Blaise Pascal University, Clermont-Ferrand, France, in 2002. Since 2003, he has been an assistant professor at ESIEE, France. He is a member of the A2SI laboratory, ESIEE, and of Gaspard-Monge Institute, Université Paris-Est.

His research interests include discrete geometry and computational geometry.

Akihiro Sugimoto received his B. Sc., M. Sc., and D.Eng. degrees in mathematical engineering from the University of Tokyo in 1987, 1989, and 1996, respectively. After working at Hitachi Advanced Research Laboratory, ATR, and Kyoto University, he joined the National Institute of Informatics, Japan, where he is currently a professor. From 2006 to 2007, he was a visiting professor at ESIEE, France. He received a Paper Award from the Information Processing Society in 2001. He is a member of IEEE.

He is interested in mathematical methods in engineering. In particular, his current main research interests include discrete mathematics, approximation algorithm, vision geometry, and modeling of human vision.

Ikuko Shimizu received her B. Sc., M. Sc., and Ph.D. degrees in mathematical engineering and information physics from the University of Tokyo, Japan, in 1994, 1996, and 1999, respectively. In 1999, she was a research associate at Saitama University, Japan. Currently, she is a lecturer in the Department of Computer, Information and Communication Sciences at Tokyo University of Agriculture and Technology, Japan. She is a member of IPSJ, IEICE, SICE, and IEEE. Her research interests include computer vision and 3D modeling.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kenmochi, Y., Buzer, L., Sugimoto, A. et al. Discrete plane segmentation and estimation from a point cloud using local geometric patterns. Int. J. Autom. Comput. 5, 246–256 (2008). https://doi.org/10.1007/s11633-008-0246-1

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11633-008-0246-1

Keywords