Convex Approaches to Model Wavelet Sparsity Patterns

Details Convex Approaches to Model Wavelet Sparsity Patterns Convex Approaches to Model Wavelet Sparsity Patterns

2011-04-22

arxiv.org/abs/1104.4385v1

Computer Science

Computer Vision and Pattern Recognition

Scientific paper

Statistical dependencies among wavelet coefficients are commonly represented by graphical models such as hidden Markov trees(HMTs). However, in linear inverse problems such as deconvolution, tomography, and compressed sensing, the presence of a sensing or observation matrix produces a linear mixing of the simple Markovian dependency structure. This leads to reconstruction problems that are non-convex optimizations. Past work has dealt with this issue by resorting to greedy or suboptimal iterative reconstruction methods. In this paper, we propose new modeling approaches based on group-sparsity penalties that leads to convex optimizations that can be solved exactly and efficiently. We show that the methods we develop perform significantly better in deconvolution and compressed sensing applications, while being as computationally efficient as standard coefficient-wise approaches such as lasso.

Affiliated with

Also associated with

No associations

Rating

Convex Approaches to Model Wavelet Sparsity Patterns does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Convex Approaches to Model Wavelet Sparsity Patterns, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Convex Approaches to Model Wavelet Sparsity Patterns will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-330373