{"title":"A Fast Averaged Kaczmarz Iteration with Convex Penalty for Inverse Problems in Hilbert Spaces","authors":"Yuxin Xia, Wei Wang, Bo Han","doi":"10.1137/21m1445181","DOIUrl":"https://doi.org/10.1137/21m1445181","url":null,"abstract":"","PeriodicalId":185319,"journal":{"name":"SIAM J. Imaging Sci.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115376642","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Bar Code Decoding in a Camera-Based Scanner: Analysis and Algorithm","authors":"F. Santosa, M. Goh","doi":"10.1137/21m1449658","DOIUrl":"https://doi.org/10.1137/21m1449658","url":null,"abstract":"","PeriodicalId":185319,"journal":{"name":"SIAM J. Imaging Sci.","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123478444","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Image warp preserving content intensity","authors":"E. Segre","doi":"10.1137/21M1452688","DOIUrl":"https://doi.org/10.1137/21M1452688","url":null,"abstract":". An accurate method for warping images is presented. Differently from most commonly used techniques, this method guarantees the conservation of the intensity of the transformed image, evaluated as the sum of its pixel values over the whole image or over corresponding transformed subregions of it. Such property is mandatory for quantitative analysis, as, for instance, when deformed images are used to assess radiances, to measure optical fluxes from light sources, or to characterize material optical densities. The proposed method enforces area resampling by decomposing each rectangular pixel in two triangles, and projecting the pixel intensity onto half pixels of the transformed image, with weights proportional to the area of overlap of the triangular half-pixels. The result is quanti-tatively exact, as long as the original pixel value is assumed to represent a constant image density within the pixel area, and as long as the coordinate transformation is diffeomorphic. Implementation details and possible variations of the method are discussed.","PeriodicalId":185319,"journal":{"name":"SIAM J. Imaging Sci.","volume":"175 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123948302","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Lucas de Lara, Alberto Gonz'alez-Sanz, Jean-Michel Loubes
{"title":"Diffeomorphic Registration Using Sinkhorn Divergences","authors":"Lucas de Lara, Alberto Gonz'alez-Sanz, Jean-Michel Loubes","doi":"10.1137/22m1493562","DOIUrl":"https://doi.org/10.1137/22m1493562","url":null,"abstract":"The diffeomorphic registration framework enables to define an optimal matching function between two probability measures with respect to a data-fidelity loss function. The non convexity of the optimization problem renders the choice of this loss function crucial to avoid poor local minima. Recent work showed experimentally the efficiency of entropy-regularized optimal transportation costs, as they are computationally fast and differentiable while having few minima. Following this approach, we provide in this paper a new framework based on Sinkhorn divergences, unbiased entropic optimal transportation costs, and prove the statistical consistency with rate of the empirical optimal deformations.","PeriodicalId":185319,"journal":{"name":"SIAM J. Imaging Sci.","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130955630","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Lukas Baumgartner, Ronny Bergmann, R. Herzog, S. Schmidt, Jos'e Vidal-N'unez
{"title":"Total Generalized Variation for Piecewise Constant Functions on Triangular Meshes with Applications in Imaging","authors":"Lukas Baumgartner, Ronny Bergmann, R. Herzog, S. Schmidt, Jos'e Vidal-N'unez","doi":"10.1137/22m1505281","DOIUrl":"https://doi.org/10.1137/22m1505281","url":null,"abstract":"We propose a novel discrete concept for the total generalized variation (TGV), which has originally been derived to reduce the staircasing effect in classical total variation (TV) regularization, in image denoising problems. We describe discrete, second-order TGV for piecewise constant functions on triangular meshes, thus allowing the TGV functional to be applied to more general data structures than pixel images, and in particular in the context of finite element discretizations. Particular attention is given to the description of the kernel of the TGV functional, which, in the continuous setting, consists of linear polynomials. We discuss how to take advantage of this kernel structure using piecewise constant functions on triangular meshes. Numerical experiments include denoising and inpainting problems for images defined on non-standard grids, including data from a 3D scanner.","PeriodicalId":185319,"journal":{"name":"SIAM J. Imaging Sci.","volume":"172 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125790057","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Bioinspired random projections for robust, sparse classification","authors":"B. Davies, Nina Dekoninck Bruhin","doi":"10.48550/arXiv.2206.09222","DOIUrl":"https://doi.org/10.48550/arXiv.2206.09222","url":null,"abstract":"Inspired by the use of random projections in biological sensing systems, we present a new algorithm for processing data in classification problems. This is based on observations of the human brain and the fruit fly's olfactory system and involves randomly projecting data into a space of greatly increased dimension before applying a cap operation to truncate the smaller entries. This leads to a simple algorithm that is very computationally efficient and can be used to either give a sparse representation with minimal loss in classification accuracy or give improved robustness, in the sense that classification accuracy is improved when noise is added to the data. This is demonstrated with numerical experiments, which supplement theoretical results demonstrating that the resulting signal transform is continuous and invertible, in an appropriate sense.","PeriodicalId":185319,"journal":{"name":"SIAM J. Imaging Sci.","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128926465","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Doosung Choi, J. Helsing, Sangwoo Kang, Mikyoung Lim
{"title":"Inverse Problem for a Planar Conductivity Inclusion","authors":"Doosung Choi, J. Helsing, Sangwoo Kang, Mikyoung Lim","doi":"10.1137/22m1522395","DOIUrl":"https://doi.org/10.1137/22m1522395","url":null,"abstract":"This paper concerns the inverse problem of determining a planar conductivity inclusion. Our aim is to analytically recover from the generalized polarization tensors (GPTs), which can be obtained from exterior measurements, a homogeneous inclusion with arbitrary constant conductivity. The primary outcome of recovering a homogeneous inclusion is an inversion formula in terms of the GPTs for conformal mapping coefficients associated with the inclusion. To prove the formula, we establish matrix factorizations for the GPTs.","PeriodicalId":185319,"journal":{"name":"SIAM J. Imaging Sci.","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122563625","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Savvas Melidonis, P. Dobson, Y. Altmann, M. Pereyra, K. Zygalakis
{"title":"Efficient Bayesian Computation for Low-Photon Imaging Problems","authors":"Savvas Melidonis, P. Dobson, Y. Altmann, M. Pereyra, K. Zygalakis","doi":"10.1137/22m1502240","DOIUrl":"https://doi.org/10.1137/22m1502240","url":null,"abstract":"This paper studies a new and highly efficient Markov chain Monte Carlo (MCMC) methodology to perform Bayesian inference in low-photon imaging problems, with particular attention to situations involving observation noise processes that deviate significantly from Gaussian noise, such as binomial, geometric and low-intensity Poisson noise. These problems are challenging for many reasons. From an inferential viewpoint, low-photon numbers lead to severe identifiability issues, poor stability and high uncertainty about the solution. Moreover, low-photon models often exhibit poor regularity properties that make efficient Bayesian computation difficult; e.g., hard non-negativity constraints, non-smooth priors, and log-likelihood terms with exploding gradients. More precisely, the lack of suitable regularity properties hinders the use of state-of-the-art Monte Carlo methods based on numerical approximations of the Langevin stochastic differential equation (SDE), as both the SDE and its numerical approximations behave poorly. We address this difficulty by proposing an MCMC methodology based on a reflected and regularised Langevin SDE, which is shown to be well-posed and exponentially ergodic under mild and easily verifiable conditions. This then allows us to derive four reflected proximal Langevin MCMC algorithms to perform Bayesian computation in low-photon imaging problems. The proposed approach is demonstrated with a range of experiments related to image deblurring, denoising, and inpainting under binomial, geometric and Poisson noise.","PeriodicalId":185319,"journal":{"name":"SIAM J. Imaging Sci.","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123145997","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Fabian Hinterer, Simon Hubmer, P. Jethwa, Kirk M. Soodhalter, G. Ven, R. Ramlau
{"title":"A projected Nesterov-Kaczmarz approach to stellar population-kinematic distribution reconstruction in Extragalactic Archaeology","authors":"Fabian Hinterer, Simon Hubmer, P. Jethwa, Kirk M. Soodhalter, G. Ven, R. Ramlau","doi":"10.48550/arXiv.2206.03925","DOIUrl":"https://doi.org/10.48550/arXiv.2206.03925","url":null,"abstract":"In this paper, we consider the problem of reconstructing a galaxy's stellar population-kinematic distribution function from optical integral field unit measurements. These quantities are connected via a high-dimensional integral equation. To solve this problem, we propose a projected Nesterov-Kaczmarz reconstruction (PNKR) method, which efficiently leverages the problem structure and incorporates physical prior information such as smoothness and non-negativity constraints. To test the performance of our reconstruction approach, we apply it to a dataset simulated from a known ground truth density, and validate it by comparing our recoveries to those obtained by the widely used pPXF software.","PeriodicalId":185319,"journal":{"name":"SIAM J. Imaging Sci.","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131402632","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}