• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.38 no.6
• /
• pp.113-119
• /
• 2001

In this paper, we propose an improved watershed algorithm that resolves the oversegmentation problem shown in the previous watershed algorithm and its modifications when the spatial video segmentation is performed. The principal idea of the proposed algorithm is merging the shallow catchment basin whose depth is less than a given threshold into the deeper one during flooding step. In the flooding process, the growth of the existing catchment basins and the extraction of newly flooded ones are accomplished. We present the experimental results using several MPEG test sequences in the last part of the paper. As a consequence, the proposed algorithm shows good segmentation results according to the thresholds applied by adding very small amount of calculations.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.871-874
• /
• 1998

This paper presents a new morphological spatio-temporal segmentation algorithm. The algorithm incorporates intensity and motion information simultaneously, and uses morphological tools such as morphological filters and watershed algorithm. The procedure toward complete segmetnation consists of three steps: joint marker extraction, boundary decision, and motion-based region fusion. By incorporating spatial and temporal information simultaneously, we can obtain visually meaningful segmentation results. Simulation results demonstrates the efficiency of the proposed method.

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

A new video segmentation algorithm for segmentation-based video coding is proposed. The method uses a new criterion based on similarities in both motion and brightness. Brightness and motion information are incorporated in a single segmentation procedure. The actual segmentation is accomplished using a region-growing technique based on the watershed algorithm. In addition, a tracking technique is used in subsequent frames to achieve a coherent segmentation through time. Simulation results show that the proposed method is effective in determining object boundaries not easily found using the statistic criterion alone.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.43 no.9 s.351
• /
• pp.44-52
• /
• 2006

Recently developed MPEG-4 Part 2 compression standard provides a novel capability to handle arbitrary video objects. To support this capability, an efficient object segmentation technique is required. This paper proposes a real-time algorithm for foreground object segmentation in video sequences. The proposed algorithm consists of two steps: the first step that segments a video frame into multiple sub-regions using Spatio-Temporal Watershed Transform and the second step in which a foreground object segment is extracted from the sub-regions generated in the first step. For real-time processing, the algorithm is partitioned into hardware and software parts so that computationally expensive parts are off-loaded from a processor and executed by hardware accelerators. Simulation results show that the proposed implementation can handle QCIF-size video at 15 fps and extracts an accurate foreground object.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.37 no.2
• /
• pp.50-59
• /
• 2000

In this paper, a new preprocessing method is proposed to speedup the watershed-based image segmentation In the proposed method, the gradient correction values of ramp edges are calculated from the positions and width of the ramp edges using Laplacian operator, and then, unlike the conventional method in which the monoscale or multi scale gradient image is directly used as a reference iImage, the reference image is obtained by adding the threshold value to each position of the ramp edges in the monoscale gradient image And the marker image is reconstructed on the reference image by erosion By preprocessing the image for the watershed transformation in such a manner, we can reduce the oversegmentations far more than those of applying the conventional morphological filter to the simple monoscale or multiscale gradient-based reference image Thus, we can reduce the total image segmentation time by reducing the time of postprocessing of region merging, which consumes most of the processing time In the watershed-based image segmentation, Experimental results indicate that the proposed method can speedup the total image segmentation about twice than those of the conventional methods, without the loss of ramp edges and principal edges around the dense-edge region.

• Proceedings of the Korea Contents Association Conference
• /
• 2004.11a
• /
• pp.505-510
• /
• 2004

This paper suggests a new CT-image segmentation algorithm. This algorithm uses morphological filters and the watershed algorithms. The proposed CT-image segmentation algorithm consists of six parts: preprocessing, image simplification, feature extraction, decision making, region merging, and postprocessing. By combining spatial and temporal information, we can get more accurate segmentation results. The simulation results illustrate not only the segmentation results of the conventional scheme but also the results of the proposed scheme; this comparison illustrates the efficacy of the proposed technique. Furthermore, we compare the various medical images of the structuring elements. Indeed, to illustrate the improvement of coding efficiency in postprocessing, we use differential chain coding for the shape coding of results.

• Proceedings of the KIEE Conference
• /
• 2007.04a
• /
• pp.17-19
• /
• 2007

This paper describe an interactive video object segmentation tool which can be used to generate MPEG-4 video object planes for multimedia broadcasting and enables content based functionalities. In order to apply these functionalities, each frame of video sequence should be represented in terms of video objects. Semiautomatic segmentation can be thought of as a user-assisted segmentation technique. A user can initially mark objects of interest around the real object boundaries. Then the user-guided and selected objects are continuously separated from the unselected areas though time evolution in the image sequences. We proposed method shows very promising result and this encourages the development of object based video editing system.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1998.06b
• /
• pp.29-33
• /
• 1998

In this paper, we propose a hierarchical segmentation method for tracking a semantic video object using a watershed algorithm based on morphological filtering. In the proposed method, each hierarchy consists of three steps: First, markers are extracted on the simplified current frame. Second, region growing by a modified watershed algorithm is performed for segmentation. Finally, the segmented regions are classified into 3 categories, i.e., inside, outside, and uncertain regions according to region probability values, which are acquired by the probability map calculated from a estimated motion field. Then, for the remaining uncertain regions, the above three steps are repeated at lower hierarchies with less simplified frames until every region is decided to a certain region. The proposed algorithm provides prospective results in video sequences such as Miss America, Clair, and Akiyo.

• The Journal of Engineering Research
• /
• v.6 no.2
• /
• pp.99-107
• /
• 2004

In stereo matching system, it is efficient using segment patch, which divides the image into homogeneous region in color or similar intensity, because it preserves the disparity boundary and disparity continuity in low textured region. But many miss matching occur in the highly textured region because of the over segmentation that makes patch small and ambiguous. In this paper, in order to solve problems, we propose adaptive patch matching based on the watershed image segmentation. Performance was verified in experimental results.

• Journal of Korean Society for Geospatial Information Science
• /
• v.19 no.1
• /
• pp.29-36
• /
• 2011

The main purpose of this paper is to make a map showing canopy cover by using airborne Lidar data based on region. Watershed algorithm was applied to elevation data to conduct segmentation, and then canopy cover was estimated through the regions extracted. In the process of transforming point data to raster, we solved the problems about overestimation and underestimation by using frequency method. Also, canopy cover map could be produced with various scales by differing level of segmentation and it provides more accurate and precise information than ones of ordinary public forest map.