• Communications for Statistical Applications and Methods
• /
• 제22권6호
• /
• pp.589-598
• /
• 2015

In longitudinal studies missing data are common and require a complicated analysis. There are two popular modeling frameworks, pattern mixture model (PMM) and selection models (SM) to analyze the missing data. We focus on the PMM and we also propose Bayesian pattern mixture models using generalized linear mixed models (GLMMs) for longitudinal binary data. Sensitivity analysis is used under the missing not at random assumption.

• 반도체디스플레이기술학회지
• /
• 제8권2호
• /
• pp.23-29
• /
• 2009

To increase the data capacity of one-dimensional symbology, 2D barcodes have been proposed a decade ago. In this paper, a new 2D barcode detection algorithm based on Local Binary Pattern is presented. To locate 2D barcode symbols, a texture analysis scheme based on the Local Binary Pattern is adopted, and a gray-scale projection with sub-pixel operation is utilized to separate the symbol precisely from the input image. Finally, the segmented symbol is normalized using the inverse perspective transformation for the decoding process. The proposed method ensures high performances under various lighting/printing conditions and strong perspective deformations. Experiments show that our method is very robust and efficient in detecting the symbol area for the various types of 2D barcodes.

• 반도체디스플레이기술학회지
• /
• 제18권4호
• /
• pp.110-115
• /
• 2019

Blur detection and segmentation play vital role in many computer vision applications. Among various methods, local binary pattern based methods provide reasonable blur detection results. However, in conventional local binary pattern based methods, the blur map is computed by using a fixed threshold irrespective of the type and level of blur. It may not be suitable for images with variations in imaging conditions and blur. In this paper we propose an effective method based on local binary pattern with adaptive threshold for blur detection. The adaptive threshold is computed based on the model learned through the multinomial logistic regression. The performance of the proposed method is evaluated using different datasets. The comparative analysis not only demonstrates the effectiveness of the proposed method but also exhibits it superiority over the existing methods.

• 정보처리학회논문지:소프트웨어 및 데이터공학
• /
• 제2권3호
• /
• pp.205-208
• /
• 2013

일반적으로 이진패턴 변환은 조명 변화에 강인한 특성을 가지므로, 얼굴인식 및 표정인식 분야에 널리 사용되고 있다. 이에, 본 논문에서는 기존의 LDP(Local Directional Pattern)의 텍스처 성분을 개선한 MLDP(Modified LDP) 변환 영상에 2D-PCA(Two-Dimensional Principal Component Analysis) 알고리즘을 결합한 조명변화에 강인한 얼굴인식 방법에 대하여 제안한다. 기존의 LBP(Local Binary Pattern)나 LDP와 같은 이진패턴 변환들이 히스토그램 특징 추출을 위해 주로 사용되는 것과는 다르게, 본 논문에서 제안하는 방법은 MLDP 영상을 2D-PCA 특징추출을 위해 직접 사용한다는 특성을 갖는다. 제안 방법의 성능평가는 PCA(Principal Component Analysis), 2D-PCA 및 가버변환 영상과 LBP를 결합한 알고리즘을 사용하여, 다양한 조명변화 환경에서 구축된 Yale B 및 CMU-PIE 데이터베이스를 이용하여 수행되었다. 실험 결과, MLDP 영상과 2D-PCA를 사용한 제안 방법이 가장 우수한 인식 성능을 보임을 확인하였다.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1992년도 한국자동제어학술회의논문집(국내학술편); KOEX, Seoul; 19-21 Oct. 1992
• /
• pp.100-105
• /
• 1992

Texture is one of the important characteristics that has been used to identify objects or regions of interest in an image. Tire tread patterns can be considered as a kind of texture, and these are classified with a texture analysis method. In this sense, this paper proposes a new algorithm for the classification of tire tread pattern. For the classification, cooccurrence matrix for the binary image is used. The performances are tested by experimentally 8 different tire tread pattern and the robustness is examined by including some kinds on noise.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권11호
• /
• pp.5474-5490
• /
• 2017

