Shape recognition with generalized beam angle statistics

Date

2004-01-01

Author

Tola, OO
Arica, N
Yarman-Vural, F

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

206
views

0
downloads

In this study, we develop a new shape descriptor and a matching algorithm in order to find a given template shape in an edge detected image without extracting the boundary. The shape descriptor based on Generalized Beam Angle Statistics (GBAS) defines the angles between the lines connecting each boundary point with the rest of the points, as random variable. Then, it assigns a feature vector to each point using the moments of beam angles. The proposed matching algorithm performs shape recognition by matching the feature vectors of boundary points on the template shape and the edge pixels on the image. The matching process also considers the spatial distance of the edge pixels. The experiments performed on MPEG-7 data set show that the template shapes are found successfully on the noisy images.

Subject Keywords

Angle statistics, Shape recognition, Statistics, MPEG 7 Standard, Image edge detection, Joining processes, Random variables, Image recognition, Pixel, Noise shaping, Virtual colonoscopy

URI

https://hdl.handle.net/11511/66751

Journal

COMPUTER AND INFORMATION SCIENCES - ISCIS 2004, PROCEEDINGS

Collections

Department of Computer Engineering, Article

Suggestions

OpenMETU
Core

Shape recognition with generalized beam angle statistics Tola, OO; Arica, N; Yarman Vural, Fatoş Tunay (2004-04-30) In this study, we develop a new shape descriptor and matching algorithm in order to find a given template shape in an edge detected image without performing boundary extraction. The shape descriptor based on Generalized Beam Angle Statistics (GBAS) defines the angles between the lines connecting each boundary point with the rest of the points, as random variable. Then, it assigns a feature vector to each point using the moments of beam angles. The proposed matching algorithm performs shape recognition by ma...
Topological Navigation Algorithm Design and Analysis Using Spherical Images Şahin, Yasin; Koku, Ahmet Buğra; Department of Mechanical Engineering (2022-8-23) A topological navigation algorithm that has the capability of mapping and localization based on visual contents is proposed. Keypoint detection and feature matching are conducted on spherical images to extract significant features among sequential frames. Robot movement direction is estimated based on historical angle differences of significant features to reach the final destination. The navigation process is supported with visual egocentric localization to gain simultaneous localization and mapping compet...
Shape similarity measurement for boundary based features Arica, N; Yarman Vural, Fatoş Tunay (2005-01-01) In this study, we propose two algorithms for measuring the distance between shape boundaries. In the algorithms, shape boundary is represented by the Beam Angle Statistics (BAS), which maps 2-D shape information into a set of 1-D functions. Firstly, we adopt Dynamic Time Warping method to develop an efficient distance calculation scheme, which is consistent with the human visual system in perceiving shape similarity. Since the starting point of the representations may differ in shapes, the best corresponden...
Coarse-to-Fine Isometric Shape Correspondence by Tracking Symmetric Flips Sahillioğlu, Yusuf; Yemez, Y. (2013-02-01) We address the symmetric flip problem that is inherent to multi-resolution isometric shape matching algorithms. To this effect, we extend our previous work which handles the dense isometric correspondence problem in the original 3D Euclidean space via coarse-to-fine combinatorial matching. The key idea is based on keeping track of all optimal solutions, which may be more than one due to symmetry especially at coarse levels, throughout denser levels of the shape matching process. We compare the resulting den...
Continuous dimensionality characterization of image structures Felsberg, Michael; Kalkan, Sinan; Kruger, Norbert (Elsevier BV, 2009-05-04) Intrinsic dimensionality is a concept introduced by statistics and later used in image processing to measure the dimensionality of a data set. In this paper, we introduce a continuous representation of the intrinsic dimension of an image patch in terms of its local spectrum or, equivalently, its gradient field. By making use of a cone structure and barycentric co-ordinates, we can associate three confidences to the three different ideal cases of intrinsic dimensions corresponding to homogeneous image patche...

Citation Formats

O. Tola, N. Arica, and F. Yarman-Vural, “Shape recognition with generalized beam angle statistics,” COMPUTER AND INFORMATION SCIENCES - ISCIS 2004, PROCEEDINGS, pp. 391–399, 2004, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/66751.