• Proceedings of the Korea Contents Association Conference
• /
• 2006.05a
• /
• pp.401-404
• /
• 2006

Mean shift procedure is applied for the data points in the joint spatial-range domain and achieves a high quality. However, a color image is segmented differently according to the inputted spatial parameter or range parameter and the demerit is that the image is broken into many small regions in case of the small parameter. In this paper, to improve this demerit, we propose the method that groups similar regions using region merging method for over-segmented images. The proposed method converts a over-segmented image in RGB color space into in HSI color space and merges similar regions by hue information. Here, to preserve edge information, the proposed method use by merging constraints to decide whether regions is merged or not. After then, we merge the regions in RGB color space for non-processed regions in HSI color space. Experimental results show the superiority in region's segmentation results.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.9
• /
• pp.1448-1455
• /
• 1990

In this paper, a range image segmentation method is proposed. This method consists of an initial segmentation stage by discontinuous edge detection and surface type labeling based on the sign of the principal curvatures. Initially type labeled image is oversegmented, this image is merged via stepwise optimal region merging stage based on polynomial function approxiamtion. The successful segmentation results are presented for two synthetic range images with noise and a real-world ERIM range image.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.4 s.42
• /
• pp.283-289
• /
• 2006

The present image segmentation is what user want to segment image and has been studied for technology in composition of segment object with other images. In this paper, we propose a method of novel semi-automatic image segmentation using gradual region merging and genetic algorithm. Proposed algorithm is edge detection of object using genetic algorithm after selecting object which user want. We segment region of object which user want to based on detection edge using watershed algorithm. We separated background and object in indefinite region using gradual region merge from Segment object. And, we have applicable value which user want by making interface based on GUI for efficient perform of algorithm development. In the experiments, we analyzed various images for proving superiority of the proposed method.

• Journal of information and communication convergence engineering
• /
• v.19 no.2
• /
• pp.102-107
• /
• 2021

In this paper, we propose a new three-dimensional (3D) photon-counting integral imaging reconstruction method using a merging reconstruction process and maximum likelihood estimation (MLE). The conventional 3D photon-counting reconstruction method extracts photons from elemental images using a Poisson random process and estimates the scene using statistical methods such as MLE. However, it can reduce the photon levels because of an average overlapping calculation. Thus, it may not visualize 3D objects in severely low light environments. In addition, it may not generate high-quality reconstructed 3D images when the number of elemental images is insufficient. To solve these problems, we propose a new 3D photon-counting merging reconstruction method using MLE. It can visualize 3D objects without photon-level loss through a proposed overlapping calculation during the reconstruction process. We confirmed the image quality of our proposed method by performing optical experiments.

• Journal of Broadcast Engineering
• /
• v.4 no.1
• /
• pp.44-58
• /
• 1999

In this paper, a rate-distortion based image segmentation algorithm is presented using a recursive merging with region adjacency graph (RAG). In the method, the dissimilarity between a pair of adjacent regions is represented as a Lagrangian cost function considered in rate-distortion sense. Lagrangian multiplier is estimated in each merging step, a pair of adjacent regions whose cost is minimal is searched and then the pair of regions are merged into a new region. The merging step is recursively performed until some termination criterion is reached. The proposed method thus is suitable for region-based coding or segmented-based coding. Experiment results for 256x256 Lena show that segmented-based coding using the proposed method yields PSNR improvement of about 2.5 - 3.5 dB. 0.8 -1.0 dB. 0.3 -0.6 dB over mean-difference-based method. distortion-based method, and JPEG, respectively.

• Korean Journal of Remote Sensing
• /
• v.27 no.6
• /
• pp.717-728
• /
• 2011

An efficient method for the unsupervised classification of high resolution imagery is suggested in this paper. It employs pixel-linking and merging based on the adjacency graph. The proposed algorithm uses the neighbor lines of 8 directions to include information in spatial proximity. Two approaches are suggested to employ neighbor lines in the linking. One is to compute the dissimilarity measure for the pixel-linking using information from the best lines with the smallest non. The other is to select the best directions for the dissimilarity measure by comparing the non-homogeneity of each line in the same direction of two adjacent pixels. The resultant partition of pixel-linking is segmented and classified by the merging based on the regional and spectral adjacency graphs. This study performed extensive experiments using simulation data and a real high resolution data of IKONOS. The experimental results show that the new approach proposed in this study is quite effective to provide segments of high quality for object-based analysis and proper land-cover map for high resolution imagery of urban area.

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.313-314
• /
• 2006

Obtained disparity map from the stereo camera by using the several stereo matching algorithms carries lots of noise because of various causes. In our approach, mode filtering and noise elimination technique using the histogram and projection-based region merging methods are adopted for improving the quality of disparity map and image segmentation. The proposed algorithms are implemented in VHDL and the real-time experimentation shows the accurately divided objects.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.40 no.2
• /
• pp.1-10
• /
• 2003

This paper presents an efficient method for image segmentation based on a multiresolution application of a wavelet transform and watershed segmentation algorithm. The procedure toward complete segmentation consists of four steps: pyramid representation, image segmentation, region merging and region projection. First, pyramid representation creates multiresolution images using a wavelet transform. Second, image segmentation segments the lowest-resolution image of the pyramid using a watershed segmentation algorithm. Third, region merging merges the segmented regions using the third-order moment values of the wavelet coefficients. Finally, the segmented low-resolution image with label is projected into a full-resolution image (original image) by inverse wavelet transform. Experimental results of the presented method can be applied to the segmentation of noise or degraded images as well as reduce over-segmentation.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.23 no.9
• /
• pp.1049-1059
• /
• 2019

We propose a learning-based image segmentation algorithm. Starting from super-pixels, our method learns the probability of merging two regions based on the ground truth made by humans. The learned information is used in determining whether the two regions should be merged or not in a segmentation stage. Unlike exiting learning-based algorithms, we use both local and object information. The local information represents features computed from super-pixels and the object information represent high level information available only in the learning process. The object information is considered as privileged information, and we can use a framework that utilize the privileged information such as SVM+. In experiments on the Berkeley Segmentation Dataset and Benchmark (BSDS 500) and PASCAL Visual Object Classes Challenge (VOC 2012) data set, out model exhibited the best performance with a relatively small training data set and also showed competitive results with a sufficiently large training data set.

• Journal of Korea Multimedia Society
• /
• v.10 no.6
• /
• pp.726-736
• /
• 2007

In this paper, real-time image scanning system using linescan cameras is designed. The system is specially designed to diagnose and analyse the conditions of tunnels such as crack widths through the captured images. The system consists of two major parts, the image acquisition system and the image merging system. To save scanned image data into storage media in real-time, the image acquisition system has been designed with two different control and management modules. The control modules are in charge of controlling the hardware device and the management modules handle system resources so that the scanned images are safely saved to the magnetic storage devices. The system can be mounted to various kinds of vehicles. After taking images, the image merging system generates extended images by combining saved images. Several tests are conducted in laboratory as well as in the field. In the laboratory simulation, both systems are tested several times and upgraded. In the field-testing, the image acquisition system is mounted to a specially designed vehicle and images of the interior surface of the tunnel are captured. The system is successfully tested in a real tunnel with a vehicle at the speed of 20 km/h. The captured images of the tunnel condition including cracks are vivid enough for an expert to diagnose the state of the tunnel using images instead of seeing through his/her eyes.