• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.7A
• /
• pp.705-710
• /
• 2002

In this paper, we present a method to find motion vectors in frequency domain for video data compression. The proposed algorithm is based on the Format Number Transform (FNT), and it declares the most correlated-block as the best matching block, as opposed to declaring the block with least sum of differences between blocks. We show that the proposed method is equivalent to declaring the block with the minimum L2-norm as the best matching block. Unlike other previous fast algorithms, the time requirement for the proposed algorithm does not defend on the image type for finding the optimum solution.

• ETRI Journal
• /
• v.34 no.1
• /
• pp.87-97
• /
• 2012

This study presents an automatic matching method for generating a dense, accurate, and discontinuity-preserved digital surface model (DSM) using multiple images acquired by an aerial digital frame camera. The proposed method consists of two main procedures: area-based multi-image matching (AMIM) and stereo-pair epipolar line matching (SELM). AMIM evaluates the sum of the normalized cross correlation of corresponding image points from multiple images to determine the optimal height of an object point. A novel method is introduced for determining the search height range and incremental height, which are necessary for the vertical line locus used in the AMIM. This procedure also includes the means to select the best reference and target images for each strip so that multi-image matching can resolve the common problem over occlusion areas. The SELM extracts densely positioned distinct points along epipolar lines from the multiple images and generates a discontinuity-preserved DSM using geometric and radiometric constraints. The matched points derived by the AMIM are used as anchor points between overlapped images to find conjugate distinct points using epipolar geometry. The performance of the proposed method was evaluated for several different test areas, including urban areas.

• The Journal of the Korea Contents Association
• /
• v.7 no.12
• /
• pp.311-321
• /
• 2007

For fast and robust face detection, this paper proposes an approach for face detection using fusion of heterogeneous template matching. First, we detect skin regions using a model of skin color which covers various illumination and races. After reducing a search space by region labelling and filtering, we apply template matching with skin color and edge to the detected regions. Finally, we detect a face by finding the best choice of template fusion. Experimental results show the proposed approach is more robust in skin color-like environments than with a single template matching and is fast by reducing a search space to face candidate regions. Also, using a global accumulator can reduce excessive space requirements of template matching.

• ETRI Journal
• /
• v.43 no.3
• /
• pp.483-510
• /
• 2021

In computational biology, desired patterns are searched in large text databases, and an exact match is preferable. Classical benchmark algorithms obtain competent solutions for pattern matching in O (N) time, whereas quantum algorithm design is based on Grover's method, which completes the search in $O(\sqrt{N})$ time. This paper briefly explains existing quantum algorithms and defines their processing limitations. Our initial work overcomes existing algorithmic constraints by proposing the quantum-based combined exact (QBCE) algorithm for the pattern-matching problem to process exact patterns. Next, quantum random access memory (QRAM) processing is discussed, and based on it, we propose the QRAM processing-based exact (QPBE) pattern-matching algorithm. We show that to find all t occurrences of a pattern, the best case time complexities of the QBCE and QPBE algorithms are $O(\sqrt{t})$ and $O(\sqrt{N})$, and the exceptional worst case is bounded by O (t) and O (N). Thus, the proposed quantum algorithms achieve computational speedup. Our work is proved mathematically and validated with simulation, and complexity analysis demonstrates that our quantum algorithms are better than existing pattern-matching methods.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.1
• /
• pp.104-110
• /
• 2006

The advantage of the DSM which employ multi-bit quantizer is the increased SNR at the modulator's output. Typically 6 dB improvement is effected for every one additional bit. But multi-bit quantizer evidently requires multi-bit DAC in the feedback loop. The integral linearity error of the feedback DAC has direct impact upon the system performance and degraded SNR of the system. In order to mitigate the negative impact the DAC has on the system performance, many DEM(Dynamic Element Matching) schemes has been proposed. Among the proposed schemes, four schemes(DER,CLA,ILA,DWA) are explained and its performance has been compared. DWA(Data Weighted Averaging) method shows the best performance of the all.

• Transactions of the Korean Society for Noise and Vibration Engineering
• /
• v.26 no.2
• /
• pp.172-178
• /
• 2016

The location template matching (LTM) method is a technique of identifying an impact location on a structure, and is often applied to structural health monitoring and large scale human-computer interface (HCI) systems. The LTM method utilizes a certain measure of similarity between two time signals. The correlation coefficient is most widely used for this purpose, and the group delay based method is recently proposed to improve the accuracy of finding the best matching pair of signals. In practice, one of key essential consideration for implementing the LTM method is to guarantee that a sufficient number of vibration modes must be contained in the measured signal, and yet the lower sampling rate is needed for a real-time implementation. In this paper, the properties of correlation coefficient and group delay with respect to the number of vibration modes are investigated. A few important results are obtained through extensive computer simulations and experiments. If the number of vibration modes contained in the measured signal is more than four it is sufficient for the correlation based LTM method, while the group delay based LTM method requires smaller number of vibration modes.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.14 no.9
• /
• pp.979-984
• /
• 2003

A reactive-loaded interstitial antenna(RLIA) is proposed for 2.45 GHz. It basically consists of a coaxial cable and a reactive load(RL). The RL is tipped at the end of the antenna and contributes to almost perfect matching and desirable heating area. For the almost perfect matching, a matching technique based on transmission line theory is suggested and the RLIA immersed in muscle phantom is designed, fabricated, measured and compared. The measured return loss of the RLIA is - 28.377 dB, which may be considered the best among those reported. Due to the excellent matching performance, the RLIA can also be applied for the treatment of deep-seated tumor or cancer with only one RLIA.

• Journal of Korea Multimedia Society
• /
• v.13 no.9
• /
• pp.1348-1356
• /
• 2010

With the advancement of information and communication technology, the market of Internet-based fashion/coordination shopping malls have been considerably increasing year by year. As the number of these Internet shopping malls increases, the operators of the malls tend to decorate the first page of their websites with a variety of events and samples of the best-fit upper-lower clothing pairs. They try to provide visitors of their web sites with products that can induce fresh impression by modifying the first page on a daily or a few days basis. If pairs of best-fit upper-lower clothes for various products available in online shopping malls can be calculated and marked, it would help not only to make the first page of the malls more appealing but also to enable users to purchase linked products in a more convenient way, replacing the recommendations usually made by offline clerks. In the paper, we present the results of designing and implementing an upper-lower clothes matching system in which expert coordinators register matching-value of upper and lower clothes in the form of attribute-value matrix.

• Korean Journal of Remote Sensing
• /
• v.32 no.6
• /
• pp.647-656
• /
• 2016

Growth of UAV technology leads to expansion of UAV image applications. Many UAV image-based applications use a method called incremental bundle adjustment. However, incremental bundle adjustment produces large computation overhead because it attempts feature matching from all image pairs. For efficient feature matching process we have to confine matching only for overlapping pairs using exterior orientation parameters. When exterior orientation parameters are not available, we cannot determine overlapping pairs. We need another methods for feature matching candidate constitution. In this paper we compare matching candidate constitution methods without exterior orientation parameters, including partial feature matching, Bag-of-keypoints, image intensity method. We use the overlapping pair determination method based on exterior orientation parameter as reference. Experiment results showed the partial feature matching method in the one with best efficiency.

• Journal of the Institute of Convergence Signal Processing
• /
• v.5 no.2
• /
• pp.126-131
• /
• 2004

Full search algorithm(FA) provides the best performance but this is usually impractical because of the large number of computations required for large search region. Fast search and conventional Boolean matching algorithms reduce computational complexity and data processing time but this algorithms have disadvantages that is difficult of implementation of hardware because of high control overhead and that is less performance than FA. This paper presents new Boolean matching algorithm, called BCBM(Bit Converted Boolean Matching). Proposed algorithm has performance closed to the FA by Boolean only block matching that may be very efficiently implemented in hardware for real time video communication. Simulation results show that the PSNR of the proposed algorithm is about 0.08㏈ loss than FA but is about 0.96∼2.02㏈ gain than fast search algorithm and conventional Boolean matching algorithm.