2012
DOI: 10.5120/7312-9885
|View full text |Cite
|
Sign up to set email alerts
|

Generalized Hough Transform for Shape Matching

Abstract: In this paper we propose a novel approach towards shape matching for image retrieval. The system takes advantages of generalized Hough transform, as it works well in detecting arbitrary shapes even in the presence of gaps and in handling rotation, scaling and shift variations, and solves the heavy computational aspect by introducing a preliminary automatic selection of the appropriate contour points to consider in the matching phase. The numerical simulations and comparisons have confirmed the effectiveness an… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2012
2012
2017
2017

Publication Types

Select...
4

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 18 publications
(28 reference statements)
0
2
0
Order By: Relevance
“…The performance section consists of two comparison results : [I] For 1st Test Image Hough Transform (HT) [20,21] is a template matching technique that locates shapes in images. It has found extensive applications in extracting lines, circles, ellipses and other conic sections of interest [22]. HT computation requires a mapping from the image points into an accumulator space or Hough space.…”
Section: Performance Of Auto-thresholdmentioning
confidence: 99%
See 1 more Smart Citation
“…The performance section consists of two comparison results : [I] For 1st Test Image Hough Transform (HT) [20,21] is a template matching technique that locates shapes in images. It has found extensive applications in extracting lines, circles, ellipses and other conic sections of interest [22]. HT computation requires a mapping from the image points into an accumulator space or Hough space.…”
Section: Performance Of Auto-thresholdmentioning
confidence: 99%
“…Hough Hierarchy formally is a function that associates to every pair (x, y) in X × Y an element v(x, y) in V, as shown in eq. (22). Therefore its graph consists of pairs of the form (x, y, v(x, y)).…”
Section: Modified Hough Circle Transform (Mhct)mentioning
confidence: 99%