• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.18 no.5
• /
• pp.125-132
• /
• 2017

Vehicular safety service reduces traffic accidents and traffic congestion by informing drivers in advance of threats that may occur while driving using vehicle-to-vehicle (V2V) communications in a wireless environment. For vehicle safety services, every vehicle must broadcasts a Basic Safety Message(BSM) periodically. In congested traffic areas, however, network congestion can easily happen, reduce the message delivery ratio, increase end-to-end delay and destabilize vehicular safety service system. In this paper, to solve the network congestion problem in vehicle safety communications, we approximate the relationship between channel busy ratio and the number of vehicles and use it to estimate the total network congestion. We propose a new context-aware transmit power control algorithm which controls the transmission power based on total network congestion. The performance of the proposed algorithm is evaluated using Qualnet, a network simulator. As a result, the estimation of total network congestion is accurately approximated except in specific scenarios, and the packet error rate in vehicle safety communication is reduced through transmit power control.

• 한국지구물리탐사학회:학술대회논문집
• /
• 2005.05a
• /
• pp.281-286
• /
• 2005

This paper presents sensitivity analysis of generalized rapid relaxation inversion (GRRI) algorithm for inverting controlled-source audio-frequency magnetotelluric (CSAMT) data. The algorithm was originally developed by modifying the RRI algorithm to recover a two-dimensional (2-D) conductivity structure of the Earth from MT data, but can be extended to include CSAMT data if it is combined with 2.5-D forward modeling. These GRRI approximate sensitivities are validated by comparison with exact 1-D and 2.5-D sensitivities. The comparison shows that the GRRI sensitivity is a good approximation to the exact sensitivity and has about half magnitude of the RRI sensitivity. Although the magnitude of the GRRI sensitivity is still slightly larger than that of the 2.5-D sensitivity, both sensitivities are broadly similar in shape when source-receiver offsets are greater than one skin depth on the Earth.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.38 no.3
• /
• pp.228-235
• /
• 2010

This paper deals with an autonomous flight controller design problem for a tilt-rotor aircraft in rotary-wing mode. The inner-loop algorithm is designed using the output-based approximate feedback linearization. The model error originated from the feedback linearization is cancelled within allowable tolerance by using single-hidden-layer neural network. According to Lyapunov direct stability theory, the adaptive update law is derived to run the neural network on-line, which is based on the linear observer dynamics. Moreover, the outer-loop algorithm is designed to track the trajectory generated from way-point guidance. Especially, heading and flight-path angle line-of-sight guidance are applied to the outer-loop to improve accuracy of the landing tracking performance. The 6-DOF nonlinear simulation shows that the overall performance of the flight control algorithm is satisfactory even though the collective input response shows instantaneous actuator saturation for a short time due to the lack of the neural network and the saturation protection logic in that loop.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.47 no.5
• /
• pp.175-182
• /
• 2010

The paper presents a novel algorithm for face and iris detection with the application for driver iris monitoring. The proposed algorithm consists of the following major steps: Skin-color segmentation, facial features segmentation, and iris positioning. For the skin-segmentation we applied a multi-layer perceptron to approximate the statistical probability of certain skin-colors, and filter out those with low probabilities. The next step segments the face region into the following categories: eye, mouth, eye brow, and remaining facial regions. For this purpose we propose a novel segmentation technique based on estimation of facial class probability density functions (PDF). Each facial class PDF is estimated on the basis of salient features extracted from a corresponding facial image region. Then pixels are classified according to the highest probability selected from four estimated PDFs. The final step applies the circular Hough transform to the detected eye regions to extract the position and radius of the iris. We tested our system on two data sets. The first one is obtained from the Web and contains faces under different illuminations. The second dataset was collected by us. It contains images obtained from video sequences recorded by a CCD camera while a driver was driving a car. The experimental results are presented, showing high detection rates.

• 전자공학회논문지 IE
• /
• v.46 no.1
• /
• pp.7-15
• /
• 2009

