• Journal of Information Processing Systems
• /
• 제16권2호
• /
• pp.343-359
• /
• 2020

In this paper, a new algorithm is proposed for three-dimensional (3D) shape recognition using local features of model views and its sparse representation. The algorithm starts with the normalization of 3D models and the extraction of 2D views from uniformly distributed viewpoints. Consequently, the 2D views are stacked over each other to from view cubes. The algorithm employs the descriptors of 3D local features in the view cubes after applying Gabor filters in various directions as the initial features for 3D shape recognition. In the training stage, we store some 3D local features to build the prototype dictionary of local features. To extract an intermediate feature vector, we measure the similarity between the local descriptors of a shape model and the local features of the prototype dictionary. We represent the intermediate feature vectors of 3D models in the sparse domain to obtain the final descriptors of the models. Finally, support vector machine classifiers are used to recognize the 3D models. Experimental results using the Princeton Shape Benchmark database showed the average recognition rate of 89.7% using 20 views. We compared the proposed approach with state-of-the-art approaches and the results showed the effectiveness of the proposed algorithm.

• 한국컴퓨터정보학회논문지
• /
• 제21권9호
• /
• pp.11-18
• /
• 2016

In this paper, we propose a gas classification method using combined features for an electronic nose system that performs well even when some loss occurs in measuring data samples. We first divide the entire measurement for a data sample into three local sections, which are the stabilization, exposure, and purge; local features are then extracted from each section. Based on the discrimination analysis, measurements of the discriminative information amounts are taken. Subsequently, the local features that have a large amount of discriminative information are chosen to compose the combined features together with the global features that extracted from the entire measurement section of the data sample. The experimental results show that the combined features by the proposed method gives better classification performance for a variety of volatile organic compound data than the other feature types, especially when there is data loss.

• ETRI Journal
• /
• 제45권3호
• /
• pp.505-517
• /
• 2023

Color, texture, and shape act as important information for images in human recognition. For content-based image retrieval, many studies have combined color, texture, and shape features to improve the retrieval performance. However, there have not been many powerful methods for combining all color, texture, and shape features. This study proposes a content-based image retrieval method that uses the combined local and global features of color, texture, and shape. The color features are extracted from the color autocorrelogram; the texture features are extracted from the magnitude of a complete local binary pattern and the Gabor local correlation revealing local image characteristics; and the shape features are extracted from singular value decomposition that reflects global image characteristics. In this work, an experiment is performed to compare the proposed method with those that use our partial features and some existing techniques. The results show an average precision that is 19.60% higher than those of existing methods and 9.09% higher than those of recent ones. In conclusion, our proposed method is superior over other methods in terms of retrieval performance.

• 한국통신학회논문지
• /
• 제17권12호
• /
• pp.1465-1474
• /
• 1992

본 논문은 확장된 지역특징을 이용하여 서로 중첩된 물체를 인식하는 새로운 방법에 대해 기술한다. 먼저 모델물체의 화상으로부터 코너, 아크, 평행선 및 코너-아크로 구성된 지역특징을 추출하고 지식베이스를 구축한다. 물체의 정합을 위해, 입력화상으로 부터 지역특징을 추출한 다음, 지식베이스의 특징과의 유사성을 조사하여 유사한 특징 set으로부터 기하변환을 구한다. 기하변환이 클러스터를 형성하면, 그 클러스터의 중심으로 가설을 설정하고 역기하변환으로 정합을 검증한다. 실험을 통해, 제안된 물체인식방법이 기존의 방법에 비해 인식율과 정확도를 높인다는 것을 확인하였다.

• Journal of Information Processing Systems
• /
• 제12권3호
• /
• pp.468-488
• /
• 2016

The paper proposes a novel framework for 3D face verification using dimensionality reduction based on highly distinctive local features in the presence of illumination and expression variations. The histograms of efficient local descriptors are used to represent distinctively the facial images. For this purpose, different local descriptors are evaluated, Local Binary Patterns (LBP), Three-Patch Local Binary Patterns (TPLBP), Four-Patch Local Binary Patterns (FPLBP), Binarized Statistical Image Features (BSIF) and Local Phase Quantization (LPQ). Furthermore, experiments on the combinations of the four local descriptors at feature level using simply histograms concatenation are provided. The performance of the proposed approach is evaluated with different dimensionality reduction algorithms: Principal Component Analysis (PCA), Orthogonal Locality Preserving Projection (OLPP) and the combined PCA+EFM (Enhanced Fisher linear discriminate Model). Finally, multi-class Support Vector Machine (SVM) is used as a classifier to carry out the verification between imposters and customers. The proposed method has been tested on CASIA-3D face database and the experimental results show that our method achieves a high verification performance.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권11호
• /
• pp.4534-4555
• /
• 2015

