• 대한전기학회논문지:시스템및제어부문D
• /
• 제50권3호
• /
• pp.149-157
• /
• 2001

In the video retrieval system, visual clues of still images and motion information of video are employed as feature vectors. We generate the temporal textures to express the motion information whose properties are simple expression, easy to compute. We make those temporal textures of wavelet coefficients to express motion information, M components. Then, temporal texture feature vectors are extracted using spatial texture feature vectors, i.e. spatial gray-level dependence. Also, motion amount and motion centroid are computed from temporal textures. Motion trajectories provide the most important information for expressing the motion property. In our modeling system, we can extract the main motion trajectory from the temporal textures.

• 한국통신학회논문지
• /
• 제21권6호
• /
• pp.1361-1369
• /
• 1996

Motion estimation is one of the key components for high quality video coding. In this paper, a new motion estimation scheme for MPEG-like video coder is suggested. The proposed temporally adaptive motion estimation scheme consists of five functional blocks: Temporal subband analysis (TSBA), extraction of temporal information, scene change detection (SCD), picture type replacement (PTR), and temporally adapted block matching algorithm (TABMA). Here all the functional components are based on the temporal subband analysis. In this papre, we applied the analysis part of subband decompostion to the temporal axis of moving picture sequence, newly defined the temporal activity distribution (TAD) and average TAD, and proposed the temporally adapted block matching algorithm, the scene change detection algorithm and picture type replacement algorithm which employed the results of the temporal subband analysis. A new block matching algorithm TABMA is capable of controlling the block matching area. According to the temporal activity distribution of objects, it allocates the search areas nonuniformly. The proposed SCD and PTR can prevent unavailable motion prediction for abrupt scene changes. Computer simulation results show that the proposed motion estimation scheme improve the quality of reconstructed sequence and reduces the number of block matching trials to 40% of the numbers of trials in conventional methods. The TSBA based scene change detection algorithm can detect the abruptly changed scenes in the intentionally combined sequence of this experiment without additional computations.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1998년도 추계종합학술대회 논문집
• /
• 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.

• 한국통신학회논문지
• /
• 제22권6호
• /
• pp.1195-1209
• /
• 1997

This paper presents a new morphological spatio-temporal segmentation algorithm. The algorithm incorporates luminance and motion information simultaneously, and uses morphological tools such as morphological filtersand watershed algorithm. The procedure toward complete segmentation consists of three steps:joint marker extraction, boundary decision, and motion-based region fusion. First, the joint marker extraction identifies the presence of homogeneours regions in both motion and luminance, where a simple joint marker extraction technique is proposed. Second, the spatio-temporal boundaries are decided by the watershed algorithm. For this purposek, a new joint similarity measure is proposed. Finally, an elimination ofredundant regions is done using motion-based region function. By incorporating spatial and temporal information simultaneously, we can obtain visually meaningful segmentation results. Simulation results demonstratesthe efficiency of the proposed method.

• 한국정보과학회논문지:소프트웨어및응용
• /
• 제29권9호
• /
• pp.631-644
• /
• 2002

In this paper efficient algorithms for content-based video retrieval using motion information are proposed, including temporal scale-invariant retrieval and temporal scale-absolute retrieval. In temporal scale-invariant video retrieval, the distance transformation is performed on each trail image in database. Then, from a given que교 trail the pixel values along the query trail are added in each distance image to compute the average distance between the trails of query image and database image, since the intensity of each pixel in distance image represents the distance from that pixel to the nearest edge pixel. For temporal scale-absolute retrieval, a new coding scheme referred to as Motion Retrieval Code is proposed. This code is designed to represent object motions in the human visual sense so that the retrieval performance can be improved. The proposed coding scheme can also achieve a fast matching, since the similarity between two motion vectors can be computed by simple bit operations. The efficiencies of the proposed methods are shown by experimental results.

