• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.4
• /
• pp.2078-2093
• /
• 2019

Visual smoke recognition is a challenging task due to large variations in shape, texture and color of smoke. To improve performance, we propose a novel smoke recognition method by combining dual-encoded features that are extracted from both spatial and Curvelet domains. A Curvelet transform is used to filter an image to generate fifty sub-images of Curvelet coefficients. Then we extract Local Binary Pattern (LBP) maps from these coefficient maps and aggregate histograms of these LBP maps to produce a histogram map. Afterwards, we encode the histogram map again to generate Dual-encoded Local Binary Patterns (Dual-LBP). Histograms of Dual-LBPs from Curvelet domain and Completed Local Binary Patterns (CLBP) from spatial domain are concatenated to form the feature for smoke recognition. Finally, we adopt Gaussian Kernel Optimization (GKO) algorithm to search the optimal kernel parameters of Support Vector Machine (SVM) for further improvement of classification accuracy. Experimental results demonstrate that our method can extract effective and reasonable features of smoke images, and achieve good classification accuracy.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.26 no.4
• /
• pp.316-320
• /
• 2016

In this paper, we presents a pattern recognition by considering the spatial co-occurrence among micro-patterns of texture images. The micro-patterns of texture image have been extracted by local binary pattern based on median(MLBP) of block image, and the recognition process is based on co-occurrence among MLBPs. The MLBP is applied not only to consider the local character but also analyze the pattern in order to be robust noise, and spatial co-occurrence is also applied to improve the recognition performance by considering the global space of image. The proposed method has been applied to recognized 17 RGB images of 120*120 pixels from Mayang texture image based on Euclidean distance. The experimental results show that the proposed method has a texture recognition performance.

• Journal of the Semiconductor & Display Technology
• /
• v.8 no.3
• /
• pp.39-44
• /
• 2009

Local Binary Pattern (LBP) is becoming a popular tool for various machine vision applications such as face recognition, classification and background subtraction. In this paper, we propose a new extension of LBP, called the Diagonal LBP (DLBP), to handle the image-based gender classification problem arise in interactive display systems. Instead of comparing neighbor pixels with the center pixel, DLBP generates codes by comparing a neighbor pixel with the diagonal pixel (the neighbor pixel in the opposite side). It can reduce by half the code length of LBP and consequently, can improve the computation complexity. The Support Vector Machine is utilized as the gender classifier, and the texture profile based on DLBP is adopted as the feature vector. Experimental results revealed that our approach based on the diagonal LPB is very efficient and can be utilized in various real-time pattern classification applications.

• Journal of Broadcast Engineering
• /
• v.18 no.3
• /
• pp.372-379
• /
• 2013

In this paper, we proposed a content-based image retrieval algorithm using local binary patterns and HSV color histogram. Images are retrieved using image input in image retrieval system. Many researches are based on global feature distribution such as color, texture and shape. These techniques decrease the retrieval performance in images which contained background the large amount of image. To overcome this drawback, the proposed method extract background fast and emphasize the feature of object by shrinking the background. The proposed method uses HSV color histogram and Local Binary Patterns. We also extract the Local Binary Patterns in quantized Hue domain. Experimental results show that the proposed method 82% precision using Corel 1000 database.

• Journal of Information Processing Systems
• /
• v.14 no.2
• /
• pp.469-486
• /
• 2018

