Skip to main content

Compact Description of the Segments on the Segmented Digital Image

  • Conference paper
  • 3613 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNIP,volume 8887))

Abstract

One of the approaches to the shape analysis of the extracted segment on 2-D segmented digital image is based on its description by the points of the closed contour surrounding the segment. In simple case, the shape contour can be described by a finite set of its boundary points, for example, a sequence of the coordinates of the contour pixels. At the same time, the larger the number of points the more accurate is the contour description. But this requires a high computational cost for further process of the shape analysis. Therefore, it is very important to obtain a more accurate restoration of the original digital closed contour for the current number of pixels on the contour than using the Whittaker-Kotelnikov-Shannon interpolation formula. In this paper we use the generalized interpolation formula (Piranashvili formula) for solution of the task.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Costa, L.d.F., Cesar Jr, R.M.: Shape Classification and Analysis: Theory and Practice. Taylor&Francis Group, LLC (2009)

    Google Scholar 

  2. Kindratenko, V.: Development and Application of image Analysis Techniques for Identification and Classification of Microscopic Particles. Ph. D. Thesis, University of Antwerp, Belgium (1997)

    Google Scholar 

  3. Bonciu, C., Leger, C., Thiel, J.: A Fourier-Shannon Approach to Closed Contours Modeling. Bioimaging 6(3), 111–125 (1998)

    Article  Google Scholar 

  4. Poliannikov, O.V., Krim, H.: On Sampling Curves. In: Proceedings of the 35th Asilomar Conference on Signals, Systems and Computers, vol. 2, pp. 941–945 (2001)

    Google Scholar 

  5. Poliannikov, O.V., Krim, H.: Parameterization Models for Sampling Planar Curves. In: Proceedings of SPIE, SPIE Conference on Image Processing: Algorithms and Systems, vol. 4667 (2002)

    Google Scholar 

  6. Poliannikov, O.V., Krim, H.: On Sampling Closed Planar Curves and Surfaces. Sampling Theory in Signal and Image Processing 2(1), 53–83 (2003)

    MATH  MathSciNet  Google Scholar 

  7. Piranashvili, Z.: On the Problem of Interpolation of Random Processes. Theory Probab. Appl. 12(4), 647–657 (1967)

    Article  MATH  Google Scholar 

  8. Piranashvili, Z.: On the Generalized Formula of Exponentially Convergent Sampling. Bull. Georg. Acad. Sci. 170(1), 50–53 (2004)

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Sulaberidze, T., Tavdishvili, O., Todua, T., Alimbarashvili, Z. (2014). Compact Description of the Segments on the Segmented Digital Image. In: Bebis, G., et al. Advances in Visual Computing. ISVC 2014. Lecture Notes in Computer Science, vol 8887. Springer, Cham. https://doi.org/10.1007/978-3-319-14249-4_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-14249-4_24

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-14248-7

  • Online ISBN: 978-3-319-14249-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics