Affine Invariants of Vector Fields.

Vector fields are a special kind of multidimensional data, which are in a certain sense similar to digital color images, but are distinct from them in several aspects. In each pixel, the field is assigned to a vector that shows the direction and the magnitude of the quantity, which has been measured. To detect the patterns of interest in the field, special matching methods must be developed. In this paper, we propose a method for the description and matching of vector field patterns under an unknown affine transformation of the field. Unlike digital images, transformations of vector fields act not only on the spatial coordinates but also on the field values, which makes the detection different from the image case. To measure the similarity between the template and the field patch, we propose original invariants with respect to total affine transformation. They are designed from the vector field moments. It is demonstrated by experiments on real data from fluid mechanics that they perform significantly better than potential competitors.

Blur-Invariant Similarity Measurement of Images.

This article is a comment on the recent TPAMI paper (Gopalan et al., 2012) that introduced a blur-invariant distance measure between two images. We point out two mistakes of the theory presented in (Gopalan et al., 2012) and propose a correction. We also compare the original and corrected methods experimentally.

Automatic blood detection in capsule endoscopy video.

We propose two automatic methods for detecting bleeding in wireless capsule endoscopy videos of the small intestine. The first one uses solely the color information, whereas the second one incorporates the assumptions about the blood spot shape and size. The original idea is namely the definition of a new color space that provides good separability of blood pixels and intestinal wall. Both methods can be applied either individually or their results can be fused together for the final decision. We evaluate their individual performance and various fusion rules on real data, manually annotated by an endoscopist.

PIZZARO: Forensic analysis and restoration of image and video data.

This paper introduces a set of methods for image and video forensic analysis. They were designed to help to assess image and video credibility and origin and to restore and increase image quality by diminishing unwanted blur, noise, and other possible artifacts. The motivation came from the best practices used in the criminal investigation utilizing images and/or videos. The determination of the image source, the verification of the image content, and image restoration were identified as the most important issues of which automation can facilitate criminalists work. Novel theoretical results complemented with existing approaches (LCD re-capture detection and denoising) were implemented in the PIZZARO software tool, which consists of the image processing functionality as well as of reporting and archiving functions to ensure the repeatability of image analysis procedures and thus fulfills formal aspects of the image/video analysis work. Comparison of new proposed methods with the state of the art approaches is shown. Real use cases are presented, which illustrate the functionality of the developed methods and demonstrate their applicability in different situations. The use cases as well as the method design were solved in tight cooperation of scientists from the Institute of Criminalistics, National Drug Headquarters of the Criminal Police and Investigation Service of the Police of the Czech Republic, and image processing experts from the Czech Academy of Sciences.

Recognition of Images Degraded by Gaussian Blur.

In this paper, we propose a new theory of invariants to Gaussian blur. We introduce a notion of a primordial image as a canonical form of all Gaussian blur-equivalent images. The primordial image is defined in spectral domain by means of projection operators. We prove that the moments of the primordial image are invariant to Gaussian blur and we derive recursive formulas for their direct computation without actually constructing the primordial image itself. We show how to extend their invariance also to image rotation. The application of these invariants is in blur-invariant image comparison and recognition. In the experimental part, we perform an exhaustive comparison with two main competitors: 1) the Zhang distance and 2) the local phase quantization.

Projection Operators and Moment Invariants to Image Blurring.

In this paper we introduce a new theory of blur invariants. Blur invariants are image features which preserve their values if the image is convolved by a point-spread function (PSF) of a certain class. We present the invariants to convolution with an arbitrary N-fold symmetric PSF, both in Fourier and image domain. We introduce a notion of a primordial image as a canonical form of all blur-equivalent images. It is defined in spectral domain by means of projection operators. We prove that the moments of the primordial image are invariant to blur and we derive recursive formulae for their direct computation without actually constructing the primordial image. We further prove they form a complete set of invariants and show how to extent their invariance also to translation, rotation and scaling. We illustrate by simulated and real-data experiments their invariance and recognition power. Potential applications of this method are wherever one wants to recognize objects on blurred images.

Registration of images with N -fold dihedral blur.

In this paper, we extend our recent registration method designed specifically for registering blurred images. The original method works for unknown blurs, assuming the blurring point-spread function (PSF) exhibits an N -fold rotational symmetry. Here, we also generalize the theory to the case of dihedrally symmetric blurs, which are produced by the PSFs having both rotational and axial symmetries. Such kind of blurs are often found in unfocused images acquired by digital cameras, as in out-of-focus shots the PSF typically mimics the shape of the shutter aperture. This makes our registration algorithm particularly well-suited in applications where blurred image registration must be used as a preprocess step of an image fusion algorithm, and where common registration methods fail, due to the amount of blur. We demonstrate that the proposed method leads to an improvement of the registration performance, and we show its applicability to real images by providing successful examples of blurred image registration followed by depth-of-field extension and multichannel blind deconvolution.

