• Journal of Korean Institute of Industrial Engineers
• /
• v.25 no.2
• /
• pp.233-239
• /
• 1999

With the increase of Internet protocol (IP) packets the performance of routers became an important issue in internetworking. In this paper we examined the matching algorithm in gigabit router which has input queue with virtual output queueing. Port partitioning concept is employed to reduce the computational burden of the scheduler within a switch. The input and output ports are divided into two groups such that the matching algorithm is implemented within each input-output pair group in parallel. The matching is performed by exchanging input and output port groups at every time slot to handle all incoming traffics. Two algorithms, maximal weight matching by port partitioning (MPP) and modified maximal weight matching by port partitioning (MMPP) are presented. MMPP has the lowest delay for every packet arrival rate. The buffer size on a port is approximately 20-60 packets depending on the packet arrival rates. The throughput is illustrated to be linear to the packet arrival rate, which can be achieved under highly efficient matching algorithm.

• Proceedings of the KIEE Conference
• /
• 2000.11d
• /
• pp.747-749
• /
• 2000

In this paper, we proposed color stereo matching algorithm using dynamic programming. The conventional gray stereo matching algorithms show blur at depth discontinuities and non-existence of matching pixel in occlusion lesions. Also it accompanies matching error by lack of matching information in the untextured region. This paper defines new cost function makes up for the problems happening in conventional gray stereo matching algorithm. New cost function contain the following properties. I) Edge points are corresponded to edge points. ii) Non-edge points are corresponded to non-edge points. iii) In case of exiting the amount of edges, the cost function has some weight in proportion to path distance. Proposed algorithm was applied in various images obtained by parallel camera model. As the result, proposed algorithm showed improved performance in the aspect of matching error and processing in the occlusion region compared to conventional gray stereo matching algorithms.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.51 no.8
• /
• pp.335-343
• /
• 2002

A segment matching algorithm in stereo vision via the fusion of multiple features on long edge segments is proposed. One problem of the previous segment matching algorithm is the similarity among the segments caused from its short length. In the proposed algorithm, edges are composed of longer segments which are obtained by breaking the edges only at the locations with distinguished changes of the shape. Such long segments can contain extra features such as curvature ratio and length of segments which could not be included in shorter ones. Use of such additional features enhances the matching accuracy significantly To fuse multiple features for matching, weighting value determination algorithm which is computed according to the degree of the contribution of each factor is proposed. The stereo matching simulations with the proposed algorithm are done about various images and their results are included.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.25 no.10
• /
• pp.1310-1316
• /
• 2021

Recently, with the development of artificial intelligence and IoT technology, the importance of video processing such as object tracking, medical imaging, and object recognition is increasing. In particular, the noise reduction technology used in the preprocessing process demands the ability to effectively remove noise and maintain detailed features as the importance of system images increases. In this paper, we provide a modified weight filter based on pixel matching in an AWGN environment. The proposed algorithm uses a pixel matching method to maintain high-frequency components in which the pixel value of the image changes significantly, detects areas with highly relevant patterns in the peripheral area, and matches pixels required for output calculation. Classify the values. The final output is obtained by calculating the weight according to the similarity and spatial distance between the matching pixels with the center pixel in order to consider the edge component in the filtering process.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.2 s.34
• /
• pp.1-10
• /
• 2005

In this Paper, we propose a new block matching a1gorithm that extracts motion vectors from consecutive range data. The proposed method defines a matching metric that integrates intensity, hue, and range. Our algorithm begins matching with a small matching template. If the matching degree is not good enough, we slightly expand the size of a matching template and then repeat the matching process until our matching criterion is satisfied or the predetermined maximum size has been reached. As the iteration proceeds, we adaptively adjust weights of the matching metric by considering the importance of each feature. In the experiments, we show that our block matching approach can work as a promising solution by comparing the proposed method with previously known method in terms of performance.

• International Journal of Advanced Culture Technology
• /
• v.5 no.1
• /
• pp.76-82
• /
• 2017

