Skip to main content
Log in

Approximation of multipath planar shapes in pattern analysis

  • Published:
International Journal of Computer & Information Sciences Aims and scope Submit manuscript

Abstract

The concept of multipath approximation of two-dimensional images is introduced and an algorithm for the functional approximation of multipath curves is given. It is shown that application of this algorithm results in a significant reduction in storage requirements and an increase in the preservation of important features of the image.

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

References

  1. F. Badi'i and B. Peikari, “Functional approximation of planar curves via adaptive segmentation,”Int. J. Syst. Sci.,13(6):667–674 (1982).

    Google Scholar 

  2. T. Pavlidis, “Waveform segmentation through functional approximation,”IEEE Transtiton Computers,C-22(7):689–697 (1973).

    Google Scholar 

  3. E. Persoon and K. S. Fu, “Sequential classification of strings generated by SCFG's,”Int. J. Comp. Infor. Sci.,4(3):205–217 (1975).

    Google Scholar 

  4. Beng-Tung Aug, “A heuristic-adaptive procedure for segmentation of time patterns,”Int. J. Comp. Infor. Sci,4(4):329–348 (1975).

    Google Scholar 

  5. T. Pavlidis and S. L. Horowitz, “Segmentation of plane curves,”IEEE Tran. on Computers,C-23(8):860–870 (1974).

    Google Scholar 

  6. C. W. Richard, Jr. and H. Hemami, “Identification of three-dimensional objects using fourier descriptors of the boundary curve,”IEEE Trans. on Systems, Man, Cybernetics,SMC4(4):July 371–378 (1974).

    Google Scholar 

  7. L. G. Shapiro and R. M. Harliack, “Decomposition of two-dimensional shapes by graph theoretic clustering,”IEEE Trans. on Pattern Analysis and Machine Intelligence,PAMI1(1); 10–20 (1979).

    Google Scholar 

  8. Douglas Dorrough, “Pattern classes: A technique for recovering their distributions,”Int. J. Comp. Infor. Sys.,5(2):165–199 (1976).

    Google Scholar 

  9. T. Pavlidis, “Use of a syntactic shape analyzer for coutour matching,”IEEE Trans. on Pattern Analysis and Machine Intelligence,PAMI1(3):307–310 (1979).

    Google Scholar 

  10. E. Persoon and K. S. Fu, “Shape discrimination using fourier descriptors,”IEEE Trans. on Systems, Man, and Cybernetics,SMC7:170–179 (1977).

    Google Scholar 

  11. D. N. Graham, “Image transmission by two-dimensional contour coding,”Proceedings IEEE,55:336–346 (1967).

    Google Scholar 

  12. T. Pavlidis and F. Ali, “A Hierarchical syntactic shape analyzer,”IEEE Trans. on Pattern Analysis and Machine Intelligence,PAMI1(1):2–9 (1979).

    Google Scholar 

  13. L. Shapiro, “A structural model of shape,”IEEE Trans. on Pattern Analysis and Machine Intelligence,PAMI2(2): 111–126 (1980).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Faris Badi'i was with the Electrical Engineering Department, Southern Methodist University.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Badi'i, F., Peikari, B. Approximation of multipath planar shapes in pattern analysis. International Journal of Computer and Information Sciences 12, 99–110 (1983). https://doi.org/10.1007/BF00993196

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00993196

Key words