Scientific Library of Tomsk State University

   E-catalog        

Image from Google Jackets
Normal view MARC view

Algorithms for Sparsity-Constrained Optimization electronic resource by Sohail Bahmani.

By: Bahmani, Sohail [author.]Contributor(s): SpringerLink (Online service)Material type: TextTextSeries: Springer Theses, Recognizing Outstanding Ph.D. ResearchPublication details: Cham : Springer International Publishing : Imprint: Springer, 2014Description: XXI, 107 p. 13 illus., 12 illus. in color. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9783319018812Subject(s): engineering | Computer vision | Engineering | Signal, Image and Speech Processing | Mathematical Applications in Computer Science | Image Processing and Computer VisionDDC classification: 621.382 LOC classification: TK5102.9TA1637-1638TK7882.S65Online resources: Click here to access online
Contents:
Introduction -- Preliminaries -- Sparsity-Constrained Optimization -- Background -- 1-bit Compressed Sensing -- Estimation Under Model-Based Sparsity -- Projected Gradient Descent for `p-constrained Least Squares -- Conclusion and Future Work.
In: Springer eBooksSummary: 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 of the inaccuracies that occurred with the use of previous models.
Tags from this library: No tags from this library for this title. Log in to add tags.
No physical items for this record

Introduction -- Preliminaries -- Sparsity-Constrained Optimization -- Background -- 1-bit Compressed Sensing -- Estimation Under Model-Based Sparsity -- Projected Gradient Descent for `p-constrained Least Squares -- Conclusion and Future Work.

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 of the inaccuracies that occurred with the use of previous models.

There are no comments on this title.

to post a comment.