Blur invariant translational image registration for N-fold symmetric blurs.

In this paper, we propose a new registration method designed particularly for registering differently blurred images. Such a task cannot be successfully resolved by traditional approaches. Our method is inspired by traditional phase correlation, which is now applied to certain blur-invariant descriptors instead of the original images. This method works for unknown blurs assuming the blurring PSF exhibits an N-fold rotational symmetry. It does not require any landmarks. We have experimentally proven its good performance, which is not dependent on the amount of blur. In this paper, we explicitly address only registration with respect to translation, but the method can be readily generalized to rotation and scaling.

Blur invariants constructed from arbitrary moments.

This paper deals with moment invariants with respect to image blurring. It is mainly a reaction to the works of Zhang and Chen , recently published in these Transactions. We present a general method on how to construct blur invariants from arbitrary moments and show that it is no longer necessary to separately derive the invariants for each polynomial basis. We show how to discard dependent terms in blur invariants definition and discuss a proper implementation of the invariants in orthogonal bases using recurrent relations. An example for Legendre moments is given.

Space-variant restoration of images degraded by camera motion blur.

We examine the problem of restoration from multiple images degraded by camera motion blur. We consider scenes with significant depth variations resulting in space-variant blur. The proposed algorithm can be applied if the camera moves along an arbitrary curve parallel to the image plane, without any rotations. The knowledge of camera trajectory and camera parameters is not necessary. At the input, the user selects a region where depth variations are negligible. The algorithm belongs to the group of variational methods that estimate simultaneously a sharp image and a depth map, based on the minimization of a cost functional. To initialize the minimization, it uses an auxiliary window-based depth estimation algorithm. Feasibility of the algorithm is demonstrated by three experiments with real images.

A unified approach to superresolution and multichannel blind deconvolution.

This paper presents a new approach to the blind deconvolution and superresolution problem of multiple degraded low-resolution frames of the original scene. We do not assume any prior information about the shape of degradation blurs. The proposed approach consists of building a regularized energy function and minimizing it with respect to the original image and blurs, where regularization is carried out in both the image and blur domains. The image regularization based on variational principles maintains stable performance under severe noise corruption. The blur regularization guarantees consistency of the solution by exploiting differences among the acquired low-resolution images. Several experiments on synthetic and real data illustrate the robustness and utilization of the proposed technique in real applications.

Rotation moment invariants for recognition of symmetric objects.

In this paper, a new set of moment invariants with respect to rotation, translation, and scaling suitable for recognition of objects having N-fold rotation symmetry are presented. Moment invariants described earlier cannot be used for this purpose because most moments of symmetric objects vanish. The invariants proposed here are based on complex moments. Their independence and completeness are proven theoretically and their performance is demonstrated by experiments.

Multichannel blind deconvolution of spatially misaligned images.

Existing multichannel blind restoration techniques assume perfect spatial alignment of channels, correct estimation of blur size, and are prone to noise. We developed an alternating minimization scheme based on a maximum a posteriori estimation with a priori distribution of blurs derived from the multichannel framework and a priori distribution of original images defined by the variational integral. This stochastic approach enables us to recover the blurs and the original image from channels severely corrupted by noise. We observe that the exact knowledge of the blur size is not necessary, and we prove that translation misregistration up to a certain extent can be automatically removed in the restoration process.

Projective moment invariants.

The paper is devoted to the moment invariants with respect to projective transform. It has been a common belief that such invariants do not exist. We show that projective moment invariants exist in a form of infinite series containing moments with positive as well as negative indices.

Multichannel blind iterative image restoration.

Blind image deconvolution is required in many applications of microscopy imaging, remote sensing, and astronomical imaging. Unfortunately in a single-channel framework, serious conceptual and numerical problems are often encountered. Very recently, an eigenvector-based method (EVAM) was proposed for a multichannel framework which determines perfectly convolution masks in a noise-free environment if channel disparity, called co-primeness, is satisfied. We propose a novel iterative algorithm based on recent anisotropic denoising techniques of total variation and a Mumford-Shah functional with the EVAM restoration condition included. A linearization scheme of half-quadratic regularization together with a cell-centered finite difference discretization scheme is used in the algorithm and provides a unified approach to the solution of total variation or Mumford-Shah. The algorithm performs well even on very noisy images and does not require an exact estimation of mask orders. We demonstrate capabilities of the algorithm on synthetic data. Finally, the algorithm is applied to defocused images taken with a digital camera and to data from astronomical ground-based observations of the Sun.

Affine invariants of convex polygons.

In this correspondence, we prove that the affine invariants, for image registration and object recognition, proposed recently by Yang and Cohen (see ibid., vol.8, no.7, p.934-46, July 1999) are algebraically dependent. We show how to select an independent and complete set of the invariants. The use of this new set leads to a significant reduction of the computing complexity without decreasing the discrimination power.