Robust sparse component analysis based on a generalized Hough transform
From MaRDI portal
Recommendations
- Sparse Component Analysis in Presence of Noise Using an Iterative EM-MAP Algorithm
- Optimization algorithms for sparse representations and applications
- A bilinear algorithm for sparse representations
- Estimating the Mixing Matrix in Sparse Component Analysis Based on Converting a Multiple Dominant to a Single Dominant Problem
- Estimating the mixing matrices based on a similarity function in sparse component analysis
Cites work
- A New Concept for Separability Problems in Blind Source Separation
- Atomic Decomposition by Basis Pursuit
- Blind source separation by sparse decomposition in a signal dictionary
- Generalizing the Hough transform to detect arbitrary shapes
- Independent component analysis, a new concept?
- On the use of sparse signal decomposition in the analysis of multi-channel surface electromyograms
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- The Hough transform estimator
- \(k\)-plane clustering
Cited in
(5)- Estimating the Mixing Matrix in Sparse Component Analysis Based on Converting a Multiple Dominant to a Single Dominant Problem
- A bilinear algorithm for sparse representations
- A probabilistic relaxation labeling framework for reducing the noise effect in geometric biclustering of gene expression data
- K-hyperline clustering learning for sparse component analysis
- Sparse Component Analysis in Presence of Noise Using an Iterative EM-MAP Algorithm
This page was built for publication: Robust sparse component analysis based on a generalized Hough transform
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q838872)