We propose an enhanced version of the local binary pattern (LBP) operator for texture extraction in images in the context of image retrieval. The novelty of our proposal is based on the observation that the LBP exploits only the lowest kind of local information through the global histogram. However, such global Histograms reflect only the statistical distribution of the various LBP codes in the image. The block based LBP, which uses local histograms of the LBP, was one of few tentative to catch higher level textural information. We believe that important local and useful information in between the two levels is just ignored by the two schemas. The newly developed method: gradual locality integration of binary patterns (GLIBP) is a novel attempt to catch as much local information as possible, in a gradual fashion. Indeed, GLIBP aggregates the texture features present in grayscale images extracted by LBP through a complex structure. The used framework is comprised of a multitude of ellipse-shaped regions that are arranged in circular-concentric forms of increasing size. The framework of ellipses is in fact derived from a simple parameterized generator. In addition, the elliptic forms allow targeting texture directionality, which is a very useful property in texture characterization. In addition, the general framework of ellipses allows for taking into account the spatial information (specifically rotation). The effectiveness of GLIBP was investigated on the Corel-1K (Wang) dataset. It was also compared to published works including the very effective DLEP. Results show significant higher or comparable performance of GLIBP with regard to the other methods, which qualifies it as a good tool for scene images retrieval.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.4
• /
• pp.1807-1823
• /
• 2016

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 show that our approach not only has better performance than existing methods in smoke detection, but also has good performance in texture classification.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.5
• /
• pp.1766-1784
• /
• 2014

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).

• Journal of the Korean Institute of Intelligent Systems
• /
• v.25 no.5
• /
• pp.483-488
• /
• 2015

This paper presents a local binary pattern(LBP) for effectively classifying textures, which is based on the multidimensional intensity difference between the adjacent pixels in the block image. The intensity difference by considering the a extent of 4 directional changes(verticality, horizontality, diagonality, inverse diagonality) in brightness between the adjacent pixels is applied to reduce the computation load as a results of decreasing the levels of histogram for classifying textures of image. And the binary patterns that is represented by the relevant intensities within a block image, is also used to effectively classify the textures by accurately reflecting the local attributes. The proposed method has been applied to classify 24 block images from USC Texture Mosaic #2 of 128*128 pixels gray image. The block images are different in size and texture. The experimental results show that the proposed method has a speedy classification and makes a free size block images classify possible. In particular, the proposed method gives better results than the conventional LBP by increasing the range of histogram level reduction as the block size becomes larger.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2015.10a
• /
• pp.1358-1360
• /
• 2015

본 논문에서는 MB-LBP(Multi-scale Block Local Binary Patterns)와 공간피라미드를 이용하여 생성된 특징을 랜덤 포레스트(Random Forest) 분류기에 적용하여 영상내의 표지판 속도를 인식하는 알고리즘을 제안한다. 입력 영상에서 표지판 영역은 다양한 위치와 크기를 가지며 주위 배경이 후보 영역에 포함되므로 먼저 입력 영상에 원형 Hough Transform을 적용하여 원형의 표지판 후보 영역만을 검출한다. 그 후 영상의 화질을 향상시키기 위해 히스토그램 평활화와 모폴로지 연산을 적용하여 표지판의 숫자 영역과 배경 영역의 대비를 높이도록 한다. 표지판의 크기 변화에 강건한 시스템의 구현을 위해 후보 영역에서 LBP(Local Binary Patterns)보다 우수한 성능을 보이는 MB-LBP를 적용하고, 다양한 크기의 속도 표지판을 인식하기 위해 공간 피라미드를 사용하여 지역적 특징과 전역적 특징 모두를 추출하였다. 추출된 특징은 랜덤 포레스트(Random Forest)를 이용하여 각 9개의 속도 표지판으로 분류, 각 속도별 클래스에 대한 인식 성능을 측정하였다.

• Asian Pacific Journal of Cancer Prevention
• /
• v.17 no.11
• /
• pp.4869-4873
• /
• 2016

Colonoscopy is currently the best technique available for the detection of colon cancer or colorectal polyps or other precursor lesions. Computer aided detection (CAD) is based on very complex pattern recognition. Local binary patterns (LBPs) are strong illumination invariant texture primitives. Histograms of binary patterns computed across regions are used to describe textures. Every pixel is contrasted relative to gray levels of neighbourhood pixels. In this study, colorectal polyp detection was performed with colonoscopy video frames, with classification via J48 and Fuzzy. Features such as color, discrete cosine transform (DCT) and LBP were used in confirming the superiority of the proposed method in colorectal polyp detection. The performance was better than with other current methods.