• Journal of Computational Design and Engineering
• /
• v.1 no.3
• /
• pp.202-212
• /
• 2014

To survive in the current shipbuilding industry, it is of vital importance for shipyards to have the ship components' accuracy evaluated efficiently during most of the manufacturing steps. Evaluating components' accuracy by comparing each component's point cloud data scanned by laser scanners and the ship's design data formatted in CAD cannot be processed efficiently when (1) extract components from point cloud data include irregular obstacles endogenously, or when (2) registration of the two data sets have no clear direction setting. This paper presents reformative point cloud data processing methods to solve these problems. K-d tree construction of the point cloud data fastens a neighbor searching of each point. Region growing method performed on the neighbor points of the seed point extracts the continuous part of the component, while curved surface fitting and B-spline curved line fitting at the edge of the continuous part recognize the neighbor domains of the same component divided by obstacles' shadows. The ICP (Iterative Closest Point) algorithm conducts a registration of the two sets of data after the proper registration's direction is decided by principal component analysis. By experiments conducted at the shipyard, 200 curved shell plates are extracted from the scanned point cloud data, and registrations are conducted between them and the designed CAD data using the proposed methods for an accuracy evaluation. Results show that the methods proposed in this paper support the accuracy evaluation targeted point cloud data processing efficiently in practice.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2002.10a
• /
• pp.595-598
• /
• 2002

Laser scanners are getting used more and more in reverse engineering and inspection. For CNC-driven laser scanners, it is important to automate the scanning operations to improve the accuracy of capture point data and to reduce scanning time in industry. However, there are few research works on laser scan planning system. In addition, it is difficult to directly analyze multi-patched freeform models. In this paper, we propose an STL (Stereolithography) mesh based laser scan planning system for complex freeform surfaces. The scan planning system consists of three steps and it is assumed that the CAD model of the part exists. Firstly, the surface model is approximated into STL meshes. From the mesh model, normal vector of each node point is estimated. Second, scan directions and regions are determined through the region growing method. Also, scan paths are generated by calculating the minimum-bounding rectangle of points that can be scanned in each scan direction. Finally, the generated scan directions and paths are validated by checking optical constraints and the collision between the laser probe and the part to be scanned.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.10C
• /
• pp.990-999
• /
• 2007

In this paper, we propose the region-based image retrieval method using JSEG which is a method for unsupervised segmentation of color-texture regions. JSEG is an algorithm that discretizes an image by color classification, makes the J-image by applying a region to window mask, and then segments the image by using a region growing and merging. The segmented image from JSEG is given to a user as the query image, and a user can select a few segmented regions as the query region. After finding the MBR of regions selected by user query and generating the multiple window masks based on the center point of MBR, we extract the feature vectors from selected regions. We use the accumulated histogram as the global descriptor for performance comparison of extracted feature vectors in each method. Our approach fast and accurately supplies the relevant images for the given query, as the feature vectors extracted from specific regions and global regions are simultaneously applied to image retrieval. Experimental evidence suggests that our algorithm outperforms the recent image-based methods for image indexing and retrieval.

• Journal of KIISE:Software and Applications
• /
• v.32 no.7
• /
• pp.612-624
• /
• 2005

In this paper, we propose a surface-based registration using a gaussian weighted distance map for PET-CT brain image fusion. Our method is composed of three main steps: the extraction of feature points, the generation of gaussian weighted distance map, and the measure of similarities based on weight. First, we segment head using the inverse region growing and remove noise segmented with head using region growing-based labeling in PET and CT images, respectively. And then, we extract the feature points of the head using sharpening filter. Second, a gaussian weighted distance map is generated from the feature points in CT images. Thus it leads feature points to robustly converge on the optimal location in a large geometrical displacement. Third, weight-based cross-correlation searches for the optimal location using a gaussian weighted distance map of CT images corresponding to the feature points extracted from PET images. In our experiment, we generate software phantom dataset for evaluating accuracy and robustness of our method, and use clinical dataset for computation time and visual inspection. The accuracy test is performed by evaluating root-mean-square-error using arbitrary transformed software phantom dataset. The robustness test is evaluated whether weight-based cross-correlation achieves maximum at optimal location in software phantom dataset with a large geometrical displacement and noise. Experimental results showed that our method gives more accuracy and robust convergence than the conventional surface-based registration.

• The KIPS Transactions:PartB
• /
• v.17B no.5
• /
• pp.363-374
• /
• 2010

