Sciweavers

133 search results - page 21 / 27
» Object Recognition by Matching Symbolic Edge Graphs
Sort
View
PR
2007
81views more  PR 2007»
13 years 8 months ago
Graph embedding using tree edit-union
In this paper we address the problem of how to learn a structural prototype that can be used to represent the variations present in a set of trees. The prototype serves as a patte...
Andrea Torsello, Edwin R. Hancock
ALGORITHMICA
2006
160views more  ALGORITHMICA 2006»
13 years 8 months ago
Combinatorial Algorithms for the Unsplittable Flow Problem
We provide combinatorial algorithms for the unsplittable flow problem (UFP) that either match or improve the previously best results. In the UFP we are given a (possibly directed)...
Yossi Azar, Oded Regev
ECCV
2010
Springer
13 years 9 months ago
Superpixels and Supervoxels in an Energy Optimization Framework
Many methods for object recognition, segmentation, etc., rely on tessellation of an image into "superpixels". A superpixel is an image patch which is better aligned with ...
Olga Veksler, Yuri Boykov, Paria Mehrani
ICCV
2009
IEEE
15 years 1 months ago
Shape Guided Contour Grouping with Particle Filters
We propose a novel framework for contour based object detection and recognition, which we formulate as a joint contour fragment grouping and labeling problem. For a given set of...
ChengEn Lu, Longin Jan Latecki, Nagesh Adluru, Hai...
PR
2007
141views more  PR 2007»
13 years 8 months ago
A Riemannian approach to graph embedding
In this paper, we make use of the relationship between the Laplace–Beltrami operator and the graph Laplacian, for the purposes of embedding a graph onto a Riemannian manifold. T...
Antonio Robles-Kelly, Edwin R. Hancock