Sciweavers

40 search results - page 7 / 8
» Optimality Bounds for a Variational Relaxation of the Image ...
Sort
View
CVPR
2010
IEEE
14 years 1 months ago
Covering Trees and Lower-bounds on Quadratic Assignment
Many computer vision problems involving feature correspondence among images can be formulated as an assignment problem with a quadratic cost function. Such problems are computatio...
Julian Yarkony, Charless Fowlkes, Alex Ihler
TPDS
1998
92views more  TPDS 1998»
13 years 4 months ago
An Efficient Algorithm for Row Minima Computations on Basic Reconfigurable Meshes
—A matrix A of size m œ n containing items from a totally ordered universe is termed monotone if, for every i, j, 1 ‹ i < j ‹ m, the minimum value in row j lies below or to...
Koji Nakano, Stephan Olariu
BILDMED
2009
143views Algorithms» more  BILDMED 2009»
13 years 6 months ago
Landmark Constrained Non-parametric Image Registration with Isotropic Tolerances
Abstract. The incorporation of additional user knowledge into a nonrigid registration process is a promising topic in modern registration schemes. The combination of intensity base...
Nils Papenberg, Janine Olesch, Thomas Lange, Peter...
CVPR
2010
IEEE
13 years 7 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
CORR
2011
Springer
186views Education» more  CORR 2011»
12 years 8 months ago
Blind Compressed Sensing Over a Structured Union of Subspaces
—This paper addresses the problem of simultaneous signal recovery and dictionary learning based on compressive measurements. Multiple signals are analyzed jointly, with multiple ...
Jorge Silva, Minhua Chen, Yonina C. Eldar, Guiller...