Boundary Based Orientation of Polygonal Shapes
The computation of a shape’s orientation is a common task in many areas of computer vision and image processing applications. It is usually an initial step or a part of data preprocessing. There are several approaches to the problem – most of them could be understood as the ‘area based’ ones. In spite of many unavoidable problems where working with shape boundaries in discrete space, the demand for a pure ‘boundary based’ method, seems to be very reasonable. Such a method for shapes having polygonal boundaries is presented in this paper. We define the shape orientation by the line that maximises the total sum of squared lengths of projections of all the shape boundary edges onto this line. Advantages and disadvantages of the method are discussed.
KeywordsShape orientation image processing early vision
Unable to display preview. Download preview PDF.
- 4.Horn, B.K.P.: Robot Vision. MIT Press, Cambridge (1986)Google Scholar
- 5.Jain, R., Kasturi, R., Schunck, B.G.: Machine Vision. McGraw-Hill, New York (1995)Google Scholar
- 10.Shiv Naga Prasad, V., Yegnanarayana, B.: Finding Axes of Symmetry from Potential Fields. IEEE Trans. Image Processing 13(12), 1556–1559 (2004)Google Scholar
- 11.Rosin, P.L.: Techniques for Assessing Polygonal Approximations of Curves. IEEE Trans. PAMI 19(6), 659–666 (1997)Google Scholar
- 12.Shen, D., Ip, H.H.S.: Generalized Affine Invariant Normalization. IEEE Trans. PAMI 19(5), 431–440 (1997)Google Scholar
- 13.Shen, D., Ip, H.H.S., Cheung, K.K.T., Teoh, E.K.: Symmetry Detection by Generalized Complex (GC) Moments: A Close-Form Solution. IEEE Trans. PAMI 21(5), 466–476 (1999)Google Scholar
- 15.Žunić, J., Kopanja, L., Fieldsend, J.E.: Notes on Shape Orientation where the Standard Method Does not Work. Pattern Recognition 39(5), 856–865 (2005)Google Scholar