Local Binary Pattern Code Research Articles

No-reference image quality assessment using local binary pattern in the wavelet domain

Objective quality assessment metrics that are consistent with human judgments of image quality, play an important role in many image processing applications. No-reference image quality assessment (NR-IQA) algorithms evaluate the quality of distorted images without any information about the reference images. In this paper, we propose an accurate and simple method for NR-IQA. In this method local binary pattern (LBP) operator is first applied to subbands of wavelet decomposed image separately; then histogram of LBP codes is calculated and concatenated to form quality aware features. Finally, support vector regression (SVR) is utilized to map the feature vectors to subjective quality scores. The experimental results for LIVE and TID2008 databases show that our proposed method is highly correlated to the subjective scores, and competitive to state-of-the-art NR-IQA methods.

Dark-spot segmentation for oil spill detection based on multifeature fusion classification in single-pol synthetic aperture radar imagery

In recent years, oil spill surveillance with space-borne synthetic aperture radar (SAR) has received unprecedented attention and has been gradually developed into a common technique for maritime environment protection. A typical SAR-based oil spill detection process consists of three steps: (1) dark-spot segmentation, (2) feature extraction, and (3) oil spill and look-alike discrimination. As a preliminary task in the oil spill detection process chain, dark-spot segmentation is a critical and fundamental step prior to feature extraction and classification, since its output has a direct impact on the two subsequent stages. The balance between the detection probability and false alarm probability has a vital impact on the performance of the entire detection system. Unfortunately, this problem has not drawn as much attention as the other two stages. A specific effort has been placed on dark-spot segmentation in single-pol SAR imagery. A combination of fine designed features, including gray features, geometric features, and textural features, is proposed to characterize the oil spill and seawater for improving the performance of dark-spot segmentation. In the proposed process chain, a histogram stretching transform is incorporated before the gray feature extraction to enhance the contrast between possible oil spills and water. A simple but effective multiple-level thresholding algorithm is developed to conduct a binary classification before the geometric feature extraction to obtain more accurate area features. A local binary pattern code is computed and assigned as the textural feature for a pixel to characterize the physical difference between oil spills and water. The experimental result confirms that the proposed fine designed feature combination outperforms existing approaches in both aspects of overall segmentation accuracy and the capability to balance detection probability and false alarm probability. It is a promising alternative that can be incorporated into existing oil spill detection systems to further improve system performance.

Fusion of color histogram and LBP-based features for texture image retrieval and classification

The Local Binary Pattern (LBP) operator and its variants play an important role as the image feature extractor in the textural image retrieval and classification. The LBP-based operator extracts the textural information of an image by considering the neighboring pixel values. A single or join histogram can be derived from the LBP code which can be used as an image feature descriptor in some applications. However, the LBP-based feature is not a good candidate in capturing the color information of an image, making it is less suitable for measuring the similarity of color images with rich color information. This work overcomes this problem by adding an additional color feature, namely Color Information Feature (CIF), along with the LBP-based feature in the image retrieval and classification systems. The CIF and LBP-based feature adequately represent the color and texture features. As documented in the experimental result, the hybrid CIF and LBP-based feature presents a promising result and outperforms the existing methods over several image databases. Thus, it can be a very competitive candidate in retrieval and classification application.

Integration of wavelet transform, Local Binary Patterns and moments for content-based image retrieval

The proliferation of large number of images has made it necessary to develop systems for indexing and organizing images for easy access. This has made Content-Based Image Retrieval (CBIR) an important area of research in Computer Vision. This paper proposes a combination of features in multiresolution analysis framework for image retrieval. In this work, the concept of multiresolution analysis has been exploited through the use of wavelet transform. This paper combines Local Binary Pattern (LBP) with Legendre Moments at multiple resolutions of wavelet decomposition of image. First, LBP codes of Discrete Wavelet Transform (DWT) coefficients of images are computed to extract texture feature from image. The Legendre Moments of these LBP codes are then computed to extract shape feature from texture feature for constructing feature vectors. These feature vectors are used to search and retrieve visually similar images from large database. The proposed method has been tested on five benchmark datasets, namely, Corel-1K, Olivia-2688, Corel-5K, Corel-10K, and GHIM-10K, and performance of the proposed method has been measured in terms of precision and recall. The experimental results demonstrate that the proposed method outperforms some of the other state-of-the-art methods in terms of precision and recall.

