Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1709.01984

Coded Aperture Ptychography: Uniqueness and Reconstruction

Pengwen Chen·Albert Fannjiang
View original source ↗Read source document ↗Export metadata ↓

Abstract

Uniqueness of solution is proved for any ptychographic scheme with a random masks under a minimum overlap condition and local geometric convergence analysis is given for the alternating projection (AP) and Douglas-Rachford (DR) algorithms. DR is shown to possess a unique fixed point in the object domain and for AP a simple criterion for distinguishing the true solution among possibly many fixed points is given. A minimalist scheme is proposed where the adjacent masks overlap 50\% of area and each pixel of the object is illuminated by exactly four times during the whole measurement process. Such a scheme is conveniently parametrized by the number $q$ of shifted masks in each direction. The lower bound $1-C/q^2$ is proved for the geometric convergence rate of the minimalist scheme, predicting a poor performance with large $q$ which is confirmed by numerical experiments. Extensive numerical experiments are performed to explore what the general features of a well-performing mask are like, what the best-performing values of $q$ for a given mask are, how robust the minimalist scheme is with respect to measurement noise and what the significant factors affecting the noise stability are.

Explore related subjects

math.NAcs.NAphysics.data-an

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Pengwen Chen, Albert Fannjiang. 2017-09-06. Coded Aperture Ptychography: Uniqueness and Reconstruction. https://doi.org/10.1088/1361-6420%2Faa9ef4

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Fully spectral scheme for the linear BGK equation on the whole space

In this article, we design a fully spectral method in both space and velocity for a linear inhomogeneous kinetic equation with mass, momentum and energy conservation. We focus on the linear BGK equation with a confinement potential $Φ$, even if the method could be applied to different collision operators. It is based upon the projection on Hermite polynomials in velocity and orthonormal polynomials with respect to the weight $e^{-$Φ$}$ in space. The potential $Φ$ is assumed to be a polynomial. It is, to the author's knowledge, the first scheme which preserves hypocoercive behavior in addition to the conservation laws. These different properties are illustrated numerically on both quadratic and double well potential.

math.NA↗
arXiv2026

Inverse inequalities for kernel-based approximation on bounded domains and Riemannian manifolds

This paper establishes inverse inequalities for kernel-based approximation spaces defined on bounded Lipschitz domains in $\mathbb{R}^d$ and compact Riemannian manifolds. While inverse inequalities are well-studied for polynomial spaces, their extension to kernel-based trial spaces poses significant challenges. For bounded Lipschitz domains, we extend prior Bernstein inequalities, which only apply to a limited range of Sobolev orders, to the full range of lower and upper orders, and derive Nikolskii inequalities that bound $L_\infty$ norms by $L_2$ norms. For compact Riemannian manifolds, we focus on restricted kernels, which are defined as the restriction of positive definite kernels from the ambient Euclidean space to the manifold, and prove their counterparts.

math.NA↗
arXiv2026

Error Estimates for Hyperbolic Scaling Limits of Linear Kinetic Models on Networks

This paper studies linear discrete kinetic models on networks and their asymptotic behavior in the small Knudsen number limit. For coupling conditions at an n-edge junction under a symmetric formulation, we introduce a change of variables that reformulates the system into n independent initial-boundary value problems. The asymptotic expansions are then constructed and rigorously justified by deriving an error estimate based on the energy method.

math.NA↗