• Journal of Korea Society of Industrial Information Systems
• /
• v.14 no.4
• /
• pp.57-64
• /
• 2009

In this paper, We propose an highly efficient preprocessing technique for improving the performance of the crease extraction method, which can improve the accuracy of feature extraction within the fingerprint image. The proposed method applies the 1-dimensional directional slit for each pixel in fingerprint image. Once the direction of every pixel in crease candidate area is estimated, it is decomposed into different images depending on their direction. From the directional images, the crease clusters are estimated by utilizing the property of crease area. The proposed method finally extracts the crease from the crease clusters estimated from directional images.

• Journal of the Korea Safety Management & Science
• /
• v.14 no.1
• /
• pp.217-224
• /
• 2012

Location-Based Services(LBS) is a service that provide location information by using communication network or satellite signal. In order to provide LBS precisely and efficiently, we studied how we can reduce the error on location determination of objects such people and things. We focus on using the least square method and triangulation positioning method to improves the accuracy of the existing location determination method. Above two methods is useful if the distance between the AP and the tags can be find. Though there are a variety of ways to find the distance between the AP and tags, least squares and triangulation positioning method are wildely used. In this thesis, positioning method is composed of preprocessing and calculation of location coordinate and detail of methodology in each stage is explained. The distance between tag and AP is adjusted in the preprocessing stage then we utilize least square method and triangulation positioning method to calculate tag coordinate. In order to confirm the performance of suggested method, we developed the test program for location determination with Labview2010. According to test result, triangulation positioning method showed up loss error than least square method by 38% and also error reduction was obtained through adjustment process and filtering process. It is necessary to study how to reduce error by using additional filtering method and sensor addition in the future and also how to improve the accuracy of location determination at the boundary location between indoor and outdoor and mobile tag.

• Journal of KIISE:Software and Applications
• /
• v.30 no.9
• /
• pp.843-849
• /
• 2003

Web usage mining is the technique of data mining that analyzes web users' usage patterns by large web log. To use the web usage mining technique, we have to classify correctly users and users session in preprocessing, but can't classify them completely by only log files with standard web log format. To classify users and user session there are many problems like local cache, firewall, ISP, user privacy, cookey etc., but there isn't any definite method to solve the problems now. Especially local cache problem is the most difficult problem to classify user session which is used as input in web mining systems. In this paper we propose a heuristic method which solves local cache problem by using only click stream data of server side like referrer log, agent log and access log, classifies user sessions and completes session.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.44 no.2 s.314
• /
• pp.55-62
• /
• 2007

This paper proposes method to get exquisite third dimension data removing included noise by error that occur in third dimension reconstruction through camera auto-calibration. Though reconstructing third dimension data by previous noise removing method, mesh that area is wide is happened problem by noise. Because mesh's area is important, the proposed algorithm need preprocessing that remove unnecessary triangle meshes of acquired third dimension data. The research analyzes the characteristics of noise using the area information of 3-dimensional meshes, separates a peek noise and a Gauss noise by its characteristics and removes the noise effectively. We give a quantitative evaluation of the proposed preprocessing filter and compare with the mesh smoothing procedures. We demonstrate that our effective preprocessing filter outperform the mesh smoothing procedures in terms of accuracy and resistance to over-smoothing.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.25 no.1
• /
• pp.91-96
• /
• 2015

In this study, we introduce robust face recognition system with illumination variation realized with the aid of CT preprocessing method. As preprocessing algorithm, Census Transform(CT) algorithm is used to extract locally facial features under unilluminated condition. The dimension reduction of the preprocessed data is carried out by using $(2D)^2$PCA which is the extended type of PCA. Feature data extracted through dimension algorithm is used as the inputs of proposed radial basis function neural networks. The hidden layer of the radial basis function neural networks(RBFNN) is built up by fuzzy c-means(FCM) clustering algorithm and the connection weights of the networks are described as the coefficients of linear polynomial function. The essential design parameters (including the number of inputs and fuzzification coefficient) of the proposed networks are optimized by means of artificial bee colony(ABC) algorithm. This study is experimented with both Yale Face database B and CMU PIE database to evaluate the performance of the proposed system.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.10
• /
• pp.3490-3507
• /
• 2014

