• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.3A
• /
• pp.221-230
• /
• 2002

This paper presents a new moving object segmentation algorithm using markov random field. The algorithm is based on signal detection theory. That is to say, motion of moving object is decided by binary decision rule, and false decision is corrected by markov random field model. The procedure toward complete segmentation consists of two steps: motion detection and object segmentation. First, motion detection decides the presence of motion on velocity vector by binary decision rule. And velocity vector is generated by optical flow. Second, object segmentation cancels noise by Bayes rule. Experimental results demonstrate the efficiency of the presented method.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.10
• /
• pp.2838-2844
• /
• 1999

The motion-based video segmentation provides a powerful method of video compression, because it defines a region with similar motion, and it makes video compression system to more efficiently describe motion video. In this paper, we propose the Modified Fuzzy Competitive Learning Algorithm (MFCLA) to improve the traditional K-menas clustering algorithm to implement the motion-based video segmentation efficiently. The segmented region is described with the affine model, which consists of only six parameters. This affine model was calculated with optical flow, describing the movements of pixels by frames. This method could be applied in the low bit rate video transmission, such as video conferencing system.

• Journal of the Institute of Convergence Signal Processing
• /
• v.10 no.1
• /
• pp.32-39
• /
• 2009

In this paper, the method of region segmentation using genetic algorithm is proposed for an improvement of efficiency in moving picture coding. A genetic algorithm is the method that searches a large probing space using only a function value for a optimal combination consecutively. By progressing both motion presumption and region segmentation at once, we can assign the motion vector in a image to a small block or a pixel respectively, and transform the capacity of coding and a signal to noise rate into a problem of optimization. That is to say, there is close correlation between region segmentation and motion presumption in motion-compensated prediction coding. This is to optimize the capacity of coding and a S/N ratio. This is to arrange the motion vector in each block of picture according to the state of optimization. Therefore, we examined both the data type of genetic algorithm and the method of data processing to obtain the results of optimal region segmentation in this paper. And we confirmed the validity of a proposed method using the test pictures by means of computer simulation.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.43 no.4 s.310
• /
• pp.74-86
• /
• 2006

This paper proposes a robust and computationally efficient algorithm for automatic video object segmentation. For implementing the spatio-temporal segmentation, which aims for efficient combination of the motion segmentation and the color segmentation, an SOM-based hierarchical clustering method in which the segmentation process is regarded as clustering of feature vectors is employed. As results, problems of high computational complexity which required for obtaining exact segmentation results in conventional video object segmentation methods, and the performance degradation due to noise are significantly reduced. A measure of motion vector reliability which employs MRF-based MAP estimation scheme has been introduced to minimize the influence from the motion estimation error. In addition, a noise elimination scheme based on the motion reliability histogram and a clustering validity index for automatically identifying the number of objects in the scene have been applied. A cross projection method for effective object tracking and a dynamic memory to maintain temporal coherency have been introduced as well. A set of experiments has been conducted over several video sequences to evaluate the proposed algorithm, and the efficiency in terms of computational complexity, robustness from noise, and higher segmentation accuracy of the proposed algorithm have been proved.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.12
• /
• pp.77-83
• /
• 1998

Generally a moving picture suffers from motion blur, due to relative motion between moving objects and the image formation system. The purpose of this paper is to propose teh model for the motion blur and the restoration method using the regularized iterative technique. In the proposed model, the boundary effect between moving objects and background is analyzed mathematically to overcome the limit of the spatially invariant model. And we present the motion-based image segmentation technique for the object-based image restoration, which is the modified version of the conventional segmentation method. Based on the proposed model, the restoration technique removes the motion blur by using the estimated motion parameter from the result of the segmentation.

• 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.

• Journal of Information Display
• /
• v.5 no.3
• /
• pp.1-7
• /
• 2004

We developed a novel frame interpolation method to interpolate a frame between two successive original frames. Using this method, we are able to apply a double-rate driving method instead of an impulse driving method where a black frame is inserted between two successive original frames. The double-rate driving method enables amelioration of the motion blur of LCDs caused by the characteristics of human vision without reducing the luminosity of the whole screen. The image quality of the double-rate driving method was also found to be better than that of an impulse driving method using our motion picture simulator and an actual panel. Our initial model of our frame interpolation method consists of motion estimation with a maximum matching pixel count estimation function, an area segmentation technique, and motion compensation with variable segmentation threshold. Although salt and pepper noise remained in a portion of an object mainly due to inaccuracy of motion estimation, we verified the validity of our method and the possibility of improvement in hold-type motion blurring.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.3
• /
• pp.469-480
• /
• 1997

For moving image coding, the variable size of region coding based on local motion is more efficient than fixed size of region coding. It can be applied well to complex motions and is more stable for wide motions because images are segmented according to local motions. In this paper, new image coding method using the segmentation of motion vectors is proposed. First, motion vector field is smoothed by filtering and segmented by smoothed motion vectors. The region growing method is used for decomposition of regions, and merging of regions is decided by motion vector and prediction errors of the region. Edge of regions is excluded because of the correlation of image, and neighbor motion vectors are used evaluation of current block and construction of region. The results of computer simulation show the proposed method is superior than the existing methods in aspect of coding efficiency.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.3
• /
• pp.1434-1449
• /
• 2019

Video object segmentation is a significant task in computer vision, but its performance is not very satisfactory. A method of video object segmentation using weakly temporal information is presented in this paper. Motivated by the phenomenon in reality that the motion of the object is a continuous and smooth process and the appearance of the object does not change much between adjacent frames in the video sequences, we use a feed-forward architecture with motion estimation to predict the mask of the current frame. We extend an additional mask channel for the previous frame segmentation result. The mask of the previous frame is treated as the input of the expanded channel after processing, and then we extract the temporal feature of the object and fuse it with other feature maps to generate the final mask. In addition, we introduce multi-mask guidance to improve the stability of the model. Moreover, we enhance segmentation performance by further training with the masks already obtained. Experiments show that our method achieves competitive results on DAVIS-2016 on single object segmentation compared to some state-of-the-art algorithms.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.5
• /
• pp.518-528
• /
• 2001

In this paper, we firstly define a new combined segmentation measure and propose a segmentation algorithm using this measure. The combined segmentation measure is a weighted sum of intensity, motion, and a change segmentation measure that is extracted from the resulting image of the proposed change detector. The change segmentation measure is defined as an absolute change value difference between an pixel and its neighboring region from the eroded image, which results from morphological erosion filtering to eliminate many inaccurate components included in the resulting image of a conventional change detector. The change segmentation measure can be used as an efficient segmentation measure for the accurate segmentation of neighboring moving objects and static background regions. Therefore, the proposed combined segmentation measure can determine exact boundaries in the segmentation process of region-based coding even though the estimated motion vectors around the boundaries of moving objects and static background regions are inaccurate and the intensities around the boundaries are similar.