Skip to main content

An Improved Algorithm for Extraction of Exact Boundaries and Boundaries Inclusion Relationship

  • Conference paper
Computing and Combinatorics (COCOON 2013)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7936))

Included in the following conference series:

  • 1840 Accesses

Abstract

Boundary extraction algorithm proposed by Capson can get the same or even better performance as the commercial software such as VisionPro andHalcon. Unfortunately, the algorithm cannot extract the inclusion relationship between boundaries, which greatly reduce its attractiveness. Two improvements is proposed to improve the original algorithm in this paper, one is to improve the precision of boundaries by splitting points and merging points, another one is to design new data-structure and rules to implement acquiring deep inclusion relationship between external and internal boundaries. Experimental results show that the improvements increase a little consuming time but make the original algorithm more attractive.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Mitrpanont, J.L., Limkonglap, U.: Using Contour Analysis to Improve Feature Extraction in Thai Handwritten Character Recognition Systems. In: 7th IEEE International Conference on Computer and Information Technology, pp. 668–673. IEEE Computer Society, USA (2007)

    Google Scholar 

  2. Kruatrachue, B., Moongfangklang, N., Siriboon, K.: Fast Document Segmentation Using Contour and X-Y Cut Technique. In: Proceedings of World Academy of Science, Engineering and Technology, vol. 5, pp. 27–29. World Enformatika Society, Turkey (2005)

    Google Scholar 

  3. Rosenfeld, A.: Connectivity in Digital Pictures. J. ACM 17(1), 146–160 (1970)

    Article  MathSciNet  MATH  Google Scholar 

  4. Pavlidis, T.: Algorithms for Graphics and Image Processing, pp. 142–148. Computer Science Press, Rockville(America) (1982)

    Book  Google Scholar 

  5. Wu, L.-D., Lin, Y.-Q.: Grack Based Contour Tracing and Tree Structure of Contours. Chinese J. Computers 19(6), 457–465 (1996) (Chinese)

    Google Scholar 

  6. Liu, X.-B., Xiang, J.-C., Xie, L.-H.: An Improved Contour Tracing Algorithm. Computer Engineering and Application 29(1), 61–63 (2005) (Chinese)

    Google Scholar 

  7. Ren, M.W., Yang, J.Y., Sun, H.: Tracing Boundary Contours in a Binary Image. Image and Vision Computing 20(2), 125–131 (2002)

    Article  Google Scholar 

  8. Chang, F., Chen, C.J., Lu, C.J.: A Linear-Time Component-Labeling Algorithm Using Contour Tracing Technique. Computer Vision and Image Understanding, 206-220 (2004)

    Google Scholar 

  9. Wagenknecht, G.: A Contour Tracing and Coding Algorithm for Generating 2D Contour Codes from 3D Classified Objects. Pattern Recognition 40(4), 1294–1306 (2007)

    Article  MATH  Google Scholar 

  10. Lunscher, W.H.H.J., Beddoes, M.P.: Fast Binary-Image Boundary Extraction. Computer Vision, Graphics, and Image Processing 38(3), 229–257 (1987)

    Article  Google Scholar 

  11. Choy, C.T., Siu, W.C.: Single Pass Algorithm for the Generation of Chain-Coded Contours and Contours Inclusion Relationship. In: IEEE Pacific Rim Conference on Communications, Computers and Signal Processing, pp. 256–259 (1993)

    Google Scholar 

  12. Pavlidis, T.: A Minimum Storage Boundary Tracing Algorithm and Its Application to Automatic Inspection. Systems, Man and Cybernetics 8(1), 66–69 (1978)

    Article  Google Scholar 

  13. Kim, S.-D., Lee, J.-H., Kim, J.-K.: A New Chain-Coding Algorithm for Binary Images Using Run-Length Codes. Computer Vision, Graphics, and Image Processing 41(1), 114–128 (1988)

    Article  Google Scholar 

  14. Quek, F.K.H.: An Algorithm for the Rapid Computation of Boundaries of Run-Length Encoded Regions. Pattern Recognition 33(10), 1637–1649 (2000)

    Article  Google Scholar 

  15. Capson, D.W.: An Improved Algorithm for the Sequential Extraction of Boundaries from a Raster Scan. Computer Vision, Graphics, and Image Processing 28(1), 109–125 (1984)

    Article  Google Scholar 

  16. Hu, T., Guo, B.-P., Guo, X.: An Improved Run-Based Boundary Extraction Algorithm. Journal of Shenzhen University Science and Engineering 26(4), 405–410 (2009)

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hu, T., Ren, X., Zhang, J. (2013). An Improved Algorithm for Extraction of Exact Boundaries and Boundaries Inclusion Relationship. In: Du, DZ., Zhang, G. (eds) Computing and Combinatorics. COCOON 2013. Lecture Notes in Computer Science, vol 7936. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38768-5_58

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-38768-5_58

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-38767-8

  • Online ISBN: 978-3-642-38768-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics