Related papers: A projection algorithm on measures sets
A typical computational geometry problem begins: Consider a set P of n points in R^d. However, many applications today work with input that is not precisely known, for example when the data is sensed and has some known error model. What if…
When solving ill-posed inverse problems, a good choice of the prior is critical for the computation of a reasonable solution. A common approach is to include a Gaussian prior, which is defined by a mean vector and a symmetric and positive…
A sequence $x_1,\dots,x_n,\dots$ of discrete-valued observations is generated according to some unknown probabilistic law (measure) $\mu$. After observing each outcome, one is required to give conditional probabilities of the next…
In complex-valued coherent inverse problems such as synthetic aperture radar (SAR), one may often have prior information only on the magnitude image which shows the features of interest such as strength of reflectivity. In contrast, there…
In this paper we broadly consider techniques which utilize projections on rays for data collection, with particular emphasis on optical techniques. We formulate a variety of imaging techniques as either special cases or extensions of…
In this paper, we construct a class of random measures $\mu^{\mathbf{n}}$ by infinite convolutions. Given infinitely many admissible pairs $\{(N_{k}, B_{k})\}_{k=1}^{\infty}$ and a positive integral sequence…
Consider the projections of a finite set $A\subset R^n$ onto the coordinate hyperplanes. How small can the sum of the sizes of these projections be, given the size of $A$? In a different form, this problem has been studied earlier in the…
Given $N\ge2$ closed subspaces $M_1,\dotsc, M_N$ of a Hilbert space $X$, let $P_k$ denote the orthogonal projection onto $M_k$, $1\le k\le N$. It is known that the sequence $(x_n)$, defined recursively by $x_0=x$ and $x_{n+1}=P_N\cdots…
Different notions on regularity of sets and of collection of sets play an important role in the analysis of the convergence of projection algorithms in nonconvex scenarios. While some projection algorithms can be applied to feasibility…
In this article we consider the graph alignment problem from the perspective of high-dimensional statistics: we aim to estimate an unknown permutation $\pi^*$ from the observation of two correlated random adjacency matrices $A_1$, $A_2$. We…
Direct reconstruction through filtered back projection engenders metal artifacts in polychromatic computed tomography images, attributed to highly attenuating implants, which further poses great challenges for subsequent image analysis.…
Set projection algorithms are a class of algorithms used in ptychography to help improve the quality of the reconstructed images. The set projection step is important because it helps to ensure that the reconstructed image satisfies the…
The unitary group U(N) acts by conjugations on the space H(N) of NxN Hermitian matrices, and every orbit of this action carries a unique invariant probability measure called an orbital measure. Consider the projection of the space H(N) onto…
We present a new numerical technique to solve large-scale eigenvalue problems. It is based on the projection technique, used in strongly correlated quantum many-body systems, where first an effective approximate model of smaller complexity…
The projection filter is a technique for approximating the solutions of optimal filtering problems. In projection filters, the Kushner--Stratonovich stochastic partial differential equation that governs the propagation of the optimal…
We prove that the packing dimension of any mean porous Radon measure on $\mathbb R^d$ may be estimated from above by a function which depends on mean porosity. The upper bound tends to $d-1$ as mean porosity tends to its maximum value. This…
This paper considers a conceptual version of a convex optimization algorithm whic is based on replacing a convex optimization problem with the root-finding problem for the approximate sub-differential mapping which is solved by repeated…
We apply MUltiple SIgnal Classification (MUSIC) algorithm for the location reconstruction of a set of {two-dimensional circle-like} small inhomogeneities in the limited-aperture inverse scattering problem. Compared with the full- or…
In the following paper, one studies, given a bounded, connected open set $\Omega$ $\subseteq$ R n , $\kappa$ > 0, a positive Radon measure $\mu$ 0 in $\Omega$ and a (signed) Radon measure $\mu$ on $\Omega$ satisfying $\mu$($\Omega$) = 0 and…
Measurement in quantum mechanics is generally described as an irreversible process that perturbs the wavefunction describing a quantum system. In this work we establish a formal connection between the measurement description within the…