Scale and orientation matching for texture analysis and recognition

Authors:
Nguyen Cao Truong Hai;Do-Yeon Kim;Hyuk-Ro Park
Affiliations:
Chonnam National University, Gwangju, South Korea;Chonnam National University, Gwangju, South Korea;Chonnam National University, Gwangju, South Korea
Venue:
Proceedings of the 6th International Conference on Ubiquitous Information Management and Communication
Year:
2012

Citing 7
Cited 0

Spatial frequency channels and perceptual grouping in texture segregation

Computer Vision, Graphics, and Image Processing - Special issue on human and machine vission, part II
Texture Classification Using Windowed Fourier Filters

IEEE Transactions on Pattern Analysis and Machine Intelligence
Texture Features and Learning Similarity

CVPR '96 Proceedings of the 1996 Conference on Computer Vision and Pattern Recognition (CVPR '96)
Rotation-invariant and scale-invariant Gabor features for texture image retrieval

Image and Vision Computing
A New Approach to Estimate Fractal Dimension of Texture Images

ICISP '08 Proceedings of the 3rd international conference on Image and Signal Processing
Texture analysis using graphs generated by deterministic partially self-avoiding walks

Pattern Recognition
Markov Random Field Texture Models

IEEE Transactions on Pattern Analysis and Machine Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

Texture is a necessary visual feature for image analysis. Many approaches have been proposed to model and analyze texture feature. Generally, researches try to use statistics results on visual features at different scales along various orientations in spatial or frequency domain as texture feature. These features are later compared without considering the scale of texture at the time of extracting information. This neglect probably leads to mismatching right texture matches. This paper contributes three matching schemes (SMS, OMS, and SOMS) to solve the problem. In these schemes, texture feature is not only extracted across scales along various orientations but compared at different scales and orientations as well. A database including texture images at different sizes, scales and orientations is generated to evaluate the performance of schemes. Besides, three modified versions of K-means algorithm are also applied on the database to automatically cluster the patterns. The purpose is to exhaustively examine the performance of proposed schemes under unpromising conditions. The experimental results show that the proposed schemes works well on generated database with various types of texture presented at difference sizes, scales and orientations.