Sciweavers

15485 search results - page 597 / 3097
» Computing Optimal Subsets
Sort
View
ICDE
2012
IEEE
240views Database» more  ICDE 2012»
13 years 9 months ago
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
Miao Qiao, Hong Cheng, Lijun Chang, Jeffrey Xu Yu
ICCV
2007
IEEE
16 years 9 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
ICPR
2006
IEEE
16 years 8 months ago
Image Renaissance Using Discrete Optimization
In this paper we propose a novel technique to image completion that addresses image renaissance through a graph-based matching process. To this end, a number of candidate seeds wi...
Cédric Allène, Nikos Paragios
CVPR
2010
IEEE
16 years 3 months ago
Vessel Scale Selection using MRF Optimization
Many feature detection algorithms rely on the choice of scale. In this paper, we complement standard scaleselection algorithms with spatial regularization. To this end, we formula...
Hengameh Mirzaalian, Ghassan Hamarneh
CVPR
2010
IEEE
16 years 3 months ago
A Globally Optimal Data-Driven Approach for Image Distortion Estimation
Image alignment in the presence of non-rigid distortions is a challenging task. Typically, this involves estimating the parameters of a dense deformation field that warps a disto...
Yuandong Tian, Srinivasa Narasimhan