Two- and three-dimensional image rotation using the FFT

Practically Lossless Affine Image Transformation

In this contribution we introduce an almost lossless affine 2D image transformation method. To this end we extend the theory of the well-known Chirp-z transform to allow for fully affine transformation of general n-dimensional images. In addition we give a practical spatial and spectral zero-padding approach dramatically reducing losses of our transform, where usual transforms introduce blurring artifacts due to sub-optimal interpolation. The proposed method improves the mean squared error by approx. a factor of 1800 compared to the commonly used linear interpolation, and by a factor of 250 to the best competitor. We derive the transform from basic principles with special attention to implementation details and supplement this paper with python code for 2D images. In demonstration experiments we show the superior image quality compared to usual approaches, when using our method. However runtimes are considerably larger than when using toolbox algorithms.

Coherent field propagation between tilted planes

Propagating electromagnetic light fields between nonparallel planes is of special importance, e.g., within the design of novel computer-generated holograms or the simulation of optical systems. In contrast to the extensively discussed evaluation between parallel planes, the diffraction-based propagation of light onto a tilted plane is more burdensome, since discrete fast Fourier transforms cannot be applied directly. In this work, we propose a quasi-fast algorithm (O(N³ log N)) that deals with this problem. Based on a proper decomposition into three rotations, the vectorial field distribution is calculated on a tilted plane using the spectrum of plane waves. The algorithm works on equidistant grids, so neither nonuniform Fourier transforms nor an explicit complex interpolation is necessary. The proposed algorithm is discussed in detail and applied to several examples of practical interest.

Double Line Image Rotation

This paper proposes a fast algorithm for rotating images while preserving their quality. The new approach rotates images based on vertical or horizontal lines in the original image and their rotated equation in the target image. The proposed method is a one-pass method that determines a based-line equation in the target image and extracts all corresponding pixels on the base-line. Floating-point multiplications are performed to calculate the base-line in the target image, and other line coordinates are calculated using integer addition or subtraction and logical justifications from the base-line pixel coordinates in the target image. To avoid a heterogeneous distance between rotated pixels in the target image, each line rotates to two adjacent lines. The proposed method yields good performance in terms of speed and quality according to the results of an analysis of the computation speed and accuracy.

Adaptive imaging for lesion detection using a zoom-in PET system

Positron emission tomography (PET) has become a leading modality in molecular imaging. Demands for further improvements in spatial resolution and sensitivity remain high with growing number of applications. In this paper we present a novel PET system design that integrates a high-resolution depth-of-interaction (DOI) detector into an existing PET system to obtain higher-resolution and higher-sensitivity images in a target region around the face of the high-resolution detector. A unique feature of the proposed PET system is that the high-resolution detector can be adaptively positioned based on the detectability or quantitative accuracy of a feature of interest. This paper focuses on the signal-known-exactly, background-known-exactly (SKE-BKE) detection task. We perform theoretical analysis of lesion detectability using computer observers, and then develop methods that can efficiently calculate the optimal position of the high-resolution detector that maximizes the lesion detectability. We simulated incorporation of a high-resolution DOI detector into the microPET II scanner. Quantitative results verified that the new system has better performance than the microPET II scanner in terms of spatial resolution and lesion detectability, and that the optimal position for lesion detection can be reliably predicted by the proposed method.

Large-area and high-resolution distortion measurement based on Moiré fringe method for hot embossing process

A Moiré fringe approach is developed to identify simultaneously the global and local distortions in hot-embossed polymeric samples. A square grid pattern with a pitch of 63.5 microm is hot-embossed on the polymer substrate. When a reference grid, a polymeric film with the same pattern, is placed on top of the sample, a Moiré fringe pattern is observed and recorded by a document scanner. The deviation of the intersections of the fringes from their ideal positions presents the residual distortion in the sample. With different sample-reference rotation angles eight images are acquired for the same sample to achieve the optimal result by a data fitting technique. The validity of this method is proved by the self-consistency of the results from the eight images. To the best of our knowledge, this is the first time distortion quantification has been achieved both in a large area up to that of a scanner and with a high resolution at the level of 1 microm. Furthermore, we do not use any expensive instrument, nor need to measure the sample-reference rotation angle or position the sample precisely, and the process is run automatically by a computer instead of manual operation.

Accurate image rotation using hermite expansions

In this paper, we propose an approach for the accurate rotation of a digital image using Hermite expansions. This exploits the fact that if a 2-D continuous bandlimited Hermite expansion is rotated, the resulting function can be expressed as a Hermite expansion with the same bandlimit. Furthermore, the Hermite coefficients of the initial 2-D expansion and the rotated expansion are mapped through an invertible linear relationship. Two efficient methods to compute the mapping between Hermite coefficients during rotation are proposed. We also propose a method for connecting the Hermite expansion and a discrete image. Using this method, we can obtain the Hermite expansion from a discrete image and vice versa. Combining these techniques, we propose new methods for the rotation of discrete images. We assess the accuracy of our methods and compare them with an existing FFT-based method implementing three shears. We find that the method proposed here consistently has better accuracy than the FFT-based method.

Reversible, fast, and high-quality grid conversions

A new grid conversion method is proposed to resample between two 2-D periodic lattices with the same sampling density. The main feature of our approach is the symmetric reversibility, which means that when using the same algorithm for the converse operation, then the initial data is recovered exactly. To that purpose, we decompose the lattice conversion process into (at most) three successive shear operations. The translations along the shear directions are implemented by 1-D fractional delay operators, which revert to simple 1-D convolutions, with appropriate filters that yield the property of symmetric reversibility. We show that the method is fast and provides high-quality resampled images. Applications of our approach can be found in various settings, such as grid conversion between the hexagonal and the Cartesian lattice, or fast implementation of affine transformations such as rotations.

An evaluation of prefiltered reconstruction schemes for volume rendering

In this paper prefiltered reconstruction techniques are evaluated for volume-rendering applications. All the analyzed methods perform a discrete prefiltering as a preprocessing of the input samples in order to improve the quality of the continuous reconstruction afterwards. Various prefiltering schemes have been proposed to fulfill either spatial-domain or frequency domain criteria. According to our best knowledge, however, their thorough comparative study has not been published yet. Therefore we derive the frequency responses of the different prefilteredreconstruction techniques to analyze their global behavior such as aliasing or smoothing. Furthermore, we introduce a novel mathematical basis to compare also their spatial-domain behavior in terms of the asymptotic local error effect. For the sake of fair comparison, we use the same linear and cubic B-splines as basis functions but combined with different discrete prefilters. Our goal with this analysis is to help the potential users to select the optimal prefiltering scheme for their specific applications.

Fast image transforms using diophantine methods

Many image transformations in computer vision and graphics involve a pipeline when an initial integer image is processed with floating point computations for purposes of symbolic information. Traditionally, in the interests of time, the floating point computation is approximated by integer computations where the integerization process requires a guess of an integer. Examples of this phenomenon include the discretization interval of rho and theta in the accumulator array in classical Hough transform, and in geometric manipulation of images (e.g., rotation, where a new grid is overlaid on the image). The result of incorrect discretization is a poor quality visual image, or worse, hampers measurements of critical parameters such as density or length in high fidelity machine vision. Correction techniques include, at best, anti-aliasing methods, or more commonly, a "kludge" to cleanup. In this paper, we present a method that uses the theory of basis reduction in Diophantine approximations; the method outperforms prior integer based computation without sacrificing accuracy (subject to machine epsilon).