286 search results - page 11 / 58 » Recognition Algorithm for Diamond-Free Graphs |
196
click to vote
ICCV
2003
IEEE
16 years 8 months ago
2003
IEEE
Vision tasks, such as segmentation, grouping, recognition, can be formulated as graph partition problems. The recent literature witnessed two popular graph cut algorithms: the Ncu...
166
Voted
ICDM
2006
IEEE
16 years 12 days ago
2006
IEEE
We describe a part-based object-recognition framework, specialized to mining complex 3D objects from detailed 3D images. Objects are modeled as a collection of parts together with...
181
Voted
LATA
2009
Springer
16 years 1 months ago
2009
Springer
This tutorial will present an overview of the use of Monadic Second-Order Logic to describe sets of finite graphs and graph transformations, in relation with the notions of tree-w...
151
Voted
ICANN
2007
Springer
16 years 15 days ago
2007
Springer
Abstract. Classification of structured data (i.e., data that are represented as graphs) is a topic of interest in the machine learning community. This paper presents a different,...
252
Voted
ACCV
2009
Springer
16 years 29 days ago
2009
Springer
This paper proposes a novel graph matching algorithm based on skeletons and applies it to shape recognition based on object silhouettes. The main idea is to match the critical poin...