• Proceedings of the KSRS Conference
• /
• v.2
• /
• pp.772-775
• /
• 2006

Muilti-dimensional feature vector matching algorithm uses multiple features such as intensity, gradient, variance, first or second derivative of a pixel to find correspondence pixels in stereo images. In this paper, we proposed a new method for adjusting automatically the weight of feature in multi-dimensional feature vector matching considering sharpeness of a pixel in feature vector distance curve. The sharpeness consists of minimum and maximum vector distances of a small window mask. In the experiment we used IKONOS satellite stereo imagery and obtained accurate matching results comparable to the manual weight-adjusting method.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10a
• /
• pp.145-147
• /
• 2003

We derive a simple clustering algorithm which partitions the given data by minimizing overlap between clusters. For simple implementation and less complexity, Parzen window density estimation and quadratic distance measure between densities are adopted.

• Proceedings of the KIEE Conference
• /
• 1998.11a
• /
• pp.208-210
• /
• 1998

A high speed digital distance relaying algorithm based on a modified least square error method is proposed. To obtain stable phasor values very Quickly, first, a lowpass filter which has very short transient period and no overshoot is used. Secondly, the conventional least square error method is modified to the one having the data window of 3 samples by applying a FIR filter which removes the DC-offset component in current relaying signals.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.6
• /
• pp.886-898
• /
• 1995

One of the ways to measure the distance in the computer vision is to use the focus and defocus. There are two methods in this way. The first method is caculating the distance from the focused images in a point (MMDFP: the method measuring the distance to the focal plane). The second method is to measure the distance from the difference of the camera parameters, in other words, the apertures of the focal planes, of two images with having the different parameters (MMDCI: the method to measure the distance by comparing two images). The problem of the existing methods in MMDFP is to decide the thresholding vaue on detecting the most optimally focused object in the defocused image. In this case, it could be solved by comparing only the error energy in 3x3 window between two images. In MMDCI, the difficulty is the influence of the deflection effect. Therefor, to minimize its influence, we utilize two differently focused images instead of different aperture images in this paper. At the first, the amount of defocusing between two images is measured through the introduction of regularization and then the distance from the camera to the objects is caculated by the new equation measuring the distance. In the results of simulation, we see the fact to be able to measure the distance from two differently defocused images, and for our approach to be robuster than the method using the different aperture in the noisy image.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.18 no.1
• /
• pp.44-51
• /
• 2004

Fractal-space multiplexing using a moving window(MW) can multiplex holograms by moving a window left and right. and up and down. But, crosstalk occurs by two neighboring moving windows in the vertical direction of the holographic memory system and limits high-density information recording. Accordingly, we analyzed the crosstalk with the focal length of lens, the distance of MW, and the number of multiplexed hologram to record high-density infromation and presented the optical experimental results of fractal-space multiplexing using volumetric photorefractive crystal and disc type photopolymer.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.51 no.8
• /
• pp.371-378
• /
• 2002

This paper presents the rapid and accurate algorithm for fault detection and location estimation in the transmission line. This algorithm uses wavelet transform for fault detection and harmonics elimination and utilizes least square error method for fault impedance estimation. Wavelet transform decomposes fault signals into high frequence component Dl and low frequence component A3. The former is used for fault phase detection and fault types classification and the latter is used for harmonics elimination. After fault detection, an adaptive data window technique using LSE estimates fault impedance. It can find a optimal data window length and estimate fault impedance rapidly, because it changes the length according to the fault disturbance. To prove the performance of the algorithm, the authors test relaying signals obtained from EMTP simulation. Test results show that the proposed algorithm estimates fault location within a half cycle after fault irrelevant to fault types and various fault conditions.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.48 no.7
• /
• pp.855-862
• /
• 1999

A high speed digital distance relaying algorithm based on a least square error method is proposed. To obtain stable phasor values very quickly, first, a lowpass filter which has very short transient period and no overshoot is presented. Secondly, the least square error method having the data window of 3 samples is used by applying a FIR filter which removes the DC-offset component in current relaying signals. Test results show that the proposed distance relaying algorithm detects most of internal faults within a half cycle after faults in a 154[kV] overhead transmission line system.

• Korean Journal of Remote Sensing
• /
• v.34 no.3
• /
• pp.535-543
• /
• 2018

Recently, level meters have been associated with the safety and maintenance of industrial sites and require a wide measurement range. Generally, to ensure the measurement range of the level meter, the measurement environment is improved to reduce the noise or to compensate the distortion of the signal through signal processing. The noise of FMCW (Frequency Modulated Continuous Wave) radar level meter or the distortion of the signal affects the near region characteristics of the level gauge, resulting in a reduction of the minimum detection distance. In this paper, an equalizer filter considering characteristics of window function and bit spectrum is applied to remove the noise in the near region of the level meter to improve the minimum detection distance performance and to improve the measurement reliability in the vicinity of the level meter, which is relatively difficult to detect, we want to improve the detection range.

• Journal of Power System Engineering
• /
• v.20 no.6
• /
• pp.99-104
• /
• 2016

In this study, we researched the energy load according to the change of the inner window area ratio, the distance of the air gap and the azimuth of the curtain wall building, which installed the multistory double-skin facade(DSF). and we compared the results with the no double-skin facade situation as follows. With the DSF, it is better than other case, when the window area ratio is 40% and the air gap is 1.2m on the west, south-45-west, south-45-east and east. And it's best when the window area ratio is 40% and the air gap is 0.4m on the south. And on the east or south-45-east, the window area ratio is 40% and the air gap is 1.2m is better than other case with the DSF. On south, it is best when the window area ratio is 100% without DSF. On the south-45-west or west, it is best when the window area ratio is 40% without the DSF.

• The KIPS Transactions:PartC
• /
• v.14C no.7
• /
• pp.571-582
• /
• 2007

Vehicular ad-hoc networks is temporarily established through inter-vehicle communication without any additional infrastructure aids. It requires a immediate message propagation because it mainly deals with critical traffic information such as traffic accidents. The distance-based broadcast scheme is one of the representative broadcast schemes for vehicular ad-hoc network. In this scheme, a node to disseminate messages is selected based on a distance from a source node. However, a message propagation delay will be increased if the relay nodes are not placed at the border of transmission range of the source node. In particular, when the node density is low, the message propagation delay is getting longer. In this paper, we propose a time-window reservation based relay node selection scheme. A node receiving the alert message from the source node has its time-window and randomly selects its waiting time within the given time-window range. A proportional time period of the given time-window is reserved in order to reduce the message propagation delay. The experimental results show that the proposed scheme has shorter message propagation delay than the distance-based broadcast scheme irrespective of node density in VANET. In particular, when the node density is low, the proposed scheme shows about 26% shorter delay and about 46% better performance in terms of compound metric, which is a function of propagation latency and network traffic.