A multiresolution approach for texture synthesis using the circular harmonic functions

Categorization and segmentation of intestinal content frames for wireless capsule endoscopy

Wireless capsule endoscopy (WCE) is a device that allows the direct visualization of gastrointestinal tract with minimal discomfort for the patient, but at the price of a large amount of time for screening. In order to reduce this time, several works have proposed to automatically remove all the frames showing intestinal content. These methods label frames as {intestinal content- clear} without discriminating between types of content (with different physiological meaning) or the portion of image covered. In addition, since the presence of intestinal content has been identified as an indicator of intestinal motility, its accurate quantification can show a potential clinical relevance. In this paper, we present a method for the robust detection and segmentation of intestinal content in WCE images, together with its further discrimination between turbid liquid and bubbles. Our proposal is based on a twofold system. First, frames presenting intestinal content are detected by a support vector machine classifier using color and textural information. Second, intestinal content frames are segmented into {turbid, bubbles, and clear} regions. We show a detailed validation using a large dataset. Our system outperforms previous methods and, for the first time, discriminates between turbid from bubbles media.

On the inter-conversion between Hermite and Laguerre local image expansions

The nice relationship existing among the Hermite-Gauss and the Laguerre-Gauss image expansions, whose basis functions span the same signal space, is investigated. As a result, a novel efficient method for Cartesian to polar coordinate inter-conversion, especially suited for dedicated hardware realization, is proposed. Applications to local image rotation, based on the simple steerability of the Laguerre-Gauss expansion, and to local image analysis, based on Gaussian derivatives, are considered in detail. A possible fixed-point realization of the proposed inter-conversion scheme is discussed.

Detection of architectural distortion in prior mammograms

We present methods for the detection of sites of architectural distortion in prior mammograms of interval-cancer cases. We hypothesize that screening mammograms obtained prior to the detection of cancer could contain subtle signs of early stages of breast cancer, in particular, architectural distortion. The methods are based upon Gabor filters, phase portrait analysis, a novel method for the analysis of the angular spread of power, fractal analysis, Laws' texture energy measures derived from geometrically transformed regions of interest (ROIs), and Haralick's texture features. With Gabor filters and phase portrait analysis, 4224 ROIs were automatically obtained from 106 prior mammograms of 56 interval-cancer cases, including 301 true-positive ROIs related to architectural distortion, and from 52 mammograms of 13 normal cases. For each ROI, the fractal dimension, the entropy of the angular spread of power, 10 Laws' measures, and Haralick's 14 features were computed. The areas under the receiver operating characteristic curves obtained using the features selected by stepwise logistic regression and the leave-one-ROI-out method are 0.76 with the Bayesian classifier, 0.75 with Fisher linear discriminant analysis, and 0.78 with a single-layer feed-forward neural network. Free-response receiver operating characteristics indicated sensitivities of 0.80 and 0.90 at 5.8 and 8.1 false positives per image, respectively, with the Bayesian classifier and the leave-one-image-out method.

A fast nonparametric noncausal MRF-based texture synthesis scheme using a novel FKDE algorithm

In this paper, a new algorithm is proposed for fast kernel density estimation (FKDE), based on principal direction divisive partitioning (PDDP) of the data space. A new framework is also developed to apply FKDE algorithms (both proposed and existing), within nonparametric noncausal Markov random field (NNMRF) based texture synthesis algorithm. The goal of the proposed FKDE algorithm is to use the finite support property of kernels for fast estimation of density. It has been shown that hyperplane boundaries for partitioning the data space and principal component vectors of the data space are two requirements for efficient FKDE. The proposed algorithm is compared with the earlier algorithms, with a number of high-dimensional data sets. The error and time complexity analysis, proves the efficiency of the proposed FKDE algorithm compared to the earlier algorithms. Due to the local simulated annealing, direct incorporation of the FKDE algorithms within the NNMRF-based texture synthesis algorithm, is not possible. This work proposes a new methodology to incorporate the effect of local simulated annealing within the FKDE framework. Afterward, the developed texture synthesis algorithms have been tested with a number of different natural textures, taken from a standard database. The comparison in terms of visual similarity and time complexity, between the proposed FKDE based texture synthesis algorithm with the earlier algorithms, show the efficiency.

A new texture generation method based on pseudo-DCT coefficients

