• Journal of the Korea Computer Industry Society
• /
• v.4 no.12
• /
• pp.1043-1052
• /
• 2003

In this paper, we present a fast motion estimation algorithm to reduce the computations of block matching algorithm for motion estimation in video coding. The proposed algorithm is based on Multi-level Successive Elimination Algorithm and Efficient Multi-level Successive Elimination Algorithms. The best estimate of the motion vectors can be obtained by hierarchical search point sampling and thus the proposed algorithm can decrease the number of matching evaluations that require very intensive computations. The efficiency of the proposed algorithm was verified by experimental results.

• Proceedings of the IEEK Conference
• /
• 1999.06a
• /
• pp.323-326
• /
• 1999

This paper describes a point matching method that is based on an expansion of the electromagnetic field in terms of a series of Bessel and modified Bessel functions multiplied by trigonometric functions. In this method, the electric and magnetic fields inside the waveguide core are matched to those outside the core at matching points on the boundary to yield matrix equations. As an example applying this method, the paper presents the results of the computation in the form of curves of the propagation constants in a semicircular optical waveguide, be formed by annealing for reduced insertion(radiation) loss when connected to optical fiber. The propagation curves are presented in a form of refractive index independent. Also, it presents relative energy distributions between inside the core and outside the core of various modes and presents field distributions.

• Proceedings of the IEEK Conference
• /
• 2002.06d
• /
• pp.295-298
• /
• 2002

This paper presents a fast block-matching algorithm to improve the conventional Three-Step Search (TSS) based method. The proposed Comparison Fast Block Matching Algorithm (CFBMA) begins with DAB for adaptive search range to choose searching method, and searches a part of search window that has high possibility of motion vector like other partial search algorithms. The CFBMA also considers the opposite direction to reduce local minimum, which is ignored in almost conventional based partial search algorithms. CFBMA uses the summation half-stop technique to reduce the computational load. Experimental results show that the proposed algorithm achieves the high computational complexity compression effect and very close or better image quality compared with TSS, SES, NTSS based partial search algorithms.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.46 no.5
• /
• pp.56-65
• /
• 2009

Stereoscopic images consist of the left image and the right image. Thus, stereoscopic images have much amounts of data than single image. Then an efficient image compression technique is needed, the DPCM-based predicted coding compression technique is used in most video coding standards. Motion and disparity estimation are needed to realize the predicted coding compression technique. Their performing algorithm is block matching algorithm used in most video coding standards. Full search algorithm is a base algorithm of block matching algorithm which finds an optimal block to compare the base block with every other block in the search area. This algorithm presents the best efficiency for finding optimal blocks, but it has very large computational loads. In this paper, we have proposed fast disparity estimation algorithm using motion and disparity vector information of the prior frame in stereo image coding. We can realize fast disparity vector estimation in order to reduce search area by taking advantage of global disparity vector and to decrease computational loads by limiting search points using motion vectors and disparity vectors of prior frame. Experimental results show that the proposed algorithm has better performance in the simple image sequence than complex image sequence. We conclude that the fast disparity vector estimation is possible in simple image sequences by reducing computational complexities.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.9
• /
• pp.2007-2012
• /
• 2011

To reduce huge computation in the block matching, this paper proposes a fast block matching algorithm which limits search points in the search area. On the basis of two facts that most motion vectors are located in central part of search area and matching error is monotonic decreasing toward the best similar block, the proposed algorithm moves a matching pattern between steps by the one pixel, predicts the motion direction for the best similar block from similar blocks decided in previous steps, and limits movements of search points to ${\pm}45^{\circ}C$ on it. As a result, it could remove the needless search points and reduce the block matching computation. In comparison with the conventional similar algorithms, the proposed algorithm caused the trivial image degradation in images with fast motion but kept the equivalent image quality in images with normal motion, and it, meanwhile, reduced from about 20% to over 67% of the their block matching computation.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.1
• /
• pp.12-17
• /
• 2005

