Sciweavers

2527 search results - page 470 / 506
» Discrete optimization in computer vision
Sort
View
AUTOMATICA
2008
116views more  AUTOMATICA 2008»
13 years 10 months ago
A dynamical systems approach to weighted graph matching
Graph matching is a fundamental problem that arises frequently in the areas of distributed control, computer vision, and facility allocation. In this paper, we consider the optimal...
Michael M. Zavlanos, George J. Pappas
CVPR
2011
IEEE
13 years 3 months ago
Reduced Epipolar Cost for Accelerated Incremental SfM
We propose a reduced algebraic cost based on pairwise epipolar constraints for the iterative refinement of a multiple view 3D reconstruction. The aim is to accelerate the intermedi...
A. L. Rodriguez, P E. Lopez-de-Teruel, A. Ruiz
ICMCS
2007
IEEE
203views Multimedia» more  ICMCS 2007»
14 years 4 months ago
Efficient Video Object Segmentation by Graph-Cut
Segmentation of video objects from background is a popular computer vision problem and has many important applications. Most existing methods are either computationally expensive ...
Jinjun Wang, Wei Xu, Shenghuo Zhu, Yihong Gong
ICIP
2005
IEEE
14 years 11 months ago
Visual tracking via efficient kernel discriminant subspace learning
Robustly tracking moving objects in video sequences is one of the key problems in computer vision. In this paper we introduce a computationally efficient nonlinear kernel learning...
Chunhua Shen, Anton van den Hengel, Michael J. Bro...
HM
2005
Springer
152views Optimization» more  HM 2005»
14 years 3 months ago
3D Inter-subject Medical Image Registration by Scatter Search
Image registration is a very active research area in computer vision, namely it is used to find a transformation between two images taken under different conditions. Point matchi...
Oscar Cordón, Sergio Damas, Jose Santamar&i...