License plate detection (LPD) is one of the most important aspects of an automatic license plate recognition system. Although there have been some successful license plate recognition (LPR) methods in past decades, it is still a challenging problem because of the diversity of plate formats and outdoor illumination conditions in image acquisition. Because the accurate detection of license plates under different conditions directly affects overall recognition system accuracy, different methods have been developed for LPD systems. In this paper, we propose a license plate detection method that is rapid and robust against variation, especially variations in illumination conditions. Taking the aspects of accuracy and speed into consideration, the proposed system consists of two stages. For each stage, Haar-like features are used to compute and select features from license plate images and a cascade classifier based on the concatenation of classifiers where each classifier is trained by an AdaBoost algorithm is used to classify parts of an image within a search window as either license plate or non-license plate. And it is followed by connected component analysis (CCA) for eliminating false positives. The two stages use different image preprocessing blocks: image preprocessing without adaptive thresholding for the first stage and image preprocessing with adaptive thresholding for the second stage. The method is faster and more accurate than most existing methods used in LPD. Experimental results demonstrate that the LPD rate is 98.38% and the average computational time is 54.64 ms.

• The Journal of the Korea Contents Association
• /
• v.14 no.12
• /
• pp.555-564
• /
• 2014

The boundary noise in image syntheses using DIBR consists of noisy pixels that are separated from foreground objects into background region. It is generated mainly by edge misalignment between the reference image and depth map or blurred edge in the reference image. Since hole areas are generally filled with neighboring pixels, boundary noise adjacent to the hole is the main cause of quality degradation in synthesized images. To solve this problem, a new boundary noise removal algorithm using a preprocessing of the depth map is proposed in this paper. The most common way to eliminate boundary noise caused by boundary misalignment is to modify depth map so that the boundary of the depth map can be matched to that of the reference image. Most conventional methods, however, show poor performances of boundary detection especially in blurred edge, because they are based on a simple boundary search algorithm which exploits signal gradient. In the proposed method, a two-step hierarchical approach for boundary detection is adopted which enables effective boundary detection between the transition and background regions. Experimental results show that the proposed method outperforms conventional ones subjectively and objectively.

• The Journal of the Korea Contents Association
• /
• v.11 no.5
• /
• pp.84-92
• /
• 2011

The automated segmentation technique of cell region in Bio Images helps biologists understand complex functions of cells. It is mightly important in that it can process the analysis of cells automatically which has been done manually before. The conventional methods for segmentation of cell and nuclei from multi-channel images consist of two steps. In the first step nuclei are extracted from DNA channel, and used as initial contour for the second step. In the second step cytoplasm are segmented from Actin channel by using Active Contour model based on intensity. However, conventional studies have some limitation that they let the cell segmentation performance fall by not considering inhomogeneous intensity problem in cell images. Therefore, the paper consider correlation between DNA and Actin channel, and then proposes the preprocessing algorithm by which the brightness of cell inside in Actin channel can be compensated homogeneously by using DNA channel information. Experiment result show that the proposed preprocessing method improves the cell segmentation performance compared to the conventional method.

• Nuclear Engineering and Technology
• /
• v.53 no.12
• /
• pp.3902-3909
• /
• 2021

SACOS series of subchannel analysis codes have been developed by XJTU-NuTheL for many years and are being used for the thermal-hydraulic safety analysis of various reactor cores. To achieve fine whole core pin-level analysis, the input preprocessing and parallel capabilities of the code have been developed in this study. Preprocessing is suitable for modeling rectangular and hexagonal assemblies with less error-prone input; parallelization is established based on the domain decomposition method with the hybrid of MPI and OpenMP. For domain decomposition, a more flexible method has been proposed which can determine the appropriate task division of the core domain according to the number of processors of the server. By performing the calculation time evaluation for the several PWR assembly problems, the code parallelization has been successfully verified with different number of processors. Subsequent analysis results for rectangular- and hexagonal-assembly core imply that the code can be used to model and perform pin-level core safety analysis with acceptable computational efficiency.

• Journal of Information Technology Services
• /
• v.21 no.4
• /
• pp.91-103
• /
• 2022

This study proposes a model for predicting contracted power using electric power data collected in real time from convenience stores nationwide. By optimizing the prediction model using machine learning, it will be possible to predict the contracted power required to renew the contract of the existing convenience store. Contracted power is predicted through the XGBoost regression model. For the learning of XGBoost model, the electric power data collected for 16 months through a real-time monitoring system for convenience stores nationwide were used. The hyperparameters of the XGBoost model were tuned using the GridesearchCV, and the main features of the prediction model were identified using the xgb.importance function. In addition, it was also confirmed whether the preprocessing method of missing values and outliers affects the prediction of reduced power. As a result of hyperparameter tuning, an optimal model with improved predictive performance was obtained. It was found that the features of power.2020.09, power.2021.02, area, and operating time had an effect on the prediction of contracted power. As a result of the analysis, it was found that the preprocessing policy of missing values and outliers did not affect the prediction result. The proposed XGBoost regression model showed high predictive performance for contract power. Even if the preprocessing method for missing values and outliers was changed, there was no significant difference in the prediction results through hyperparameters tuning.