Search

This paper introduces a new model for image texture classification based on wavelet transformation and singular value decomposition. The probability density function of the singular values of wavelet transformation coefficients of image textures is modeled as an exponential function. The model parameter of the exponential function is estimated using maximum likelihood estimation technique. Truncation of lower singular values is employed to classify textures in the presence of noise. Kullback-Leibler distance (KLD) between estimated model parameters of image textures is used as a similarity metric to perform the classification using minimum distance classifier. The exponential function permits us to have closed-form expressions for the estimate of the model parameter and computation of the KLD. These closed-form expressions reduce the computational complexity of the proposed approach. Experimental results are presented to demonstrate the effectiveness of this approach on the entire 111 textures from Brodatz database. The experimental results demonstrate that the proposed approach improves recognition rates using a lower number of parameters on large databases. The proposed approach achieves higher recognition rates compared to the traditional sub- band energy-based approach, the hybrid IMMJSVM approach, and the GGD-based approach. [ABSTRACT FROM AUTHOR]

In this paper, we aim to handle the intraclass variation resulting from the geometric transformation and the illumination change for more robust texture classification. To this end, we propose a novel feature descriptor called Radon representation-based feature descriptor (RRFD). RRFD converts the original pixel represented images into Radon-pixel images by using the Radon transform. The new Radon-pixel representation is more informative in geometry and has a much lower dimension. Subsequently, RRFD efficiently achieves affine invariance by projecting an image (or an image patch) from the space of Radon-pixel pairs onto an invariant feature space by using a ratiogram, i.e., the histogram of ratios between the areas of triangle pairs. The illumination invariance is also achieved by defining an illumination invariant distance metric on the invariant feature space. Comparing to the existing Radon transform-based texture features, which only achieve rotation and/or scaling invariance, RRFD achieves affine invariance. The experimental results on CUReT show that RRFD is a powerful feature descriptor that is suitable for texture classification. [ABSTRACT FROM AUTHOR]

Although simple and efficient, traditional feature-based texture segmentation methods usually suffer from the intrinsical less inaccuracy, which is mainly caused by the oversimplified assumption that each textured subimage used to estimate a feature is homogeneous. To solve this problem, an adaptive segmentation algorithm based on the coupled Markov random field (CMRF) model is proposed in this paper. The CMRF model has two mutually dependent components: one models the observed image to estimate features, and the other models the labeling to achieve segmentation. When calculating the feature of each pixel, the homogeneity of the subimage is ensured by using only the pixels currently labeled as the same pattern. With the acquired features, the labeling is obtained through solving a maximum a posteriori problem. In our adaptive approach, the feature set and the labeling are mutually dependent on each other, and therefore are alternately optimized by using a simulated annealing scheme. With the gradual improvement of features' accuracy, the labeling is able to locate the exact boundary of each texture pattern adaptively. The proposed algorithm is compared with a simple MRF model based method in segmentation of Brodatz texture mosaics and real scene images. The satisfying experimental demonstrate that the proposed approach can differentiate textured images more accurately. [ABSTRACT FROM AUTHOR]

It is very important to extract high quality texture features from images. This is, however, often laborious, because the randomness in the color distribution patterns for texture elements makes texture measurement very difficult, despite these elements having a very similar visual appearance. In this paper, we propose the use of multi-scale color histograms to measure the effect of color distribution patterns efficiently and without having to compute the actual patterns, which saves considerable effort. Meanwhile, the hue-saturation-intensity color model is mainly adopted to take the advantage of human visual experiences in texture recognition. We discuss and validate the effectiveness and efficiency of our method by applying to various benchmarks. The results show that we can extract quality dominant textures automatically in real time, and faster by several orders of magnitude than existing methods. [ABSTRACT FROM AUTHOR]

Vision-based road detection in unstructured environments is a challenging problem as there are hardly any discernible and invariant features that can characterize the road or its boundaries in such environments. However, a salient and consistent feature of most roads or tracks regardless of type of the environments is that their edges, boundaries, and even ruts and tire tracks left by previous vehicles on the path appear to converge into a single point known as the vanishing point. Hence, estimating this vanishing point plays a pivotal role in the determination of the direction of the road. In this paper, we propose a novel methodology based on image texture analysis for the fast estimation of the vanishing point in challenging and unstructured roads. The key attributes of the methodology consist of the optimal local dominant orientation method that uses joint activities of only four Gabor filters to precisely estimate the local dominant orientation at each pixel location in the image plane, the weighting of each pixel based on its dominant orientation, and an adaptive distance-based voting scheme for the estimation of the vanishing point. A series of quantitative and qualitative analyses are presented using natural data sets from the Defense Advanced Research Projects Agency Grand Challenge projects to demonstrate the effectiveness and the accuracy of the proposed methodology. [ABSTRACT FROM PUBLISHER]

The dual-tree quaternion wavelet transform (QWT) is a new multiscale analysis tool for geometric image features. The QWT is a near shift-invariant tight frame representation whose coefficients sport a magnitude and three phases: two phases encode local image shifts while the third contains image texture information. The QWT is based on an alternative theory for the 2-D Hilbert transform and can be computed using a dual-tree filter bank with linear computational complexity. To demonstrate the properties of the QWT's coherent magnitude/phase representation, we develop an efficient and accurate procedure for estimating the local geometrical structure of an image. We also develop a new multiscale algorithm for estimating the disparity between a pair of images that is promising for image registration and flow estimation applications. The algorithm features multiscale phase unwrapping, linear complexity, and sub-pixel estimation accuracy. [ABSTRACT FROM AUTHOR]

``Prediction is an essential operation in many image processing applications, such as object detection and image and video compression. When the images are modeled as Gaussian, the optimal predictor is linear and easy to obtain. However, image texture and clutter are often non-Gaussian, and, in such cases, optimal predictors are difficult to obtain. In this paper, we derive an optimal predictor for an important class of non-Gaussian image models, the block-based multivariate Gaussian mixture model. This predictor has a special nonlinear structure: it is a linear combination of the neighboring pixels, but the combination coefficients are also functions of the neighboring pixels, not constants. The efficacy of this predictor is demonstrated in object detection experiments where the prediction error image is used to identify "hidden" objects. Experimental results indicate that when the background texture is nonlinear, i.e., with fast-switching gray-level patches, it performs significantly better than the optimal linear predictor. [ABSTRACT FROM AUTHOR]

Focuses on the visually improved image compression by combining a conventional wavelet-codec with texture modeling. Process of texture modeling; Wavelet-based Image/texture Coding Hybrid (WITCH) system overview; Analysis of stochastic textures.

Presents information on a study that developed an image texture segmentation algorithm based on wavelet-domain hidden Markov tree models. Discussion on multiscale image segmentation; Methodology; Results and discussion.

Presents a study which assessed the validity of a model that relates a rough surface to its image texture. Research methodology; Results and discussion; Conclusions.

In this paper, we introduce a method to detect co-saliency from an image pair that may have some objects in common. The co-saliency is modeled as a linear combination of the single-image saliency map (SISM) and the multi-image saliency map (MISM). The first term is designed to describe the local attention, which is computed by using three saliency detection techniques available in literature. To compute the MISM, a co-multilayer graph is constructed by dividing the image pair into a spatial pyramid representation. Each node in the graph is described by two types of visual descriptors, which are extracted from a representation of some aspects of local appearance, e.g., color and texture properties. In order to evaluate the similarity between two nodes, we employ a normalized single-pair SimRank algorithm to compute the similarity score. Experimental evaluation on a number of image pairs demonstrates the good performance of the proposed method on the co-saliency detection task. [ABSTRACT FROM AUTHOR]