• Journal of the Semiconductor & Display Technology
• /
• v.11 no.2
• /
• pp.27-31
• /
• 2012

This paper proposes a new method of character segmentation in a grayscale image using the standard deviation. Firstly, the proposed method scans vertically the region of interest in an image in order to calculate a standard deviation for each scan line. Characters' standard deviations are much bigger than the background's. Therefore, it is possible to segment characters vertically using the differentiation of those two types of standard deviations. Secondly, the method scans each vertically segmented image horizontally at this time, and then segments each image similarly. The proposed method is implemented using C language in an embedded Linux system for a high-speed real-time image processing. Experiments were conducted by using credit card images. The results show that the proposed algorithm is quite successful for most credit cards. However, the method fails in some credit cards with strong background patterns.

• Proceedings of the IEEK Conference
• /
• 2007.07a
• /
• pp.221-222
• /
• 2007

This paper presents wavelet-based moving object segmentation using double change detection and background registration. Three successive frame differences for detection change were used in the wavelet domain. The background was constructed with the wavelet coefficients in the lowest frequency subband which are the approximated version of an image. Combining double change detection and background registration, we can obtain an efficient moving object segmentation algorithm.

• Journal of Electrical Engineering and Technology
• /
• v.7 no.6
• /
• pp.1001-1008
• /
• 2012

Non-destructive testing (NDT) is a technique used in science and industry to evaluate the properties of a material without causing damage. In this paper we propose a method for segmenting radiographic images of welding in order to extract the welding defects which may occur during the welding process. We study different methods of level set and choose the model adapted to our application. The methods presented here take the property of local segmentation geodesic active contours and have the ability to change the topology automatically. The computation time is considerably reduced after taking into account a new level set function which eliminates the re-initialization procedure. Satisfactory results are obtained after applying this algorithm both on synthetic and real images.

• IE interfaces
• /
• v.16 no.1
• /
• pp.54-62
• /
• 2003

With the ubiquitous use of the Internet in daily business activities, most of modern firms are keenly interested in customer's behaviors on the Internet. That is because a wide variety of information about customer's intention about the target web site can be revealed from IP address, reference address, cookie files, duration time, all of which are expressing customer's behaviors on the Internet. In this sense, this paper aims to accomplish an objective of analyzing a set of exemplar web log files extracted from a specific P2P site, anti identifying information about customer segmentation strategies. Major web mining technique we adopted includes a machine learning like C5.0.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.3
• /
• pp.432-443
• /
• 1997

This paper presents contour simplification method and a regional hierarchical segmentation algorithm based on PSNR for the transmission of image in mobile communication, of which available bandwidth is very limited. It first takes into account the global information and produces a coarse segmentation, that is, with a small number of regions. Then, each segmented region has different quality. Thus, the region with low quality is selected by PSNR and improved by introducing regions corresponding to more local information. It is able to improve the subjective quality of image and reduce contour information. In addition, contour simplification method is proposed for the efficient lossless chain coding. The proposed method can be applied to the applications such as mobile communications and videotelephone through PSTN, of which the available transmission bandwidth is very limited.

• Proceedings of the KSRS Conference
• /
• 2002.10a
• /
• pp.59-64
• /
• 2002

This paper presents a method for line segment extraction for 3-d building reconstruction. Building roofs are described as a set of planar polygonal patches, each of which is extracted by watershed-based image segmentation, line segment matching and coplanar grouping. Coplanar grouping and polygonal patch formation are performed per region by selecting 3-d line segments that are matched using epipolar geometry and flight information. The algorithm has been applied to high resolution aerial images and the results show accurate 3-d building reconstruction.

• Korean Journal of Remote Sensing
• /
• v.20 no.3
• /
• pp.215-225
• /
• 2004

A multistage hierarchical clustering technique, which is an unsupervised technique, was suggested in this paper for classifying large remotely-sensed imagery. The multistage algorithm consists of two stages. The 'local' segmentor of the first stage performs region-growing segmentation by employing the hierarchical clustering procedure of CN-chain with the restriction that pixels in a cluster must be spatially contiguous. The 'global' segmentor of the second stage, which has not spatial constraints for merging, clusters the segments resulting from the previous stage, using the conventional agglomerative approach. Using simulation data, the proposed method was compared with another hierarchical clustering technique based on 'mutual closest neighbor.' The experimental results show that the new approach proposed in this study considerably increases in computational efficiency for larger images with a low number of bands. The technique was then applied to classify the land-cover types using the remotely-sensed data acquired from the Korean peninsula.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.26 no.4
• /
• pp.333-342
• /
• 2022

In this paper, we perform a direct comparison study of real experimental data for domain rearrangement and the Cahn-Hilliard (CH) equation on the dynamics of morphological evolution. To validate a mathematical model for physical phenomena, we take initial conditions from experimental images by using an image segmentation technique. The image segmentation algorithm is based on the Mumford-Shah functional and the Allen-Cahn (AC) equation. The segmented phase-field profile is similar to the solution of the CH equation, that is, it has hyperbolic tangent profile across interfacial transition region. We use unconditionally stable schemes to solve the governing equations. As a test problem, we take domain rearrangement of lipid bilayers. Numerical results demonstrate that comparison of the evolutions with experimental data is a good benchmark test for validating a mathematical model.

• Smart Structures and Systems
• /
• v.32 no.2
• /
• pp.111-121
• /
• 2023

This study proposes an automated assembly performance evaluation method for prefabricated steel structures (PSSs) using machine learning methods. Assembly component images were segmented using a modified version of the receptive field pyramid. By factorizing channel modulation and the receptive field exploration layers of the convolution pyramid, highly accurate segmentation results were obtained. After completing segmentation, the positions of the bolt holes were calculated using various image processing techniques, such as fuzzy-based edge detection, Hough's line detection, and image perspective transformation. By calculating the distance ratio between bolt holes, the assembly performance of the PSS was estimated using the k-nearest neighbors (kNN) algorithm. The effectiveness of the proposed framework was validated using a 3D PSS printing model and a field test. The results indicated that this approach could recognize assembly components with an intersection over union (IoU) of 95% and evaluate assembly performance with an error of less than 5%.

• Proceedings of the Optical Society of Korea Conference
• /
• 2005.02a
• /
• pp.202-203
• /
• 2005