We propose a robust object cataloging method using multiple locally distinct heterogeneous features for aiding image retrieval. Due to challenges such as variations in object size, orientation, illumination etc. object recognition is extraordinarily challenging problem. In these circumstances, we adapt local interest point detection method which locates prototypical local components in object imageries. In each local component, we exploit heterogeneous features such as gradient-weighted orientation histogram, sum of wavelet responses, histograms using different color spaces etc. and combine these features together to describe each component divergently. A global signature is formed by adapting the concept of bag of feature model which counts frequencies of its local components with respect to words in a dictionary. The proposed method demonstrates its excellence in classifying objects in various complex backgrounds. Our proposed local feature shows classification accuracy of 98% while SURF,SIFT, BRISK and FREAK get 81%, 88%, 84% and 87% respectively.

• 한국언어정보학회:학술대회논문집
• /
• 한국언어정보학회 2007년도 정기학술대회
• /
• pp.303-310
• /
• 2007

Named Entity Recognition (NER) is always limited by its lower recall resulting from the asymmetric data distribution where the NONE class dominates the entity classes. This paper presents an approach that exploits non-local information to improve the NER recall. Several kinds of non-local features encoding entity token occurrence, entity boundary and entity class are explored under Conditional Random Fields (CRFs) framework. Experiments on SIGHAN 2006 MSRA (CityU) corpus indicate that non-local features can effectively enhance the recall of the state-of-the-art NER systems. Incorporating the non-local features into the NER systems using local features alone, our best system achieves a 23.56% (25.26%) relative error reduction on the recall and 17.10% (11.36%) relative error reduction on the F1 score; the improved F1 score 89.38% (90.09%) is significantly superior to the best NER system with F1 of 86.51% (89.03%) participated in the closed track.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권9호
• /
• pp.4412-4428
• /
• 2018

The purpose of this work is to solve the problem of representing an entire video using Convolutional Neural Network (CNN) features for human action recognition. Recently, due to insufficient GPU memory, it has been difficult to take the whole video as the input of the CNN for end-to-end learning. A typical method is to use sampled video frames as inputs and corresponding labels as supervision. One major issue of this popular approach is that the local samples may not contain the information indicated by the global labels and sufficient motion information. To address this issue, we propose a binary hashing method to enhance the local feature extractors. First, we extract the local features and aggregate them into global features using maximum/minimum pooling. Second, we use the binary hashing method to capture the motion features. Finally, we concatenate the hashing features with global features using different normalization methods to train the classifier. Experimental results on the JHMDB and MPII-Cooking datasets show that, for these new local features, binary hashing mapping on the sparsely sampled features led to significant performance improvements.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권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).

• 융합보안논문지
• /
• 제14권5호
• /
• pp.49-56
• /
• 2014

본 논문에서는 기존의 제안된 LDP(Local Directional Pattern)에 기반하여 지역적인 얼굴특징을 표현하는 방법을 제안한다. 제안된 방법은 눈과 입과 같은 얼굴의 영구적인 특징과 표정이 변하면서 발생하는 일시적인 특징을 효과적으로 표현할 수 있도록 얼굴특징별로 크기와 형태를 달리하는 중첩 가능한 블록을 설정하고 이를 바탕으로 얼굴 특징벡터를 구성한다. 제안된 중첩 블록설정 및 특징 표현 방법은 기하학적 특징을 기반으로 하는 접근 방법의 장점을 수용할 뿐만 아니라 각 얼굴특징의 움직임 특성을 이용하여 얼굴검출에 대한 오류를 수용할 수 있고, 블록사이즈의 가변성으로 인한 공간정보를 유지할 수 있어 표본오차를 줄일 수 있는 장점이 있다. 실험결과, 제안된 방법은 기존 방법에 비해 인식률이 향상됨을 확인하였고, 기존 얼굴 특징 벡터보다 길이가 짧기 때문에 연산량 또한 감소하는 것을 확인하였다.