Elsevier

Pattern Recognition Letters

Volume 27, Issue 16, December 2006, Pages 1875-1883
Pattern Recognition Letters

Texture classification using ridgelet transform

https://doi.org/10.1016/j.patrec.2006.04.013Get rights and content

Abstract

Texture classification has long been an important research topic in image processing. Now a day’s classification based on wavelet transform is being very popular. Wavelets are very effective in representing objects with isolated point singularities, but failed to represent line singularities. Recently, ridgelet transform which deal effectively with line singularities in 2-D is introduced. It allows representing edges and other singularities along lines in a more efficient way compared to wavelet transform. In this paper, the issue of texture classification based on ridgelet transform has been analyzed. Features are derived from the sub-bands of the ridgelet decomposition and are used for classification for the four different datasets containing 20, 30, 112 and 129 texture images respectively. Experimental results show that this approach allows obtaining high degree of success rate in classification.

Introduction

The analysis of texture in images provides an important cue to the recognition of objects. It has been recently observed that different image objects are best characterized by different texture methods. Successful applications of texture analysis methods have been widely found in industrial, biomedical, remote sensing areas and target recognition (e.g., Kaplan, 1999). In addition, the recent emerging of multimedia and the availability of large image and video archives has made content-based information retrieval become a very popular research topic. Texture is also deemed as one of the most important features when performing content-based information retrieval (e.g., Chan et al., 1997). Various textural features have been adopted to fulfill these applications. Since there are a lot of variations among natural textures, to achieve the best performance for texture analysis or retrieval, different features should be chosen according to the characteristics of texture images. A number of texture analysis methods have been proposed over the years and it is well-recognized that they capture different texture properties of the image.

Texture analysis methods used can be categorized as statistical, geometrical, model-based and signal processing (e.g., Tuceyran and Jain, 1998). Early works were based on the analysis of statistical properties of the texture which deals with the spatial distribution of gray values. Some statistical methods used are co-occurrence matrix features (e.g., Haralick et al., 1973, Argenti et al., 1990) and autocorrelation function (e.g., Kaizer, 1955). In geometrical methods textures are considered to be composed of texture primitives and are extracted and analyzed (e.g., Tuceryan and Jain, 1990). Several stochastic models have been proposed for texture modeling and classification such as Gaussian Markov random fields (e.g., Cross and Jain, 1983, Rama and Shankar, 1985, Charles, 1995) and spatial autocorrelation function model (e.g., Patrizio et al., 2002). The signal processing techniques are mainly based on texture filtering for analyzing the frequency contents either in spatial domain (e.g., Laws, 1980, Unser, 1986) or in frequency domain (e.g., Bajcsy and Lieberman, 1976). Filter bank instead of a single filter has been proposed, giving rise to several multi-channel texture analysis systems such as Gabor filters and wavelet transforms (e.g., Unser and Eden, 1989). The major disadvantage of the Gabor transform is that its output are not mutually orthogonal, which may result in a significant correlation between texture features.

In the last decade, wavelet theory has been widely used for texture classification purposes. Here, image is decomposed using wavelet transform and statistics such as mean and standard deviation are derived from the decomposed sub-bands and is used as features for classification (e.g., Smith and Chang, 1994, Nicu and Michael, 2000, DeBrunner and Kadiyala, 2000). Apart from these statistical features, co-occurrence features are extracted from the wavelet decomposed sub-bands in order to increase the correct classification rate (e.g., Arivazhagan and Ganesan, 2003). In order to explore the middle-band characteristics, tree structured wavelet transform (e.g., Chang and Kuo, 1992), pyramid structured wavelet transform (e.g., Chang and Kuo, 1993), dual-tree complex wavelet transform (e.g., Serkan et al., 1999), wavelet packets (e.g., Moon-Chuen and Chi-Man, 2000, Rajpoot, 2002) were used for texture classification. A comparative study by Randen and Husoy (1999) shows that various filtering approaches yield different results for different images. No single approach did perform best or very close to the best for all images.

The success of wavelets is mainly due to the good performance for piecewise smooth functions in one dimension. Unfortunately, such is not the case in two dimensions. In essence, wavelets are good at catching zero-dimensional or point singularities, but two-dimensional piecewise smooth signals resembling images have one-dimensional singularities (e.g., Minh and Martin, 2003). Wavelets in two dimensions are obtained by a tensor-product of one dimensional wavelet and they are thus good at isolating the discontinuity across an edge, but will not see the smoothness along the edge. To overcome the weakness of wavelets in higher dimensions, Candes and Donoho pioneered a new system of representations named ridgelets which deal effectively with line singularities in two dimensions (e.g., Candes, 1998, Candes and Donoho, 1999). The idea is to map a line singularity into a point singularity using the Radon transform (e.g., Deans, 1983, Bolker, 1987). Then, the wavelet transform can be used to effectively handle the point singularity in the Radon domain. So, ridgelet transform allows representing edges and other singularities along lines in a more efficient way, in terms of compactness of the representation, than traditional transformations, such as the wavelet transform, for a given accuracy of reconstruction (e.g., Patrizio et al., 2002).

In this paper, the ridgelet transform is applied on a set of texture images and statistical features such as mean and standard deviation are extracted from each of the ridgelet sub-bands and used for classification. In order to improve the classification gain, the co-occurrence features are also extracted from each ridgelet sub-bands. The experimental result shows that the success rate is improved much when compared with traditional methods.

The paper is organized as follows: Section 2 describes the theory of continuous ridgelet transform (CRT). The digital implementation aspect of ridgelet transform is given in Section 3. The process of texture classification is explained in Section 4. Experimental results and discussion are given in Section 5. Finally, concluding remarks are given in Section 6.

Section snippets

