• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.4
• /
• pp.492-497
• /
• 2005

Feature extraction is important to classify data with large dimension such as image data. The representative feature extraction methods lot feature extraction ate PCA, ICA, LDA and MLP, etc. These algorithms can be classified in two groups: unsupervised algorithms such as PCA, LDA, and supervised algorithms such as LDA, MLP. Among these two groups, supervised algorithms are more suitable to extract the features for classification because of the class information of input data. In this paper we suggest a new feature extraction algorithm PCA-FX which uses class information with PCA to extract ieatures for classification. We test our algorithm using Yale face database and compare the performance of proposed algorithm with those of other algorithms.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.8
• /
• pp.31-39
• /
• 2010

The paper proposes the median filter based Retinex algorithm to detect the lanes in a foggy image. Whether an input image is foggy or not is determined by analyzing the histogram in the pre-defined ROI(Region of Interest). If the image is determined as a foggy one, then it is improved by the median filter based Retinex algorithm. By replacing the Gaussian filter by the median filter in the Retinex algorithm, the processing time can be reduced and the lane features can be detected more robustly. Once the enhanced image is acquired, the binarization based on multi-threshold and the labeling operations are applied. Finally, it detects the lane information using the size and direction parameters of the detected lane features. The proposed algorithm has been evaluated by using various foggy images collected on different road conditions to prove that it detects lanes more robustly in most cases than the conventional methods.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.25 no.2
• /
• pp.214-220
• /
• 2021

In modern society, various digital communication equipments are being used due to the influence of the 4th industrial revolution, and accordingly, interest in removing noise generated in the data transmission process is increasing. In this paper, we propose a filtering algorithm to remove AWGN generated during digital image transmission. The proposed algorithm removes noise based on mask matching to preserve information such as the boundary of an image, and uses pixel values with similar patterns according to the pattern of the input pixel value and the surrounding pixels for output calculation. To evaluate the proposed algorithm, we simulated with existing AWGN removal algorithms, and analyzed using enlarged image and PSNR comparison. The proposed algorithm has superior AWGN removal performance compared to the existing method, and is particularly effective in images with strong noise intensity of AWGN.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2022.05a
• /
• pp.428-430
• /
• 2022

Image processing is playing an important part in automation and artificial intelligence systems, such as object tracking, object recognition and classification, and the importance of IoT technology and automation is emphasizing as interest in automation increases. However, in a system that requires detailed data such as an image boundary, a precise noise removal algorithm is required. Therefore, in this paper, we propose a filtering algorithm based on the pixel value distribution pattern to minimize the information loss in the filtering process. The proposed algorithm finds the distribution pattern of neighboring pixel values with respect to the pixel values of the input image. Then, a weight mask is calculated based on the distribution pattern, and the final output is calculated by applying it to the filtering mask. The proposed algorithm has superior noise removal characteristics compared to the existing method and restored the image while minimizing blurring.

• ETRI Journal
• /
• v.24 no.4
• /
• pp.311-322
• /
• 2002

Presently, optical burst switching (OBS) technology is under study as a promising solution for the backbone of the optical Internet in the near future because OBS eliminates the optical buffer problem at the switching node with the help of no optical/electro/optical conversion and guarantees class of service without any buffering. To implement the OBS network, there are a lot of challenging issues to be solved. The edge router, burst offset time management, and burst assembly mechanism are critical issues. In addition, the core router needs data burst and control header packet scheduling, a protection and restoration mechanism, and a contention resolution scheme. In this paper, we focus on the burst assembly mechanism. We present a novel data burst generation algorithm that uses hysteresis characteristics in the queueing model for the ingress edge node in optical burst switching networks. Simulation with Poisson and self-similar traffic models shows that this algorithm adaptively changes the data burst size according to the offered load and offers high average data burst utilization with a lower timer operation. It also reduces the possibility of a continuous blocking problem in the bandwidth reservation request, limits the maximum queueing delay, and minimizes the required burst size by lifting up data burst utilization for bursty input IP traffic.

• Spatial Information Research
• /
• v.18 no.5
• /
• pp.107-117
• /
• 2010

Taking the East-Hwasung area as the case, this study first builds gridded population data based on the municipal population survey raw data, and then measures, by way of GIS tools, the major urban spatial variables that are thought to influence the composition of the regional population. For the purpose of comparison, the urban models based on the Genetic Algorithm technique and the regression technique are constructed using the same input variables. The findings indicate that the GA output performed better in differentiating the effective variables among the pilot model variables, and predicted as much consistent and meaningful coefficient estimates for the explanatory variables as the regression models. The study results indicate that GA technique could be a very useful and supplementary research tool in understanding the urban phenomena.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.18 no.5
• /
• pp.592-598
• /
• 2008

This paper presents collision prediction and avoidance method for AGVS (Automatic Guide Vehicle System). Also, we propose the PO(Right of Path Occupying) with decentralized delay time for collision avoidance. Classified essential element of AGV's working environment is modeled in this paper. Using this model, we propose a new shortest path algorithm using A* search algorithm and obtain the information on AGVs travel time, coordinates and rotation vector. Finally, we use the AGVs information data as input for simulation program. The simulation practice is used in order to evaluate a collision prediction and avoidance, and it has been presented to demonstrate the applicability of the minimize delay time.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.4 no.3
• /
• pp.549-555
• /
• 2000

We propose an approximate algorithm to analyze the queuing system with n bursty and heterogeneous arrival processes. Each input process is modeled by Interrupted Bernoulli Process(IBP). We approximate N arrival processes by a single state variable and subsequently simplify the transition probability matrix of the Markov chain associated with these N arrival processes. Using this single state variable of arrival processes, we describe the state of the queuing system and analyze the system numerically with the reduced transition probability matrix. We compute the queue length distribution, the delay distribution, and the loss probability. Comparisons with simulation data show that the approximation algorithm has a good accuracy.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.9
• /
• pp.1965-1970
• /
• 2011

This paper proposes the method of switching function implementation using switching function extraction based on graph over finite fields. After we deduce the matrix equation from path number of directional graph, we propose the switching function circuit algorithm, also we propose the code assignment algorithm for nodes which is satisfied the directional graph characteristics with designed circuits. We can implement more optimal switching function compare with former algorithm, also we can design the switching function circuit which have any natural number path through the proposed switching function circuit implementation algorithms. Also the proposed switching function implementation using graph theory over finite fields have decrement number of input-output, circuit construction simplification, increment arithmetic speed and decrement cost etc.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.3C
• /
• pp.323-330
• /
• 2007

Performance indicators such as output SNR, SIR, SINR for rectangular smart antennas in CDMA basestations have been derived. Simulations have been carried out to find the rectangular smart antenna performance while varying the input SNR, number of antenna elements, and the interferers' spatial distributions. Simplified Conjugate Gradient Method was chosen as the underlying beam forming algorithm. It has been shown that the performance of a rectangular smart antenna is similar to that of the linear one having the same number of elements when the interferers are randomly distributed over the whole azimuth angle range.