• 한국정보디스플레이학회:학술대회논문집
• /
• 한국정보디스플레이학회 2007년도 7th International Meeting on Information Display 제7권1호
• /
• pp.1029-1030
• /
• 2007

I introduce two experiments that investigate temporal factors of stereopsis: one is for depth perception and the other is for perception of motion in depth. Both studies show that there are multiple mechanisms to process depth information with different temporal characteristics.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권1호
• /
• pp.360-373
• /
• 2017

This paper presents a novel digital video steganalysis scheme against the spatial domain video steganography technology based on a spatial temporal detector (ST_D) that considers both spatial and temporal redundancies of the video sequences simultaneously. Three descriptors are constructed on XY, XT and YT planes respectively to depict the spatial and temporal relationship between the current pixel and its adjacent pixels. Considering the impact of local motion intensity and texture complexity on the histogram distribution of three descriptors, each frame is segmented into non-overlapped blocks that are $8{\times}8$ in size for motion and texture analysis. Subsequently, texture and motion factors are introduced to provide reasonable weights for histograms of the three descriptors of each block. After further weighted modulation, the statistics of the histograms of the three descriptors are concatenated into a single value to build the global description of ST_D. The experimental results demonstrate the great advantage of our features relative to those of the rich model (RM), the subtractive pixel adjacency model (SPAM) and subtractive prediction error adjacency matrix (SPEAM), especially for compressed videos, which constitute most Internet videos.

• 전자공학회논문지B
• /
• 제33B권6호
• /
• pp.64-72
• /
• 1996

In this paper, we propose predictive motion estimatin algorithm which can predict motion without additional side information considering spatio-tempral correlatio of motion vector. This method performs motion prediction of current block using correlation of the motion vector for two spatially adjacent blocks and a temporally adjacent block. Form predicted motion, the position of searhc area is determined. Then in this searhc area, we estimate motion vector of current block using block matching algoirthm. Considering spatial an temporal correlation of motion vector, the proposed method can predict motion precisely much more. Especially when the motion of objects is rapid, this method can estimate motion more precisely without reducing block size or increasing search area. Futhrmore, the proposed method has computation time the same as conventional block matching algorithm. And as it predicts motion from adjacent blocks, it does not require additional side information for adjacent block. Computer simulation results show that motion estimation of proposed method is more precise than that of conventioanl method.

• 한국방송∙미디어공학회:학술대회논문집
• /
• 한국방송공학회 1995년도 학술대회
• /
• pp.137-141
• /
• 1995

MASF is a kind of temporal filter proposed for noise reduction and temporal band limitation. MASF uses motion vectors to extract temporal information in spatial domain. Therefore, inaccurate motion information causes some distortions in MASF operation. Currently, bilinear interpolation after MBA(Block Matching Algorithm) is used for the motion estimation sheme of MASF. But, this method results in unreliable estimation when the object in image sequence has larger movement than the maximum displacement assumed in BMA or the input images are severely corrupted with noise. In order to solve this problem, we propose a hierarchical motion estimation algorithm for MASF. Experimental results show that the proposed method produces reliable output under large motion and noisy situations.

• 한국통신학회논문지
• /
• 제21권5호
• /
• pp.1109-1122
• /
• 1996

Generally, moving images contain the various components in motions, which reange from a static object and background to a fast moving object. To extract the accurate motion parameters, we must consider the various motions. That requires a wide search egion in motion estimation. The wide search, however, causes a high computational complexity. If we have a few knowledge about the motion direction and magnitude before motion estimation, we can determine the search location and search window size using the already-known information about the motion. In this paper, we present a local adaptive motion estimation approach that predicts a block motion based on spatio-temporal neighborhood blocks and adaptively defines the search location and search window size. This paper presents a technique for reducing computational complexity, while having high accuracy in motion estimation. The proposed algorithm is introduced the forward and backward projection techniques. The search windeo size for a block is adaptively determined by previous motion vectors and prediction errors. Simulations show significant improvements in the qualities of the motion compensated images and in the reduction of the computational complexity.