In this paper, a new method for generating different texture images is presented. This method involves a simple transform from a certain one-dimensional (1-D) signal to an expected two-dimensional (2-D) image. Unlike traditional methods, the input signal is generated by a simple 1-D function in our work instead of a sample texture. We first transform the 1-D input signal into frequency domain using fast Fourier transform. Based on the sufficient analysis in 2-D discrete cosine transform (DCT) domain, where each of the coefficients expresses a texture feature in a certain direction, the 2-D pseudo-DCT coefficients are then constructed by appropriately rearranging the Fourier coefficients in terms of their frequency components. Finally, the corresponding texture image can be produced by 2-D inverse DCT algorithm. We applied the proposed method to generate several stochastic textures (i.e., cloud, illumination, and sand), and several structural texture images. Experimental results indicate the good performance of the proposed method.

Texture synthesis: textons revisited

This paper introduces a technique for synthesizing natural textures, with emphasis on quasiperiodic and structural textures. Textures are assumed to be composed of three components, namely illumination, structure, and stochastic. The contribution of this work is that, in contrast to previous techniques, it proposes a joint approach for handling the texture's global illumination, irregular structure, and stochastic component which may be correlated to the other two components. Furthermore, the proposed technique does not produce verbatim copies in the synthesized texture. More specifically, a top-down approach is used for extraction of texture elements (textons) in which, in contrast to previous texton-based approaches, no assumptions regarding perfect periodicity are made. The structure itself can be modeled as a stochastic process. Consequently, textons are allowed to have irregular and nonidentical shapes. In the synthesis stage, a new nonregular textural structure is designed from the original one that defines the place holders for textons. We call such place holders empty textons (e-textons). The e-textons are filled in by a representative texton. Since e-textons do not have identical shapes, a texton shape-matching procedure is required. After adding the illumination to the structural component, a strictly localized version of a block sampling technique is applied to add the stochastic component. The block sampling technique combined with the addition of the illumination component provides a significant improvement in the appearance of synthesized textures. Results show that the proposed method is successful in synthesizing structural textures visually indistinguishable to the original. Moreover, the method is successful in synthesizing a variety of stochastic textures.

Reduced complexity rotation invariant texture classification using a blind deconvolution approach

In this paper, we present a texture classification procedure that makes use of a blind deconvolution approach. Specifically, the texture is modeled as the output of a linear system driven by a binary excitation. We show that features computed from one-dimensional slices extracted from the two-dimensional autocorrelation function (ACF) of the binary excitation allows representing the texture for rotation-invariant classification purposes. The two-dimensional classification problem is thus reconduced to a more simple one-dimensional one, which leads to a significant reduction of the classification procedure computational complexity.

Design of steerable filters for feature detection using canny-like criteria

We propose a general approach for the design of 2D feature detectors from a class of steerable functions based on the optimization of a Canny-like criterion. In contrast with previous computational designs, our approach is truly 2D and provides filters that have closed-form expressions. It also yields operators that have a better orientation selectivity than the classical gradient or Hessian-based detectors. We illustrate the method with the design of operators for edge and ridge detection. We present some experimental results that demonstrate the performance improvement of these new feature detectors. We propose computationally efficient local optimization algorithms for the estimation of feature orientation. We also introduce the notion of shape-adaptable feature detection and use it for the detection of image corners.

Robust rotation-invariant texture classification using a model based approach

In this paper, a model based texture classification procedure is presented. The texture is modeled as the output of a linear system driven by a binary image. This latter retains the morphological characteristics of the texture and it is specified by its spatial autocorrelation function (ACF). We show that features extracted from the ACF of the binary excitation suffice to represent the texture for classification purposes. Specifically, we employ a moment invariants based technique to classify the ACF. The resulting proposed classification procedure is thus inherently rotation invariant. Moreover, it is robust with respect to additive noise. Experimental results show that this approach allows obtaining high correct rotation-invariant classification rates while containing the size of the feature space.

Multichannel blind image deconvolution using the Bussgang algorithm: spatial and multiresolution approaches

This work extends the Bussgang blind equalization algorithm to the multichannel case with application to image deconvolution problems. We address the restoration of images with poor spatial correlation as well as strongly correlated (natural) images. The spatial nonlinearity employed in the final estimation step of the Bussgang algorithm is developed according to the minimum mean square error criterion in the case of spatially uncorrelated images. For spatially correlated images, the nonlinearity design is rather conducted using a particular wavelet decomposition that, detecting lines, edges, and higher order structures, carries out a task analogous to those of the (preattentive) stage of the human visual system. Experimental results pertaining to restoration of motion blurred text images, out-of-focus spiky images, and blurred natural images are reported.