{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T04:20:37Z","timestamp":1760242837598,"version":"build-2065373602"},"reference-count":40,"publisher":"MDPI AG","issue":"1","license":[{"start":{"date-parts":[[2016,12,25]],"date-time":"2016-12-25T00:00:00Z","timestamp":1482624000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U1533125","61401069"],"award-info":[{"award-number":["U1533125","61401069"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"National Science and technologymajor project","award":["2016ZX03001022"],"award-info":[{"award-number":["2016ZX03001022"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>This paper investigates a structured sparse SAR imaging algorithm for point scattering model based on tensor decomposition. Several SAR imaging schemes have been developed by researchers for improving the imaging quality. For a typical SAR target scenario, the scatterers distribution usually has the feature of structured sparsity. Without considering this feature thoroughly, the existing schemes have still certain drawbacks. The classic matching pursuit algorithms can obtain clearer imaging results, but the cost is resulting in an extreme complexity and a huge computation resource consumption. Therefore, this paper put forward a tensor-based SAR imaging algorithm by means of multiway structured sparsity which makes full use of the above geometrical feature of the scatterers distribution. The spotlight SAR observation signal is formulated as a Tucker model considering the Kronecker constraint, and then a sparse reconstruction algorithm is introduced by utilizing the structured sparsity of the scene. The proposed tensor-based SAR imaging model is able to take advantage of the Kronecker information in each mode, which ensures the robustness for the signal reconstruction. Both the algorithm complexity analysis and numerical simulations show that the proposed method requires less computation than the existing sparsity-driven SAR imaging algorithms. The imaging realizations based on the practical measured data also indicate that the proposed algorithm is superior to the reference methods even in the severe noisy environment, under the condition of multiway structured sparsity.<\/jats:p>","DOI":"10.3390\/a10010002","type":"journal-article","created":{"date-parts":[[2016,12,28]],"date-time":"2016-12-28T11:22:14Z","timestamp":1482924134000},"page":"2","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A Tensor Decomposition Based Multiway Structured Sparse SAR Imaging Algorithm with Kronecker Constraint"],"prefix":"10.3390","volume":"10","author":[{"given":"Yu-Fei","family":"Gao","sequence":"first","affiliation":[{"name":"School of Electronic Engineering, University of Electronic Science and Technology of China, No. 2006, Xiyuan Ave., West Hi-Tech Zone, Chengdu 611731, China"}]},{"given":"Xun-Chao","family":"Cong","sequence":"additional","affiliation":[{"name":"School of Electronic Engineering, University of Electronic Science and Technology of China, No. 2006, Xiyuan Ave., West Hi-Tech Zone, Chengdu 611731, China"}]},{"given":"Yue","family":"Yang","sequence":"additional","affiliation":[{"name":"School of Electronic Engineering, University of Electronic Science and Technology of China, No. 2006, Xiyuan Ave., West Hi-Tech Zone, Chengdu 611731, China"}]},{"given":"Qun","family":"Wan","sequence":"additional","affiliation":[{"name":"School of Electronic Engineering, University of Electronic Science and Technology of China, No. 2006, Xiyuan Ave., West Hi-Tech Zone, Chengdu 611731, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3888-2881","authenticated-orcid":false,"given":"Guan","family":"Gui","sequence":"additional","affiliation":[{"name":"College of Telecommunication and Information Engineering, Nanjing University of Posts and Telecommunications, 66 Xinmofan Road, Nanjing 210003, China"}]}],"member":"1968","published-online":{"date-parts":[[2016,12,25]]},"reference":[{"key":"ref_1","unstructured":"Curlander, J.C., and McDonough, R.N. (1991). Synthetic Aperture Radar: Systems and Signal Processing, Wiley-Interscience."},{"key":"ref_2","unstructured":"Franceschetti, G., and Lanari, R. (1999). Synthetic Aperture Radar Processing, CRC Press."},{"key":"ref_3","unstructured":"Vu, D.H. (2012). Advanced Techniques for Synthetic Aperture Radar Image Reconstruction. [Ph.D. Thesis, University of Florida]."},{"key":"ref_4","unstructured":"Soumekh, M. (1999). Synthetic Aperture Radar Signal Processing with MATLAB Algorithms, Wiley-Interscience."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"1289","DOI":"10.1109\/TIT.2006.871582","article-title":"Compressed sensing","volume":"52","author":"Donoho","year":"2006","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Eldar, Y.C., and Kutyniok, G. (2012). Compressed Sensing: Theory and Applications, Cambridge University Press.","DOI":"10.1017\/CBO9780511794308"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"743","DOI":"10.3390\/a8030743","article-title":"A CS Recovery Algorithm for Model and Time Delay Identification of MISO-FIR Systems","volume":"8","author":"Liu","year":"2015","journal-title":"Algorithms"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1109\/83.913596","article-title":"Feature-enhanced synthetic aperture radar image formation based on nonquadratic regularization","volume":"10","author":"Karl","year":"2001","journal-title":"IEEE Trans. Image Proc."},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Baraniuk, R., and Steeghs, P. (2007, January 17\u201320). Compressive radar imaging. Proceedings of the 2007 IEEE Radar Conference, Chantilly, VA, USA.","DOI":"10.1109\/RADAR.2007.374203"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"2640","DOI":"10.1109\/TSP.2009.2016270","article-title":"A compressive sensing data acquisition and imaging method for stepped frequency GPRs","volume":"57","author":"Gurbuz","year":"2009","journal-title":"IEEE Trans. Signal Proc."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"1006","DOI":"10.1109\/JPROC.2009.2037526","article-title":"Sparsity and compressed sensing in radar imaging","volume":"98","author":"Potter","year":"2010","journal-title":"Proc. IEEE"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"3040","DOI":"10.1109\/TAES.2011.6034687","article-title":"Parameter selection in sparsity-driven SAR imaging","volume":"47","author":"Batu","year":"2011","journal-title":"IEEE Trans. Aerosp. Electron. Syst."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"352","DOI":"10.1109\/JSTARS.2013.2263309","article-title":"Fast compressed sensing SAR imaging based on approximated observation","volume":"7","author":"Fang","year":"2014","journal-title":"IEEE J. Sel. Top. Appl. Earth Obs. Remote Sens."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1109\/LGRS.2014.2349035","article-title":"Efficient compressed sensing method for moving-target imaging by exploiting the geometry information of the defocused results","volume":"12","author":"Zhang","year":"2015","journal-title":"IEEE Geosci. Remote Sens. Lett."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"784","DOI":"10.1049\/iet-rsn.2015.0385","article-title":"Object-level SAR imaging method with canonical scattering characterisation and inter-subdictionary interferences mitigation","volume":"10","author":"Cong","year":"2016","journal-title":"IET Radar Sonar Navig."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1016\/j.sigpro.2016.02.004","article-title":"Structured sparsity-driven autofocus algorithm for high-resolution radar imagery","volume":"125","author":"Zhao","year":"2016","journal-title":"Signal Proc."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/S0169-7439(97)00032-4","article-title":"PARAFAC. Tutorial and applications","volume":"38","author":"Bro","year":"1997","journal-title":"Chemom. Intell. Lab. Syst."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"2377","DOI":"10.1109\/78.852018","article-title":"Parallel factor analysis in sensor array processing","volume":"48","author":"Sidiropoulos","year":"2000","journal-title":"IEEE Trans. Signal Proc."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"736","DOI":"10.1016\/j.aeue.2015.01.001","article-title":"A two-dimensional arrival angles estimation for L-shaped array based on tensor decomposition","volume":"69","author":"Gao","year":"2015","journal-title":"AEU-Int. J. Electron. Commun."},{"key":"ref_20","unstructured":"Donoho, D.L. (2000, January 6\u201311). High-dimensional data analysis: The curses and blessings of dimensionality. Proceedings of the AMS American Math Society Challenges Lecture, Los Angeles, CA, USA."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"3744","DOI":"10.1137\/090748330","article-title":"Breaking the curse of dimensionality, or how to use SVD in many dimensions","volume":"31","author":"Oseledets","year":"2009","journal-title":"SIAM J. Sci. Comput."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1109\/MSP.2013.2297439","article-title":"Tensor decompositions for signal processing applications: From two-way to multiway component analysis","volume":"32","author":"Cichocki","year":"2015","journal-title":"IEEE Signal Proc. Mag."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/j.crme.2010.06.005","article-title":"Multiarray signal processing: Tensor decomposition meets compressed sensing","volume":"338","author":"Lim","year":"2010","journal-title":"Comptes Rendus Mec."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"4053","DOI":"10.1109\/TSP.2011.2161982","article-title":"Structured Compressed Sensing: From Theory to Applications","volume":"59","author":"Duarte","year":"2011","journal-title":"IEEE Trans. Signal Process."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"757","DOI":"10.1109\/LSP.2012.2210872","article-title":"Multi-way compressed sensing for sparse low-rank tensors","volume":"19","author":"Sidiropoulos","year":"2012","journal-title":"IEEE Signal Proce. Lett."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1162\/NECO_a_00385","article-title":"Computing sparse representations of multidimensional signals using kronecker bases","volume":"25","author":"Caiafa","year":"2013","journal-title":"Neural Comput."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1002\/widm.1108","article-title":"Multidimensional compressed sensing and their applications","volume":"3","author":"Caiafa","year":"2013","journal-title":"Wiley Interdiscip. Rev. Data Min. Knowl. Discov."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1109\/7.366309","article-title":"Nonlinear apodization for sidelobe control in SAR imagery","volume":"31","author":"Stankwitz","year":"1995","journal-title":"IEEE Trans. Aerosp. Electron. Syst."},{"key":"ref_29","unstructured":"Walter, G.C., Ron, S.G., and Ronald, M.M. (1995). Spotlight Synthetic Aperture Radar, Artech House Publishers."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"2231","DOI":"10.1109\/TIT.2004.834793","article-title":"Greed is good: Algorithmic results for sparse approximation","volume":"50","author":"Tropp","year":"2004","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/j.acha.2008.07.002","article-title":"CoSaMP: Iterative signal recovery from incomplete and inaccurate samples","volume":"26","author":"Needell","year":"2009","journal-title":"Appl. Comput. Harmon. Anal."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"948","DOI":"10.1109\/JPROC.2010.2044010","article-title":"Computational methods for sparse solution of linear inverse problems","volume":"98","author":"Tropp","year":"2010","journal-title":"Proc. IEEE"},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1137\/S003614450343200X","article-title":"Accelerating the Nonuniform Fast Fourier Transform","volume":"46","author":"Greengard","year":"2004","journal-title":"SIAM Rev."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"2437","DOI":"10.1016\/j.laa.2009.08.005","article-title":"Sparse solutions to underdetermined Kronecker product systems","volume":"431","author":"Jokar","year":"2009","journal-title":"Linear Algebra Appl."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"494","DOI":"10.1109\/TIP.2011.2165289","article-title":"Kronecker compressive sensing","volume":"21","author":"Duarte","year":"2012","journal-title":"IEEE Trans. Image Process."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"780","DOI":"10.1109\/TSP.2014.2385040","article-title":"Stable, robust, and super fast reconstruction of tensors using multi-way projections","volume":"63","author":"Caiafa","year":"2015","journal-title":"IEEE Trans. Signal Process."},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1137\/07070111X","article-title":"Tensor decompositions and applications","volume":"51","author":"Kolda","year":"2009","journal-title":"SIAM Rev."},{"key":"ref_38","doi-asserted-by":"crossref","unstructured":"Eldar, Y.C., and Mishali, M. (2009, January 5\u20137). Block sparsity and sampling over a union of subspaces. Proceedings of the 2009 16th International Conference on Digital Signal Processing, Santorini, Greece.","DOI":"10.1109\/ICDSP.2009.5201211"},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"3042","DOI":"10.1109\/TSP.2010.2044837","article-title":"Block-Sparse Signals: Uncertainty Relations and Efficient Recovery","volume":"58","author":"Eldar","year":"2010","journal-title":"IEEE Trans. Signal Process."},{"key":"ref_40","unstructured":"Rubinstein, R., Zibulevsky, M., and Elad, M. (2008). Efficient Implementation of the K-SVD Algorithm Using Batch Orthogonal Matching Pursuit, Computer Science Department, Technology\u2014Israel Institute of Technology. Technical Report 8."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/10\/1\/2\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T19:29:16Z","timestamp":1760210956000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/10\/1\/2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12,25]]},"references-count":40,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2017,3]]}},"alternative-id":["a10010002"],"URL":"https:\/\/doi.org\/10.3390\/a10010002","relation":{},"ISSN":["1999-4893"],"issn-type":[{"type":"electronic","value":"1999-4893"}],"subject":[],"published":{"date-parts":[[2016,12,25]]}}}