{"title":"Space-variant deconvolution for synthetic aperture imaging using simulated annealing","authors":"M. Robini, T. Rastello, D. Vray, I. Magnin","doi":"10.1109/ICIP.1997.647799","DOIUrl":null,"url":null,"abstract":"The synthetic aperture image formation process can be formulated as a space-variant 2D convolution. The recovery of the original reflection density is an ill-posed inverse problem which is both underdetermined and ill-conditioned. Its stabilization is achieved via concave stabilizers that are well adapted to the preservation of discontinuities. This leads to the minimization of a non-convex functional, a task which is successfully carried out using a Metropolis-type annealing algorithm. For improved performance, we investigate some inexpensive acceleration techniques which do not alter the theoretical convergence results; their efficiency is demonstrated through restorations from simulated data.","PeriodicalId":92344,"journal":{"name":"Computer analysis of images and patterns : proceedings of the ... International Conference on Automatic Image Processing. International Conference on Automatic Image Processing","volume":"1 1","pages":"432-435 vol.1"},"PeriodicalIF":0.0000,"publicationDate":"1997-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer analysis of images and patterns : proceedings of the ... International Conference on Automatic Image Processing. International Conference on Automatic Image Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIP.1997.647799","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4
Abstract
The synthetic aperture image formation process can be formulated as a space-variant 2D convolution. The recovery of the original reflection density is an ill-posed inverse problem which is both underdetermined and ill-conditioned. Its stabilization is achieved via concave stabilizers that are well adapted to the preservation of discontinuities. This leads to the minimization of a non-convex functional, a task which is successfully carried out using a Metropolis-type annealing algorithm. For improved performance, we investigate some inexpensive acceleration techniques which do not alter the theoretical convergence results; their efficiency is demonstrated through restorations from simulated data.