85 search results - page 4 / 17 » On Minimum Circular Arrangement |
ICIAP
2009
ACM
14 years 8 months ago
2009
ACM
Multi-class binary symbol classification requires the use of rich descriptors and robust classifiers. Shape representation is a difficult task because of several symbol distortions...
WSCG
2003
13 years 9 months ago
2003
In this paper we present the geometrical construction of an approximate generalized Voronoi diagram for generalized polygons and circular objects based on their minimum geometrica...
WG
2007
Springer
14 years 1 months ago
2007
Springer
The pathwidth of a graph G is the minimum clique number of H minus one, over all interval supergraphs H of G. Although pathwidth is a well-known and well-studied graph parameter, t...
ICIP
2009
IEEE
14 years 8 months ago
2009
IEEE
Symbol spotting problem requires feature extraction strategies able to generalize from training samples and to localize the target object while discarding most part of the image. ...
TSMC
2011
13 years 2 months ago
2011
—In this paper, we propose a circular blurred shape model descriptor to deal with the problem of symbol detection and classification as a particular case of object recognition. ...