• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.3
• /
• pp.305-323
• /
• 2010

This paper proposes an efficient and yet powerful local descriptor called phase-space partition based descriptor (PPD). This descriptor is designed for the mobile image matching and retrieval. PPD, which is inspired from SIFT, also encodes the salient aspects of the image gradient in the neighborhood around an interest point. However, without employing SIFT's smoothed gradient orientation histogram, we apply the region based gradient statistics in phase space to the construction of a feature representation, which allows to reduce much computation requirements. The feature matching experiments demonstrate that PPD achieves favorable performance close to that of SIFT and faster building and matching. We also present results showing that the use of PPD descriptors in a mobile image retrieval application results in a comparable performance to SIFT.

• ETRI Journal
• /
• v.32 no.5
• /
• pp.784-794
• /
• 2010

Automatic facial expression recognition has many potential applications in different areas of human computer interaction. However, they are not yet fully realized due to the lack of an effective facial feature descriptor. In this paper, we present a new appearance-based feature descriptor, the local directional pattern (LDP), to represent facial geometry and analyze its performance in expression recognition. An LDP feature is obtained by computing the edge response values in 8 directions at each pixel and encoding them into an 8 bit binary number using the relative strength of these edge responses. The LDP descriptor, a distribution of LDP codes within an image or image patch, is used to describe each expression image. The effectiveness of dimensionality reduction techniques, such as principal component analysis and AdaBoost, is also analyzed in terms of computational cost saving and classification accuracy. Two well-known machine learning methods, template matching and support vector machine, are used for classification using the Cohn-Kanade and Japanese female facial expression databases. Better classification accuracy shows the superiority of LDP descriptor against other appearance-based feature descriptors.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2015.07a
• /
• pp.9-12
• /
• 2015

In this paper, we propose a new feature matching algorithm by modifying and combining the FAST(Features from Accelerated Segment Test) feature detector and SURF feature descriptor which is robust to the distortion of the given image. Scale space is generated to consider the variation of the scale and determine the candidate of features in the image robust to the noise. The original FAST algorithm results in many feature points along edges. To solve this problem, we apply the principal curvatures for refining it. We also use SURF descriptor to make it robust against the variations in the image by rotation. Through the experiments, it is shown that the proposed algorithm has better performance than the conventional feature matching algorithms even though it has much less computational load. Especially, it shows a strength for noisy images.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2012.07a
• /
• pp.269-270
• /
• 2012

Features which exhibit scale and rotation invariance, such as SIFT, are notorious for expensive computation time, and often overlooked for real-time tracking scenarios. This paper proposes a descriptorless matching algorithm based on motion vectors between consecutive frames to find the geometrically closest candidate to each tracked reference feature in the database. Descriptor-less matching forgoes expensive SIFT descriptor extraction without loss of matching accuracy and exhibits dramatic speed-up compared to traditional, naive matching based trackers. Descriptor-less SIFT tracking runs in real-time on an Intel dual core machine at an average of 24 frames per second.

• Journal of Korea Multimedia Society
• /
• v.20 no.5
• /
• pp.758-768
• /
• 2017

In this paper, we present a novel method to extract face representation based on multi-resolution spatial pyramid. In our method, a face is subdivided into increasingly finer sub-regions (local regions) and represented at multiple levels of histogram representations. To cope with misaligned problem, patch-based local descriptor extraction has been also developed in a novel way. To preserve multiple levels of detail in local characteristics and also encode holistic spatial configuration, histograms from all levels of spatial pyramid are integrated by using dimensionality reduction and feature combination, leading to our spatial-pyramid face feature representation. We incorporate our proposed face features into general face recognition pipeline and achieve state-of-the-art results on challenging face recognition problems.

• Journal of Korea Multimedia Society
• /
• v.16 no.5
• /
• pp.591-600
• /
• 2013

This paper addresses a feature-based robust watermarking scheme for digital images using a local invariant features of SURF (Speeded-Up Robust Feature) descriptor. In general, the feature invariance is exploited to achieve robustness in watermarking schemes, but the leakage of information about hidden watermarks from publicly known locations and sizes of features are not considered carefully in security perspective. We propose embedding and detection methods where the watermark is bound with circular areas and inserted into extracted circular feature regions. These methods enhance the robustness since the circular watermark is inserted into the selected non-overlapping feature regions instead of entire image contents. The evaluation results for repeatability measures of SURF descriptor and robustness measures present the proposed scheme can tolerate various attacks, including signal processing and geometric distortions.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.12
• /
• pp.2363-2371
• /
• 2015

