Skip to main content

Repairing Flaws in a Picture Based on a Geometric Representation of a Digital Image

  • Conference paper
  • First Online:
Algorithms and Computation (ISAAC 1998)

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

Included in the following conference series:

  • 557 Accesses

Abstract

In high-qualityimage printing it is somet mes requ red to repair flaws contained n a given mage. A simple wayfor such repair is to paste a flaw reg on with white and then to move those pixels in the neighborhood byusing a tool called an copy-brush. Since it is a very fine operation, it causes great effort to human operators. It is not easy to automate this operation in the existing matrix representation of an image. In our geometric representation of an mage as a collection of contour lines for ntensitylevels this problem is naturally defined as one of reconnect ng those contour lines disconnected by a flaw region. An efficient algorithm for reconnecting contour lines is presented based on perfect matching and observations on geometric properties of interconnection paths.

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. T. Asano and S. Kimura: “Contour Representation of an Image with Applications,” Proc. SPIE’s International Symposium on Vision Geometry IV, pp. 14–22, San Diego, July 1995.

    Google Scholar 

  2. T.H. Cormen, C.E. Leiserson, and R.L. Rivest: “Introduct on to Algorithms,” The MIT Press, 1990.

    Google Scholar 

  3. L. Guibas, J. Hershberger, D. Leven, M. Sharir, and R. Tarjan: “Linear time algorithm for visibility and shortest path problems nside simple polygons,” Proc. 2nd ACM Symp. on Computational Geometry, pp. 1–13, 1986.

    Google Scholar 

  4. A.N. Heran and T. Totsuka: “Combining Frequencyand Spatial Domain Information for Fast Interactive Image Noise Removal,” Proc. SIGGRAPH’96, pp. 269–276, 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Asano, T., Ito, H., Kimua, S., Shimazu, S. (1998). Repairing Flaws in a Picture Based on a Geometric Representation of a Digital Image. In: Chwa, KY., Ibarra, O.H. (eds) Algorithms and Computation. ISAAC 1998. Lecture Notes in Computer Science, vol 1533. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49381-6_17

Download citation

  • DOI: https://doi.org/10.1007/3-540-49381-6_17

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65385-1

  • Online ISBN: 978-3-540-49381-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics