• Proceedings of the Korea Information Processing Society Conference
• /
• 2005.05a
• /
• pp.521-524
• /
• 2005

This paper proposes a fusion algorithm which merges multiple vein pattern images into a single image, larger than those images. As a preprocessing step of template matching, during the verification of biometric data such as fingerprint image, vein pattern image of hand, etc., the fusion technique is used to make reference image larger than the candidate images in order to enhance the matching performance. In this paper, a new algorithm, called BSA (Boundary Stitching Algorithm) is proposed, in which the boundary rectilinear parts extracted from the candidate images are stitched to the reference image in order to enlarge its matching space. By applying BSA to practical vein pattern verification system, its verification rate was increased by about 10%.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.99-102
• /
• 2009

In this paper a hierarchical stereo matching algorithm based on feature extraction is proposed. The boundary (edge) as feature point in an image is first obtained by segmenting an image into red, green, blue and white regions. With the obtained boundary information, disparities are extracted by matching window on the image boundary, and the initial disparity map is generated when assigned the same disparity to neighbor pixels. The final disparity map is created with the initial disparity. The regions with the same initial disparity are classified into the regions with the same color and we search the disparity again in each region with the same color by changing block size and search range. The experiment results are evaluated on the Middlebury data set and it show that the proposed algorithm performed better than a phase based algorithm in the sense that only about 14% of the disparities for the entire image are inaccurate in the final disparity map. Furthermore, it was verified that the boundary of each region with the same disparity was clearly distinguished.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.1
• /
• pp.96-104
• /
• 1990

In this paper, a novel method of jig-saw puzzle matching is proposed using a modifided boundary matching algorithm without a priori knowledge for the matched puzzle. Specifically, a boundary tracking algorithm is utilised to segment each puzzle from low-resolution image data. Segmented puzzle is described via corner point, angle and distance between two adjacent coner point, and convexity and/or concavity of corner point. Proposed algorithm is implemented and tested in IBM PC and PC version vision system, and applied successfully to real jig-saw puzzles.

• Proceedings of the IEEK Conference
• /
• 2004.08c
• /
• pp.819-822
• /
• 2004

To transmit MPEG-2 video on an erroneous channel, a number of error control techniques He needed. Especially, error concealment techniques which can be implemented on receivers independent of transmitters are essential to obtain good video quality. In this paper, a motion adaptive boundary matching algorithm (MA-BMA) is presented for temporal error concealment. Before carrying out BMA, we perform error concealmmt by a motion vector prediction using neighboring motion vectors. If the candidate of error concealment is rot satisfied, search range and reliable boundary pixels are selected by the motion activity or motion vectors ane a damaged macroblock is concealed by applying the MA-BMA. This error concealment technique reduces the complexity and maintains PSNR gain of 0.3 0.7dB compared to the conventional BMA.

• Proceedings of the KIEE Conference
• /
• 2005.10b
• /
• pp.12-14
• /
• 2005

In this paper, we proposed an temporal error concealment (EC) using the proposed boundary matching method and the adaptive block matching method. The proposed boundary matching method improves the spatial correlation of the macroblocks (MBs) by reusing the pixels of the concealed MB to estimate a motion vector of a error MB. The adaptive block matching method inspects the horizontal edge and the vertical edge feature of a error MB surroundings, and it conceals the error MBs in reference to more stronger edge feature. This improves video quality by raising edge connection feature of the error MBs and the neighborhood MBs. In particular, we restore a lost MB as the unit of 8${\times}$16 block or 16${\times}$8 block by using edge feature from the surrounding macroblocks. Experimental results show that the proposed algorithm gives better results than the conventional algorithms from a subjective and an objective viewpoint.

• Proceedings of the KIEE Conference
• /
• 1988.07a
• /
• pp.954-958
• /
• 1988

A jig-saw puzzle matching technique is proposed. Specifically, the geometric patterns of the puzzle pieces are firstly extracted using a boundary tracking algorithm at low resolution. And then, features of the extracted pieces to describe jig-saw puzzle pieces such as angles and distances between corner points, and convexity or concavity of a corner point are obtained from some corner points implying discontinuity of curvature of puzzle pieces' boundary. Finally, a boundary matching algorithm without a priori information of matched puzzle is proposed.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.39 no.6
• /
• pp.623-629
• /
• 2002

In transmitting compressed video bit-stream over Internet, packet losses cause error propagations in both spatial and temporal domains, which in turn leads to severe degradation I image quality. In this paper, a new error concealment algorithm, called EBMA(Edge Detection based Boundary Matching Algorithm), is proposed to repair damaged portions of the video frames in the receiver. Conventional BMA(Boundary Matching Algorithm) assumes that the pixels on the boundary of the missing block and its neighboring blocks are very similar, but has no consideration of edges across the boundary. In our approach, the edges are detected across the boundary of the lost or erroneous block. Once the orientation of each edge is found, only the pixel difference along the expected edges across the boundary is measured instead of the calculation of difference along the expected edges across the boundary is measured instead of the calculation of differences between all adjacent pixels on the boundary Therefore, the proposed approach needs very few computations and the experiment shows and improvement of the performance over the conventional BMA in terms of both subjective and objective quality of video sequences.

• Journal of Broadcast Engineering
• /
• v.20 no.4
• /
• pp.533-544
• /
• 2015

Recently, most of the video services are usually transmitted in wireless networks. In networks environment, a packet of video is likely to be lost during transmission. For this reason, this paper proposes a new Error Concealment (EC) algorithm. For High Efficiency Video Coding (HEVC) bitstreams, the proposed algorithm includes Adaptive Prediction Unit-based Motion Vector Extrapolation (APMVE) and Boundary Matching (BM) algorithm, which employs both the temporal and spatial correlation. APMVE adaptively decides a Error Concealment Basic Unit (ECBU) by using the PU information of the previous frame and BM employing the spatial correlation is applied to only unreliable blocks. Simulation results show that the proposed algorithm provides the higher subjective quality by reducing blocking artifacts which appear in other existing algorithms.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.23 no.11
• /
• pp.1343-1350
• /
• 2019

Converting boundary images to time-series makes it feasible to perform boundary matching even on a very large image database, which is very important for interactive and fast matching. In recent research, there has been an attempt to perform fast matching considering partial denoising by converting the boundary image into time series. In this paper, to improve performance, we propose an index-building method considering all possible arbitrary denoising parameters for removing arbitrary partial noises. This is a challenging problem since the partial denoising boundary matching must be considered for all possible denoising parameters. We propose an efficient single index-building algorithm by constructing a minimum bounding rectangle(MBR) according to all possible denoising parameters. The results of extensive experiments conducted show that our index-based matching method improves the search performance up to 46.6 ~ 4023.6 times.

• 제어로봇시스템학회:학술대회논문집
• /
• 1991.10a
• /
• pp.1186-1191
• /
• 1991

This paper represents a new edge relaxation algorithm that enhances the noisy boundary informations in images. The proposed algorithm employes relaxation process that reduces or eliminates ambiguities of derivative operator response via contextual informations. The contextual informations are the neighborhood patterns of a central edge which are estimated using fuzzy pattern matching technique. The algorithm is developed on crack edges. Experimental results show that the proposed scheme is effective even for noisy images or low contrast images.