$rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
Tóm tắt
Từ khóa
Tài liệu tham khảo
gersho, 1991, Vector Quantization and Signal Compression
tropp, 2004, Topics in Sparse Approximation
donoho, 2004, For most large underdetermined systems of linear equations the minimal -norm solution is also the sparsest solution
tropp, 2004, Just Relax Convex Programming Methods for Subset Selection and Sparse Approximation
donoho, 2004, For most large underdetermined systems of linear equations the minimal -norm near-solution approximates the sparsest near-solution
aharon, 2005, K-SVD An algorithm for designing of overcomplete dictionaries for sparse representation
coifman, 1995, Wavelets and Statistics, 103, 120
gastaud, 2003, dynamic range compression : a new method based on wavelet transform, Astron Data Anal Software Systems Conf
starck, 2003, image decomposition: separation of texture from piece-wise smooth content, SPIE Conf Signal Image Process Wavelet Applicat Signal Image Process X SPIE 48th Annu Meeting
donoho, 1994, ideal denoising in an orthonormal basis chosen from a library of bases, Comp Rend Acad Sci, 319, 1317
dempster, 1977, maximum likelihood from incomplete data via the em algorithm, J Roy Statist Soc, 39, 1
engan, 1999, frame design using focuss with method of optimal directions (mod), Norwegian Signal Process Symp, 65 69
kreutz-delgado, 2000, focuss-based dictionary learning algorithms, Wavelet Applications in Signal and Image Process VIII, 4119 53, 10.1117/12.408634
