Search

Semi-variogram estimators and distortion measures of signal spectra are utilized in this paper for image texture retrieval. On the use of the complete Brodatz database, most high retrieval rates are reportedly based on multiple features and the combinations of multiple algorithms, while the classification using single features is still a challenge to the retrieval of diverse texture images. The semi-variogram, which is theoretically sound and the cornerstone of spatial statistics, has the characteristics shared between true randomness and complete determinism and, therefore, can be used as a useful tool for both the structural and statistical analysis of texture images. Meanwhile, spectral distortion measures derived from the theory of linear predictive coding provide a rigorously mathematical model for signal-based similarity matching and have been proven useful for many practical pattern classification systems. Experimental results obtained from testing the proposed approach using the complete Brodatz database, and the the University of Illinois at Urbana-Champaign texture database suggests the effectiveness of the proposed approach as a single-feature-based dissimilarity measure for real-time texture retrieval. [ABSTRACT FROM PUBLISHER]

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]

Nonrigid image registration plays an important role in the field of computer vision and medical application. The methods based on Demons algorithm for image registration usually use intensity difference as similarity criteria. However, intensity based methods can not preserve image texture details well and are limited by local minima. In order to solve these problems, we propose a Gabor feature based LogDemons registration method in this article, called GFDemons. We extract Gabor features of the registered images to construct feature similarity metric since Gabor filters are suitable to extract image texture information. Furthermore, because of the weak gradients in some image regions, the update fields are too small to transform the moving image to the fixed image correctly. In order to compensate this deficiency, we propose an inertial constraint strategy based on GFDemons, named IGFDemons, using the previous update fields to provide guided information for the current update field. The inertial constraint strategy can further improve the performance of the proposed method in terms of accuracy and convergence. We conduct experiments on three different types of images and the results demonstrate that the proposed methods achieve better performance than some popular methods. [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]

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]

High spatial resolution and high spectral resolution images (HR-HSIs) are widely applied in geosciences, medical diagnosis, and beyond. However, how to get images with both high spatial resolution and high spectral resolution is still a problem to be solved. In this paper, we present a deep spatial-spectral feature interaction network (SSFIN) for reconstructing an HR-HSI from a low-resolution multispectral image (LR-MSI), e.g., RGB image. In particular, we introduce two auxiliary tasks, i.e., spatial super-resolution (SR) and spectral SR to help the network recover the HR-HSI better. Since higher spatial resolution can provide more detailed information about image texture and structure, and richer spectrum can provide more attribute information, we propose a spatial-spectral feature interaction block (SSFIB) to make the spatial SR task and the spectral SR task benefit each other. Therefore, we can make full use of the rich spatial and spectral information extracted from the spatial SR task and spectral SR task, respectively. Moreover, we use a weight decay strategy (for the spatial and spectral SR tasks) to train the SSFIN, so that the model can gradually shift attention from the auxiliary tasks to the primary task. Both quantitative and visual results on three widely used HSI datasets demonstrate that the proposed method achieves a considerable gain compared to other state-of-the-art methods. Source code is available at https://github.com/junjun-jiang/SSFIN. [ABSTRACT FROM AUTHOR]

The image contrast is a feature capturing the variation of the image signal across the space. Such a feature is very useful to describe the local image structure at different scales and thus it is relevant to many computer vision applications, like image/texture retrieval and object recognition. In this work, we present MiRCo, a novel measure of image contrast derived from the Retinex theory. MiRCo is robust against in-plane rotations and light changes at multiple scales. Thanks to these properties, MiRCo enables an accurate and robust description of the local image structure. Here we describe and discuss the mathematical insights of MiRCo also in comparison with other popular contrast measures. [ABSTRACT FROM AUTHOR]