An image hash, a discriminative and robust summary of an image, should be robust against quality-preserving signal processing steps, while being pairwise independent for perceptually different inputs. In order to improve the hash matching performance, this paper proposes a probabilistic dissimilarity matching. Instead of extracting the binary hash from the query image, we compute the probability that the intermediate hash vector of the query image belongs to each quantization bin, which is referred to as soft quantization binning. The probability is used as a weight in comparing the binary hash of the query with that stored in a database. A performance evaluation over sets of image distortions shows that the proposed probabilistic matching method effectively improves the hash matching performance as compared with the conventional Hamming distance.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.1
• /
• pp.75-85
• /
• 2013

To acquire depth information using stereo vision, it is required to find correspondence points between stereo image pair. Conventional stereo vision systems usually use two cameras to get disparity data. Therefore, conventional stereo matching methods cannot resolve the tradeoff problem between accuracy and precision with respect to the length of baseline. Besides, belief propagation method, which is being used recently, has a problem that matching performance is dependent on the fixed weight parameter ${\lambda}$. In this paper, we propose a modified belief propagation stereo matching technique based on multi-baseline stereo vision to solve the tradeoff problem. The proposed method calculates EMAD(extended mean of absolute differences) as local evidence. And proposed method decides weight parameter ${\lambda}$ adaptively to local texture information. The proposed method shows higher initial matching performance than conventional methods and reached optimum solution in less iteration. The matching performance is increased about 4.85 dB in PSNR.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.08a
• /
• pp.73-76
• /
• 2008

We present a area-based method for stereo matching using varying weights. A central problem in a area-based stereo matching is different result from selecting a window size. Most of the previous window-based methods iteratively update windows. However, the iterative methods very sensitive the initial disparity estimation and are computationally expensive. To resolve this problem, we proposed a new function to assign weights to pixels using features. To begin with, we extract features in a given stereo images based on edge. We adjust the weights of the pixels in a given window based on correlation of the stereo images. Then, we match pixels in a given window between the reference and target images of a stereo pair. The proposed method is compared to existing matching strategies using both synthetic and real images. The experimental results show the improved accuracy of the proposed method.

• The Journal of Korean Medicine
• /
• v.43 no.3
• /
• pp.65-78
• /
• 2022

Objectives: The purpose of this study is to analyze the weight loss and the adverse events of overweight and obese adults on weight loss program with face-to-face treatment (FTF) and non-face-to-face treatment (NFTF) in 6 Korean Medicine obesity clinics. Methods: From March 2nd to March 10th, 2021, we collected data with a retrospective way from overweight and obese adults (body mass index, BMI≥23 kg/m²) who registered for a 12-week Gamitaeeumjowi-tang prescription program. After matching initial information of the FTF group and the NFTF group using propensity matching score, weight loss and BMI change were analyzed, and adverse events were evaluated in terms of causality, severity and system-organ classes. Results: Weight and BMI change from baseline to 12 weeks was -7.98±3.09kg (10.41±3.57%), -3.03±1.14kg/m² and -7.30±3.11kg (9.59±3.45%), -2.76±1.15kg/m² for FTF group and NFTF group, respectively. Body weight and BMI significantly decreased before and after treatment in both groups, and there was no significant difference in weight loss and BMI change between the two groups. No serious adverse events were reported. Conclusions: This study showed the potential that NFTF weight management treatment could be a good alternative way to FTF weight management treatment without serious adverse events.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.6
• /
• pp.1194-1199
• /
• 2009

Stereo vision system is useful method for inferring 3D depth information from two or more images. So it has been the focus of attention in this field for a long time. Stereo matching is the process of finding correspondence points in two or more images. A central problem in a stereo matching is that it is difficult to satisfy both the computation time problem and accuracy at the same time. To resolve this problem, we proposed a new stereo matching technique using weighted cost aggregation. To begin with, we extract the weight in given stereo images based on features. We compute the costs of the pixels in a given window using correlation of weighted color and brightness information. Then, we match pixels in a given window between the reference and target images of a stereo pair. To demonstrate the effectiveness of the algorithm, we provide experimental data from several synthetic and real scenes. The experimental results show the improved accuracy of the proposed method.