LOGIN TO YOUR ACCOUNT

Username
Password
Remember Me
Or use your Academic/Social account:

CREATE AN ACCOUNT

Or use your Academic/Social account:

Congratulations!

You have just completed your registration at OpenAire.

Before you can login to the site, you will need to activate your account. An e-mail will be sent to you with the proper instructions.

Important!

Please note that this site is currently undergoing Beta testing.
Any new content you create is not guaranteed to be present to the final version of the site upon release.

Thank you for your patience,
OpenAire Dev Team.

Close This Message

CREATE AN ACCOUNT

Name:
Username:
Password:
Verify Password:
E-mail:
Verify E-mail:
*All Fields Are Required.
Please Verify You Are Human:
fbtwitterlinkedinvimeoflicker grey 14rssslideshare1
Publisher: World Scientific Publishing
Languages: English
Types: Part of book or chapter of book
Subjects: QA75
Global shape measures are a convenient way to describe regions. They are generally simple and efficient to extract, and provide an easy means for high level tasks such as classification as well as helping direct low-level computer vision processes such as segmentation. In this chapter a large selection of global shape measures (some from the standard literature as well as other newer methods) are described and demonstrated.
  • The results below are discovered through our pilot algorithms. Let us know how we are doing!

    • 2. S. Marshall. Review of shape coding techniques. Image and Vision Computing, 7(4):281–294., 1989.
    • 3. S. Loncaric. A survey of shape analysis techniques. Pattern Recognition, 31(8):983–1001, 1998.
    • 4. D. Zhang and G. Lu. Review of shape representation and description techniques. Pattern Recog-
    • 9. M. Flickner et al. Image and video content: The QBIC system. IEEE Computer, 28(9):23–32, 1995.
    • 10. J.P. Eakins, J.D. Edwards, J. Riley, and P.L. Rosin. A comparison of the effectiveness of alternative feature sets in shape retrieval of multi-component images. In SPIE Conf. Storage and Retrieval for Media Databases, pages 196–207, 2001.
    • 11. M.A. Shahin and S.J. Symons. Lentil type identi cation using machine vision. Canadian Biosystems Engineering, 45:3.5–3.11, 2003.
    • 12. D.W. Jacobs. Robust and ef cient detection of salient convex groups. IEEE Trans. on Patt. Anal. and Mach. Intell., 18(1):23–37, 1996.
    • 13. P.L. Rosin and G.A.W. West. Non-parametric segmentation of curves into various representations. IEEE Trans. on Patt. Anal. and Mach. Intell., 17:1140–1153, 1995.
    • 14. P. L. Rosin. Non-parametric multi-scale curve smoothing. Int. J. Pattern Recognition and AI, 8:1381–1406, 1994.
    • 15. P.L. Rosin. A hierarchy of representations for curves. In Arcelli et al., editor, Aspects of Visual Form Processing, pages 465–474, 1994.
    • 16. H. Asada and M. Brady. The curvature primal sketch. IEEE Trans. on Patt. Anal. and Mach. Intell., 8(1):2–14, 1986.
    • 17. D. Hoffman and W. Richards. Parts of recognition. Cognition, 18:65–96, 1984.
    • 18. P. L. Rosin. Multi-scale representation and matching of curves using codons. CVGIP: Graphical Models and Image Processing, 55:286–310, 1993.
    • 19. P. L. Rosin. Representing curves at their natural scales. Pattern Recognition, 25:1315–1325, 1992.
    • 20. P.J. Giblin and B.B. Kimia. On the local form and transitions of symmetry sets, medial axes, and shocks. Int. Journal of Computer Vision, 54(1):143–156, 2003.
    • 21. H. Sanchez-Cruz and E. Bribiesca. A method of optimum transformation of 3d objects used as a measure of shape dissimilarity. Image and Vision Computing, 21(12):1027–1036, 2003.
    • 22. F.P. Preparata and M.I. Shamos. Computational Geometry. Springer-Verlag, 1985.
    • 23. A. Rosenfeld. Compact gures in digital pictures. IEEE Trans. on Systems, Man and Cybernetics, 4:221–223, 1974.
    • 24. Bogaert J., Rousseau R., Van Hecke P., and Impens I. Alternative area-perimeter ratios for measurement of 2D-shape compactness of habitats. Applied Mathematics and Computation, 111:71– 85, 2000.
    • 25. R.M. Haralick. A measure for circularity of digital gures. IEEE Trans. on Systems, Man and Cybernetics, 4:394–396, 1974.
    • 26. G.H. Granlund. Fourier preprocessing for hand print character recognition. IEEE Trans. on Computers, 21:195–201, 1972.
    • 27. E.T. Bowman, K. Soga, and T. Drummond. Particle shape characterization using Fourier analysis. Geotechnique, 51(6):545–554, 2001.
    • 28. K. Voss and H. Su¨ße. Invariant tting of planar objects by primitives. IEEE Trans. on Patt. Anal. and Mach. Intell., 19(1):80–84, 1997.
    • 29. P.L. Rosin. Further ve-point t ellipse tting. CVGIP: Graphical Models and Image Processing, 61(5):245–259, 1999.
    • 30. P.L. Rosin. Ellipse tting using orthogonal hyperbolae and Stirling's oval. CVGIP: Graphical Models and Image Processing, 60(3):209–213, 1998.
    • 31. A.W. Fitzgibbon, M. Pilu, and R.B. Fisher. Direct least square tting of ellipses. IEEE Trans. on Patt. Anal. and Mach. Intell., 21(5):476–480, 1999.
    • 32. P.L. Rosin. Measuring shape: Ellipticity, rectangularity, and triangularity. Machine Vision and Applic., 14(3):172–184, 2003.
    • 33. S. Maitra. Moment invariants. Proc. IEEE, 67:697–699, 1979.
    • 34. M.H. Singer. A general approach to moment calculation for polygons and line segments. Pattern Recognition, 26(7):1019–1028, 1993.
    • 35. J. Flusser and T. Suk. Pattern recognition by af ne moment invariants. Pattern Recognition, 26:167–174, 1993.
    • 36. G.T. Toussaint. Solving geometric problems with the rotating calipers. In Proc. IEEE MELECON '83, pages A10.02/1–4, 1983.
    • 37. P.L. Rosin. Measuring rectangularity. Machine Vision and Applic., 11:191–196, 1999.
    • 38. M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf. Computational Geometry: Algorithms and Applications. Springer-Verlag, 2nd edition, 2000.
    • 39. J. Zunic´ and P.L. Rosin. A rectilinearity measurement for polygons. IEEE Trans. on Patt. Anal. and Mach. Intell., 25(9):1193–1200, 2003.
    • 40. P.L. Rosin. Measuring sigmoidality. In Computer Analysis of Images and Patterns, volume 2756 of LNCS, pages 410–417, 2003.
    • 41. S. Fischer and H. Bunke. Identi cation using classical and new features in combination with decision tree ensembles. In J.M.H. du Buf and M.M. Bayer, editors, Automatic Diatom Identi - cation, pages 109–140. World Scienti c, 2002.
    • 42. D. McCallum and D. Avis. A linear algorithm for nding the convex hull of a simple polygon. Inform. Process. Lett., 9:201–206, 1979.
    • 43. J. Zunic´ and P.L. Rosin. A new convexity measurement for polygons. IEEE Trans. on Patt. Anal. and Mach. Intell., 26(7):923–934, 2004.
    • 44. J.J. Leou and W.H. Tsai. Automatic rotational symmetry determination for shape analysis. Pattern Recognition, 20(6):571–582, 1987.
    • 45. G. Marola. On the detection of the axes of symmetry of symmetric and almost symmetric planar images. IEEE Trans. on Patt. Anal. and Mach. Intell., 11(1):104–108, 1989.
    • 46. M. Petitjean. Chirality and symmetry measures: A transdisciplinary review. Entropy, 5:271–312, 2003.
    • 47. Y. Hel-Or, S. Peleg, and D. Avnir. Characterization of right handed and left handed shapes. Computer Vision, Graphics and Image Processing, 53(2):297–302, 1991.
    • 48. M.L. Hentschel and N.W. Page. Selection of descriptors for particle shape characterization. Part. Part. Syst. Charact., 20:25–38, 2003.
  • No related research data.
  • No similar publications.

Share - Bookmark

Cite this article