Sciweavers

334 search results - page 54 / 67
» On Shift-Invariant Sparse Coding
Sort
View
AI
2006
Springer
13 years 9 months ago
Cut-and-solve: An iterative search strategy for combinatorial optimization problems
Branch-and-bound and branch-and-cut use search trees to identify optimal solutions to combinatorial optimization problems. In this paper, we introduce an iterative search strategy...
Sharlee Climer, Weixiong Zhang
ICCV
2005
IEEE
14 years 11 months ago
Creating Efficient Codebooks for Visual Recognition
Visual codebook based quantization of robust appearance descriptors extracted from local image patches is an effective means of capturing image statistics for texture analysis and...
Bill Triggs, Frédéric Jurie
ICIP
2005
IEEE
14 years 10 months ago
The M-term pursuit for image representation and progressive compression
This paper introduces a sparse signal representation algorithm in redundant dictionaries, called the M-Term Pursuit (MTP), with an application to image representation and scalable ...
Adel Rahmoune, Pierre Vandergheynst, Pascal Frossa...
FASE
2009
Springer
14 years 3 months ago
Reducing the Costs of Bounded-Exhaustive Testing
Abstract. Bounded-exhaustive testing is an automated testing methodology that checks the code under test for all inputs within given bounds: first the user describes a set of test...
Vilas Jagannath, Yun Young Lee, Brett Daniel, Dark...
ICASSP
2009
IEEE
14 years 3 months ago
Distributed compressive video sensing
Low-complexity video encoding has been applicable to several emerging applications. Recently, distributed video coding (DVC) has been proposed to reduce encoding complexity to the...
Li-Wei Kang, Chun-Shien Lu