The segment matching method shows better performance than the global and points-based methods to compare reference signature with an input signature. However, the segment-to-segment matching method has the problem of decreasing recognition rate according to the variation of partitioning points. This paper proposes a fusion model based on the segment matching and HMM to construct a more reliable authentic system. First, a segment matching classifier is designed by conventional technique to calculate matching values lot dynamic information of signatures. And also, a novel HMM classifier is constructed by using the principal component analysis to calculate matching values for static information of signatures. Finally, SVM classifier is adopted to effectively combine two independent classifiers. From the various experiments, we find that the proposed method shows better performance than the conventional segment matching method.

• Journal of Korea Multimedia Society
• /
• v.19 no.6
• /
• pp.1003-1013
• /
• 2016

This paper proposes a framework of superpixel-based vehicle detection method using plane normal vector in disparity space. We utilize two common factors for detecting vehicles: Hypothesis Generation (HG) and Hypothesis Verification (HV). At the stage of HG, we set the regions of interest (ROI) by estimating the lane, and track them to reduce computational cost of the overall processes. The image is then divided into compact superpixels, each of which is viewed as a plane composed of the normal vector in disparity space. After that, the representative normal vector is computed at a superpixel-level, which alleviates the well-known problems of conventional color-based and depth-based approaches. Based on the assumption that the central-bottom of the input image is always on the navigable region, the road and obstacle candidates are simultaneously extracted by the plane normal vectors obtained from K-means algorithm. At the stage of HV, the separated obstacle candidates are verified by employing HOG and SVM as for a feature and classifying function, respectively. To achieve this, we trained SVM classifier by HOG features of KITTI training dataset. The experimental results demonstrate that the proposed vehicle detection system outperforms the conventional HOG-based methods qualitatively and quantitatively.

• The KIPS Transactions:PartB
• /
• v.11B no.7 s.96
• /
• pp.885-892
• /
• 2004

In this paper, we propose a multi-modal biometrics system based on face and signature recognition system. Here, the face recognition system is designed by fuzzy LDA, and the signature recognition system is implemented with the LDA and segment matching methods. To effectively aggregate two systems, we obtain statistical distribution models based on matching values for genuine and impostor, respectively. And then, the final verification is Performed by the support vector machine. From the various experiments, we find that the proposed method shows high recognition rates comparing with the conventional methods.

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.27 no.6
• /
• pp.726-735
• /
• 2003

A Process of 3-D Particle image velocimetry, called here, as '3-D volume PIV' was developed for the full-field measurement of 3-D complex flows. The present method includes the coordinate transformation from image to camera, calibration of camera by a calibrator based on the collinear equation, stereo matching of particles by the approximation of the epipolar lines, accurate calculation of 3-D particle positions, identification of velocity vectors by 3-D cross-correlation equation, removal of error vectors by a statistical method followed by a continuity equation criterior, and finally 3-D animation as the post processing. In principle, as two frame images only are necessary for the single instantaneous analysis 3-D flow field, more effective vectors are obtainable contrary to the previous multi-frame vector algorithm. An Experimental system was also used for the application of the proposed method. Three analog CCD camera and a Halogen lamp illumination were adopted to capture the wake flow behind a bluff obstacle. Among 200 effective particle s in two consecutive frames, 170 vectors were obtained averagely in the present study.

• Journal of Advanced Navigation Technology
• /
• v.12 no.6
• /
• pp.691-698
• /
• 2008

We present a novel method for face detection and recognition methods applicable to video retrieval. The person matching efficiency largely depends on how robustly faces are detected in the video frames. Face regions are detected in video frames using viola-jones features boosted with the Adaboost algorithm After face detection, PCA (Principal Component Analysis) follows illumination compensation to extract features that are classified by SVM (Support Vector Machine) for person identification. Experimental result shows that the matching efficiency of the ensembled architecture is quit satisfactory.