Continuous ridgelet transform

Given an integrable bivariate function f(x), the continuous ridgelet transform (CRT) of f(x) is defined asR(a,b,θ)=ψa,b,θ(x)f(x)dxwhere ψa,b,θ is the ridgelets and is given byψa,b,θ(x)=a-1/2ψ((x1cosθ+x2sinθ-b)/a)here, ψ is the smooth univariate function with sufficient decay and satisfying the admissibility condition|ψ(ξ)|2/|ξ|2dξ<which holds only if ψ has a vanishing mean. The exact reconstruction formula isf(x)=02π-0R(a,b,θ)ψa,b,θ(x)daa3dbdθ4π

The CRT is similar to the 2-D continuous

Digital ridgelet transform

The fast implementation of the ridgelet transform can be performed in the Fourier domain. The block diagram for the implementation of digital ridgelet transform is shown in Fig. 1.

First compute the two dimensional Fourier transform, F(u, v) for the input image f(x, y). Using an interpolation scheme, substitute the sampled values of the Fourier transform obtained on the square lattice with the sampled values on a polar lattice. The pseudo-polar grid shown in Fig. 2 is used for this

Texture classification

Texture classification involves two phases, i.e., learning and classification. In the learning phase, the original image is decomposed using discrete ridgelet transform (DRT) as explained in Section 3. The band structure of DRT decomposed image of size 64 × 64 is shown in Fig. 3. Here 1st and 14th sub-bands contain approximation coefficients and the remaining sub-bands contain detailed coefficients.

Features such as mean and standard deviation are calculated from each of these sub-band using Eqs.

Experimental results and discussion

In this experiment, four different datasets containing 20, 30, 112 and 129 monochrome images respectively each of size 512 × 512 are used for analysis. Dataset-1 and Dataset-2 contains 20 and 30 monochrome images obtained from VisTex color image database and each texture image is subdivided into sixty four 64 × 64, sixteen 128 × 128 and four 256 × 256 non-overlapping image regions, so that a total of 1680, 2520 sub-image regions respectively will be in the databases. Dataset-3 is the full Brodatz

Conclusion

From the analysis of texture classification results obtained using ridgelet transform, it is inferred that the mean success rate is improved much. In this work the mean success rate achieved for the first three datasets shows good improvement over the mean success rate achieved using wavelet transform for the same datasets. First two datasets gives 0.9% and 0.3% improvement in mean success rate respectively, while the increase in mean success rate in the Dataset-3 is about 12.55%, when compared

Acknowledgements

The authors are grateful to the Management and Principal of Mepco Schlenk Engineering College, Sivakasi for their constant support and encouragement. The authors also extend their gratitude to the anonymous reviewers who have given very good suggestions for this better presentation of our manuscript.

References (33)

  • S. Arivazhagan et al.

    Texture classification using wavelet transform

    Pattern Recognition Letters

    (2003)
  • R. Bajcsy et al.

    Texture gradient as a depth cue

    Computer Graphics and Image Processing

    (1976)
  • M. Unser

    Local linear transforms for texture measurements

    Signal Processing

    (1986)
  • F. Argenti et al.

    Fast algorithms for texture analysis using co-occurrence matrices

    IEE Proceedings-F

    (1990)
  • Arivazhagan, S., 2004. Some studies on texture image analysis using wavelet transform and its usage in few industrial...
  • E.D. Bolker

    The finite Radon transform

    Contemporary Mathematics

    (1987)
  • Candes, J., 1998. Ridgelets: Theory and applications. Ph.D. Thesis, Department of Statistics, Stanford...
  • E.J. Candes et al.

    Ridgelets: A key to higher-dimensional intermittency

    Philosophical Transactions of the Royal Society of London, Series A

    (1999)
  • Chan, Y., Kung, S.Y., Lei, Z., 1997. A feature-based approach for image retrieval by sketch. In: Proceedings of the...
  • Chang, T., Kuo, C., 1992. Texture classification with tree-structured wavelet transform. In: Pattern Recognition...
  • T. Chang et al.

    Texture analysis and classification with tree-structured wavelet transform

    IEEE Transactions on Image Processing

    (1993)
  • Charles, A. Bouman, 1995. Markov random fields and stochastic image models. In: IEEE International Conference on Image...
  • G.R. Cross et al.

    Markov random field texture models

    IEEE Transactions on Pattern Analysis and Machine Intelligence

    (1983)
  • S.R. Deans

    The Radon Transform and Some of its Applications

    (1983)
  • DeBrunner, V., Kadiyala, M., 2000. Texture classification using wavelet transform. In: Circuits and Systems, 42nd...
  • Eric, D. Kolaczyk, 1994. Wavelet methods for the inversion of certain homogeneous linear operators in the presence of...
  • Cited by (65)

    • A two-fold transformation model for human action recognition using decisive pose

      2020, Cognitive Systems Research
      Citation Excerpt :

      RT is achieved by applying a discrete wavelet transform to each of the Radon’s projection. ( Arivazhagan et al., 2006) describe the Ridgelet based texture grouping and its invariant rotation stuff. The features such as energy, contrast, and similarity were developed from the sub-bands of the Ridgelet decomposition.

    • SVM-PSO based rotation-invariant image texture classification in SVD and DWT domains

      2016, Engineering Applications of Artificial Intelligence
      Citation Excerpt :

      The feature extraction of this method is performed by the sub-bands of the ridgelet decomposition. Also, a set of features can be obtained by calculating mean values, standard deviations, and co-occurrences of each of ridgelet sub-bands of an image (Arivazhagan et al., 2006). However, the ordinary ridgelet transform is not well fitting in dealing with texture images which often contain many edges.

    View all citing articles on Scopus
    View full text