Topology-based image segmentation using LBP pyramids

In this paper, we present a new image segmentation algorithm which is based on local binary patterns (LBPs) and the combinatorial pyramid and which preserves structural correctness and image topology. For this purpose, we define a codification of LBPs using graph pyramids. Since the LBP code characterizes the topological category (local max, min, slope, saddle) of the gray level landscape around the center region, we use it to obtain a minimal image representation in terms of the topological characterization of a given 2D grayscale image. Based on this idea, we further describe our hierarchical texture aware image segmentation algorithm and compare its segmentation output and the minimal image representation.

Sub Oriented Histograms of Local Binary Patterns for Smoke Detection and Texture Classification

Local Binary Pattern (LBP) and its variants have powerful discriminative capabilities but most of them just consider each LBP code independently. In this paper, we propose sub oriented histograms of LBP for smoke detection and image classification. We first extract LBP codes from an image, compute the gradient of LBP codes, and then calculate sub oriented histograms to capture spatial relations of LBP codes. Since an LBP code is just a label without any numerical meaning, we use Hamming distance to estimate the gradient of LBP codes instead of Euclidean distance. We propose to use two coordinates systems to compute two orientations, which are quantized into discrete bins. For each pair of the two discrete orientations, we generate a sub LBP code map from the original LBP code map, and compute sub oriented histograms for all sub LBP code maps. Finally, all the sub oriented histograms are concatenated together to form a robust feature vector, which is input into SVM for training and classifying. Experiments how that our approach not only has better performance than existing methods in smoke detection, but also has good performance in texture classification.

Robust Texture Classification by Aggregating Pixel-Based LBP Statistics

This letter addresses the texture classification problem through a pixel-based local binary pattern (LBP) statistics aggregation mechanism. Real-world texture images often present challenges for classification algorithms in terms of intra-class variability due, among others, to variable illumination. The LBP operator, a state-of-the-art texture descriptor, possesses key properties for tackling real-world texture images: discriminative power and invariance against monotonic gray level changes. We propose a novel texture classification approach that increases the robustness of LBP-based methods with respect to any type of intra-class variations. The method locally characterizes each pixel with an LBP code histogram and globally computes the label of a textured image by aggregating pixel labels through a voting process. Our approach can be in principle applied to any LBP version, as it focuses on how statistics are computed from LBP codes. We show that the proposed pixel-based approach improves upon traditional LBP block-based approaches in terms of classification accuracy by up to 5.1 p.p. on the public Outex database for the classic LBP with various neighborhoods as well as for various LBP extensions.

Evaluation of LBP-Based Facial Emotions Recognition Techniques to Make Consistent Decisions

Decision making is one of the smouldering problems in day to day works. Human emotions play crucial role in decision-making systems. While person is in high emotion he cannot make proper decision. Robust local binary pattern (RLBP) operator is more powerful to recognize the emotions and extends the features of local binary pattern (LBP). However, there are some precincts like discriminating bright faces against dark features and vice versa and intra-class variances increase. The RLBP solves this problem by finding minimum of LBP codes and their complements. However, it miss the mark for different local structures a similar feature is obtained, weak contrast local patterns and similar strong contrast local patterns. Hence, the discriminative robust local binary pattern (DRLBP) method is proposed to retain the contrast information of image patterns next to considering both edge and texture information. Nevertheless, LBP family methods are highly sensitive to noise. To trounce these drawbacks this paper extends fuzzy rule-based DRLBP which is more robust to noise, low contrasted, uneven lighting conditions, variations in expressions and rotation variant images.

Dynamic texture recognition based on completed volume local binary pattern

