Sciweavers

144 search results - page 21 / 29
» Sparsity in time-frequency representations
Sort
View
TKDE
2012
270views Formal Methods» more  TKDE 2012»
13 years 4 days ago
Low-Rank Kernel Matrix Factorization for Large-Scale Evolutionary Clustering
—Traditional clustering techniques are inapplicable to problems where the relationships between data points evolve over time. Not only is it important for the clustering algorith...
Lijun Wang, Manjeet Rege, Ming Dong, Yongsheng Din...
CVPR
2006
IEEE
15 years 11 months ago
Learning Semantic Patterns with Discriminant Localized Binary Projections
In this paper, we present a novel approach to learning semantic localized patterns with binary projections in a supervised manner. The pursuit of these binary projections is refor...
Shuicheng Yan, Tianqiang Yuan, Xiaoou Tang
ISCAS
2008
IEEE
217views Hardware» more  ISCAS 2008»
15 years 4 months ago
Approximate L0 constrained non-negative matrix and tensor factorization
— Non-negative matrix factorization (NMF), i.e. V ≈ WH where both V, W and H are non-negative has become a widely used blind source separation technique due to its part based r...
Morten Mørup, Kristoffer Hougaard Madsen, L...
ICASSP
2007
IEEE
15 years 4 months ago
Morphological Diversity and Sparse Image Denoising
Overcomplete representations are attracting interest in image processing theory, particularly due to their potential to generate sparse representations of data based on their morp...
Mohamed-Jalal Fadili, Jean-Luc Starck, Larbi Boubc...
ECCV
2010
Springer
14 years 11 months ago
Robust and Fast Collaborative Tracking with Two Stage Sparse Optimization
Abstract. The sparse representation has been widely used in many areas and utilized for visual tracking. Tracking with sparse representation is formulated as searching for samples ...
Baiyang Liu, Lin Yang, Junzhou Huang, Peter Meer, ...