• Journal of Institute of Control, Robotics and Systems
• /
• v.5 no.3
• /
• pp.363-369
• /
• 1999

In this paper, we design the robust $H_{\infty}$ controller for water level control of steam generator using a mixed $H_{\infty}$ optimization with model-matching method. Firstly we choose the desired model which has good disturbance rejection performance. Secondly we design a stabilizing controller to keep the model-matching error small and also provide sufficiently large stability margin against additive perturbations of the nominal plant. Simulation results show that proposed robust $H_{\infty}$ controller at specific power operation has satisfactory performances against the variations of load power, steam flow rate, primary circuit coolant temperature, and feedwater temperature. It can be also observed that the proposed robust $H_{\infty}$ controller exhibits better robust stability than conventional PI controller.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.48 no.2
• /
• pp.88-95
• /
• 2011

Stereo matching is the research area that regarding the estimation of the distance between objects and camera using different view points and it still needs lot of improvements in aspects of speed and accuracy. This paper presents a fast stereo matching algorithm based on plane-converging belief propagation that uses message passing convergence in hierarchical belief propagation. Also, stereo matching technique is developed using GPU and it is available for real-time applications. The error rate of proposed Plane-converging Belief Propagation algorithm is similar to the conventional Hierarchical Belief Propagation algorithm, while speed-up factor reaches 2.7 times.

• Journal of information and communication convergence engineering
• /
• v.9 no.4
• /
• pp.447-451
• /
• 2011

Recently, various in-vehicle networks have been developed respectively in order to accomplish their own purposes such as CAN and MOST. Especially, the MOST network is usually adapted to provide entertainment service. The car navigation system is also widely used for guiding driving paths to driver. The position for the navigation system is usually acquired by GPS technology. However, the GPS technique has two serious problems. The first is unavailability in urban canyons. The second is inherent positional error rate. The problems have been studied in many literatures. However, the second still leads to incorrect locational information in some area, especially parallel roads. This paper proposes a performance tuning method of image matching algorithm for the car navigation system. The method utilizes images obtained from in-vehicle MOST network and a real-time image matching algorithm which determines the direction of moving vehicle in parallel section of road. In order to accuracy improvement of image matching algorithm, three conditions are applied. The experimental tests show that the proposed system increases the accuracy.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2011.05a
• /
• pp.119-122
• /
• 2011

The Stereo vision using belief propagation algorithm that has been studied recently yields good performance in disparity extraction. In this paper, BP algorithm is proved theoretically to high precision for a stereo matching algorithm. We derive disparity map from stereo image by using Belief Propagation (BP) algorithm and area-based matching algorithm. Two algorithms are compared using stereo images provided by Middlebury web site. Disparity map error rate decreased from 52.3% to 2.3%.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.11
• /
• pp.62-71
• /
• 1996

In this paper we propose a method that improves PSNR at low bit rate and reduces computational complexity in fractal image coding based on discrete wavelet transform. The proposed method, which uses significant coefficient tree, improves PSNR of the reconstructed image and reduces computational comlexity of mapping domain block onto range block by matching only the significant coefficients of range block to coefficients of domain block. Also, the proposed method reduces error propagation form lower resolution subbands to higher resolution subbands by correcting error of lower resolution subbands. Some experimental results confirm that the proposed method reduces encoding and decoding time significantly and has fine reconstructed images having no blocking effect and clear edges at low bit rate.

• The Korean Journal of Applied Statistics
• /
• v.30 no.3
• /
• pp.453-462
• /
• 2017

Double propensity score adjustment is an analytic solution to address bias due to incomplete matching. However, it is difficult to estimate the standard error of the estimated treatment effect when using double propensity score adjustment. In this study, we propose two bootstrap methods to estimate the standard error. The first is a simple bootstrap method that involves drawing bootstrap samples from the matched sample using the propensity score as well as estimating the standard error from the bootstrapped samples. The second is a complex bootstrap method that draws bootstrap samples first from the original sample and then applies the propensity score matching to each bootstrapped sample. We examined the performances of the two methods using simulations under various scenarios. The estimates of standard error using the complex bootstrap were closer to the empirical standard error than those using the simple bootstrap. The simple bootstrap methods tended to underestimate. In addition, the coverage rates of a 95% confidence interval using the complex bootstrap were closer to the advertised rate of 0.95. We applied the two methods to a real data example and found also that the estimate of the standard error using the simple bootstrap was smaller than that using the complex bootstrap.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.5C
• /
• pp.469-477
• /
• 2007

Most multimedia source coders exhibit unequal bit error sensitivity. Efficient transmission system design should therefore incorporate the use of matching unequal error protection (UEP). In this paper, we present and evaluate a flexible space-time coding system with unequal error protection. Multiple transmit and receive antennas and bit-interleaved coded modulation techniques are used combined with rate compatible punctured convolutional codes. A near optimum iterative receiver is employed with a multiple-in multiple-out inverse mapper and a MAP decoder as component decoders. We illustrate how the UEP system gain can be achieved either as a power or bandwidth gain compared to the equal error protection system (EEP) for the identical source and equal overall quality for both the UEP and EEP systems. An example with two/three transmit and two receive antennas using BPSK modulation is given for the block fading channel.

• Journal of Broadcast Engineering
• /
• v.10 no.2
• /
• pp.166-173
• /
• 2005

In this paper, we propose a mobile channel estimation algorithm using matching pursuit algorithm for orthogonal frequency division multiplexing (OFDM) systems. Least square (LS) algorithm, which is used as a conventional channel estimation algorithm for OFDM systems, has error probability of channel estimation affected by effects of noise. By estimating the channel of sparse type, the proposed algorithm reduces effects of noise during time intervals that multi-path signal doesn't exist. The proposed algorithm estimates a mobile receivingchannel using pilot information transmitted consequently. We compare performance of the proposed algorithm with the LS algorithm by measuring symbol error rate with 64QAM under a mobile multi-path fading channel model.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2013.05a
• /
• pp.385-388
• /
• 2013

In this paper, we show the weakness of the image matching method by using MPEG-7 EHD(Edge Histogram Descriptor) and suggest how to improve this weakness by using image normalization. EHD algorithm is an image matching technique that collects edge's slope of distribution and same distribution. However, the EHD error rate is high because EHD is sensitive for changes of object distortion and rotation that will be matched. We improve matching performance by accurately extract edge information in image by using normalization. We compare and analyze the normalized EHD algorithm by using distortion and rotation and it shows robustness for changes of the size and rotation.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.20 no.9
• /
• pp.1-6
• /
• 2019

One method for image recognition is template matching. In conventional template matching, the block matching algorithm (BMA) is performed while changing the two-dimensional translational displacement of the template within a given matching image. The template size and shape do not change during the BMA. Since only two-dimensional translational displacement is considered, the success rate decreases if the size and direction of the object do not match in the template and the matching image. In this paper, a variable is added to adjust the two-dimensional direction and size of the template, and the optimal value of the variable is automatically calculated in the block corresponding to each two-dimensional translational displacement. Using the calculated optimal value, the template is automatically transformed into an optimal template for each block. The matching error value of each block is then calculated based on the automatically deformed template. Therefore, a more stable result can be obtained for the difference in direction and size. For ease of use, this study focuses on designing the algorithm in a closed form that does not require additional information beyond the template image, such as distance information.