• Journal of Information Processing Systems
• /
• v.14 no.3
• /
• pp.666-679
• /
• 2018

The discrete wavelet transform (DWT) has good multi-resolution decomposition characteristic and its low frequency component contains the basic information of an image. Based on this, a fragile watermarking using the local binary pattern (LBP) and DWT is proposed for image authentication. In this method, the LBP pattern of low frequency wavelet coefficients is adopted as a feature watermark, and it is inserted into the least significant bit (LSB) of the maximum pixel value in each block of host image. To guarantee the safety of the proposed algorithm, the logistic map is applied to encrypt the watermark. In addition, the locations of the maximum pixel values are stored in advance, which will be used to extract watermark on the receiving side. Due to the use of DWT, the watermarked image generated by the proposed scheme has high visual quality. Compared with other state-of-the-art watermarking methods, experimental results manifest that the proposed algorithm not only has lower watermark payloads, but also achieves good performance in tamper identification and localization for various attacks.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.9 no.5
• /
• pp.261-268
• /
• 2014

Face detection is essential to the full automation of face image processing application system such as face recognition, facial expression recognition, age estimation and gender identification. It is found that local image features which includes Haar-like, LBP, and MCT and the Adaboost algorithm for classifier combination are very effective for real time face detection. In this paper, we present a face detection method using local pixel direction code(PDC) feature and lookup table classifiers. The proposed PDC feature is much more effective to dectect the faces than the existing local binary structural features such as MCT and LBP. We found that our method's classification rate as well as detection rate under equal false positive rate are higher than conventional one.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2016.04a
• /
• pp.708-711
• /
• 2016

일반적인 얼굴인식 시스템에서는 얼굴표현과 얼굴분류 과정을 통하여 얼굴인식을 수행한다. 얼굴표현 방법으로는 LBP(Local Binary Pattern) 방법이 많이 사용되고 있다. 얼굴분류 방법으로는 신경망을 이용하여 미리 학습을 시켜놓기 때문에 수행시간이 매우 짧은 신경망 방법이 많이 사용되고 있다. 이때 얼굴표현 과정에서 LBP를 사용한 후 신경망을 사용하여 얼굴분류를 수행하면 인식률이 낮고 학습시간이 오래 걸리는 문제점이 있다. 따라서 본 논문에서는 신경망을 이용하여 얼굴 인식 과정을 수행하기 적합한 얼굴 표현 과정인 라플라시안 필터를 이용한 알고리즘을 제안한다. LBP와 신경망을 이용한 얼굴인식 과정과 본 논문에서 제안한 얼굴인식 과정을 비교분석한 실험결과, 본 논문에서 제안한 방법이 학습에 걸리는 시간과 인식률이 우수함을 보였다.

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

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.5A
• /
• pp.375-387
• /
• 2012

This paper proposes a new real-time object tracking algorithm using particle filters with color and texture features in moving CCD camera images. If the user selects an initial object, this region is declared as a target particle and an initial state is modeled. Then, N particles are generated based on random distribution and CS-LBP (Centre Symmetric Local Binary Patterns) for texture model and weighted color distribution is modeled from each particle. For observation likelihoods estimation, Bhattacharyya distance between particles and their feature models are calculated and this observation likelihoods are used for weights of individual particles. After weights estimation, a new particle which has the maximum weight is selected and new particles are re-sampled using the maximum particle. For performance comparison, we tested a few combinations of features and particle filters. The proposed algorithm showed best object tracking performance when we used color and texture model simultaneously for likelihood estimation.

• International Journal of Internet, Broadcasting and Communication
• /
• v.7 no.2
• /
• pp.51-55
• /
• 2015

This paper proposes an algorithm for risk situation recognition using facial expression. The proposed method recognitions the surprise and fear expression among human's various emotional expression for recognizing dangerous situation. The proposed method firstly extracts the facial region using Harr-like technique from input, detects eye region and lip region from the extracted face. And then, the method applies Uniform LBP to each region, detects facial expression, and recognizes dangerous situation. The proposed method is evaluated for MUCT database image and web cam input. The proposed method produces good results of facial expression and discriminates dangerous situation well and the average recognition rate is 91.05%.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.1
• /
• pp.288-301
• /
• 2017

In this paper, we propose an optimized algorithm for texture classification by computing a completed modeling of the local binary pattern (CLBP) instead of the traditional LBP of a scalable block size in an image. First, we show that the CLBP descriptor is a better representative than LBP by extracting more information from an image. Second, the CLBP features of scalable block size of an image has an adaptive capability in representing both gross and detailed features of an image and thus it is suitable for image texture classification. This paper successfully implements a machine learning scheme by applying the CLBP features of a scalable size to the Support Vector Machine (SVM) classifier. The proposed scheme has been evaluated on Outex and CUReT databases, and the evaluation result shows that the proposed approach achieves an improved recognition rate compared to the previous research results.

• Journal of KIISE
• /
• v.41 no.9
• /
• pp.666-673
• /
• 2014

This paper proposes a scalable face recognition method for unconstrained face databases, and shows a simple experimental result. Existing face recognition research usually has focused on improving the recognition rate in a constrained environment where illumination, face alignment, facial expression, and background is controlled. Therefore, it cannot be applied in unconstrained face databases. The proposed system is face feature extraction algorithm for unconstrained face recognition. First of all, we extract the area that represent the important features(landmarks) in the face, like the eyes, nose, and mouth. Each landmark is represented by a high-dimensional LBP(Local Binary Pattern) histogram feature vector. The multi-scale LBP histogram vector corresponding to a single landmark, becomes a low-dimensional face feature vector through the feature reduction process, PCA(Principal Component Analysis) and LDA(Linear Discriminant Analysis). We use the Rank acquisition method and Precision at k(p@k) performance verification method for verifying the face recognition performance of the low-dimensional face feature by the proposed algorithm. To generate the experimental results of face recognition we used the FERET, LFW and PubFig83 database. The face recognition system using the proposed algorithm showed a better classification performance over the existing methods.

• Journal of Korea Multimedia Society
• /
• v.13 no.11
• /
• pp.1630-1642
• /
• 2010

Recently, there is an increasing need for developing the technique of Hand Gesture Recognition (HGR), for vision based interface. Since hand gesture is defined as consecutive change of hand posture, developing the algorithm of Hand Posture Recognition (HPR) is required. Among the factors that decrease the performance of HPR, we focus on rotation factor. To achieve rotation invariant HPR, we propose a method that uses the property of video that adjacent frames in video have high correlation, considering the environment of HGR. The proposed method introduces template update of object tracking using the above mentioned property, which is different from previous works based on still images. To compare our proposed method with previous methods such as template matching, PCA and LBP, we performed experiments with video that has hand rotation. The accuracy rate of the proposed method is 22.7%, 14.5%, 10.7% and 4.3% higher than ordinary template matching, template matching using KL-Transform, PCA and LBP, respectively.

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