scholarly journals EFFECT OF HIGH CURVATURE POINT DELETION ON THE PERFORMANCE OF TWO CONTOUR BASED SHAPE RECOGNITION ALGORITHMS

Author(s):  
ANARTA GHOSH ◽  
NICOLAI PETKOV

Psychophysical researches on the human visual system have shown that the points of high curvature on the contour of an object play an important role in the recognition process. Inspired by these studies we propose: (i) a novel algorithm to select points of high curvature on the contour of an object which can be used to construct a recognizable polygonal approximation, (ii) a test which evaluates the effect of deletion of contour segments containing such points on the performance of contour based object recognition algorithms. We use complete contour representations of objects as a reference (training) set. Incomplete contour representations of the same objects are used as a test set. The performance of an algorithm is reported using the recognition rate as a function of the percentage of contour retained. We consider two types of contour incompleteness obtained by deletion of contour segments of high or low curvature. We illustrate the test procedure using two shape recognition algorithms that deploy a shape context and a distance multiset as local shape descriptors. Both algorithms qualitatively mimic human visual perception in that the deletion of segments of high curvature has a stronger performance degradation effect than the deletion of other parts of the contour. This effect is more pronounced in the performance of the shape context method.

2013 ◽  
Vol 5 (20) ◽  
pp. 4810-4815
Author(s):  
Gu Lichuan ◽  
Qiao Yulong ◽  
Cao Mengru ◽  
Guo Qingyan

2009 ◽  
Author(s):  
J. Lu ◽  
B. Wang ◽  
H.M. Gao ◽  
Z.Q. Zhou

Author(s):  
Jungpil Shin ◽  
◽  
Hsien-Chou Liao ◽  

In this paper a new interactive map search system is presented using shape context and bipartite graph matching. Shape context is used for measuring shape similarity and the recovering of point correspondences. After the above information is generated from the shape context bipartite graph matching is used to obtain the optimal correspondence between two shapes. Hierarchical description is also used to increase the recognition rate. Shape context is a method to treat shapes as a set of points and generate the histogram of the distribution of points. Wavelet analysis is used in hierarchical description. In order to shorten the calculation time, piecewise linear approximation is implemented as the feature extraction method. The systemlists the sixmost similar shapes to hand-written input shapes from the reference shapes, i.e., Japan’s 47 prefectures. Comparison results of linear matching, Dynamic Programming (DP) matching and shape context with bipartite graph matching indicate that the 1st place recognition rates are 82%, 84.52% and 92.45%, respectively. The evaluation result of hierarchical description shows that hierarchical approximation can improve the recognition rate from 92.45 to 94.97% using the deepest-4 depth. These results show that the proposed method is effective on fulfilling the interactive map search system.


2016 ◽  
Vol 175 ◽  
pp. 888-898 ◽  
Author(s):  
Edgar Roman-Rangel ◽  
Changhu Wang ◽  
Stephane Marchand-Maillet

Sign in / Sign up

Export Citation Format

Share Document