Although two-dimensional principal component analysis (2DPCA) has been shown to be successful in face recognition system, it is still very sensitive to illumination variations. To reduce the effect of these variations, texture-based techniques are used due to their robustness to these variations. In this paper, we explore several texture-based techniques and determine the most appropriate one to be used with 2DPCA-based techniques for face recognition. We also propose a new distance metric computation in 2DPCA called Row Assembled Matrix Distance (RowAMD). Experiments on Yale Face Database, Extended Yale Face Database B, AR Database and LFW Database reveal that the proposed RowAMD distance computation method outperforms other conventional distance metrics when Local Line Binary Pattern (LLBP) and Multi-scale Block Local Binary Pattern (MB-LBP) are used for face authentication and face identification, respectively. In addition to this, the results also demonstrate the robustness of the proposed RowAMD with several texture-based techniques.

• ETRI Journal
• /
• 제35권6호
• /
• pp.1021-1028
• /
• 2013

Automatic facial expression recognition is a widely studied problem in computer vision and human-robot interaction. There has been a range of studies for representing facial descriptors for facial expression recognition. Some prominent descriptors were presented in the first facial expression recognition and analysis challenge (FERA2011). In that competition, the Local Gabor Binary Pattern Histogram Sequence descriptor showed the most powerful description capability. In this paper, we introduce hybrid facial representations for facial expression recognition, which have more powerful description capability with lower dimensionality. Our descriptors consist of a block-based descriptor and a pixel-based descriptor. The block-based descriptor represents the micro-orientation and micro-geometric structure information. The pixel-based descriptor represents texture information. We validate our descriptors on two public databases, and the results show that our descriptors perform well with a relatively low dimensionality.

• 반도체디스플레이기술학회지
• /
• 제8권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.

• 디지털산업정보학회논문지
• /
• 제9권2호
• /
• pp.111-119
• /
• 2013

Face recognition has recently become one of the most popular research areas in the fields of computer vision, machine learning, and pattern recognition because it spans numerous applications, such as access control, surveillance, security, credit-card verification, and criminal identification. In this paper, we propose a simple descriptor called an ECSP(Extended Center-Symmetric Pattern) for illumination-robust face recognition. The ECSP operator encodes the texture information of a local face region by emphasizing diagonal components of a previous CS-LBP(Center-Symmetric Local Binary Pattern). Here, the diagonal components are emphasized because facial textures along the diagonal direction contain much more information than those of other directions. The facial texture information of the ECSP operator is then used as the input image of an image covariance-based feature extraction algorithm such as 2D-PCA(Two-Dimensional Principal Component Analysis). Performance evaluation of the proposed approach was carried out using various binary pattern operators and recognition algorithms on the Yale B database. The experimental results demonstrated that the proposed approach achieved better recognition accuracy than other approaches, and we confirmed that the proposed approach is effective against illumination variation.

• 정보보호학회논문지
• /
• 제29권6호
• /
• pp.1365-1373
• /
• 2019

Meltdown과 Spectre는 프로세서의 비순차 및 추측 실행의 취약점을 이용해 일반 사용자 권한으로 접근할 수 없는 메모리를 읽는 공격이다. 이 공격을 방지하기 위한 대응 패치가 공개되었으나, 적용 가능한 패치가 없는 오래된 시스템 등은 여전히 이 공격에 취약하다고 할 수 있다. 이 공격을 탐지하기 위한 연구가 이루어지고 있지만 대부분 동적 식별 방법을 제안하고 있다. 따라서 본 논문은 Meltdown과 Spectre 악성코드를 실행하지 않고 파일 상태에서 탐지가 가능한 시그니처를 제안한다. 이를 위해 GitHub에 등록된 13종의 악성코드에 대한 바이너리 패턴 분석을 수행하였다. 이를 바탕으로 공격 파일 식별 방법을 제안하였으며, 실험결과 분석한 악성코드와 현재 악성코드 데이터베이스에 등록된 19개의 변종 악성코드를 100% 식별했고, 2,317개의 정상파일 중 0.94%(22건)의 오탐률을 보였다.