SIAM J. Imaging Sci.最新文献_第8页

A Novel Mesh Denoising Method Based on Relaxed Second-Order Total Generalized Variation 一种基于松弛二阶总广义变分的网格去噪方法

SIAM J. Imaging Sci. Pub Date : 2022-01-01 DOI: 10.1137/21m1397945

Huayan Zhang, Zhishuai He, Xiaochao Wang

引用次数: 0

The Whole and the Parts: The Minimum Description Length Principle and the A-Contrario Framework 整体与局部:最小描述长度原则与a -对立框架

SIAM J. Imaging Sci. Pub Date : 2022-01-01 DOI: 10.1137/21m145745x

R. G. V. Gioi, Ignacio Ramírez Paulino, G. Randall

引用次数: 0

Hyperspectral Super-resolution Accounting for Spectral Variability: Coupled Tensor LL1-Based Recovery and Blind Unmixing of the Unknown Super-resolution Image 光谱变异性的高光谱超分辨率计算:基于耦合张量ll1的未知超分辨率图像恢复和盲解

SIAM J. Imaging Sci. Pub Date : 2022-01-01 DOI: 10.1137/21m1409354

C. Prévost, R. Borsoi, K. Usevich, D. Brie, J. Bermudez, C. Richard

引用次数: 12

Learnable Empirical Mode Decomposition based on Mathematical Morphology 基于数学形态学的可学习经验模态分解

SIAM J. Imaging Sci. Pub Date : 2022-01-01 DOI: 10.1137/21m1417867

S. Velasco-Forero, R. Pagés, J. Angulo

引用次数: 3

Single Pixel X-ray Transform and Related Inverse Problems 单像素x射线变换及相关反问题

SIAM J. Imaging Sci. Pub Date : 2021-12-28 DOI: 10.1137/21m1468103

Ru-Yu Lai, G. Uhlmann, J. Zhai, Hanming Zhou

引用次数: 0

High-resolution, quantitative signal subspace imaging for synthetic aperture radar 合成孔径雷达的高分辨率、定量信号子空间成像

SIAM J. Imaging Sci. Pub Date : 2021-12-22 DOI: 10.1137/21m1467109

A. Kim, C. Tsogka

引用次数: 3

Bilevel training schemes in imaging for total-variation-type functionals with convex integrands 凸被积全变分泛函成像中的双层训练方案

SIAM J. Imaging Sci. Pub Date : 2021-12-20 DOI: 10.1137/21m1467328

V. Pagliari, Kostas Papafitsoros, Bogdan Raiță, Andreas Vikelis

