Sciweavers

11565 search results - page 1909 / 2313
» Computing Minimal Mappings
Sort
View
CRV
2008
IEEE
205views Robotics» more  CRV 2008»
16 years 2 months ago
Accurate Boundary Localization using Dynamic Programming on Snakes
The extraction of contours using deformable models, such as snakes, is a problem of great interest in computer vision, particular in areas of medical imaging and tracking. Snakes ...
Akshaya Kumar Mishra, Paul W. Fieguth, David A. Cl...
ICASSP
2008
IEEE
16 years 2 months ago
Parameterized design framework for hardware implementation of particle filters
Particle filtering methods provide powerful techniques for solving non-linear state-estimation problems, and are applied to a variety of application areas in signal processing. Be...
Sankalita Saha, Neal K. Bambha, Shuvra S. Bhattach...
ICASSP
2008
IEEE
16 years 2 months ago
Blind optimization of algorithm parameters for signal denoising by Monte-Carlo SURE
We consider the problem of optimizing the parameters of an arbitrary denoising algorithm by minimizing Stein’s Unbiased Risk Estimate (SURE) which provides a means of assessing ...
Sathish Ramani, Thierry Blu, Michael Unser
ICASSP
2008
IEEE
16 years 2 months ago
Reconstructing sparse signals from their zero crossings
Classical sampling records the signal level at pre-determined time instances, usually uniformly spaced. An alternative implicit sampling model is to record the timing of pre-deter...
Petros Boufounos, Richard G. Baraniuk
ICASSP
2008
IEEE
16 years 2 months ago
Wavelet-domain compressive signal reconstruction using a Hidden Markov Tree model
Compressive sensing aims to recover a sparse or compressible signal from a small set of projections onto random vectors; conventional solutions involve linear programming or greed...
Marco F. Duarte, Michael B. Wakin, Richard G. Bara...
« Prev « First page 1909 / 2313 Last » Next »