In this paper, we propose a novel no reference quality assessment method by incorporating statistical luminance and texture features (NRLT) for screen content images (SCIs) with both local and global feature representation. The proposed method is designed inspired by the perceptual property of the human visual system (HVS) that the HVS is sensitive to luminance change and texture information for image perception. In the proposed method, we first calculate the luminance map through the local normalization, which is further used to extract the statistical luminance features in global scope. Second, inspired by existing studies from neuroscience that high-order derivatives can capture image texture, we adopt four filters with different directions to compute gradient maps from the luminance map. These gradient maps are then used to extract the second-order derivatives by local binary pattern. We further extract the texture feature by the histogram of high-order derivatives in global scope. Finally, support vector regression is applied to train the mapping function from quality-aware features to subjective ratings. Experimental results on the public large-scale SCI database show that the proposed NRLT can achieve better performance in predicting the visual quality of SCIs than relevant existing methods, even including some full reference visual quality assessment methods. [ABSTRACT FROM PUBLISHER]

This paper proposes a new texture enhancement method which uses an image decomposition that allows different visual characteristics of textures to be represented by separate components in contrast with previous methods which either enhance texture indirectly or represent all texture information using a single image component. Our method is intended to be used as a preprocessing step prior to the use of texture-based image segmentation algorithms. Our method uses a modification of morphological component analysis (MCA) which allows texture to be separated into multiple morphological components each representing a different visual characteristic of texture. We select four such texture characteristics and propose new dictionaries to extract these components using MCA. We then propose procedures for modifying each texture component and recombining them to produce a texture-enhanced image. We applied our method as a preprocessing step prior to a number of texture-based segmentation methods and compared the accuracy of the results, finding that our method produced results superior to comparator methods for all segmentation algorithms tested. We also demonstrate by example the main mechanism by which our method produces superior results, namely that it causes the clusters of local texture features of each distinct image texture to mutually diverge within the multidimensional feature space to a vastly superior degree versus the comparator enhancement methods. [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]

The goal of exemplar-based texture synthesis is to generate texture images that are visually similar to a given exemplar. Recently, promising results have been reported by methods relying on convolutional neural networks (ConvNets) pretrained on large-scale image datasets. However, these methods have difficulties in synthesizing image textures with non-local structures and extending to dynamic or sound textures. In this article, we present a conditional generative ConvNet (cgCNN) model which combines deep statistics and the probabilistic framework of generative ConvNet (gCNN) model. Given a texture exemplar, cgCNN defines a conditional distribution using deep statistics of a ConvNet, and synthesizes new textures by sampling from the conditional distribution. In contrast to previous deep texture models, the proposed cgCNN does not rely on pre-trained ConvNets but learns the weights of ConvNets for each input exemplar instead. As a result, cgCNN can synthesize high quality dynamic, sound and image textures in a unified manner. We also explore the theoretical connections between our model and other texture models. Further investigations show that the cgCNN model can be easily generalized to texture expansion and inpainting. Extensive experiments demonstrate that our model can achieve better or at least comparable results than the state-of-the-art 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]

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]

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.

Degraded image semantic segmentation is of great importance in autonomous driving, highway navigation systems, and many other safety-related applications and it was not systematically studied before. In general, image degradations increase the difficulty of semantic segmentation, usually leading to decreased semantic segmentation accuracy. Therefore, performance on the underlying clean images can be treated as an upper bound of degraded image semantic segmentation. While the use of supervised deep learning has substantially improved the state of the art of semantic image segmentation, the gap between the feature distribution learned using the clean images and the feature distribution learned using the degraded images poses a major obstacle in improving the degraded image semantic segmentation performance. The conventional strategies for reducing the gap include: 1) Adding image-restoration based pre-processing modules; 2) Using both clean and the degraded images for training; 3) Fine-tuning the network pre-trained on the clean image. In this paper, we propose a novel Dense-Gram Network to more effectively reduce the gap than the conventional strategies and segment degraded images. Extensive experiments demonstrate that the proposed Dense-Gram Network yields state-of-the-art semantic segmentation performance on degraded images synthesized using PASCAL VOC 2012, SUNRGBD, CamVid, and CityScapes datasets. [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]

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]