{"title":"Bilevel training schemes in imaging for total-variation-type functionals with convex integrands","authors":"V. Pagliari, Kostas Papafitsoros, Bogdan Raiță, Andreas Vikelis","doi":"10.1137/21m1467328","DOIUrl":"https://doi.org/10.1137/21m1467328","url":null,"abstract":". In the context of image processing, given a k -th order, homogeneous and linear diﬀerential operator with constant coeﬃcients, we study a class of variational problems whose regularizing terms depend on the operator. Precisely, the regularizers are integrals of spatially inhomogeneous integrands with convex dependence on the diﬀerential operator applied to the image function. The setting is made rigorous by means of the theory of Radon measures and of suitable function spaces modeled on BV . We prove the lower semicontinuity of the functionals at stake and existence of minimizers for the corresponding variational problems. Then, we embed the latter into a bilevel scheme in order to automatically compute the space-dependent regularization parameters, thus allowing for good ﬂexibility and preservation of details in the reconstructed image. We establish existence of optima for the scheme and we ﬁnally substantiate its feasibility by numerical examples in image denoising. The cases that we treat are Huber versions of the ﬁrst and second order total variation with both the Huber and the regularization parameter being spatially dependent. Notably the spatially dependent version of second order total variation produces high quality reconstructions when compared to regularizations of similar type, and the introduction of the spatially dependent Huber parameter leads to a further enhancement of the image details.","PeriodicalId":185319,"journal":{"name":"SIAM J. Imaging Sci.","volume":"161 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133108377","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}

引用次数: 6

Inversion of band-limited discrete Fourier transforms of binary images: Uniqueness and algorithms 二值图像带限离散傅里叶变换的反演:唯一性和算法

SIAM J. Imaging Sci. Pub Date : 2021-12-10 DOI: 10.1137/22M1540442

Howard W. Levinson, Vadim A. Markel

{"title":"Inversion of band-limited discrete Fourier transforms of binary images: Uniqueness and algorithms","authors":"Howard W. Levinson, Vadim A. Markel","doi":"10.1137/22M1540442","DOIUrl":"https://doi.org/10.1137/22M1540442","url":null,"abstract":"Conventional inversion of the discrete Fourier transform (DFT) requires all DFT coefficients to be known. When the DFT coefficients of a rasterized image (represented as a matrix) are known only within a pass band, the original matrix cannot be uniquely recovered. In many cases of practical importance, the matrix is binary and its elements can be reduced to either 0 or 1. This is the case, for example, for the commonly used QR codes. The {it a priori} information that the matrix is binary can compensate for the missing high-frequency DFT coefficients and restore uniqueness of image recovery. This paper addresses, both theoretically and numerically, the problem of recovery of blurred images without any known structure whose high-frequency DFT coefficients have been irreversibly lost by utilizing the binarity constraint. We investigate theoretically the smallest band limit for which unique recovery of a generic binary matrix is still possible. Uniqueness results are proved for images of sizes $N_1 times N_2$, $N_1 times N_1$, and $N_1^alphatimes N_1^alpha$, where $N_1 neq N_2$ are prime numbers and $alpha>1$ an integer. Inversion algorithms are proposed for recovering the matrix from its band-limited (blurred) version. The algorithms combine integer linear programming methods with lattice basis reduction techniques and significantly outperform naive implementations. The algorithm efficiently and reliably reconstructs severely blurred $29 times 29$ binary matrices with only $11times 11 = 121$ DFT coefficients.","PeriodicalId":185319,"journal":{"name":"SIAM J. Imaging Sci.","volume":"334 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121600317","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}

引用次数: 1

Parallelizable global quasi-conformal parameterization of multiply-connected surfaces via partial welding 局部焊接多连接曲面的可并行化全局拟保形参数化

SIAM J. Imaging Sci. Pub Date : 2021-12-08 DOI: 10.1137/21m1466323

Zhipeng Zhu, G. Choi, L. Lui

{"title":"Parallelizable global quasi-conformal parameterization of multiply-connected surfaces via partial welding","authors":"Zhipeng Zhu, G. Choi, L. Lui","doi":"10.1137/21m1466323","DOIUrl":"https://doi.org/10.1137/21m1466323","url":null,"abstract":"Conformal and quasi-conformal mappings have widespread applications in imaging science, computer vision and computer graphics, such as surface registration, segmentation, remeshing, and texture map compression. While various conformal and quasi-conformal parameterization methods for simply-connected surfaces have been proposed, efficient parameterization methods for multiply-connected surfaces are less explored. In this paper, we propose a novel parallelizable algorithm for computing the global conformal and quasi-conformal parameterization of multiply-connected surfaces onto a 2D circular domain using variants of the partial welding algorithm and the Koebe's iteration. The main idea is to partition a multiply-connected surface into several subdomains and compute the free-boundary conformal or quasi-conformal parameterizations of them respectively, and then apply a variant of the partial welding algorithm to reconstruct the global mapping. We apply the Koebe's iteration together with the geodesic algorithm to the boundary points and welding paths before and after the global welding to transform all the boundaries to circles conformally. After getting all the updated boundary conditions, we obtain the global parameterization of the multiply-connected surface by solving the Laplace equation for each subdomain. Using this divide-and-conquer approach, the parameterization of surfaces with very high resolution can be efficiently computed. Experimental results are presented to demonstrate the effectiveness of our proposed algorithms.","PeriodicalId":185319,"journal":{"name":"SIAM J. Imaging Sci.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123415867","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}

引用次数: 2

A Generalized Primal-Dual Algorithm with Improved Convergence Condition for Saddle Point Problems 鞍点问题的一种改进收敛条件的广义原对偶算法

SIAM J. Imaging Sci. Pub Date : 2021-12-01 DOI: 10.1137/21m1453463

B. He, Fengming Ma, Sheng Xu, Xiaoming Yuan

引用次数: 9