Developing a New Version of Local Binary Patterns for Texture Classification

Texture classification is one of the main steps in image processing and computer vision applications. Feature extraction is the first step of texture classification process which plays a main role. Many approaches have proposed to classify textures since now. Among them, Local Binary Patterns and Modified Local Binary Patterns, because of simplicity and classification accuracy, have emerged as one of the most popular ones. The Local Binary Patterns have simple implementation, but with increase in the radius of neighborhood, computational complexity will be increased. Modified Local Binary Patterns assigns various labels to uniform textures and a unique label to all non-uniform ones. In this respect, the modified local binary pattern cant classify non uniform textures as well as uniform ones. In this paper a new version of Local Binary Pattern is proposed that has less computational complexity than Local Binary Patterns and more classification accuracy than Modified version. The proposed approach classifies non uniform textures as well as uniform ones. Also with change in the length of central gray level intervals, locality and globally of the features can be controlled. Classification accuracy on two standard datasets, Brodatz and Outex, indicates the efficiency of the proposed approach.