• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.9
• /
• pp.4386-4404
• /
• 2016

Most existing salient object detection algorithms commonly employed segmentation techniques to eliminate background noise and reduce computation by treating each segment as a processing unit. However, individual small segments provide little information about global contents. Such schemes have limited capability on modeling global perceptual phenomena. In this paper, a novel salient object detection algorithm is proposed based on region merging. An adaptive-based merging scheme is developed to reassemble regions based on their color dissimilarities. The merging strategy can be described as that a region R is merged with its adjacent region Q if Q has the lowest dissimilarity with Q among all Q's adjacent regions. To guide the merging process, superpixels that located at the boundary of the image are treated as the seeds. However, it is possible for a boundary in the input image to be occupied by the foreground object. To avoid this case, we optimize the boundary influences by locating and eliminating erroneous boundaries before the region merging. We show that even though three simple region saliency measurements are adopted for each region, encouraging performance can be obtained. Experiments on four benchmark datasets including MSRA-B, SOD, SED and iCoSeg show the proposed method results in uniform object enhancement and achieve state-of-the-art performance by comparing with nine existing methods.

• 한국전산유체공학회:학술대회논문집
• /
• 2009.04a
• /
• pp.116-120
• /
• 2009

A two-dimensional unsteady inviscid flow solver has been developed for the simulation of complex geometric configurations on adaptive Cartesian meshes. Embedded condition was used for boundary condition and a predictor-corrector explicit time marching scheme was used for time-accurate numerical simulation. The Cartesian mesh generator, which was previously developed for steady problem, was used grid generation for unsteady flow. The solver was based on ALE formulation for body motion. For diminishing the effects of cut-cells, the cell merging method was used. Using cell merging method, it was eliminated the CFL constraints. The conservation problem, which is caused cell-type variation around region swept by solid boundary, was also solved using cell merging method. The results are presented for 2D circular cylinder and missile launching problem.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.3C
• /
• pp.119-124
• /
• 2005

In this paper, we propose a novel algorithm for determining the variable size of locally adaptive window using region-merging method. A region including a denoising point is partitioned to disjoint sub-regions. Locally adaptive window for denoising is obtained by selecting Proper sub-lesions. In our method, nearly arbitrarily shaped window is achieved. Experimental results show that our method outperforms other critically sampled wavelet denoising scheme.

• The Journal of the Korea Contents Association
• /
• v.7 no.2
• /
• pp.40-50
• /
• 2007

In this paper, we propose an efficient method for detecting and tracking multiple moving objects based on morphological region merging from real-time video sequences. The proposed approach consists of adaptive threshold extraction, morphological region merging and detecting and tracking of objects. Firstly, input frame is separated into moving regions and static regions using the difference of images between two consecutive frames. Secondly, objects are segmented with a reference background image and adaptive threshold values, then, the segmentation result is refined by morphological region merge algorithm. Lastly, each object segmented in a previous step is assigned a consistent identification over time, based on its spatio-temporal information. The experimental results show that a proposed method is efficient and useful in terms of real-time multiple objects detecting and tracking.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.525-528
• /
• 1999

Abstract - In this paper, a segmentation method for brain Magnetic Resonance(MR) image using region clustering technique with statistical distribution of gradient image and fuzzy rules is described. The brain MRI consists of gray matter and white matter, cerebrospinal fluid. But due to noise, overlap, vagueness, and various parameters, segmentation of MR image is a very difficult task. We use gradient information rather than intensity directly from the MR images and find appropriate thresholds for region classification using gradient approximation, rayleigh distribution function, region clustering, and merging techniques. And then, we propose the adaptive fuzzy rules in order to extract anatomical structures and diseases from brain MR image data. The experimental results shows that the proposed segmentation algorithm given better performance than traditional segmentation techniques.

• Journal of Korea Multimedia Society
• /
• v.8 no.4
• /
• pp.473-481
• /
• 2005

