Sciweavers

CORR
2010
Springer
208views Education» more  CORR 2010»
13 years 9 months ago
Real-time Robust Principal Components' Pursuit
In the recent work of Candes et al, the problem of recovering low rank matrix corrupted by i.i.d. sparse outliers is studied and a very elegant solution, principal component pursui...
Chenlu Qiu, Namrata Vaswani
CORR
2010
Springer
143views Education» more  CORR 2010»
13 years 9 months ago
CUR from a Sparse Optimization Viewpoint
The CUR decomposition provides an approximation of a matrix X that has low reconstruction error and that is sparse in the sense that the resulting approximation lies in the span o...
Jacob Bien, Ya Xu, Michael W. Mahoney
ICCV
2009
IEEE
13 years 10 months ago
Learning with dynamic group sparsity
This paper investigates a new learning formulation called dynamic group sparsity. It is a natural extension of the standard sparsity concept in compressive sensing, and is motivat...
Junzhou Huang, Xiaolei Huang, Dimitris N. Metaxas
ICASSP
2009
IEEE
13 years 10 months ago
Blind sparse source separation for unknown number of sources using Gaussian mixture model fitting with Dirichlet prior
In this paper, we propose a novel sparse source separation method that can be applied even if the number of sources is unknown. Recently, many sparse source separation approaches ...
Shoko Araki, Tomohiro Nakatani, Hiroshi Sawada, Sh...
FAST
2009
13 years 10 months ago
Sparse Indexing: Large Scale, Inline Deduplication Using Sampling and Locality
We present sparse indexing, a technique that uses sampling and exploits the inherent locality within backup streams to solve for large-scale backup (e.g., hundreds of terabytes) t...
Mark Lillibridge, Kave Eshghi, Deepavali Bhagwat, ...
WD
2010
13 years 10 months ago
Self-organized aggregation in irregular wireless networks
Gossip-based epidemic protocols are used to aggregate data in distributed systems. This fault-tolerant approach does neither require maintenance of any global network state nor kno...
Joanna Geibig, Dirk Bradler
ICIP
2010
IEEE
13 years 10 months ago
Semi-automatic motion based segmentation using long term motion trajectories
Semi-automated object segmentation is an important step in the cinema post-production workflow. We propose a dense motion based segmentation process that employs sparse feature ba...
Gary Baugh, Anil C. Kokaram
BMVC
2010
13 years 10 months ago
Sparse Sparse Bundle Adjustment
Sparse Bundle Adjustment (SBA) is a method for simultaneously optimizing a set of camera poses and visible points. It exploits the sparse primary structure of the problem, where c...
Kurt Konolige
SIAMSC
2010
215views more  SIAMSC 2010»
13 years 10 months ago
A Fast Algorithm for Sparse Reconstruction Based on Shrinkage, Subspace Optimization, and Continuation
We propose a fast algorithm for solving the ℓ1-regularized minimization problem minx∈Rn µ x 1 + Ax − b 2 2 for recovering sparse solutions to an undetermined system of linea...
Zaiwen Wen, Wotao Yin, Donald Goldfarb, Yin Zhang
PKDD
2010
Springer
160views Data Mining» more  PKDD 2010»
13 years 11 months ago
Sparse Unsupervised Dimensionality Reduction Algorithms
Abstract. Principal component analysis (PCA) and its dual—principal coordinate analysis (PCO)—are widely applied to unsupervised dimensionality reduction. In this paper, we sho...
Wenjun Dou, Guang Dai, Congfu Xu, Zhihua Zhang