Dynamic textures are the sequences of images of moving scenes having some stationary properties in time; these include sea-waves, smoke, foliage, whirlwind etc. In recent years, dynamic texture description and recognition has attracted growing attention. This paper presents a more effective completed modeling of volume local binary pattern (VLBP) to recognize dynamic textures. Due to the dependency on local binary pattern (LBP), traditional VLBP also suffers with noise sensitivity and may give the same LBP code to different structural patterns; thus limiting the discriminating power of a texture descriptor. To represent temporal textures we have used VLBP. Local region of a volume is represented using its center frame and local sign magnitude difference with the circularly symmetric neighborhood. We have proposed a new contrast operator to complement the sign information of the temporal texture. To add additional discriminative information, volume center pixel information is also fused with the sign magnitude difference of texture. By combining these features into hybrid distributions we get higher classification accuracy for rotation invariant texture classification. Experimental results on UCLA and Dyntex databases show that the proposed approach provides better performance in comparison to the existing approaches.

Infrared face recognition based on LBP co-occurrence matrix and partial least squares

Infrared face recognition, being light-independent, and not vulnerable to facial skin, expressions and posture, can avoid or limit the drawbacks of face recognition in visible light. This paper proposes an infrared face recognition method based on Local Binary Pattern (LBP) co-occurrence matrix. In traditional LBP-based features such as LBP histogram, space locations information, which is an important feature for recognition, is discarded. Considering such spatial relations in infrared faces, we introduce co-occurrence matrix of LBP codes, instead of histogram, to obtain more discriminative representation for location features. To cope with the high dimensions of LBP co-occurrence matrix, the final classifier formulates Partial Least Squares (PLS) regression for accurate classification. The experimental results show combination of LBP co-occurrence matrix and PLS achieve better infrared face recognition performance compared to state-of-the-art approaches.

Texton Based Image Retrieval Using Indexed LBP Transitions

The present paper derived a new model of texture image retrieval by integrating the transitions on Local Binary Pattern (LBP) with textons and Grey Level Co-occurrence Matrix (GLCM). The present paper initially derived transitions that occur from 0 to 1 or 1 to 0 in circular manner on LBP. The transitions reduce the 256 LBP codes into five texture features. This reduces the lot of complexity. The LBP codes are rotationally variant. The proposed circular transitions on LBP are rotationally invariant. Textons,which represents the local relationships,are detected on this. The GLCM features are evaluated on the texton based image for efficient image retrieval. The proposed method is experimented on a huge data base of textures collected from Google data base. The experimental result indicates the efficiency of the proposed model.

Finger Vein Recognition Using Generalized Local Line Binary Pattern

Finger vein images contain rich oriented features. Local line binary pattern (LLBP) is a good oriented feature representation method extended from local binary pattern (LBP), but it is limited in that it can only extract horizontal and vertical line patterns, so effective information in an image may not be exploited and fully utilized. In this paper, an orientation-selectable LLBP method, called generalized local line binary pattern (GLLBP), is proposed for finger vein recognition. GLLBP extends LLBP for line pattern extraction into any orientation. To effectually improve the matching accuracy, the soft power metric is employed to calculate the matching score. Furthermore, to fully utilize the oriented features in an image, the matching scores from the line patterns with the best discriminative ability are fused using the Hamacher rule to achieve the final matching score for the last recognition. Experimental results on our database, MMCBNU_6000, show that the proposed method performs much better than state-of-the-art algorithms that use the oriented features and local features, such as LBP, LLBP, Gabor filter, steerable filter and local direction code (LDC).

LBP-Based Edge-Texture Features for Object Recognition

This paper proposes two sets of novel edge-texture features, Discriminative Robust Local Binary Pattern (DRLBP) and Ternary Pattern (DRLTP), for object recognition. By investigating the limitations of Local Binary Pattern (LBP), Local Ternary Pattern (LTP) and Robust LBP (RLBP), DRLBP and DRLTP are proposed as new features. They solve the problem of discrimination between a bright object against a dark background and vice-versa inherent in LBP and LTP. DRLBP also resolves the problem of RLBP whereby LBP codes and their complements in the same block are mapped to the same code. Furthermore, the proposed features retain contrast information necessary for proper representation of object contours that LBP, LTP, and RLBP discard. Our proposed features are tested on seven challenging data sets: INRIA Human, Caltech Pedestrian, UIUC Car, Caltech 101, Caltech 256, Brodatz, and KTH-TIPS2-a. Results demonstrate that the proposed features outperform the compared approaches on most data sets.