In this paper, we propose an image segmentation method preserving object's boundaries by using the number of quantized colors and merging regions using adaptive threshold values. First of all, the proposed method quantizes an original image by a vector quantization and the number of quantized colors is determined differently using PSNR each image. We obtain initial regions from the quantized image, merge initial regions in CIE Lab color space and RGB color space step by step and segment the image into semantic regions. In each merging step, we use color distance between adjacent regions as similarity-measure. Threshold values for region-merging are determined adaptively according to the global mean of the color difference between the original image and its split-regions and the mean of those variations. Also, if the segmented image of RGB color space doesn't split into semantic objects, we merge the image again in the CIE Lab color space as post-processing. Whether the post-processing is done is determined by using the color distance between initial regions of the image and the segmented image of RGB color space. Experiment results show that the proposed method splits an original image into main objects and boundaries of the segmented image are preserved. Also, the proposed method provides better results for objective measure than the conventional method.

• Korean Journal of Remote Sensing
• /
• v.7 no.1
• /
• pp.69-86
• /
• 1991

An unsupervised region based image segmentation algorithm implemented with a pyramid structure has been developed. Rather than depending on thraditional local splitting and merging of regions with a similarity test of region statistics, the algorithm identifies the homogenous and boundary regions at each level of pyramid, then the global parameters of esch class are estimated and updated with values of the homogenous regions represented at the level of the pyramid using the mixture distribution estimation. The image is then classified through the pyramid structure. Classification results obtained for both simulated and SPOT imagery are presented.

• International journal of advanced smart convergence
• /
• v.11 no.4
• /
• pp.81-87
• /
• 2022

In this paper, we propose a watershed algorithm that applies a high-frequency enhancement filter to emphasize the boundary and a local adaptive threshold to search for minimum points. The previous method causes the problem of over-segmentation, and over- segmentation appears around the boundary of the object, creating an inaccurate boundary of the region. The proposed method applies a high-frequency enhancement filter that emphasizes the high-frequency region while preserving the low-frequency region, and performs a minimum point search to consider local characteristics. When merging regions, a fixed threshold is applied. As a result of the experiment, the proposed method reduced the number of segmented regions by about 58% while preserving the boundaries of the regions compared to when high frequency emphasis filters were not used.

• The KIPS Transactions:PartD
• /
• v.13D no.7 s.110
• /
• pp.857-866
• /
• 2006

Performance of an image retrieval system is usually very low because of the semantic gap between the low level feature and the high level concept in a query image. Semantically relevant images may exhibit very different visual characteristics, and may be scattered in several clusters. In this paper, we propose a content based image rertrieval approach which combines region based image retrieval and a new relevance feedback method using adaptive clustering together. Our main goal is finding semantically related clusters to narrow down the semantic gap. Our method consists of region based clustering processes and cluster-merging process. All segmented regions of relevant images are organized into semantically related hierarchical clusters, and clusters are merged by finding the number of the latent clusters. This method, in the cluster-merging process, applies r: using v principal components instead of classical Hotelling's $T_v^2$ [1] to find the unknown number of clusters and resolve the singularity problem in high dimensions and demonstrate that there is little difference between the performance of $T^2$ and that of $T_v^2$. Experiments have demonstrated that the proposed approach is effective in improving the performance of an image retrieval system.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.40 no.1
• /
• pp.30-38
• /
• 2003

This paper presents an efficient region-based motion segmentation method for segmenting of moving objects in a traffic scene with a focus on a Video Monitoring System (VMS). The presented method consists of two phases: motion detection and motion segmentation. Using the adaptive thresholding technique, the differences between two consecutive frames are analyzed to detect the movements of objects in a scene. To segment the detected regions into meaningful objects which have the similar intensity and motion information, the regions are initially segmented using a k-means clustering algorithm and then, the neighboring regions with the similar motion information are merged. Since we deal with not the whole image, but the detected regions in the segmentation phase, the computational cost is reduced dramatically. Experimental results demonstrate robustness in the occlusions among multiple moving objects and the change in environmental conditions as well.