• Proceedings of the KOSOMBE Conference
• /
• v.1995 no.05
• /
• pp.131-134
• /
• 1995

A three dimensional fractal coding with a perceptually enhanced matching is proposed. Since most of medical images (e.g. computed tomography or magnetic resonance image) have three dimensional character, the searching region is extended to adjacent slices. For perceptually enhanced matching, a high frequency booster filter is used for prefiltering of the original image, and the least mean square error matching is applied to this edge enhanced image rather than the original image. From the simulation with the magnetic resonance images ($255{\times}255$, 8bits/pixel). the proposed algorithm provides excellent image quality with compression rations higher than 10. Compared to existing fractal coding the algorithm also provides better subjective image quality with higher compression ratio.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.28B no.11
• /
• pp.925-933
• /
• 1991

Conventional stereo matching techniques are based on the assumption that the features representing an object in left and right images have fixed attribute values. But, in fact, such features may take different values due to the practical stereo image formation and the image acquisition error, and thus the conventional techniques tend to result in the in the incorrect matching of features. In this paper, we propose a stereo matching mathod with a possibilistic view which copes with the possible variability of feature values. As a result, this method decreases the number of incorrect matching features when the values of corresponding features are somewhat large. The effectiveness of the proposed method is shown via computer simulation.

• Journal of Institute of Control, Robotics and Systems
• /
• v.15 no.5
• /
• pp.548-554
• /
• 2009

We propose an automatic inspection system for hologram with multiple patterns. The system hardware consists of illuminations, camera, and vision processor. Multiple illuminations using LEDs are arranged in different directions to acquire each image of patterns. The system software consists of pre-processing, pattern generation, and pattern matching. The acquired images of input hologram are compared with their reference patterns by developed matching algorithm. To compensate for the positioning error of input hologram, reference patterns of hologram for different position should be generated in on-line. We apply a frequency transformation based CGH(computer-generated hologram) method to generate reference images. For the fast pattern matching, we also apply the matching method in the frequency domain. Experimental results for hologram of Korean currency are then presented to verify the usefulness of proposed system.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.10 no.3
• /
• pp.554-559
• /
• 2009

This paper proposes a new method of weighted template matching fur machine-printed numeral recognition. The proposed weighted template matching, which emphasizes the feature of a pattern using adaptive Hamming distance on local feature areas, improves the recognition rate while template matching processes an input image as one global feature. The experiment compares confusion matrices of the template matching, error back propagation neural network classifier, and the proposed weighted template matching respectively. The result shows that the proposed method improves fairly the recognition rate of the machine-printed numerals.

• Journal of the Optical Society of Korea
• /
• v.20 no.4
• /
• pp.515-523
• /
• 2016

Spectral reflectance is sparse in space, and while the traditional spectral-reconstruction algorithm does not make full use of this characteristic sparseness, the compressive sensing algorithm can make full use of it. In this paper, on the basis of analyzing compressive sensing based on the orthogonal matching pursuit algorithm, a new algorithm based on the Dice matching criterion is proposed. The Dice similarity coefficient is introduced, to calculate the correlation coefficient of the atoms and the residual error, and is used to select the atoms from a library. The accuracy of Spectral reconstruction based on the pseudo-inverse method, Wiener estimation method, OMP algorithm, and DOMP algorithm is compared by simulation on the MATLAB platform and experimental testing. The result is that spectral-reconstruction accuracy based on the DOMP algorithm is higher than for the other three methods. The root-mean-square error and color difference decreases with an increasing number of principal components. The reconstruction error decreases as the number of iterations increases. Spectral reconstruction based on the DOMP algorithm can improve the accuracy of color-information replication effectively, and high-accuracy color-information reproduction can be realized.

• Journal of the Institute of Convergence Signal Processing
• /
• v.21 no.2
• /
• pp.55-60
• /
• 2020

In this paper, we propose a fast block matching algorithm of motion estimation using early detection of optimal candidate with high priority and a threshold. Even though so many fast algorithms for motion estimation have been published to reduce computational reduction full search algorithm, still so many works to improve performance of motion estimation are being reported. The proposed algorithm calculates block matching error for each candidate with high priority from previous partial matching error. The proposed algorithm can be applied additionally to most of conventional fast block matching algorithms for more speed up. By doing that, we can find the minimum error point early and get speed up by reducing unnecessary computations of impossible candidates. The proposed algorithm uses smaller computation than conventional fast full search algorithms with the same prediction quality as the full search algorithm. Experimental results shows that the proposed algorithm reduces 30~70% compared with the computation of the PDE and full search algorithms without any degradation of prediction quality and further reduces it with other fast lossy algorithms.

• Proceedings of the IEEK Conference
• /
• 1998.06a
• /
• pp.215-218
• /
• 1998

In this paper, we design the $H_{\infty}$ controllers satisfying robust stability and performance for underwater vehicle. The underwater vehicle has computations delay time and input delay. In addition, there exist parameter uncertainties by the roll motion coefficient error, buoyance error, and gravity error. We design the $H_{\infty}$ controllers using model-matching method and check the performance of the proposed controller by nonlinear simulation which includes time delay model, sensor error model, and actuator model.

• Proceedings of the IEEK Conference
• /
• 2003.11a
• /
• pp.271-274
• /
• 2003

This paper presents a robust error concealment method for burst-packet-loss networks. The proposed error concealment algorithm can reduce the computational complexities of the existing error concealment methods. Moreover, experimental results show that the proposed method produces the better video quality than the conventional boundary matching algorithm.

• Journal of Korea Multimedia Society
• /
• v.12 no.11
• /
• pp.1563-1571
• /
• 2009

In this paper, we propose a new boundary matching method for the temporal error concealment and a post processing algorithm for perceptual quality improvement of the concealed frame. Temporal error concealment is a method that substitutes error blocks with similar blocks from the reference frame. In conventional H.264/AVC standard, it compares outside pixels of erroneous block with inside pixels of reference block to find the most similar block. However, it is very possible that the conventional method substitutes erroneous block with the wrong one because it compares only narrow spatial range of pixels. In this paper, for substituting erroneous blocks with more correct blocks, we propose enhanced boundary matching method by comparing inside and outside pixels of reference block with outside pixels of erroneous block and setting up additional candidate motion vector in the fixed search range based on maximum and minimum value of candidate motion vectors. Furthermore, we propose a post processing method to smooth edges between concealed and decoded blocks without error by using the modified deblocking filter. We identified that the proposed method shows quality improvement of about 0.9dB over the conventional boundary matching methods.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.1B
• /
• pp.128-140
• /
• 2000

In this paper, we propose a fast block matching algorithm using the mean absolute error (MAE) of neighbor search point and search region reduction. The proposed algorithm is composed of two stages. At the first stage,the search region is divided into nonoverlapped 3$\times$3 areas and MAE of the center point of each area iscalculated. The minimum MAE value of all the calculated MAE's is determined as reference MAE. At thesecond stage, because the possibility that final motion vector exist near the position of reference MAE is veryhigh, we use smaller search region than first stage, And, using the MAE of center point of each area, the lowerbound of rest search point of each area is calculated and block matching process is performed only at the searchpoints that the lower bound is smaller than reference MAE. By doing so, we can significantly reduce thecomputational complexity while keep the increasement of motion estimation error small.