• Proceedings of the KSME Conference
• /
• 2007.05a
• /
• pp.366-371
• /
• 2007

In many CAD systems, NURBS has been employed to construct exact geometries. Recently, NURBS finite element analysis methods were proposed by some authors for convenient connection between CAD and finite element analysis. Additional advantages of NURBS FEA, such as exact geometry and no mesh generation, are obtained. However, NURBS is inefficient in local refinement and merging patches. For refinement of local region in interest, additional control points should be inserted into the entire row or column which contains the local region. There is another inefficiency of NURBS during merging patches into a large structure due to propagation of control points. In order to overcome these inefficiencies of NURBS, T-spline was proposed by Sederberg. In this work, T-spline based finite element method is proposed for efficient local refinement and merging patches. At first, accuracy and efficiency of NURBS FEA is verified and efficiency of T-spline FEA is verified by comparing with NURBS FEA.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.1B
• /
• pp.156-166
• /
• 2000

A rate-distortion based segmentation using recursive merging is presented, which considers texture as a homogeneity by adopting the procedure of a generalized texture approximation. The texture in a region is approximated by SA-DCT and a set of two uniform quantizers with fixed step sizes, one for DC and another for AC. Using the approximated texture, we calculated the rate-distortion based cost. The segmentation using recursive merging is performed by using the rate-distortion based cost. Experimental results for 256$\times$256 Lena show that the region-based coding using the proposed segmentation yields the PSNR improvements of 0.8~ 1.0 dB and 1.2~1.5 dB over that using the rate-distortion based segmentation with DC approximation only and JPEG, respectively.

• 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
• /
• 1998.10a
• /
• pp.903-906
• /
• 1998

We propose a new method for merging partical regions which have similar motion characteristics. In the proposed method, the trajectories of each partial regions are computed and the regions consisting a same object are merged by a similarity function defined in this paper. The similarity function is defined to take into consideration the motion characteristics of the trajectories. The proposed method shows good performance when the regions of an object show little variation in size and shape.

• Proceedings of the IEEK Conference
• /
• 2001.09a
• /
• pp.283-286
• /
• 2001

In this paper, we present a robust region segmentation method based on the watershed transformation of a pseudo-distance map (PDM). A usual approach for the segmentation of a gray-scale image with the watershed algorithm is to apply it to a gradient magnitude image or the Euclidean distance map (EDM) of an edge image. However, it is well known that this approach suffers from the oversegmentation of the given image due to noisy gradients or spurious edges caused by a thresholding operation. In this paper we show thor applying the watershed algorithm to the EDM, which is a regularized version of the EDM and is directly computed form the edgestrength function (ESF) of the input image, significantly reduces the oversegmentation, and the final segmentation results obtained by a simple region-merging process are more reliable and less noisy than those of the gradient-or EDM-based methods. We also propose a simple and efficient region-merging criterion considering both boundary strengths and inner intensities of regions to be merged. The robustness of our method is proven by testing it with a variety of synthetic and real images.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.9
• /
• pp.2994-3001
• /
• 2000

In this paper. a method for color image segmentation using region merging is proposed. A inhomogeneity which exists in image is reduced by smoothing with non-linear filtering. saturation enhancement and intensity averaging in previous step of image segmentation. and a similar regions are segmented by non-uniform quantization using zero-crossing information of color histogram. A edge strength of initial region is measured using high frequency energy of wavelet transform. A candidate region which is merged in next step is selected by doing this process. A similarity measure for region merging is processed using Euclidean distance of R. G. B color channels. A Proposed method can reduce an over-segmentation results by irregular light sources et. al, and we illustrated that the proposed method is reasonable by simulation.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.5
• /
• pp.1587-1598
• /
• 2000

For the object-based video compression at very low bit rate, vieo segmentation is an essential part. In this paper, we propose a temporal video segmentation algorithms for motion pictures which is based on blocks. The algorithm is composed of three steps: (1) the change-detection, (2) the block merging, and (3) the block segmentation. The first step separates the change-detected region from background. Here, a new method for removing the uncovered region without motion estimation is presented. The second step, which is further divided into three substeps, estimates motions for the change-detected region and merges blocks with similar motions. The merging conditions for each substep as criteria are also given. The final step, the block segmentation, segments the boundary block that is excluded from the second step on a pixel basis. After describing our algorithm in detail, several experimental results along the processing order are shown step by step. The results demonstrate that the proposed algorithm removes the uncovered region effectively and produced objects that are segmented well.

• Proceedings of the IEEK Conference
• /
• 2003.11a
• /
• pp.449-452
• /
• 2003

This paper propose a extracting method of the region for image using segmentation and edge information. First propose algorithm extract information using canny edge detector and the image was divided by watershed segmentation. And it extract the mage with edge information by merging region. Finally we compare the proposed method with levelset method. In the result proposed method not only extract the image with accurate region but also reduce operation time.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.42 no.6
• /
• pp.33-42
• /
• 2005

In this paper, we propose an efficient segmentation algerian using morphological grayscale reconstruction for region-based coding. Each segmentation stage consists of simplification, marker extraction and decision. The simplification removes unnecessary components to make an easier segmentation. The marker extraction finds the flat zones which are the seed points from the simplified image. The decision is to locate the contours of regions detected by the marker extraction. For the simplification, we use a new connected operator based on the size and contrast. In the marker extraction stage, the regions reconstructed to original values we excluded from the candidate marker. For the other regions, the regions which are larger than structuring elements or have higher contrast than a threshold value are selected as markers. For the initial segmentation, the conventional hierarchical watershed algorithm and the extracted markers are used. Finally in the region merging stage, we propose an efficient region merging algorithm which preserves a high quality in terms of the number of regions. At the same time, the pairs which have higher contrast than a threshold are excluded from the region merging stage. Experimental results show that the proposed marker extraction method produces a small number of markers, while maintaining high quality and that the proposed region merging algorithm achieves a good performance in terms of the image quality and the number of regions.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1996.06a
• /
• pp.175-180
• /
• 1996

In this paper, a new image segmentation method based on merging of two low contrast neighbor regions iteratively is proposed. It is suitable for very low bit rate coding. The proposed method reduces efficiently contour information and preserves subjective and objective image quality. It consists of image segmentation using 4-level hierarchical structure based on mathematical morphology and 1-level region merging structure using the contrast difference of two adjacent neighbor regions. For each segmented region of the third level, two adjacent neighbor regions having low contrast difference value in fourth level based on contrast difference value is merged iteratively. It preserves image quality and shows the noticeable reduction of the contour information, so that it can improve the bottleneck problem of segmentation-based coding at very low bit rate.