• Title/Summary/Keyword: dominant feature points

Search Result 17, Processing Time 0.02 seconds

Recognition of Facial Expressions of Animation Characters Using Dominant Colors and Feature Points (주색상과 특징점을 이용한 애니메이션 캐릭터의 표정인식)

  • Jang, Seok-Woo;Kim, Gye-Young;Na, Hyun-Suk
    • The KIPS Transactions:PartB
    • /
    • v.18B no.6
    • /
    • pp.375-384
    • /
    • 2011
  • This paper suggests a method to recognize facial expressions of animation characters by means of dominant colors and feature points. The proposed method defines a simplified mesh model adequate for the animation character and detects its face and facial components by using dominant colors. It also extracts edge-based feature points for each facial component. It then classifies the feature points into corresponding AUs(action units) through neural network, and finally recognizes character facial expressions with the suggested AU specification. Experimental results show that the suggested method can recognize facial expressions of animation characters reliably.

An Approach to Target Tracking Using Region-Based Similarity of the Image Segmented by Least-Eigenvalue (최소고유치로 분할된 영상의 영역기반 유사도를 이용한 목표추적)

  • Oh, Hong-Gyun;Sohn, Yong-Jun;Jang, Dong-Sik;Kim, Mun-Hwa
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.8 no.4
    • /
    • pp.327-332
    • /
    • 2002
  • The main problems of computational complexity in object tracking are definition of objects, segmentations and identifications in non-structured environments with erratic movements and collisions of objects. The object's information as a region that corresponds to objects without discriminating among objects are considered. This paper describes the algorithm that, automatically and efficiently, recognizes and keeps tracks of interest-regions selected by users in video or camera image sequences. The block-based feature matching method is used for the region tracking. This matching process considers only dominant feature points such as corners and curved-edges without requiring a pre-defined model of objects. Experimental results show that the proposed method provides above 96% precision for correct region matching and real-time process even when the objects undergo scaling and 3-dimen-sional movements In successive image sequences.

Effective Marker Placement Method By De Bruijn Sequence for Corresponding Points Matching (드 브루인 수열을 이용한 효과적인 위치 인식 마커 구성)

  • Park, Gyeong-Mi;Kim, Sung-Hwan;Cho, Hwan-Gue
    • The Journal of the Korea Contents Association
    • /
    • v.12 no.6
    • /
    • pp.9-20
    • /
    • 2012
  • In computer vision, it is very important to obtain reliable corresponding feature points. However, we know it is not easy to find the corresponding feature points exactly considering by scaling, lighting, viewpoints, etc. Lots of SIFT methods applies the invariant to image scale and rotation and change in illumination, which is due to the feature vector extracted from corners or edges of object. However, SIFT could not find feature points, if edges do not exist in the area when we extract feature points along edges. In this paper, we present a new placement method of marker to improve the performance of SIFT feature detection and matching between different view of an object or scene. The shape of the markers used in the proposed method is formed in a semicircle to detect dominant direction vector by SIFT algorithm depending on direction placement of marker. We applied De Bruijn sequence for the markers direction placement to improve the matching performance. The experimental results show that the proposed method is more accurate and effective comparing to the current method.

A Study on Automatic Classification of Fingerprint Images (지문 영상의 자동 분류에 관한 연구)

  • Lim, In-Sic;Sin, Tae-Min;Park, Goo-Man;Lee, Byeong-Rae;Park, Kyu-Tae
    • Proceedings of the KIEE Conference
    • /
    • 1988.07a
    • /
    • pp.628-631
    • /
    • 1988
  • This paper describes a fingerprint classification on the basis of feature points(whorl, core) and feature vector and uses a syntactic approach to identify the shape of flow line around the core. Fingerprint image is divided into 8 by 8 subregions and fingerprint region is separated from background. For each subregion of fingerprint region, the dominant ridge direction is obtained to use the slit window quantized in 8 direction and relaxation is performed to correct ridge direction code. Feature points(whorl, core, delta) are found from the ridge direction code. First classification procedure divides the types of fingerprint into 4 class based on whorl and cores. The shape of flow line around the core is obtained by tracing for the fingerprint which has one core or two core and is represented as string. If the string is acceptable by LR(1) parser, feature vector is obtained from feature points(whorl, core, delta) and the shape of flow line around the core. Feature vector is used hierarchically and linearly to classify fingerprint again. The experiment resulted in 97.3 percentages of sucessful classification for 71 fingerprint impressions.

  • PDF

Estimation of transformation parameters using shape matching (형상 정합을 통한 변환 파라미터 추출)

  • 박용희;전병호;김태균
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.22 no.7
    • /
    • pp.1523-1533
    • /
    • 1997
  • Image registration is concerned with the establishment of correspondence between images of the same scene with translational, rotational, and scaling differences. The estimated transformation parameters between images are very important information in the field of many applications. In this paper, we propose a shape matching scheme for finding correspondence points for images with various differences, Tranditional solutions to this area are unreliable for the rotational and schaling changes between images, and the feature extraction of partially occluded scene. To solve those problems, dominant points on digital curves are detected by scale-space filtering, and initial matching is performed by similarity measure of cumulative curvatures for dominant points. For initial matching segments pairs, optimal matching points are calculated using dynamic programming.Finally, transformation parameters are estimated.

  • PDF

