Sciweavers

18 search results - page 3 / 4
» A Global Relaxation Labeling Approach to Coreference Resolut...
Sort
View
CATA
2000
13 years 7 months ago
Fast connected component labeling algorithm using a divide and conquer technique
We investigate a method to speed up the O(n3 ) labeling algorithm of Rosenfeld and Pfaltz for segmenting binary images, which is unduly complex for large images. That algorithm sea...
June-Me Park, Carl G. Looney, Hui-Chuan Chen
ICML
2006
IEEE
14 years 6 months ago
Efficient MAP approximation for dense energy functions
We present an efficient method for maximizing energy functions with first and second order potentials, suitable for MAP labeling estimation problems that arise in undirected graph...
Marius Leordeanu, Martial Hebert
CORR
2008
Springer
126views Education» more  CORR 2008»
13 years 5 months ago
Path following algorithm for the graph matching problem
We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted ...
Mikhail Zaslavskiy, Francis Bach, Jean-Philippe Ve...
CVPR
2010
IEEE
13 years 8 months ago
A Study on Continuous Max-Flow and Min-Cut Approaches
Abstract. This work addresses a class of total-variation based multilabeling problems over a spatially continuous image domain, where the data fidelity term can be any bounded fun...
Jing Yuan, Egil Bae, Xuecheng Tai
PRL
2007
164views more  PRL 2007»
13 years 5 months ago
Retrieval of objects in video by similarity based on graph matching
In this paper, we tackle the problem of matching of objects in video in the context of the rough indexing paradigm. The approach developed is based on matching of region adjacency...
F. Chevalier, Jean-Philippe Domenger, Jenny Benois...