Boosted Dictionary Learning for Image Compression

被引:28
作者
Nejati, Mansour [1 ]
Samavi, Shadrokh [1 ,2 ]
Karimi, Nader [1 ]
Soroushmehr, Sayed Mohammad Reza [3 ]
Najarian, Kayvan [3 ,4 ]
机构
[1] Isfahan Univ Technol, Dept Elect & Comp Engn, Esfahan 8415683111, Iran
[2] McMaster Univ, Dept Elect & Comp Engn, Hamilton, ON L8S 4L8, Canada
[3] Univ Michigan, Dept Emergency Med, Michigan Ctr Integrat Res Crit Care, Ann Arbor, MI 48109 USA
[4] Univ Michigan, Dept Computat Med & Bioinformat, Ann Arbor, MI 48109 USA
关键词
Image compression; sparse representation; boosted dictionary learning; ensemble model; mutual coherence; wavelet; INCOHERENT DICTIONARIES; SPARSE REPRESENTATION; COMPUTER VISION; K-SVD; MATRIX; PROJECTIONS; ALGORITHM;
D O I
10.1109/TIP.2016.2598483
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Sparse representations over redundant dictionaries have shown to produce high-quality results in various signal and image processing tasks. Recent advancements in learning-based dictionary design have made image compression using data-adaptive learned dictionaries a promising field. In this paper, we present a boosted dictionary learning framework to construct an ensemble of complementary specialized dictionaries for sparse image representation. Boosted dictionaries along with a competitive sparse coding form our ensemble model which can provide us with more efficient sparse representations. The constituent dictionaries of the ensemble are obtained using a coherence regularized dictionary learning model for which two novel dictionary optimization algorithms are proposed. These algorithms improve the generalization properties of the trained dictionary compared with several incoherent dictionary learning methods. Based on the proposed ensemble model, we then develop a new image compression algorithm using boosted multi-scale dictionaries learned in the wavelet domain. Our algorithm is evaluated for the compression of natural images. Experimental results demonstrate that the proposed algorithm has better rate-distortion performance as compared with several competing compression methods, including analytic and learned dictionary schemes.
引用
收藏
页码:4900 / 4915
页数:16
相关论文
共 56 条
[1]   K-SVD: An algorithm for designing overcomplete dictionaries for sparse representation [J].
Aharon, Michal ;
Elad, Michael ;
Bruckstein, Alfred .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2006, 54 (11) :4311-4322
[2]  
[Anonymous], 2004, Technical Report HPL-2004-76.
[3]  
[Anonymous], 1993, SIGN SYST COMP 1993
[4]   Optimization with Sparsity-Inducing Penalties [J].
Bach, Francis ;
Jenatton, Rodolphe ;
Mairal, Julien ;
Obozinski, Guillaume .
FOUNDATIONS AND TRENDS IN MACHINE LEARNING, 2012, 4 (01) :1-106
[5]   Learning Incoherent Dictionaries for Sparse Approximation Using Iterative Projections and Rotations [J].
Barchiesi, Daniele ;
Plumbley, Mark D. .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2013, 61 (08) :2055-2065
[6]   ALGORITHM - SOLUTION OF MATRIX EQUATION AX+XB = C [J].
BARTELS, RH ;
STEWART, GW .
COMMUNICATIONS OF THE ACM, 1972, 15 (09) :820-&
[7]  
Bovik A, 2005, HANDBOOK OF IMAGE AND VIDEO PROCESSING, 2ND EDITION, pV, DOI 10.1016/B978-012119792-6/50062-0
[8]   From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images [J].
Bruckstein, Alfred M. ;
Donoho, David L. ;
Elad, Michael .
SIAM REVIEW, 2009, 51 (01) :34-81
[9]   Compression of facial images using the K-SVD algorithm [J].
Bryt, Ori ;
Elad, Michael .
JOURNAL OF VISUAL COMMUNICATION AND IMAGE REPRESENTATION, 2008, 19 (04) :270-282
[10]  
Celepcikay, 2013, P IEEE INT C IM PROC