(Algorithm for Recognizing Bulb in Cluster) (계기판 벌브 인식 알고리즘)

  • 이철헌;설성욱;김효성
    • Journal of the Institute of Electronics Engineers of Korea TE
    • /
    • v.39 no.1
    • /
    • pp.37-45
    • /
    • 2002
  • This paper proposes new features for recognizing telltale bulb in a cluster. A typical feature employed in model-based pattern recognition is polygonal approximation points of object. But recognition using these dominant points has many mismatching counts in small model such as telltale bulb. To reduce mismatching counts, proposed features are the circle distribution of object pixel and the ratio of distance from center to boundary in object. This Paper also proposes new decision function using three features. In simulation result, we make a comparison mismatching counts between recognition using dominant points and the new recognition algorithm using three features.

ECG Signal Compression using Feature Points based on Curvature (곡률을 이용한 특징점 기반 심전도 신호 압축)

  • Kim, Tae-Hun;Kim, Sung-Wan;Ryu, Chun-Ha;Yun, Byoung-Ju;Kim, Jeong-Hong;Choi, Byung-Jae;Park, Kil-Houm
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.20 no.5
    • /
    • pp.624-630
    • /
    • 2010
  • As electrocardiogram(ECG) signals are generally sampled with a frequency of over 200Hz, a method to compress diagnostic information without losing data is required to store and transmit them efficiently. In this paper, an ECG signal compression method, which uses feature points based on curvature, is proposed. The feature points of P, Q, R, S, T waves, which are critical components of the ECG signal, have large curvature values compared to other vertexes. Thus, these vertexes are extracted with the proposed method, which uses local extremum of curvatures. Furthermore, in order to minimize reconstruction errors of the ECG signal, extra vertexes are added according to the iterative vertex selection method. Through the experimental results on the ECG signals from MIT-BIH Arrhythmia database, it is concluded that the vertexes selected by the proposed method preserve all feature points of the ECG signals. In addition, they are more efficient than the AZTEC(Amplitude Zone Time Epoch Coding) method.

Multi-Object Detection Using Image Segmentation and Salient Points (영상 분할 및 주요 특징 점을 이용한 다중 객체 검출)

  • Lee, Jeong-Ho;Kim, Ji-Hun;Moon, Young-Shik
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.45 no.2
    • /
    • pp.48-55
    • /
    • 2008
  • In this paper we propose a novel method for image retrieval system using image segmentation and salient points. The proposed method consists of four steps. In the first step, images are segmented into several regions by JSEG algorithm. In the second step, for the segmented regions, dominant colors and the corresponding color histogram are constructed. By using dominant colors and color histogram, we identify candidate regions where objects may exist. In the third step, real object regions are detected from candidate regions by SIFT matching. In the final step, we measure the similarity between the query image and DB image by using the color correlogram technique. Color correlogram is computed in the query image and object region of DB image. By experimental results, it has been shown that the proposed method detects multi-object very well and it provides better retrieval performance compared with object-based retrieval systems.

The Implementation of Fast Object Recognition Using Parallel Processing on CPU and GPU (CPU와 GPU의 병렬 처리를 이용한 고속 물체 인식 알고리즘 구현)

  • Kim, Jun-Chul;Jung, Young-Han;Park, Eun-Soo;Cui, Xue-Nan;Kim, Hak-Il;Huh, Uk-Youl
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.15 no.5
    • /
    • pp.488-495
    • /
    • 2009
  • This paper presents a fast feature extraction method for autonomous mobile robots utilizing parallel processing and based on OpenMP, SSE (Streaming SIMD Extension) and CUDA programming. In the first step on CPU version, the algorithms and codes are optimized and then implemented by parallel processing. The parallel algorithms are debugged to maintain the same level of performance and the process for extracting key points and obtaining dominant orientation with respect to key points is parallelized. After extraction, a parallel descriptor via SSE instructions is constructed. And the GPU version also implemented by parallel processing using CUDA based on the SIFT. The GPU-Parallel descriptor achieves an acceleration up to five times compared with the CPU-Parallel descriptor, but it shows the lower performance than CPU version. CPU version also speed-up the four and half times compared with the original SIFT while maintaining robust performance.

Numerical Analysis of Impurity Transport Along Magnetic Field Lines in Tokamak Scrape-011 Layer

  • Chung, Tae-Kyun;Hong, Sang-Hee
    • Nuclear Engineering and Technology
    • /
    • v.30 no.1
    • /
    • pp.17-25
    • /
    • 1998
  • Transport of carbon and boron impurity ions parallel to magnetic field lines in the tokamak SOL (scrape-off layer) is numerically investigated for a one-dimensional steady state. The spatial distributions of density and velocity of the impurity ions in a steady state are calculated by finite difference method for a single-fluid model. The calculated results show that among forces acting on SOL particles thermal force produced tv plasma temperature gradient is a principal force determining the feature of impurity distribution profiles in the tokamak edge. However, strong collisional friction forces appearing dominant in front of the diverter plate restrain impurity ion flows due to temperature gradients from moving toward the midplane. Consequently, the stagnation point develops in the impurity flow by these two forces near the diverter region, in which ion flows change their directions. Impurity ions turn out to be accumulated at the stagnation points, where peaked profiles of highly-ionized state ions are relatively predominant over those of low-ionized state ions.

  • PDF