Sciweavers

504 search results - page 31 / 101
» Canonical Graph Shapes
Sort
View
ICPR
2008
IEEE
14 years 9 months ago
Object localization using affine invariant substructure constraints
In this paper we propose a novel method for generic object localization. The method is based on modeling the object as a graph at two levels: a local substructural representation ...
Ahmed M. Elgammal, Ishani Chakraborty
CORR
2010
Springer
342views Education» more  CORR 2010»
13 years 6 months ago
Canonizable Partial Order Generators
In a previous work we introduced slice graphs as a way to specify both infinite languages of directed acyclic graphs (DAGs) and infinite languages of partial orders. Therein we fo...
Mateus de Oliveira Oliveira
APPROX
2007
Springer
100views Algorithms» more  APPROX 2007»
14 years 2 months ago
Implementing Huge Sparse Random Graphs
Consider a scenario where one desires to simulate the execution of some graph algorithm on random input graphs of huge, perhaps even exponential size. Sampling and storing these h...
Moni Naor, Asaf Nussboim
CVPR
2008
IEEE
14 years 10 months ago
From skeletons to bone graphs: Medial abstraction for object recognition
letons to Bone Graphs: Medial Abstraction for Object Recognition Diego Macrini University of Toronto Kaleem Siddiqi McGill University Sven Dickinson University of Toronto Medial d...
Diego Macrini, Kaleem Siddiqi, Sven J. Dickinson
ICDAR
2011
IEEE
12 years 8 months ago
Symbol Spotting in Line Drawings through Graph Paths Hashing
—In this paper we propose a symbol spotting technique through hashing the shape descriptors of graph paths (Hamiltonian paths). Complex graphical structures in line drawings can ...
Anjan Dutta, Josep Lladós, Umapada Pal