Algorithms for Sparsity-Constrained Optimization
This thesis demonstrates techniques that provide faster and more accurate solutions to a variety of problems in machine learning and signal processing. The author proposes a"greedy" algorithm, deriving sparse solutions with guarantees of optimality. The use of this algorithm removes many o...
| Main Author: | Bahmani, Sohail (Author) |
|---|---|
| Corporate Author: | SpringerLink (Online service) |
| Format: | Electronic eBook |
| Language: | English |
| Published: |
Cham :
Springer International Publishing : Imprint: Springer,
2014.
|
| Series: | Springer Theses, Recognizing Outstanding Ph.D. Research,
261 |
| Subjects: | |
| Online Access: | Full Text via HEAL-Link |
Similar Items
-
Riemannian Computing in Computer Vision
Published: (2016) -
Perceptual Image Coding with Discrete Cosine Transform
by: Tan, Ee-Leng, et al.
Published: (2015) -
Multiresolution Approach to Processing Images for Different Applications Interaction of Lower Processing with Higher Vision /
by: Vujović, Igor
Published: (2015) -
Big Visual Data Analysis Scene Classification and Geometric Labeling /
by: Chen, Chen, et al.
Published: (2016) -
Writing Virtual Environments for Software Visualization
by: Jeffery, Clinton, et al.
Published: (2015)