• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.7-10
• /
• 2000

Fast block motion estimation technique is proposed to reduce the computational complexity in video coding. In the conventional methods the size of search region is fixed. For small motion regions like background the small size of sea of search region is enough to find a block motion. But for active motion regions the large size of search region is preferred to figure out the accurate motion vector. Therefore, it is reasonable that a block motion is estimated in the variable search region (both the size and the position of it). That is to say, the search region varies according to the predicted motion characteristics of a block. The block motion in video frames has temporal continuity and then the search region of a current block is predicted using the block motion of previous blocks. The computational complexity of the proposed technique is significantly reduced with a good picture quality compared to the conventional methods.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.8
• /
• pp.1691-1697
• /
• 1997

This paper presents a new motion compensated error coding method suitable for region based image coding system. Compared with block based conding, the region based coding improves subjective quality as it estimates and compensates 2D (or 3D) translantional, rotational, and scaling motion for each regions. although the region based coding has this advantage, its merit is reduced as bock-DCT (2D-DCT) is used to encode motion-compensated error. To overcome this problem, a new region adaptive motion compensated error coding technique which improver subjective and objective quality in the region boundary is proposed in this paper. In the proposed method, regions with large error are estimated using contour of the regions and contrast between the regions. The regions estiated as those with large error are coded by arbitrarily shaped image segment coding method. The mask information of the coded regions is not transmitted because it is estimated as the same algorithm in the encoder and the decoder. The proposed region adaptive motion conpensated error coding method improves about 0.5dB when it is compared with conventional block based method.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.8
• /
• pp.129-136
• /
• 1994

In this paper an adaptive moving method of the search region tracking the motion is proposed. The search region in BMA is determined by the capability of hardware implementation and the degree of motion. But once determined nothing can be changed during coding procedure. In this paper we predict the level of motion of the current block using motion vectors of previous frames without overhead information and change the location of the search region according to the level of the motion predicted. In short the proposed method can be archieved the dsirable effect such that the size of search region gets large when the motion is large. Results of experiments show that prediction efficiency has been improved by using adaptive moving method resulting in reduced prediction error in the blocks with large motion.

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

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.4
• /
• pp.771-781
• /
• 1997

In order to solve the problem of uncovered background region due to the region-due to the region-based motion estimation, this paper presents a new method which generates the uncovered region memory using motion estimation and shows the application of the algorithm for very low bit rate video coding. The proposed algorithm can be briefly described as follows it detects the changed region by using the information of FD(frame difference) and segmentation, and then as for only that region the backward motion estimation without transmission of shape information is done. Therefore, from only motion information the uncovered background region memory is generated and updated. The contents stored in the uncovered background region memory are referred whenever the uncovered region comes into existence. The regions with large prediction error are transformed and coded by using DCT. As results of simulation, the proposed algorithm shows the superior improvement in the subjective and objective image quality due to the remarkable reduction of transmission bits for prediction error.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.7
• /
• pp.78-88
• /
• 1997

A three dimensional-two spatical dimensions plus time-image segmentation is widely used in a very low bit rate image sequence coding because it can solve the region correspondence problem. Mathematical morphology is a very efficient tool for the segmentation because it deals well with geometric features such as size, shape, contrast and connectivity. But if the motion in the image sequence is large in time axis, the conventional 3D morphological segmentation algorithm have difficulty in solving region correspondence problem. To alleviate this problem, we propose the hierarchical image sequence segmentation algorithm that uses the region motion information. Since the motion of a region in previous level affects that in current level uses the previous motion information to increase region correspondence. Simulation result shows improved performance for sequence frames with large motion.

• Proceedings of the IEEK Conference
• /
• 2000.07b
• /
• pp.843-846
• /
• 2000

An optical flow-based motion estimation algorithm is proposed for video coding. The algorithm uses block-matching motion estimation with an adaptive search region. The search region is computed from motion fields that are estimated based on the optical flow. The algorithm is based on the fact that true block-motion vectors have similar characteristics to optical flow vectors. Thereafter, the search region is computed using these optical flow vectors that include spatial relationships. In conventional block matching, the search region is fixed. In contrast, in the new method, the appropriate size and location of the search region are both decided by the proposed algorithm. The results obtained using test images show that the proposed algorithm can produce a significant improvement compared with previous block-matching algorithms.

• Proceedings of the IEEK Conference
• /
• 2001.06d
• /
• pp.219-222
• /
• 2001

Moving objects in video data are main elements for video analysis and retrieval. In this paper, we propose a new algorithm for tracking and segmenting moving objects in color image sequences that include complex camera motion such as zoom, pan and rotating. The Proposed algorithm is based on the Mean-shift color segmentation and stochastic region matching method. For segmenting moving objects, each sequence is divided into a set of similar color regions using Mean-shift color segmentation algorithm. Each segmented region is matched to the corresponding region in the subsequent frame. The motion vector of each matched region is then estimated and these motion vectors are summed to estimate global motion. Once motion vectors are estimated for all frame of video sequences, independently moving regions can be segmented by comparing their trajectories with that of global motion. Finally, segmented regions are merged into the independently moving object by comparing the similarities of trajectories, positions and emerging period. The experimental results show that the proposed algorithm is capable of segmenting independently moving objects in the video sequences including complex camera motion.

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

The three-step search(TSS) algorithm, a simple and gradual motion estimation algorithm, has been widely used in some low bit-rate video compression. We propose a new fast block motion estimation algorithm using the characteristics of motion in search region. Most of motion vectors exist in the center region of search area, so the notion in that region is examined more closely than TSS in this paper. Also in a search step, motion vector is estimated in the local area which is not overlapped with the search area in previous step, considering the all possible direction of motion. Therefore, we get the better motion estimation and reduce computational time in compared with the conventional methods.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.7
• /
• pp.1187-1192
• /
• 2008

This paper proposes a fast motion estimation using an adaptive search region and a new three step search. The proposed method improved in the quality of motion compensation image as $0.43dB{\sim}2.19dB$, according as it predict motion of current block from motion vector of neigher blocks, and adaptively set up search region using predicted motion information. We show that the proposed method applied a new three step search pattern is able to fast motion estimation, according as it reduce computational complexity per blocks as $1.3%{\sim}1.9%$ than conventional method.