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

• KIPS Transactions on Software and Data Engineering
• /
• v.2 no.3
• /
• pp.205-208
• /
• 2013

Generally, binary pattern transforms have been used in the field of the face recognition and facial expression, since they are robust to illumination. Thus, this paper proposes an illumination-robust face recognition system combining an MLDP, which improves the texture component of the LDP, and a 2D-PCA algorithm. Unlike that binary pattern transforms such as LBP and LDP were used to extract histogram features, the proposed method directly uses the MLDP image for feature extraction by 2D-PCA. The performance evaluation of proposed method was carried out using various algorithms such as PCA, 2D-PCA and Gabor wavelets-based LBP on Yale B and CMU-PIE databases which were constructed under varying lighting condition. From the experimental results, we confirmed that the proposed method showed the best recognition accuracy.

• International Journal of Automotive Technology
• /
• v.7 no.2
• /
• pp.227-235
• /
• 2006

In this paper a robust image processing method with modified Otsu algorithm to recognize the road lane for a real-time controlled autonomous vehicle is presented. The main objective of a proposed method is to drive an autonomous vehicle safely irrespective of road image qualities. For the steering of real-time controlled autonomous vehicle, a detection area is predefined by lane segment, with previously obtained frame data, and the edges are detected on the basis of a lane width. For stable as well as psudo-robust autonomous driving with "good", "shady" or even "bad" road profiles, the variable threshold with modified Otsu algorithm in the image histogram, is utilized to obtain a binary image from each frame. Also Hough transform is utilized to extract the lane segment. Whether the image is "good", "shady" or "bad", always robust and reliable edges are obtained from the algorithms applied in this paper in a real-time basis. For verifying the adaptability of the proposed algorithm, a miniature vehicle with a camera is constructed and tested with various road conditions. Also, various highway road images are analyzed with proposed algorithm to prove its usefulness.

• Journal of Korea Multimedia Society
• /
• v.12 no.2
• /
• pp.191-199
• /
• 2009

In this paper, the improved edge extract methods is proposed in order to extract edge. For the correct and fast detect, the binary image using the threshold value is applied for a experiment. For the experimental analysis, we compare the existing edge methods with the improved methods. Hereby, the exist methods are the sobel, robert, and prewitt. and the improved methods use the existing methods which is applied mask variations. The merits of the improved mothods have a result of a little erosion, a apparent edge. Specially, we use the grey image of medical image for the experimental analysis and then apply threshold value for a result image. After that, we acquire a apparent edge. For a quantitative analysis of the each methods, the each images was applied a histogram. As a result, we prove the merit of the improved methods using a analytical graph of the medical images.

• Proceedings of the KIEE Conference
• /
• 1996.07b
• /
• pp.1398-1400
• /
• 1996

In this paper, a method of the decision of the road direction for ALV(Autonomous Land Vehicle) road following by region-based segmentation is presented. The decision of the road direction requires extracting road regions from images in real-time to guide the navigation of ALV on the roadway. Two thresholds to discriminate between road and non-road region in the image are easily decided, using knowledge of problem region and polygonal approximation that searches multiple peaks and valleys in histogram of a road image. The most likely road region of the binary image is selected from original image by these steps. The location of a vanishing point to indicate the direction of the road can be obtained applying it to X-Y profile of the binary road region again. It can successfully steer a ALV along a road reliably, even in the presence of fluctuation of illumination condition, bad road surface condition such as hidden boundaries, shadows, road patches, dirt and water stains, and unusual road condition. Pyramid structure also saves time in processing road images and a real-time image processing for achieving navigation of ALV is implemented. The efficacy of this approach is demonstrated using several real-world road images.

• KIPS Transactions on Software and Data Engineering
• /
• v.2 no.4
• /
• pp.273-280
• /
• 2013

This paper presents novel OCS-LBP (Oriented Center Symmetric Local Binary Patterns) based on orientation of pixel gradient and image retrieval system based on BoF (Bag-of-Feature) and random forest classifier. Feature vectors extracted from training data are clustered into code book and each feature is transformed new BoF feature using code book. BoF features are applied to random forest for training and random forest having N classes is constructed by combining several decision trees. For testing, the same OCS-LBP feature is extracted from a query image and BoF is applied to trained random forest classifier. In contrast to conventional retrieval system, query image selects similar K-nearest neighbor (K-NN) classes after random forest is performed. Then, Top K similar images are retrieved from database images that are only labeled K-NN classes. Compared with other retrieval algorithms, the proposed method shows both fast processing time and improved retrieval performance.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.11C
• /
• pp.1076-1082
• /
• 2005

Recently, there have been much efforts in the image segmentation using morphological approach. Among them, the watershed algorithm is one of powerful tools which can take advantages of both of the conventional edge-based segmentation and region-based segmentation. The concept of watershed is based on topographic analogy. But, its high sensitivity to noise yields a very large number of resulting segmented regions which leads to oversegmentation. So we suggest the restricted waterfall algorithm which reduce the oversegmentation by eliminate not only local minima but also local maxima. As a result, the restricted waterfall algorithm has a good segmented image than the other methods, and has a better binary image than the histogram thresholding method.

• Journal of Korea Multimedia Society
• /
• v.7 no.1
• /
• pp.98-105
• /
• 2004

In this paper, we proposed a watermarking algorithm for embedding visually recognizable pattern into the middle-frequency part:; of image. Binary image as watermark is embedded in the LH2, HL2 and HH2 band of wavelet transformed domain for copyright protection of image data. To evaluate robustness of the proposed method, we applied some basic algorithm of image processing such as scaling, filtering, cropping, histogram equalizing and lossy compression(JPEG, gif). As a result of experiment, the proposed method has the good image quality and the high perceptibility of watermark. It was demonstrated by experiments that the proposed algorithm can provide an excellent protection under various attacks.

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

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.49 no.2
• /
• pp.61-74
• /
• 2012

In this paper, we propose a illumination-robust face recognition system using MCS-LBP and 2D-PCA algorithm. A binary pattern transform which has been used in the field of the face recognition and facial expression, has a characteristic of robust to illumination. Thus, this paper propose MCS-LBP which is more robust to illumination than previous LBP, and face recognition system fusing 2D-PCA algorithm. The performance evaluation of proposed system was performed by using various binary pattern images and well-known face recognition features such as PCA, LDA, 2D-PCA and ULBP histogram of gabor images. In the process of performance evaluation, we used a YaleB face database, an extended YaleB face database, and a CMU-PIE face database that are constructed under varying lighting condition, and the proposed system which consists of MCS-LBP image and 2D-PCA feature show the best recognition accuracy.