An effective scheme for image texture classification based on binary local structure pattern

Effectiveness of local binary pattern (LBP) features is well proven in the field of texture image classification and retrieval. This paper presents a more effective completed modeling of the LBP. The traditional LBP has a shortcoming that sometimes it may represent different structural patterns with same LBP code. In addition, LBP also lacks global information and is sensitive to noise. In this paper, the binary patterns generated using threshold as a summation of center pixel value and average local differences are proposed. The proposed local structure patterns (LSP) can more accurately classify different textural structures as they utilize both local and global information. The LSP can be combined with a simple LBP and center pixel pattern to give a completed local structure pattern (CLSP) to achieve higher classification accuracy. In order to make CLSP insensitive to noise, a robust local structure pattern (RLSP) is also proposed. The proposed scheme is tested over three representative texture databases viz. Outex, Curet, and UIUC. The experimental results indicate that the proposed method can achieve higher classification accuracy while being more robust to noise.

Towards Understanding the Formation of Uniform Local Binary Patterns

The research reported in this paper focuses on the modeling of Local Binary Patterns (LBPs) and presents an a priori model where LBPs are considered as combinations of permutations. The aim is to increase the understanding of the mechanisms related to the formation of uniform LBPs. Uniform patterns are known to exhibit high discriminative capability; however, so far the reasons for this have not been fully explored. We report an observation that although the overall a priori probability of uniform LBPs is high, it is mostly due to the high probability of only certain classes of patterns, while the a priori probability of other patterns is very low. In order to examine this behavior, the relationship between the runs up and down test for randomness of permutations and the uniform LBPs was studied. Quantitative experiments were then carried out to show that the relative effect of uniform patterns to the LBP histogram is strengthened with deterministic data, in comparison with the i.i.d. model. This was verified by using an a priori model as well as through experiments with natural image data. It was further illustrated that specific uniform LBP codes can also provide responses to salient shapes, that is, to monotonically changing intensity functions and edges within the image microstructure.

Noise-Resistant Local Binary Pattern With an Embedded Error-Correction Mechanism

Local binary pattern (LBP) is sensitive to noise. Local ternary pattern (LTP) partially solves this problem. Both LBP and LTP, however, treat the corrupted image patterns as they are. In view of this, we propose a noise-resistant LBP (NRLBP) to preserve the image local structures in presence of noise. The small pixel difference is vulnerable to noise. Thus, we encode it as an uncertain state first, and then determine its value based on the other bits of the LBP code. It is widely accepted that most of the image local structures are represented by uniform codes and noise patterns most likely fall into the non-uniform codes. Therefore, we assign the value of an uncertain bit hence as to form possible uniform codes. Thus, we develop an error-correction mechanism to recover the distorted image patterns. In addition, we find that some image patterns such as lines are not captured in uniform codes. Those line patterns may appear less frequently than uniform codes, but they represent a set of important local primitives for pattern recognition. Thus, we propose an extended noise-resistant LBP (ENRLBP) to capture line patterns. The proposed NRLBP and ENRLBP are more resistant to noise compared with LBP, LTP, and many other variants. On various applications, the proposed NRLBP and ENRLBP demonstrate superior performance to LBP/LTP variants.

Image‐splicing forgery detection based on local binary patterns of DCT coefficients

