Sparse representation in structured dictionaries with application to synthetic aperture radar

被引:128
作者
Varshney, Kush R. [1 ]
Cetin, Muejdat [2 ]
Fisher, John W., III [3 ]
Willsky, Alan S. [1 ]
机构
[1] MIT, Informat & Decis Syst Lab, Cambridge, MA 02139 USA
[2] Sabanci Univ, Fac Engn & Nat Sci, TR-34956 Istanbul, Turkey
[3] MIT, Comp Sci & Artificial Intelligence Lab, Cambridge, MA 02139 USA
基金
美国国家科学基金会;
关键词
Hough transforms; inverse problems; optimization methods; overcomplete dictionaries; sparse signal representations; synthetic aperture radar; tree searching;
D O I
10.1109/TSP.2008.919392
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Sparse signal representations and approximations from overcomplete dictionaries have become an invaluable tool recently. In this paper, we develop a new, heuristic, graph-structured, sparse signal representation algorithm for overcomplete dictionaries that can be decomposed into subdictionaries and whose dictionary elements can be arranged in a hierarchy. Around this algorithm, we construct a methodology for advanced image formation in wide-angle synthetic aperture radar (SAR), defining an approach for joint anisotropy characterization and image formation. Additionally, we develop a coordinate descent method for jointly optimizing a parameterized dictionary and recovering a sparse representation using that dictionary. The motivation is to characterize a phenomenon in wide-angle SAR that has not been given much attention before: migratory scattering centers, i.e., scatterers whose apparent spatial location depends on aspect angle. Finally, we address the topic of recovering solutions that are sparse in more than one objective domain by introducing a suitable sparsifying cost function. We encode geometric objectives into SAR image formation through sparsity in two domains, including the normal parameter space of the Hough transform.
引用
收藏
页码:3548 / 3561
页数:14
相关论文
共 40 条
[1]  
Aggarwal N, 2006, IEEE T IMAGE PROCESS, V15, P582, DOI 10.1109/TIP.2005.863021
[2]   On the uniqueness of overcomplete dictionaries, and a practical way to retrieve them [J].
Aharon, Michal ;
Elad, Michael ;
Bruckstein, Alfred M. .
LINEAR ALGEBRA AND ITS APPLICATIONS, 2006, 416 (01) :48-67
[3]   Angular description for 3D scattering centers [J].
Bhalla, Rajan ;
Raynal, Ann Marie ;
Ling, Hao ;
Moore, John ;
Velten, Vincent J. .
ALGORITHMS FOR SYNTHETIC APERTURE RADAR IMAGERY XIII, 2006, 6237
[4]   Feature-preserving regularization method for complex-valued inverse problems with application to coherent imaging [J].
Çetin, M ;
Karl, WC ;
Willsky, AS .
OPTICAL ENGINEERING, 2006, 45 (01)
[5]   SAR imaging from partial-aperture data with frequency-band omissions [J].
Çetin, M ;
Moses, RL .
Algorithms for Synthetic Aperture Radar Imagery XII, 2005, 5808 :32-43
[6]   Feature-enhanced synthetic aperture radar image formation based on nonquadratic regularization [J].
Çetin, M ;
Karl, WC .
IEEE TRANSACTIONS ON IMAGE PROCESSING, 2001, 10 (04) :623-631
[7]  
CHANEY RD, 1994, P SOC PHOTO-OPT INS, V2230, P256, DOI 10.1117/12.177177
[8]   Atomic decomposition by basis pursuit [J].
Chen, SSB ;
Donoho, DL ;
Saunders, MA .
SIAM JOURNAL ON SCIENTIFIC COMPUTING, 1998, 20 (01) :33-61
[9]  
COIFMAN RR, 1989, P INT C WAV MARS FRA
[10]   A reflective Newton method for minimizing a quadratic function subject to bounds on some of the variables [J].
Coleman, TF ;
Li, YY .
SIAM JOURNAL ON OPTIMIZATION, 1996, 6 (04) :1040-1058