Sciweavers

33 search results - page 3 / 7
» Finding the global minimum for binary image restoration
Sort
View
ICCV
2007
IEEE
14 years 7 months ago
Uninitialized, Globally Optimal, Graph-Based Rectilinear Shape Segmentation The Opposing Metrics Method
We present a new approach for the incorporation of shape information into a segmentation algorithm. Unlike previous approaches to the problem, our method requires no initializatio...
Ali Kemal Sinop, Leo Grady
ICIP
2008
IEEE
14 years 1 days ago
Graph-cut optimization of the ratio of functions and its application to image segmentation
Optimizing the ratio of two functions of binary variables is a common task in many image analysis applications. In general, such a ratio is not amenable to graph-cut based optimiz...
Hui Wang, Nilanjan Ray, Hong Zhang
ECCV
2008
Springer
14 years 7 months ago
Feature Correspondence Via Graph Matching: Models and Global Optimization
Abstract. In this paper we present a new approach for establishing correspondences between sparse image features related by an unknown non-rigid mapping and corrupted by clutter an...
Lorenzo Torresani, Vladimir Kolmogorov, Carsten Ro...
ICIP
2001
IEEE
14 years 7 months ago
Moving target tracking algorithm based on the confidence measure of motion vectors
Change detection using difference picture has been used to detect the location of moving targets and to track them. This method needs the assumption of static camera, and the glob...
Jin-Sung Lee, Kwang-Yeon Rhee, Seong-Dae Kim
IEEECIT
2010
IEEE
13 years 4 months ago
Parallel Best Neighborhood Matching Algorithm Implementation on GPU Platform
—Error concealment restores the visual integrity of image content that has been damaged due to a bad network transmission. Best neighborhood matching (BNM) is an effective image ...
Guangyong Zhang, Liqiang He, Yanyan Zhang