In this paper, we propose a new feature matching algorithm which is robust to the viewpoint change by using the FAST(Features from Accelerated Segment Test) feature detector and the SIFT(Scale Invariant Feature Transform) feature descriptor. The original FAST algorithm unnecessarily results in many feature points along the edges in the image. To solve this problem, we apply the principal curvatures for refining it. We use the SIFT descriptor to describe the extracted feature points and calculate the homography matrix through the RANSAC(RANdom SAmple Consensus) with the matching pairs obtained from the two different viewpoint images. To make feature matching robust to the viewpoint change, we classify the matching pairs by calculating the Euclidean distance between the transformed coordinates by the homography transformation with feature points in the reference image and the coordinates of the feature points in the different viewpoint image. Through the experimental results, it is shown that the proposed algorithm has better performance than the conventional feature matching algorithms even though it has much less computational load.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.9
• /
• pp.4429-4447
• /
• 2018

Local binary descriptors are well-suited for many real-time and/or large-scale computer vision applications, while their low computational complexity is usually accompanied by the limitation of performance. In this paper, we propose a new optimization framework, RLDB (Robust-LDB), to improve a typical region-based binary descriptor LDB (local difference binary) and maintain its computational simplicity. RLDB extends the multi-feature strategy of LDB and applies a more complete region-comparing configuration. A cascade bit selection method is utilized to select the more representative patterns from massive comparison pairs and an online learning strategy further optimizes descriptor for each specific patch separately. They both incorporate LDP (linear discriminant projections) principle to jointly guarantee the robustness and distinctiveness of the features from various scales. Experimental results demonstrate that this integrated learning framework significantly enhances LDB. The improved descriptor achieves a performance comparable to floating-point descriptors on many benchmarks and retains a high computing speed similar to most binary descriptors, which better satisfies the demands of applications.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.10
• /
• pp.39-46
• /
• 2013

Recently, the mobile industries grow up rapidly and their performances are improved. So the usage of mobile devices is increasing in our life. Also mobile devices equipped with a high-performance camera, so the image stitching can carry out on the mobile devices instead of the desktop. However the mobile devices have limited hardware to perform the image stitching which has a lot of computational complexity. In this paper, we have proposed improved feature descriptor extraction and matching method for efficient image stitching on mobile environment. Our method can reduce computational complexity using extension of orientation window and reduction of dimension feature descriptor when feature descriptor is generated. In addition, the computational complexity of image stitching is reduced through the classification of matching points. In our results, our method makes to improve the computational time of image stitching than the previous method. Therefore our method is suitable for the mobile environment and also that method can make natural-looking stitched image.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.44 no.1
• /
• pp.10-16
• /
• 2007

In this paper, we propose a technique for retrieving images using spatial color correlation and texture characteristics based on local fourier transform. In order to retrieve images, two new descriptors are proposed. One is a color descriptor which represents spatial color correlation. The other is a descriptor combining the proposed color descriptor with texture descriptor. Since most of existing color descriptors including color correlogram which represent spatial color correlation considered just color distribution between neighborhood pixels, the structural information of neighborhood pixels is not considered. Therefore, a novel color descriptor which simultaneously represents spatial color distribution and structural information is proposed. The proposed color descriptor represents color distribution of Min-Max color pairs calculating color distance between center pixel and neighborhood pixels in a block with 3x3 size. Also, the structural information which indicates directional difference between minimum color and maximum color is simultaneously considered. Then new color descriptor(min-max color correlation descriptor, MMCCD) containing mean and variance values of each directional difference is generated. While the proposed color descriptor includes by far smaller feature vector over color correlogram, the proposed color descriptor improves 2.5 % ${\sim}$ 13.21% precision rate, compared with color correlogram. In addition, we propose a another descriptor which combines the proposed color descriptor and texture characteristics based on local fourier transform. The combined method reduces size of feature vector as well as shows improved results over existing methods.