In recent years there has been a growing interest in sparse approximations. This is due to their ... more In recent years there has been a growing interest in sparse approximations. This is due to their vast amount of applications. The task of finding sparse approximations can be very difficult this is because there is no general method guaranteed to work in every situation. In fact, in certain cases there are no efficient methods for finding sparse approximations. This project considers the problems of finding sparse approximations and then examines the two most commonly used algorithms the Lasso and Orthogonal matching pursuit. Then goes on to discuss some practical applications of sparse approximations.
In recent years there has been a growing interest in sparse approximations. This is due to their ... more In recent years there has been a growing interest in sparse approximations. This is due to their vast amount of applications. The task of finding sparse approximations can be very difficult this is because there is no general method guaranteed to work in every situation. In fact, in certain cases there are no efficient methods for finding sparse approximations. This project considers the problems of finding sparse approximations and then examines the two most commonly used algorithms the Lasso and Orthogonal matching pursuit. Then goes on to discuss some practical applications of sparse approximations.
Uploads
Papers by Debjyoti Ghosh