In this paper, automatic structure boundary extraction is proposed using terrestrial LIDAR (Light Detection And Ranging) in 3-dimensional data. This paper describes an algorithm which does not use pictures and pre-processing. In this algorithm, an efficient decimation method is proposed, considering the size of object, the amount of LIDAR data, etc. From these decimated data, object points and non-object points are distinguished using distance information which is a major features of LIDAR. After that, large and small values are extracted using local variations, which can be candidate for boundary. Finally, a boundary line is drawn based on the boundary point candidates. In this way, the approximate boundary of the object is extracted.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.8 no.5
• /
• pp.98-106
• /
• 1998

This paper proposes an efficient learning algorithm for improving the training performance of the neural network. The proposed method improves the training performance by applying the backpropagation algorithm of a global optimization method which is a hybrid of a stochastic approximation and a conjugate gradient method. The approximate initial point for f a ~gtl obal optimization is estimated first by applying the stochastic approximation, and then the conjugate gradient method, which is the fast gradient descent method, is applied for a high speed optimization. The proposed method has been applied to the parity checking and the pattern classification, and the simulation results show that the performance of the proposed method is superior to those of the conventional backpropagation and the backpropagation algorithm which is a hyhrid of the stochastic approximation and steepest descent method.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.39 no.1
• /
• pp.49-60
• /
• 2002

We propose an algorithm for extracting the boundary of a desired object with shape information obtained from sample images. Considering global shape obtained from sample images and edge orientation as well as edge magnitude, the Proposed method composed of two steps finds the boundary of an object. The first step is the approximate segmentation that extracts a rough boundary with a probability map and an edge map. And the second step is the detailed segmentation for finding more accurate boundary based on the SEEL (seed-point extraction and edge linking) algorithm. The experiment results using IR images show robustness to low-quality image and better performance than conventional segmentation methods.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.8
• /
• pp.3-9
• /
• 2015

Under the maximum transmit power constraint and the minimum rate constraint, we propose the optimal number of transmit antennas and transmit power which maximize energy-efficiency (EE) in multi-user multiple-input multiple-output (MIMO) downlink system with the maximal ratio transmission (MRT) precoding. Because the optimization problem for the instantaneous channel is difficult to solve, we use independence of individual channel, average channel gain and path loss to approximate the objective function. Since the approximated EE optimization problem is two-dimensional search problem, we find the optimal number of transmit antennas and transmit power using Lagrange multipliers and our proposed algorithm. Simulation results show that the number of transmit antennas and power obtained by proposed algorithm are almost identical to the value by the exhaustive search.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.48 no.1
• /
• pp.1-7
• /
• 2011

Terrain, building location and area, and building shape information is in need of implementing 3D map. This paper proposes a method of extracting a building area by an improved semi-automatic snake algorithm. The method consists of 3-stage: pre-processing, initializing control points, and applying an improved snake algorithm. In the first stage, after transforming a satellite image to a gray image and detecting the approximate edge of the gray image, the method combines the gray image and the edge. In the second stage, the user looks for the center point of a building and the system sets the circular or rectangular initial control points by an procedural method. In the third stage, the enhanced snake algorithm extracts the building area. In particular, this paper sets the one tenn of the snake in a new way in order to use the proposed method for specializing building area extraction. Finally, this paper evaluated the performance of the proposed method using sky view satellite image and it showed that the matching percentage to the exact building area is 75%.

• Journal of the Korean Institute of Telematics and Electronics T
• /
• v.35T no.3
• /
• pp.15-24
• /
• 1998

In this paper, we present new method of fractal image coding based on iterated function system(IFS) suggested by Barnsley. In previous Fractal coding using full searching algorithm, the quality of reconstructed image was better than other fractal coding method's, but it took a long time in that algorithm for searching domain blocks matched. And it is performed through linear affine transform, therefore it is difficult to approximate the complex range blocks. In this paper, using quadtree partitioning, complex blocks are divided into more smaller blocks, and simple blocks are merged to more larger blocks. So, we can got more precisely approximated range blocks and reduce the number of transformations. Hence, we have improved the compression ratio. In addition, we restrict the region of searching domains in order to reduce the searching time and coding time. Compared with full searching algorithm, we reduced coding time drastically, and quality of reconstructed image was better in terms subjective criteria. And compared with Monro's, our method is slower, but we could obtain a reconstructed image with better quality.