• Journal of KIISE:Software and Applications
• /
• v.30 no.3_4
• /
• pp.251-258
• /
• 2003

A support vector machine (SVM) is supposed to provide a good generalization performance, but the actual performance of a actually implemented SVM is often far from the theoretically expected level. This is largely because the implementation is based on an approximated algorithm, due to the high complexity of time and space. To improve this limitation, we propose ensemble of SVMs by using Bagging (bootstrap aggregating) and Boosting. By a Bagging stage each individual SVM is trained independently using randomly chosen training samples via a bootstrap technique. By a Boosting stage an individual SVM is trained by choosing training samples according to their probability distribution. The probability distribution is updated by the error of independent classifiers, and the process is iterated. After the training stage, they are aggregated to make a collective decision in several ways, such ai majority voting, the LSE(least squares estimation) -based weighting, and double layer hierarchical combining. The simulation results for IRIS data classification, the hand-written digit recognition and Face detection show that the proposed SVM ensembles greatly outperforms a single SVM in terms of classification accuracy.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.4
• /
• pp.707-714
• /
• 2016

Active driving safety systems for vehicle, such as the front collision avoidance, lane departure warning, and lane change assistance, have been popular to be adopted to the compact car. For improving performance and competitive cost, FMCW radar has been researched to adopt a phased array or a multi-beam antenna, and to integrate the front and the side radar. In this paper we propose several efficient methods to implement the signal processing module of FMCW radar system using low cost DSP. The pulse width modulation (PWM) based analog conversion, the approximation of time-eating functions, and the adoption of vector-based computation, etc, are proposed and implemented. The implemented signal processing board shows the real-time performance of 1.4ms pulse repetition interval (PRI) with 1024pt-FFT. In real road we verify the radar performance under real-time constraints of 10Hz update time.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.12A
• /
• pp.1387-1395
• /
• 2004

Turbo decoder inherently requires large memory and intensive hardware complexity due to iterative decoding, despite of excellent decoding efficiency. To decrease the memory space and reduce hardware complexity, various design issues have to be discussed. In this paper, various design issues on Turbo decoder are investigated and the tradeoffs between the hardware complexity and the performance are analyzed. Through the various simulations on the fixed-length analysis, we decided 5-bits for the received data, 6-bits for a priori information, and 7-bits for the quantization state metric, so the performance gets close to that of infinite precision. The MAX operation which is the main function of Log-MAP decoding algorithm is analyzed and the error correction term for MAX* operation can be efficiently implemented with very small hardware overhead. The size of the sliding window was decided as 32 to reduce the state metric memory space and to achieve an acceptable BER.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.16 no.3 s.94
• /
• pp.319-326
• /
• 2005

In the multi-carrier OFDM communication system for the high data rate transmission, the ICI caused by phase noise of transceiver local oscillator may degrade the system performance seriously. In this paper, a new ICI self-cancellation scheme using data-conjugate method is proposed to reduce the ICI caused by phase noise effectively. Then, the CPE, ICI and CIR are derived by the phase noise linear approximation method. Besides, to analyze the efficiency of system performance improvement, the proposed method is compared with the original OFDM and the conventional ICI self-cancellation scheme using data-conversion method. As results, the performance degradation caused by ICI can be mitigated effectively in the OFDM system with ICI self-cancellation scheme, and more performance improvement can be achieved by the proposed ICI self-cancellation scheme using data-conjugate method than the conventional ICI self-cancellation scheme using data-conversion method when phase noise exists.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.29 no.9
• /
• pp.701-706
• /
• 2018

The characteristic basis function method, or CFBM, is one of the representative electromagnetic methods widely used today. In this paper, we propose an accelerating algorithm for the far field interaction calculation of CBFM, to efficiently analyze the electromagnetic characteristics of arbitrarily large structures. To effectively analyze the electromagnetic characteristics of a large structure, it is essential to shorten the computation time. In the CBFM analysis method, the complexity can be greatly reduced by using approximations created via the multipole expansion method. The new algorithm proposed in this paper is applied to the computation of radar cross sections of conductor spheres and fighter aircraft, and it is confirmed that calculation time is reduced by 34 % and 74 %, respectively, without loss of accuracy compared with existing CBFM.

• Journal of Korean Society for Geospatial Information Science
• /
• v.13 no.3 s.33
• /
• pp.87-94
• /
• 2005

