Skip to main content
SpringerLink
Log in

Projection Filling Based on Contour Structural Points

  • Conference paper
  • First Online:
Computational Science and Its Applications — ICCSA 2003 (ICCSA 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2669))

Included in the following conference series:

  • 1456 Accesses

Abstract

This paper introduces a new method, called the projection filling, to fill any regions based on contour structure points. Four types of the structure points are detected based on the structure pattern models of chain codes of con-tours. The projection filling proceeds between each pair of the neighbouring structural points (filling section) parallelly. The new filling algorithm can fill any regions including some contours which can not be filled by traditional filling algorithms, such as the “seed” and the “even-odd” algorithms. The projection filling method can be used in image analysis, recognition and computer graphics.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. T. PAVLIDIS: Algorithms for Graphics and Image Processing, Computer Science Press Rockville (1982).

    Google Scholar 

  2. K. NAKASHIMA, M. KOGA and K. MARUKAWA: A Contour Method for Alpha-numeric Character Image Generation, Proc. Of the second international conference on document analysis and recognition (1993) 722–725.

    Google Scholar 

  3. S. V. BURTSEV and Y. P. KUZMIN: An efficient Flood-filling Algorithm, Comput. and Graphics, 17,(5) (1993) 549–561.

    Article  Google Scholar 

  4. U. SHANI: Filling Regions in Binary Raster Images: A Graph-Theoretic Approach, Proc. of SIGRAPH’ 80, 14,(1) (1980) 321–327.

    Article  Google Scholar 

  5. T. PAVLIDIS: Filling Algorithms for Raster Graphics, Comput. Graphics and Image process, 10, (2) (1979) 126–141.

    Article  MathSciNet  Google Scholar 

  6. T. PAVLIDIS: Contour Filling in Rater Graphics, Pro. of SIGRAPH’81, 15,(3) (1981) 29–36.

    Google Scholar 

  7. R. D. MERILL: Representation of Contours and Region for Efficient ComputerSearch, Commun. ACM, 16 (1973) 69–82.

    Article  Google Scholar 

  8. J. D. FOLEY, A. V. DAM, S. K. FEINER and J. F. HUGHES: Computer Graphics, Adisson-Wesley Publish Company (1995).

    Google Scholar 

  9. J. K. Wu: Analysis of Digital Images, PEOPLE’S POSTS TELECOMMUNICATIONS PUBLISHING HOUSE (1989).

    Google Scholar 

  10. C. WANG, Y. QI, D. YU and S. Xu: A fast algorithm for boundary tracing of binary image with neighbourhood coding, Proc. international conference on signal processing, 2 (1990) 1083–1085.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Information Technology, Swinburne University of Technology, PO Box 218, Hawthorn, VIC, 3122, Australia

    Donggang Yu, Haizhen Dong, Wei Lai & Yun Yang

Authors
  1. Donggang Yu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Haizhen Dong
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Wei Lai
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Yun Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Army High Performance Computing Research Center, USA University of Minessota Department of Computer Science and Engineering, MN, 55455, USA

    Vipin Kumar

  2. Department of Computer Science, University of Calgary, Calgary, AB, T2N1N4, Canada

    Marina L. Gavrilova

  3. Heuchera Technologies Inc., 122 9251-8Yonge Street, Richmond Hill, ON, Canada, L4C 9T3

    Chih Jeng Kenneth Tan

  4. School of Computer Science, The Queen’s University of Belfast, Belfast, BT7 1NN, Northern Ireland UK

    Chih Jeng Kenneth Tan

  5. Département d’informatique et de recherche opérationelle Montréal, Université de Montréal, Québec, H3C 3J7, Canada

    Pierre L’Ecuyer

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yu, D., Dong, H., Lai, W., Yang, Y. (2003). Projection Filling Based on Contour Structural Points. In: Kumar, V., Gavrilova, M.L., Tan, C.J.K., L’Ecuyer, P. (eds) Computational Science and Its Applications — ICCSA 2003. ICCSA 2003. Lecture Notes in Computer Science, vol 2669. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44842-X_39

Download citation

  • DOI: https://doi.org/10.1007/3-540-44842-X_39

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40156-8

  • Online ISBN: 978-3-540-44842-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation