Search

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]

The method of average local variance (ALV) computes the mean of the standard deviation values derived for a 3 × 3 moving window on a successively coarsened image to produce a function of ALV versus spatial resolution. In developing ALV, the authors used approximately a doubling of the pixel size at each coarsening of the image. They hypothesized that ALV is low when the pixel size is smaller than the size of scene objects because the pixels on the object will have similar response values. When the pixel and objects are of similar size, they will tend to vary in response and the ALV values will increase. As the size of pixels increase further, more objects will be contained in a single pixel and ALV will decrease. The authors showed that various cover types produced single peak ALV functions that inexplicitly peaked when the pixel size was 1/2 to 3/4 of the object size. This paper reports on work done to explore the characteristics of the various forms of the ALV function and to understand the location of the peaks that occur in this function. The work was conducted using synthetically generated image data. The investigation showed that the hypothesis originally proposed in is not adequate. A new hypothesis is proposed that the ALV function has peak locations that are related to the geometric size of pattern structures in the scene. These structures are not always the same as scene objects. Only in cases where the size of and separation between scene objects are equal does the ALV function detect the size of the objects. In situations where the distance between scene objects are larger than their size, the ALV function has a peak at the object separation, not at the object size. This work has also shown that multiple object structures of different sizes and distances in the image provide multiple peaks in the ALV function and that some of these structures are not implicitly recognized as such from our perspective. However, the magnitude of these peaks depends on the response mix in the structures, complicating their interpretation and analysis. The analysis of the ALV Function is, thus, more complex than that generally reported in the literature. [ABSTRACT FROM AUTHOR]

A multiscale method in surface processing is presented which carries over image processing methodology based on nonlinear diffusion equations to the fairing of noisy, textured, parametric surfaces. The aim is to smooth noisy, triangulated surfaces and accompanying noisy textures--as they are delivered by new scanning technology--while enhancing geometric and texture features. For an initial textured surface a fairing method is described which simultaneously processes the texture and the surface. Considering an appropriate coupling of the two smoothing processes one can take advantage of the frequently present strong correlation between edge features in the texture and on the surface edges. The method is based on an anisotropic curvature evolution of the surface itself and an anisotropic diffusion on the processed surface applied to the texture. Here, the involved diffusion tensors depends on a regularized shape operator of the evolving surface and on regularized texture gradients. A spatial finite element discretization on arbitrary unstructured triangular grids and a semi-implicit finite difference discretization in lime are the building blocks of the corresponding numerical algorithm. A normal projection is applied to the discrete propagation velocity to avoid tangential drifting in the surface evolution. Different applications underline the efficiency and flexibility of the presented surface processing tool. [ABSTRACT FROM AUTHOR]

The segmentation of images into meaningful and homogenous regions is a key method for image analysis within applications such as content based retrieval. The watershed transform is a well established tool for the segmentation of images. However, watershed segmentation is often not effective for textured image regions that are perceptually homogeneous. In order to properly segment such regions the concept of the "texture gradient" is now introduced. Texture information and its gradient are extracted using a novel nondecimated form of a complex wavelet transform. A novel marker location algorithm is subsequently used to locate significant homogeneous textured or non textured regions. A marker driven watershed transform is then used to properly segment the identified regions. The combined algorithm produces effective texture and intensity based segmentation for the application to content based image retrieval. [ABSTRACT FROM AUTHOR]

Texture is an important characteristic for different computer vision tasks and applications. Local binary pattern (LBP) is considered one of the most efficient texture descriptors yet. However, LBP has some notable limitations, in particular its sensitivity to noise. In this paper, we address these criteria by introducing a novel texture descriptor, robust adaptive median binary pattern (RAMBP). RAMBP is based on a process involving classification of noisy pixels, adaptive analysis window, scale analysis, and a comparison of image medians. The proposed method handles images with highly noisy textures and increases the discriminative properties by capturing microstructure and macrostructure texture information. The method was evaluated on popular texture datasets for classification and retrieval tasks and under different high noise conditions. Without any training or prior knowledge of the noise type, RAMBP achieved the best classification compared to state-of-the-art techniques. It scored more than 90% under 50% impulse noise densities, more than 95% under Gaussian noised textures with a standard deviation $\sigma = 5$ , more than 99% under Gaussian blurred textures with a standard deviation $\sigma = 1.25$ , and more than 90% for mixed noise. The proposed method yielded competitive results and proved to be one of the best descriptors in noise-free texture classification. Furthermore, RAMBP showed high performance for the problem of noisy texture retrieval providing high scores of recall and precision measures for textures with high noise levels. Finally, compared with the state-of-the-art methods, RAMBP achieves a good running time with low feature dimensionality. [ABSTRACT FROM AUTHOR]

Texture filtering seeks to smooth out textured details in order to present structures prominently. To filter out multi-scale textured details while preserving structures, some methods propose to adjust the size of the filtering windows by handling the pixels near structures with small windows and the other pixels with large windows. Unfortunately, their adjustment measures are not very effective in treating complex situations. They may handle the pixels inside small structures with large windows, which overly smooths them, or they may be incapable of smoothing out large-scale textures. With regard to this, in this paper, we present a novel method that adjusts the window size for a pixel by checking similar pixels in its neighborhood. In general, pixels nearer structures have fewer similar pixels in their neighborhoods than the pixels that are farther away from structures. Thus, our adjustment can adaptively adjust window sizes by the distances from pixels to structures, which improves the potential to treat complex situations. The experimental results show that we can well filter out very large-scale textures while preserving small structures with high quality in a manner superior to the state-of-the-art methods. In addition, our method is very simple and efficient, and can be used easily in applications. [ABSTRACT FROM AUTHOR]