Sciweavers

4714 search results - page 189 / 943
» The Complexity of Iterated Multiplication
Sort
View
JSCIC
2010
136views more  JSCIC 2010»
14 years 11 months ago
Multiple Level Sets for Piecewise Constant Surface Reconstruction in Highly Ill-Posed Problems
This paper considers highly ill-posed surface recovery inverse problems, where the sought surface in 2D or 3D is piecewise constant with several possible level values. These level...
K. van den Doel, U. M. Ascher, A. Leitão
TCSV
2010
14 years 11 months ago
M-Channel Multiple Description Coding With Two-Rate Coding and Staggered Quantization
A low complexity M-channel multiple description coding scheme is developed in this paper, in which each description carries one subset of the input with a higher bit rate and the r...
Upul Samarawickrama, Jie Liang, Chao Tian
163
Voted
ICCV
2011
IEEE
14 years 4 months ago
Tracking Multiple People under Global Appearance Constraints
In this paper, we show that tracking multiple people whose paths may intersect can be formulated as a convex global optimization problem. Our proposed framework is designed to exp...
Horesh Ben Shitrit, Jerome Berclaz, Francois Fleur...
CVPR
2007
IEEE
16 years 6 months ago
Object Tracking by Asymmetric Kernel Mean Shift with Automatic Scale and Orientation Selection
Tracking objects using the mean shift method is performed by iteratively translating a kernel in the image space such that the past and current object observations are similar. Tr...
Alper Yilmaz
ICC
2007
IEEE
192views Communications» more  ICC 2007»
15 years 10 months ago
Informed Dynamic Scheduling for Belief-Propagation Decoding of LDPC Codes
— Low-Density Parity-Check (LDPC) codes are usually decoded by running an iterative belief-propagation, or message-passing, algorithm over the factor graph of the code. The tradi...
Andres I. Vila Casado, Miguel Griot, Richard D. We...