Mixed Integer Programming For Sparse Coding: Application to Image Denoising

You are here

Top Reasons to Join SPS Today!

1. IEEE Signal Processing Magazine
2. Signal Processing Digital Library*
3. Inside Signal Processing Newsletter
4. SPS Resource Center
5. Career advancement & recognition
6. Discounts on conferences and publications
7. Professional networking
8. Communities for students, young professionals, and women
9. Volunteer opportunities
10. Coming soon! PDH/CEU credits
Click here to learn more.

Mixed Integer Programming For Sparse Coding: Application to Image Denoising

By: 
Yuan Liu; Stéphane Canu; Paul Honeine; Su Ruan

Dictionary learning for sparse representations is generally conducted in two alternating steps-sparse coding and dictionary updating. In this paper, a new approach to solve the sparse coding step is proposed. Because this step involves an 0 -norm, most, if not all, existing solutions only provide a local or approximate solution. Instead, a real 0 optimization is considered for the sparse coding problem providing a global solution. The proposed method reformulates the optimization problem as a mixed-integer quadratic program (MIQP), allowing then to obtain the global optimal solution by using an off-the-shelf optimization software. Because computing time is the main disadvantage of this approach, two techniques are proposed to improve its computational speed. One is to add suitable constraints and the other to use an appropriate initialization. The results obtained on an image denoising task demonstrate the feasibility of the MIQP approach for processing real images while achieving good performance compared to the most advanced methods.

SPS on Twitter

SPS Videos


Signal Processing in Home Assistants

 


Multimedia Forensics


Careers in Signal Processing             

 


Under the Radar