• International Journal of CAD/CAM
• /
• v.9 no.1
• /
• pp.31-36
• /
• 2010

3D point data acquired from laser scan or stereo vision can be quite noisy. A preprocessing step is often needed before a surface reconstruction algorithm can be applied. In this paper, we propose a nonparametric approach for noisy point data preprocessing. In particular, we proposed an anisotropic kernel based nonparametric density estimation method for outlier removal, and a hill-climbing line search approach for projecting data points onto the real surface boundary. Our approach is simple, robust and efficient. We demonstrate our method on both real and synthetic point datasets.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.24 no.1
• /
• pp.1-11
• /
• 1999

We classified preprocessing methods into (1) analytic methods, (2) methods for removing implied free variables, (3) methods using pivot or elementary row operations, (4) methods for removing linearly dependent rows and columns and (5) methods for dense columns. We noted some considerations to which should be paid attention when preprocessing methods are applied to interior point methods for linear programming. We proposed an efficient order of preprocessing methods and data structures. We also noted the recovery process for dual solutions. We implemented the proposed preprocessing methods. and tested it with 28 large scale problems of NETLIB. We compared the results of it with those of preprocessing routines of HOPDM, BPDPM and CPLEX.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.30 no.4
• /
• pp.335-342
• /
• 2012

3D point cloud is widely used in Architecture, Civil Engineering, Medical, Computer Graphics, and many other fields. Due to the improvement of 3D laser scanner, a massive 3D point cloud whose gigantic file size is bigger than computer's memory requires efficient preprocessing and visualization. We suggest a data structure to solve the problem; a 3D point cloud is gradually subdivided by arbitrary-sized cube grids structure and corresponding point cloud subsets generated by the center of each grid cell are achieved while preprocessing. A massive 3D point cloud file is tested through two algorithms: QSplat and ours. Our algorithm, grid-based, showed slower speed in preprocessing but performed faster rendering speed comparing to QSplat. Also our algorithm is further designed to editing or segmentation using the original coordinates of 3D point cloud.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1996.10a
• /
• pp.285-288
• /
• 1996

Generally MPS, standardized by IBM, is the input type of large scale linear programming problems, and there may be unnecessary variables or constraints. These can be discarded by preprocessing. As the size of a problem is reduced by preprocessing, the running time is reduced. And more, the infeasibility of a problem may be detected before using solution methods. When the preprocessing implemented by this paper is used in NETLIB problems, it removes unnecessary variables and constraints by 21%, 15%, respectively. The use of preprocessing gives in the average 21% reduction in running time by applying the interior point method. Preprocessing can detect 10 out of 30 infeasible NETLIB problems.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.29B no.8
• /
• pp.35-43
• /
• 1992

We have presented the tracing algorithm for center pixel of character image. Character image was read by scanner device. Performing the tracing process, it can be possible to detect feature points, such as branch point, stroke of 4 directions. So, the tracing process covers the thinning and feature point detection process for improving the processing time. Usage of suggested tracing algorithm instead of thinning that is the preprocessing of character recognition increases speed up to 5 times. The preprocessing chip has been designed by using single layer perceptron algorithm.

• Journal of the Korean Society of Industry Convergence
• /
• v.25 no.4_2
• /
• pp.573-586
• /
• 2022

Corrosion can cause dangerous and expensive damage and failures of ship hulls and equipment. Therefore, it is necessary to maintain the vessel by periodic corrosion inspections. During visual inspection, many corrosion locations are inaccessible for many reasons, especially safety's point of view. Including subjective decisions of inspectors is one of the issues of visual inspection. Automation of visual inspection is tried by many pieces of research. In this study, we propose image preprocessing methods by image patch segmentation and thresholding. YOLOv5 was used as an object detection model after the image preprocessing. Finally, it was evaluated that corrosion detection performance using the proposed method was improved in terms of mean average precision.

• Proceedings of the IEEK Conference
• /
• 2003.07e
• /
• pp.1799-1802
• /
• 2003

This paper has been studied a Adaptive feature-factors based fingerprints recognition in many biometrics. we study preprocessing and matching method of fingerprints image in various circumstances by using optical fingerprint input device. The Fingerprint Recognition Technology had many development until now. But, There is yet many point which the accuracy improves with operation speed in the side. First of all we study fingerprint classification to reduce existing preprocessing step and then extract a Feature-factors with direction information in fingerprint image. Also in the paper, we consider minimization of noise for effective fingerprint recognition system.

• Proceedings of the Korea Institute of Convergence Signal Processing
• /
• 2003.06a
• /
• pp.82-85
• /
• 2003

This paper proposes a preprocessing method for tracking aircraft's take-off and lading. The method uses accumulative difference image technique for segmenting the object from the background, and obtains the centroid of the object exactly using centroid method. Then the moving object is analyzed and represented with the information such as feature point, velocity, and distance. A simulation result reveals that the proposed algorithm has good performance in segmenting and tracking the aircraft.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.6
• /
• pp.929-936
• /
• 1990

This paper describes the method of the Korean character recognition by means of feature points extraction. Also, the preprocessing neural chip for noise elimination, smoothing, thinning and feature point extraction has been designs. The subpatterns were separated by means of advanced index algorithm using mask, and recognized by means of feature points classification. The separation of the Korean character subpatterns was abtained about 97%, and the recognition of the Korean characters was abtained about 95%. The preprocessing neural chip was simulated on SPICE and layouted by double CMOS 2\ulcorner design rule.

• Journal of Astronomy and Space Sciences
• /
• v.19 no.2
• /
• pp.163-172
• /
• 2002

This article investigates the problem of data preprocessing for the precision orbit determination (POD) of low earth orbit satellite using GPS .aw data. Several data preprocessing algorithms have been developed to edit the GPS data automatically such that outlier deletion, cycle slip identification and correction, and time tag error correction. The GPS data are precisely edited for the accuracy of POD. Some methods of data preprocessing are restricted to the rate of the collections of the pseudorange and carrier phase measurements. This study considers the preprocessing efficiency varied with the rate, the quality of receiver and the altitude of the satellite's orbit. We also propose the proper methods in accordance with the rate for single frequency and dual frequency receivers.