Sciweavers

333 search results - page 27 / 67
» Speeding up moving-target search
Sort
View
86
Voted
ICCV
2003
IEEE
16 years 2 days ago
Globally Convergent Autocalibration
Existing autocalibration techniques use numerical optimization algorithms that are prone to the problem of local minima. To address this problem, we have developed a method where ...
Arrigo Benedetti, Alessandro Busti, Michela Farenz...
ICIP
2005
IEEE
15 years 11 months ago
Dependent bit allocation in multiview video coding
We consider the bit allocation problem in multiview video coding (MVC). A dependent coding technique using trellis expansion and the Viterbi algorithm (VA) is proposed, which take...
Jae Hoon Kim, Jonathan Garcia, Antonio Ortega
IBPRIA
2007
Springer
15 years 4 months ago
A Fast and Robust Iris Segmentation Method
Image preprocessing stage (also known as iris segmentation) is the first step of the iris recognition process and determines its accuracy. In this paper, we propose a method for ir...
Noé Otero-Mateo, Miguel A. Vega-Rodrí...
69
Voted
CP
2003
Springer
15 years 3 months ago
Propagation Redundancy in Redundant Modelling
Combining mutually redundant models with channelling constraints increases constraint propagation. However, the extra computation efforts of the additional variables and constraint...
Chiu Wo Choi, Jimmy Ho-Man Lee, Peter J. Stuckey
AAIM
2008
Springer
142views Algorithms» more  AAIM 2008»
14 years 11 months ago
Engineering Label-Constrained Shortest-Path Algorithms
We consider a generalization of the shortest-path problem: given an alphabet , a graph G whose edges are weighted and -labeled, and a regular language L , the L-constrained shortes...
Christopher L. Barrett, Keith R. Bisset, Martin Ho...