64 search results - page 3 / 13 » Locally Competitive Algorithms for Sparse Approximation |
175
Voted
DAC
2011
ACM
13 years 9 months ago
2011
ACM
In this paper, a new sparse approximation technique is proposed for incremental power grid analysis. Our proposed method is motivated by the observation that when a power grid net...
ECCV
2006
Springer
15 years 11 months ago
2006
Springer
Abstract. In recent years there has been growing interest in recognition models using local image features for applications ranging from long range motion matching to object class ...
ICRA
2005
IEEE
15 years 3 months ago
2005
IEEE
— For the Simultaneous Localization and Mapping problem several efficient algorithms have been proposed that make use of a sparse information matrix representation (e.g. SEIF, T...
ICIP
2007
IEEE
15 years 11 months ago
2007
IEEE
Finding the sparsest approximation of an image as a sum of basis functions drawn from a redundant dictionary is an NPhard problem. In the case of a dictionary whose elements form ...
75
Voted
ICPR
2008
IEEE
15 years 4 months ago
2008
IEEE
Frames of videos with static background and dynamic foreground can be viewed as samples of signals that vary slowly in time with sparse corruption caused by foreground objects. We...