In this paper, we propose the method for extracting Homogeneity Threshold($H_T$) and for segmenting homogeneous regions by USRG(Unseeded Region Growing) with $H_T$. The $H_T$ is a criterion to distinguish homogeneity in neighbor pixels and is computed automatically from the original image by proposed method. Theoretical background for proposed method is based on the Otsu's single level threshold method. The method is used to divide a small local part of original image int o two classes and the sum($\sigma_c$) of standard deviations for the classes to satisfy special conditions for distinguishing as different regions from each other is used to compute $H_T$. To find validity for proposed method, we compare the original image with the image that is regenerated with only the segmented homogeneous regions and show up the fact that the difference between two images is not exist visually and also present the steps to regenerate the image in order the size of segmented homogeneous regions and in order the intensity that includes pixels. Also, we show up the validity of proposed method with various results that is segmented using the homogeneity thresholds($H^*_T$) that is added a coefficient ${\alpha}$ for adjusting scope of $H_T$. We expect that the proposed method can be applied in various fields such as visualization and animation of natural image, anatomy and biology and so on.

• Journal of Korea Multimedia Society
• /
• v.17 no.10
• /
• pp.1205-1212
• /
• 2014

In this paper, we propose a high-quality stitching method of 3D multiple dental CT images. First, a weighted function is generated using the difference of two distance functions that calculate a distance from the nearest edge of an overlapped region to each position. And a blending ratio propagation function for two gradient vectors is parameterized by the difference and magnitude of gradient vectors that is also applied by the weighted function. When the blending ratio is propagated, an improved region growing scheme is proposed to decide the next position and calculate the blending intensity. The proposed method produces a high-quality stitching image. Our method removes the seam artifact caused by the mean intensity difference between images and vignetting effect. And it removes double edges caused by local misalignment. Experimental results showed that the proposed method produced high-quality stitching images for ten patients. Our stitching method could be usefully applied into the stitching of 3D or 2D multiple images.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.48 no.5
• /
• pp.37-44
• /
• 2011

This paper proposes a confusion-line separating algorithm in a CIE Lab color space using color segmentation for protanopia and deuteranopia. Images are segmented into regions by grouping adjacent pixels with similar color information using the hue components of the images. To this end, the region growing method and the seed points used in this method are the pixels that correspond to peak points in hue histograms that went through a low pass filter. In order to establish a color vision deficiency (CVD) confusion line map, we established 512 virtual boxes in an RGB 3-D space so that boxes existing on the same confusion line can be easily identified. After that, we checked if segmented regions existed on the same confusion line and then performed color adjustment in an CIE Lab color space so that all adjacent regions exist on different confusion lines in order to provide the best color identification effect to people with CVDs.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.44 no.3
• /
• pp.42-47
• /
• 2007

Video Segmentation is an essential part in region-based video coding and any other fields of the video processing. Among lots of methods proposed so far, the watershed method in which the region growing is performed for the gradient image can produce well-partitioned regions globally without any influence on local noise and extracts accurate boundaries. But, it generates a great number of small regions, which we call over segmentation problem. Therefore we proposes that adaptive trimmed mean filter for resolving the over segmentation of image. Simulation result, we confirm that proposed ATM filter improves the performance to remove noise and reduces damage for the clear degree of image in case of the noise ratio of 20% and over.

• Journal of Biomedical Engineering Research
• /
• v.38 no.6
• /
• pp.295-301
• /
• 2017

In this study, We subtracted the calcification blooming artifact from MDCT images of coronary atherosclerosis patients and verified their accuracy and usefulness. We performed coronary artery calcification stenosis phantom and a program to subtract calcification blooming artifact by applying 8 different image segmentation method (Otsu, Sobel, Prewitt, Canny, DoG, Region Growing, Gaussian+K-mean clustering, Otsu+DoG). As a result, In the coronary artery calcification stenosis phantom with the lumen region 5 mm the calcification blooming artifact was subtracted in the application of the mixture of Gaussian filtering and K- Clustering algorithm, and the value was close to the actual calcification region. These results may help to accurately diagnose coronary artery calcification stenosis.

• The KIPS Transactions:PartD
• /
• v.17D no.1
• /
• pp.59-66
• /
• 2010

Traditional OCR engines are designed to the scanned documents in calibrated environment. Three dimensional perspective distortion and smooth distortion in images are critical problems caused by un-calibrated devices, e.g. image from smart phones. To meet the growing demand of character recognition of texts embedded in the photos acquired from the non-calibrated hand-held devices, we address the problem in three categorical aspects: rotational invariant method of text region extraction, scale invariant method of text line segmentation, and three dimensional perspective mapping. With the integration of the methods, we developed an OCR for camera-captured images.