AbstractThe wide use of high‐performance image acquisition devices and powerful image‐processing software has made it easy to tamper images for malicious purposes. Image splicing, which has constituted a menace to integrity and authenticity of images, is a very common and simple trick in image tampering. Therefore, image‐splicing detection is of great importance in digital forensics. In this paper, an effective framework for revealing image‐splicing forgery is proposed. First, the local binary pattern operator is used to model magnitude components of two‐dimensional arrays obtained by applying multisize block discrete cosine transform to test images. Then, all of bins of histograms computed from local binary pattern codes are served as discriminative features for image‐splicing detection. After that, kernel principal component analysis is utilized to reduce the dimensionality of the proposed features to avoid the high computational complexity, high mutual correlation among the constructed features and possible overfitting for support vector machine classifier. Finally, support vector machine classifier is employed to distinguish spliced images from authentic images by using the final dimensionality‐reduced feature set. The experiment results show that the proposed method can perform better than some state‐of‐the‐art methods in terms of the detection performance over the Columbia image‐splicing detection evaluation dataset. Copyright © 2013 John Wiley & Sons, Ltd.

Extended local binary patterns for texture classification

This paper presents a novel approach for texture classification, generalizing the well-known local binary pattern (LBP) approach. In the proposed approach, two different and complementary types of features (pixel intensities and differences) are extracted from local patches. The intensity-based features consider the intensity of the central pixel (CI) and those of its neighbors (NI); while for the difference-based feature, two components are computed: the radial-difference (RD) and the angular-difference (AD). Inspired by the LBP approach, two intensity-based descriptors CI-LBP and NI-LBP, and two difference-based descriptors RD-LBP and AD-LBP are developed. All four descriptors are in the same form as conventional LBP codes, so they can be readily combined to form joint histograms to represent textured images. The proposed approach is computationally very simple: it is totally training-free, there is no need to learn a texton dictionary, and no tuning of parameters. We have conducted extensive experiments on three challenging texture databases (Outex, CUReT and KTHTIPS2b). Outex results show significant improvements over the classical LBP approach, which clearly demonstrates the great power of the joint distributions of these proposed descriptors for gray-scale and rotation invariant texture classification. The proposed method produces the best classification results on KTHTIPS2b, and results comparable to the state-of-the-art on CUReT.

Local multiple patterns based multiresolution gray-scale and rotation invariant texture classification

The local binary pattern (LBP) is a robust but computationally simple approach in texture analysis. However, LBP does not have enough information to discriminate among multiple patterns due to its binary patterns only comprising of 0s and 1s. Thus, a multi-resolution gray-scale and rotation invariant texture classification based on local multiple patterns (LMP) is proposed in the paper. The LMP extends binary patterns to multiple patterns, which can preserve more structural information, and be more suitable for image analysis, including the analysis of flat image areas, in which case LBP code is often a random value and thus unsuitable. In addition, several extensions to the LMP, including multi-resolution analysis with the “uniform” LMP with rotation invariance, are presented. The “uniform” LMP can be regarded as a gray-scale and rotation invariant description in various applications and its discrete occurrence histogram over a region of image is proved to be a powerful invariant texture feature. Experimental results of multi-resolution texture classification with support vector machine show that the proposed method obtains overall better performance than other common methods in several aspects of space-resolution and gray-scale variation, rotation, and noise.

Finger vein recognition using weighted local binary pattern code based on a support vector machine

Finger vein recognition is a biometric technique which identifies individuals using their unique finger vein patterns. It is reported to have a high accuracy and rapid processing speed. In addition, it is impossible to steal a vein pattern located inside the finger. We propose a new identification method of finger vascular patterns using a weighted local binary pattern (LBP) and support vector machine (SVM). This research is novel in the following three ways. First, holistic codes are extracted through the LBP method without using a vein detection procedure. This reduces the processing time and the complexities in detecting finger vein patterns. Second, we classify the local areas from which the LBP codes are extracted into three categories based on the SVM classifier: local areas that include a large amount (LA), a medium amount (MA), and a small amount (SA) of vein patterns. Third, different weights are assigned to the extracted LBP code according to the local area type (LA, MA, and SA) from which the LBP codes were extracted. The optimal weights are determined empirically in terms of the accuracy of the finger vein recognition. Experimental results show that our equal error rate (EER) is significantly lower compared to that without the proposed method or using a conventional method.