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

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2003년도 신호처리소사이어티 추계학술대회 논문집
• /
• pp.437-440
• /
• 2003

When we search database with a query image, the retrieval efficiency will vary from each kind of descriptor. Even the best representative descriptor, it results a few useless images that don't match with query image. This type of error can be reduced by adopting another descriptor which extracts features in different way. At present, the choice of descriptors is base on intuitive and experimental method. By theoretic accessing to the problem of descriptor choice, we can solve the given problem in the objective and rational way. In this study, we intend to make a composite of descriptors that can reduce retrieval error by adopting principal component analysis.

• ETRI Journal
• /
• 제38권3호
• /
• pp.502-509
• /
• 2016

Feature detection and description are key ingredients of common image processing and computer vision applications. Most existing algorithms focus on robust feature matching under challenging conditions, such as inplane rotations and scale changes. Consequently, they usually fail when the scene is blurred by camera shake or an object's motion. To solve this problem, we propose a new feature description algorithm that is robust to image blur and significantly improves the feature matching performance. The proposed algorithm builds a feature descriptor by considering the integral projection along four angular directions ($0^{\circ}$, $45^{\circ}$, $90^{\circ}$, and $135^{\circ}$) and by combining four projection vectors into a single highdimensional vector. Intensive experiment shows that the proposed descriptor outperforms existing descriptors for different types of blur caused by linear motion, nonlinear motion, and defocus. Furthermore, the proposed descriptor is robust to intensity changes and image rotation.

• 반도체디스플레이기술학회지
• /
• 제12권4호
• /
• pp.33-38
• /
• 2013

Image retrieval is one of the most exciting and fastest growing research fields in the area of multimedia technology. As the amount of digital contents continues to grow users are experiencing increasing difficulty in finding specific images in their image libraries. This paper proposes an efficient image descriptor which uses a local color and texture in the non-overlapped block images. To evaluate the performance of the proposed method, we assessed the retrieval efficiency in terms of ANMRR with common image dataset. The experimental trials revealed that the proposed algorithm exhibited a significant improvement in ANMRR, compared to Dominant Color Descriptor and Edge Histogram Descriptor.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권12호
• /
• pp.4513-4532
• /
• 2014

Motivated by the Weber's Law, this paper proposes an efficient and robust shape descriptor based on the perceptual stimulus model, called Weber's Law Shape Descriptor (WLSD). It is based on the theory that human perception of a pattern depends not only on the change of stimulus intensity, but also on the original stimulus intensity. Invariant to scale and rotation is the intrinsic properties of WLSD. As a global shape descriptor, WLSD has far lower computation complexity while is as discriminative as state-of-art shape descriptors. Experimental results demonstrate the strong capability of the proposed method in handling shape retrieval.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권2호
• /
• pp.825-836
• /
• 2016

In this paper, a speed-up technique for the non-local means (NLM) image denoising method based on local binary descriptor (LBD) is proposed. In the NLM, most of the computation time is spent on searching for non-local similar patches in the search window. The local binary descriptor which represents the structure of patch as binary strings is employed to speed up the search process in the NLM. The descriptor allows for a fast and accurate preselection of non-local similar patches by bitwise operations. Using this approach, a tradeoff between time-saving and noise removal can be obtained. Simulations exhibit that despite being principally constructed for speed, the proposed algorithm outperforms in terms of denoising quality as well. Furthermore, a parallel implementation on GPU brings NLM-LBD to real-time image denoising.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2002년도 하계종합학술대회 논문집(4)
• /
• pp.45-48
• /
• 2002

In this paper, we propose an iris recognition system using Homogeneous Texture descriptor of MPEG-7 standard. The texture of iris is generally used in iris recognition system. We segment the pupil with Hough transform and the boundary of iris with it's gray level difference between the white of the eye. To extract Homogeneous Texture descriptor, this iris image is transformed into polar coordinates. The extracted descriptor is then compared with the reference in DB. If their distance is larger than threshold, they are recognized as different iris. Test results will show that Homogeneous Texture descriptor can be a good measure for iris recognition system.

• International Journal of CAD/CAM
• /
• 제8권1호
• /
• pp.69-72
• /
• 2009

In this paper, we present a new shape descriptor, which is named Poisson equation-Fourier-Mellin moment Descriptor. We solve the Poisson equation in the shape area, and use the solution to get feature function, which are then integrated using Fourier-Mellin moment to represent the shape. This method develops the Poisson equation-geometric moment Descriptor proposed by Lena Gorelick, and keeps both advantages of Poisson equation-geometric moment and Fourier-Mellin moment. It is proved better than Poisson equation-geometric moment Descriptor in shape recognition and classification experiments.

• 전기학회논문지
• /
• 제58권9호
• /
• pp.1796-1801
• /
• 2009

This paper is concerned with the problem of delay-dependent robust $H_{\infty}$ filtering for uncertain descriptor systems with time-varying delay. The considering uncertainty is convex compact set of polytoic type. The purpose is the design of a linear filter such that the resulting filtering error descriptor system is regular, impulse-free, and asymptotically stable with $H_{\infty}$ norm bound. By establishing a finite sum inequality based on quadratic terms, a new delay-dependent bounded real lemma (BRL) for delayed descriptor systems is derived. Based on the derived BRL, a robust $H_{\infty}$ filter is designed in terms of linear matrix inequaltity (LMI). Numerical examples are given to illustrate the effectiveness of the proposed method.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2006년도 추계학술발표대회
• /
• pp.227-230
• /
• 2006

A content-based image retrieval system using MPEG-7 is designed and implemented in this thesis. The implemented system uses existing MPEG-7 Visual Descriptors. In addition, a new descriptor for efficient retrieval of bio images is proposed and utilized in the developed content-based image retrieval system. Comparing proposed CBSD(Compact Binary Shape Descriptor) with Edge Histogram Descriptor(EHD) and Region Shape Descriptor(RSD), it shows good retrieval performance in NMRR. The proposed descriptor is robust to large modification of brightness and contrast and especially improved retrieval performance to search images with similar shapes. Also proposed system adopts distributed architecture to solve increased server overload and network delay. Updating module of client efficiently reduces downloading time for metadata. The developed system can efficiently retrieve images without causing server's overload.