3D positional information of lane can be automatically calculated tv combining GPS data, IMU data if coordinates of lane centers are given. The Road Safety Survey and Analysis Vehicle(RoSSAV) is currently under development to analyze three dimensional safety and stability of roads. RoSSAV has GPS and IMU sensors to get positional information of the vehicle and two road-facing CCD cameras for extraction of lane coordinates. In this paper, we develop technology that automatically detects centers of lanes from the road-facing cameras of RoSSAV. The proposed algorithm defines line-support regions by grouping pixels with similar edge orientation and magnitude together and extracts a line from each line support region by planar fitting. Then if extracted lines and the region in-between satisfy the criteria of brightness and width, we decide this region as lane. The proposed algorithm was more precise and stable than the previously proposed algorithm based on brightness threshold method. Experiments with real road scenes confirmed that lane was effectively extracted by the proposed algorithm.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.18 no.2
• /
• pp.117-123
• /
• 2018

In this study, we suggest a fast image reconstruction scheme using Poisson equation from image gradient domain. In this approach, using the Poisson equation, a guided vector field is created by employing source and target images within a selected region at the first step. Next, the guided vector is used in generating the result image. We analyze the problem of reconstructing a two-dimensional function that approximates a set of desired gradients and a data term. The joined data and gradients are able to work like modifying the image gradients while staying close to the original image. Starting with this formulation, we have a screened Poisson equation known in physics. This equation leads to an efficient solution to the problem in FFT domain. It represents the spatial filters that solve the two-dimensional screened Poisson model and shows gradient scaling to be a well-defined sharpen filter that generalizes Laplace sharpening. We demonstrate the results using a discrete cosine transformation based this Poisson model.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.49 no.2
• /
• pp.63-70
• /
• 2012

The collision-free flight planning method based on the extended collision map is proposed for cooperation of multiple unmanned aerial vehicles (UAVs) in a common 3-dimensional workspace. First, a UAV is modeled as a sphere, taking its 3-D motions such as rolling into consideration. We assume that after entering the common workspace, the UAVs move along their straight paths until they depart from the workspace, and that the priorities of the UAVs are determined in advance. According to the assumptions, the collision detection problem between two spheres in $R^3$ can be reduced into the collision detection problem between a circle and a line in $R^2$. For convenience' sake and safety, the collision regions are approximated by collision boxes. Using the collision boxes, the entrance times of the UAVs are scheduled for collision avoidance among the UAVs. By this way, all UAVs can move in the common workspace without collisions with one another. For verifying the effectiveness of the proposed flight planning method, the simulation with 12 UAVs is carried out.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.42 no.9 s.339
• /
• pp.73-80
• /
• 2005

The Turbo decoders based on Log-MAP decoding algorithm inherently requires large amount of memory and intensive complexity of hardware due to iterative decoding, despite of excellent decoding efficiency. To decrease the large amount of memory and reduce hardware complexity, the result of previous research. And this paper design the Turbo decoder applicable to the 3G W-CDMA systems. Through the result of previous research, we decided 5-bits for the received data 6-bits for a priori information, and 7-bits for the quantization state metrics. The error correction term for $MAX^{*}$ operation which is the main function of Log-MAP decoding algorithm is implemented with very small hardware overhead. The proposed Turbo decoder is synthesized in $0.35\mu$m Hynix CMOS technology. The synthesized result for the Turbo decoder shows that it supports a maximum 9Mbps data rate, and a BER of $10^{-6}$ is achieved(Eb/No=1.0dB, 5 iterations, and the interleaver size $\geq$ 2000).

• Journal of KIISE:Databases
• /
• v.32 no.5
• /
• pp.509-525
• /
• 2005

In this paper, we propose the index structure based on a vector approximation for efficiently supporting the similarity search of multi-dimensional data. The proposed index structure splits a region with the space partition method and allocates to the split region dynamic bits according to the distribution of data. Therefore, the index structure splits a region to the unoverlapped regions and can reduce the depth of the tree by storing the much region information of child nodes in a internal node. Our index structure represents the child node more exactly and provide the efficient search by representing the region information of the child node relatively using the region information of the parent node. We show that our proposed index structure is better than the existing index structure in various experiments. Experimental results show that our proposed index structure achieves about $40\%$ performance improvements on search performance over the existing method.