Shape recognition using attributed string matching with polygon vertices as the primitives

Date

2002-01-01

Author

Kaygin, S
Bulut, Mehmet Mete

Metadata

Show full item record

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

Item Usage Stats

91
views

0
downloads

Attributed string matching has been utilized for polygon matching in various applications, in which line segments are the primitives. Adding a merge operator avoids the segmentation inconsistencies due to the noisy images or distorted shapes, however it is computationally expensive. In this paper, the vertices of the polygons are suggested as the primitives of the attributed strings. Deletion and insertion of a vertex corresponds to merging two consecutive line segments and splitting a line segment, respectively. In this way, the benefits of split and merge operations are placed in the dynamic programming algorithm for the edit distance evaluation without an extra computation-cost. (C) 2002 Elsevier Science B.V. All rights reserved

Subject Keywords

Attributed strings, Vertex primitives

URI

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

Journal

PATTERN RECOGNITION LETTERS

DOI

https://doi.org/10.1016/s0167-8655(01)00111-8

Collections

Department of Electrical and Electronics Engineering, Article

Suggestions

OpenMETU
Core

Shape recognition with generalized beam angle statistics Tola, OO; Arica, N; Yarman-Vural, F (2004-01-01) 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 matchin...
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...
Fine resolution frequency estimation from three DFT samples: Case of windowed data Candan, Çağatay (2015-09-01) An efficient and low complexity frequency estimation method based on the discrete Fourier transform (DFT) samples is described. The suggested method can operate with an arbitrary window function in the absence or presence of zero-padding. The frequency estimation performance of the suggested method is shown to follow the Cramer-Rao bound closely without any error floor due to estimator bias, even at exceptionally high signal-to-noise-ratio (SNR) values.
Performance-based parametric design explorations: A method for generating appropriate building components Ercan, Burak; Elias Özkan, Soofia Tahira (2015-05-01) Performance-based parametric design explorations depend on formulating custom-designed workflows that require reading, writing, interpreting and manipulating databases, as part of the design process. The possibilities of customization and parameterization offered by the user-friendly interfaces of advanced building-performance simulation software and digital design tools have now enabled architects to carry out performance-based design explorations without the help of simulation experts. This paper presents...
Similarity matrix framework for data from union of subspaces Aldroubi, Akram; Sekmen, Ali; Koku, Ahmet Buğra; Cakmak, Ahmet Faruk (2018-09-01) This paper presents a framework for finding similarity matrices for the segmentation of data W = [w(1)...w(N)] subset of R-D drawn from a union U = boolean OR(M)(i=1) S-i, of independent subspaces {S-i}(i=1)(M), of dimensions {d(i)}(i=1)(M). It is shown that any factorization of W = BP, where columns of B form a basis for data W and they also come from U, can be used to produce a similarity matrix Xi w. In other words, Xi w(i, j) not equal 0, when the columns w(i) and w(j) of W come from the same subspace, ...

Citation Formats

S. Kaygin and M. M. Bulut, “Shape recognition using attributed string matching with polygon vertices as the primitives,” PATTERN RECOGNITION LETTERS, pp. 287–294, 2002, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/52210.