Recognition of shapes by editing their shock graphs
TB Sebastian, PN Klein… - IEEE Transactions on …, 2004 - ieeexplore.ieee.org
This paper presents a novel framework for the recognition of objects based on their
silhouettes. The main idea is to measure the distance between two shapes as the minimum …
silhouettes. The main idea is to measure the distance between two shapes as the minimum …
On aligning curves
TB Sebastian, PN Klein… - IEEE transactions on …, 2003 - ieeexplore.ieee.org
We present a novel approach to finding a correspondence (alignment) between two curves.
The correspondence is based on a notion of an alignment curve which treats both curves …
The correspondence is based on a notion of an alignment curve which treats both curves …
Improving SVM accuracy by training on auxiliary data sources
P Wu, TG Dietterich - Proceedings of the twenty-first international …, 2004 - dl.acm.org
The standard model of supervised learning assumes that training and test data are drawn
from the same underlying distribution. This paper explores an application in which a second …
from the same underlying distribution. This paper explores an application in which a second …
Complex Zernike moments features for shape-based image retrieval
S Li, MC Lee, CM Pun - … on Systems, Man, and Cybernetics-Part …, 2008 - ieeexplore.ieee.org
Shape is a fundamental image feature used in content-based image-retrieval systems. This
paper proposes a robust and effective shape feature, which is based on a set of orthogonal …
paper proposes a robust and effective shape feature, which is based on a set of orthogonal …
2D shape matching by contour flexibility
In computer vision, shape matching is a challenging problem, especially when articulation
and deformation of parts occur. These variations may be insignificant in terms of human …
and deformation of parts occur. These variations may be insignificant in terms of human …
Matching and retrieval of distorted and occluded shapes using dynamic programming
EGM Petrakis, A Diplaros… - IEEE Transactions on …, 2002 - ieeexplore.ieee.org
We propose an approach for matching distorted and possibly occluded shapes using
dynamic programming (DP). We distinguish among various cases of matching such as …
dynamic programming (DP). We distinguish among various cases of matching such as …
Retrieval by shape similarity with perceptual distance and effective indexing
An important problem in accessing and retrieving visual information is to provide efficient
similarity matching in large databases. Though much work is being done on the …
similarity matching in large databases. Though much work is being done on the …
MARCH: Multiscale-arch-height description for mobile retrieval of leaf images
In this paper, we propose a novel shape description method for mobile retrieval of leaf
images. In this method, termed multiscale arch height (MARCH), hierarchical arch height …
images. In this method, termed multiscale arch height (MARCH), hierarchical arch height …
Hierarchical procrustes matching for shape retrieval
G McNeill, S Vijayakumar - 2006 IEEE Computer Society …, 2006 - ieeexplore.ieee.org
We introduce Hierarchical Procrustes Matching (HPM), a segment-based shape matching
algorithm which avoids problems associated with purely global or local methods and …
algorithm which avoids problems associated with purely global or local methods and …
A novel algorithm for estimation of depth map using image focus for 3D shape recovery in the presence of noise
Three-dimensional shape recovery from one or multiple observations is a challenging
problem of computer vision. In this paper, we present a new Focus Measure for the …
problem of computer vision. In this paper, we present a new Focus Measure for the …