21,149 research outputs found
Projection-based image registration in the presence of fixed-pattern noise
A computationally efficient method for image registration is investigated that can achieve an improved performance over the traditional two-dimensional (2-D) cross-correlation-based techniques in the presence of both fixed-pattern and temporal noise. The method relies on transforming each image in the sequence of frames into two vector projections formed by accumulating pixel values along the rows and columns of the image. The vector projections corresponding to successive frames are in turn used to estimate the individual horizontal and vertical components of the shift by means of a one-dimensional (1-D) cross-correlation-based estimator. While gradient-based shift estimation techniques are computationally efficient, they often exhibit degraded performance under noisy conditions in comparison to cross-correlators due to the fact that the gradient operation amplifies noise. The projection-based estimator, on the other hand, significantly reduces the computational complexity associated with the 2-D operations involved in traditional correlation-based shift estimators while improving the performance in the presence of temporal and spatial noise. To show the noise rejection capability of the projection-based shift estimator relative to the 2-D cross correlator, a figure-of-merit is developed and computed reflecting the signal-to-noise ratio (SNR) associated with each estimator. The two methods are also compared by means of computer simulation and tests using real image sequences
Subspace procrustes analysis
Postprint (author's final draft
Sliced Wasserstein Generative Models
In generative modeling, the Wasserstein distance (WD) has emerged as a useful
metric to measure the discrepancy between generated and real data
distributions. Unfortunately, it is challenging to approximate the WD of
high-dimensional distributions. In contrast, the sliced Wasserstein distance
(SWD) factorizes high-dimensional distributions into their multiple
one-dimensional marginal distributions and is thus easier to approximate. In
this paper, we introduce novel approximations of the primal and dual SWD.
Instead of using a large number of random projections, as it is done by
conventional SWD approximation methods, we propose to approximate SWDs with a
small number of parameterized orthogonal projections in an end-to-end deep
learning fashion. As concrete applications of our SWD approximations, we design
two types of differentiable SWD blocks to equip modern generative
frameworks---Auto-Encoders (AE) and Generative Adversarial Networks (GAN). In
the experiments, we not only show the superiority of the proposed generative
models on standard image synthesis benchmarks, but also demonstrate the
state-of-the-art performance on challenging high resolution image and video
generation in an unsupervised manner.Comment: This paper is accepted by CVPR 2019, accidentally uploaded as a new
submission (arXiv:1904.05408, which has been withdrawn). The code is
available at this https URL https:// github.com/musikisomorphie/swd.gi
Automatic alignment for three-dimensional tomographic reconstruction
In tomographic reconstruction, the goal is to reconstruct an unknown object
from a collection of line integrals. Given a complete sampling of such line
integrals for various angles and directions, explicit inverse formulas exist to
reconstruct the object. Given noisy and incomplete measurements, the inverse
problem is typically solved through a regularized least-squares approach. A
challenge for both approaches is that in practice the exact directions and
offsets of the x-rays are only known approximately due to, e.g. calibration
errors. Such errors lead to artifacts in the reconstructed image. In the case
of sufficient sampling and geometrically simple misalignment, the measurements
can be corrected by exploiting so-called consistency conditions. In other
cases, such conditions may not apply and we have to solve an additional inverse
problem to retrieve the angles and shifts. In this paper we propose a general
algorithmic framework for retrieving these parameters in conjunction with an
algebraic reconstruction technique. The proposed approach is illustrated by
numerical examples for both simulated data and an electron tomography dataset
- …