• Journal of Electrical Engineering and Technology
• /
• v.9 no.2
• /
• pp.707-720
• /
• 2014

This paper proposes a face tracking scheme that is a combination of a face detection algorithm and a face tracking algorithm. The proposed face detection algorithm basically uses the Adaboost algorithm, but the amount of search area is dramatically reduced, by using skin color and motion information in the depth map. Also, we propose a face tracking algorithm that uses a template matching method with depth information only. It also includes an early termination scheme, by a spiral search for template matching, which reduces the operation time with small loss in accuracy. It also incorporates an additional simple refinement process to make the loss in accuracy smaller. When the face tracking scheme fails to track the face, it automatically goes back to the face detection scheme, to find a new face to track. The two schemes are experimented with some home-made test sequences, and some in public. The experimental results are compared to show that they outperform the existing methods in accuracy and speed. Also we show some trade-offs between the tracking accuracy and the execution time for broader application.

• 제어로봇시스템학회:학술대회논문집
• /
• 1997.10a
• /
• pp.860-863
• /
• 1997

FCM(Fuzzy Cognitive Map) is a fuzzy signed directed graph for representing causal reasoning which has fuzziness between causal concepts. Authors have already proposed FCM-based fault diagnostic scheme. However, the previously proposed scheme has the problem of lower diagnostic resolution. In order to improve the diagnostic resolution, a new diagnostic scheme based on extended FCM which incorporates the concept of fuzzy number into FCM is developed in this paper. Furthermore, an enhanced TAM(Temporal Associative Memory) recall procedure and pattern matching scheme are also proposed.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.42 no.3
• /
• pp.191-198
• /
• 2014

During multi-physics or multi-phase simulations accompanying fluid- structure- thermal interaction, data transfer problems always arise along non- matching interfaces caused by different computational meshes for each physical domain. Common- refinement scheme, among many available methods, is attractive since it is known to yield conservative and accurate data transfer for non- matching interface cases. This is particularly important in simulating compressible unsteady fluid- structure- thermal interaction inside solid propellant rockets, where grid size along solid- fluid interfaces is substantially different. From this perspective, we examine performances of common- refinement- based data transfer scheme between structured quadrilateral (structure part) and unstructured triangular (fluid part) meshes by comparing computed results with other data transfer methods.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.11A
• /
• pp.1925-1938
• /
• 2001

In this paper, a new block-matching algorithm for standard video encoder is presented. The slice competition method is proposed as a new scheme, as opposed to a coarse-to-fine approach. The order of calculating the SAD(Sum of Absolute Difference) to fad the best matching block is changed from a raster order to a dispersed one. Based on this scheme, the increasing SAD curve during its calculation is more linear than that of other curves. Then, the candidates of low probability can be removed in the early stage of calculation. And new MV prediction technique with an adaptive search range scheme also assists the proposed block-matching algorithm. As a result, an average of 13% improvement in computational power is recorded by only the proposed MV prediction technique. Synthetically, the computational power is reduced by 3977∼77% than that of the conventional BMAs. The average MAD is always low in various sequences. The results are also very close to the MAD of the full search block-matching algorithm.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.37 no.5
• /
• pp.1-8
• /
• 2000

Point pattern matching schemes for finger print recognition do not guarantee robust matching performance for fingerprint Images of poor quality We present a finger print recognition scheme, where transformation parameters of matched ridge pairs are estimated by Hough transform and the matching hypothesis is verified by a new measure of the matching degree using selective directional information Proposed method may exhibit extremely low FAR(False accept rate) while maintaining low reject rate even for the Images of poor quality because of the robustness to the variation of minutia points.

• ETRI Journal
• /
• v.42 no.3
• /
• pp.411-419
• /
• 2020

In real-world intelligent transportation systems, accuracy in vehicle license plate detection and recognition is considered quite critical. Many algorithms have been proposed for still images, but their accuracy on actual videos is not satisfactory. This stems from several problematic conditions in videos, such as vehicle motion blur, variety in viewpoints, outliers, and the lack of publicly available video datasets. In this study, we focus on these challenges and propose a license plate detection and recognition scheme for videos based on a temporal matching prior network. Specifically, to improve the robustness of detection and recognition accuracy in the presence of motion blur and outliers, forward and bidirectional matching priors between consecutive frames are properly combined with layer structures specifically designed for plate detection. We also built our own video dataset for the deep training of the proposed network. During network training, we perform data augmentation based on image rotation to increase robustness regarding the various viewpoints in videos.

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

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.30B no.4
• /
• pp.116-129
• /
• 1993

This paper proposes an on-line Recognition scheme of cursive Korean characters based on the DP matching and fuzzy concept. The proposed algorithm, invariant to rotation and size, reduces greatly the computational requirement of dynamic programming by matching phonemes rather than character patterns, where the angle difference and the ration of lengths between input and reference patterns are adopted as matching features. The correct matching of poorly written cursive characters becomes possible by introducing the fuzzy concept in representing the features of phonemes and the ralative position between adjacent phonemes. Computer simulation results are observed to show the effectiveness of the proposed algorithm.

• Transactions on Control, Automation and Systems Engineering
• /
• v.1 no.1
• /
• pp.32-43
• /
• 1999

Adaptive robust control scheme is introduced for flexible joint manipulator with nonlinearities and uncertainties. The system does not satisfy the matching condition due to insufficient actuators for each node. The control only relies on the assumption that the bound of uncertainty exists. Thus, the bounded value does not need to be known a prior. The control utilizes the update law by estimating the bound of the uncertainties. The control scheme uses the backstepping method and constructs a state transformation. Also, stability analysis is done for both transformed system and original system.

• The KIPS Transactions:PartB
• /
• v.12B no.4 s.100
• /
• pp.429-436
• /
• 2005

A simple stereo matching algorithm using population-based incremental learning(PBIL) is proposed in this paper to decrease the general problem of genetic algorithms, such as memory consumption and inefficiency of search. PBIL is a variation of genetic algorithms using stochastic search and competitive teaming based on a probability vector. The structure of PBIL is simpler than that of other genetic algorithm families, such as serial and parallel ones, due to the use of a probability vector. The PBIL strategy is simplified and adapted for stereo matching circumstances. Thus, gene pool, chromosome crossover, and gene mutation we removed, while the evolution rule, that fitter chromosomes should have higher survival probabilities, is preserved. As a result, memory space is decreased, matching rules are simplified and computation cost is reduced. In addition, a scheme controlling the distance of neighbors for disparity smoothness is inserted to obtain a wide-area consistency of disparities, like a result of coarse-to-fine matchers. Because of this scheme, the proposed algorithm can produce a stable disparity map with a small fixed-size window. Finally, an alterative version of the proposed algorithm without using probability vector is also presented for simpler set-ups.