Motion Analysis I

Chair: Eric Dubois, Universite du Quebec, Canada

Home


Representation and Estimation of Motion Using a Dictionary of Models

Authors:

Daniel Lauzon, INRS-Telecommunications (Canada)
Eric Dubois, INRS-Telecommunications (Canada)

Volume 5, Page 2585, Paper number 1848

Abstract:

This paper presents a novel method for representing motion information based on a Dictionary of Motion Models and a Tag Image which indicates which motion model is used at any given image position. Each model is composed of low-order polynomial-based motion fields. The motion in most sequences can be adequately represented by a very small number of such motion models. We further present an efficient way of estimating and coding this representation. Comparative results are presented which indicate a performance superior to that of motion representations found in classical block-based codecs.

ic981848.pdf (Scanned)

TOP



Global Motion Estimation and Robust Regression for Video Coding

Authors:

Kui Zhang, CVSSP, University of Surrey (U.K.)
Josef Kittler, CVSSP, University of Surrey (U.K.)

Volume 5, Page 2589, Paper number 2367

Abstract:

In the H.263 Version 2 (H.263+) coding standard, the global motion compensation can be introduced by using Reference Picture Resampling (Annex. P) syntax. Such an application requires that the global motion parameters be estimated automatically. In this paper, we propose a global motion estimation algorithm based on the Taylor Expansion Equation and robust regression technique using probabilistic thresholding. The experimental results confirm that the proposed algorithm can improve both coding efficiency and the quality of motion compensation on sequences involving camera movement.

ic982367.pdf (From Postscript)

TOP



Parametric Motion Modeling Based on Trilinear Constraints for Object-Based Video Compression

Authors:

Zhaohui Sun, University of Rochester (U.S.A.)
A. Murat Tekalp, University of Rochester (U.S.A.)

Volume 5, Page 2593, Paper number 1317

Abstract:

We propose a new parametric motion model based on the so-called ``trifocal tensor"" representation, which captures rigid 3D motion of static scenes with a depth of field. The proposed parametric representation, called the trilinear model, is superior to other forms such as translational, affine, perspective, and bilinear models, because it can implicitly encode the depth of the scene and 3D motion of the scene/camera under perspective projection unlike others. A video object can thus be represented by its first VOP, a set of trifocal sensors and the corresponding prediction residues. Motion estimation and compensation based on the new parametric model are incorporated into the MPEG-4 Video Verification Model to compare its efficacy for object-based video compression with the state-of-the-art motion compensation methods. Experimental results are provided to demonstrate the performance of the trilinear model for object-based video compression.

ic981317.pdf (From Postscript)

TOP



Adaptive Thresholding for Detection of Nonsignificant Vectors in Noisy Image Sequences

Authors:

Luc Martel, Laval University (Canada)
Andre Zaccarin, Laval University (Canada)

Volume 5, Page 2597, Paper number 2498

Abstract:

In noisy image sequences, block matching motion estimation generates erroneous motion vectors since the algorithm tries to correlate noise. We present an adaptive threshold test to detect blocks for which only nonsignificant motion vectors can be estimated. Vectors of these blocks are then assigned the zero vector before any block motion estimation is performed. By nonsignificant, we refer to motion vectors of non moving areas as well as vectors of moving areas for which the noise level is too high to allow a good estimation of the motion. The detection of these vectors reduces the computational complexity of the BMA and the entropy of the motion field. The algorithm is embedded in a hierarchical BMA and takes advantage of their different spectral characteristics to discriminate between the frame difference energy due to noise and due to motion. The algorithm is also efficient for low noise sequences where it can be used to initialize a segmentation of moving objects from the background.

ic982498.pdf (From Postscript)

TOP



Computing Optical Flow for Motion Images Sequences by Applying Multi-constraints to Multi-locations

Authors:

Chunke S Yang, University of Tokushima (Japan)
Shunitiro Oe, University of Tokushima (Japan)

Volume 5, Page 2601, Paper number 1075

Abstract:

Computing optical flow is one of the most fundamental problem to the motion image analysis. Many methods have been proposed for computing optical flow, among them gradient-based methods are the most well-known and most used. In the paper, a new gradient-based method for the computation of optical flow was proposed. In this method, optical flow was computed by minimizing a weighted least-squares error estimator for a constant motion vector model in a local spatial neighborhood, where the weight of each image location in the neighborhood was determined by its multiple constraints. Several experiments on real and synthetic image sequences have been carried out to verify the efficacy and the reliability of the new method.

ic981075.pdf (Scanned)

ic981075.pdf (From Postscript)

TOP



Active Mesh Reconstruction of Block-Based Motion Information

Authors:

Xavier Marichal, Lab de Telecommunication & Teledetection (Belgium)
Benoît Macq, Lab de Telecommunication & Teledetection (Belgium)

Volume 5, Page 2605, Paper number 1976

Abstract:

This paper proposes an asymmetric scheme for motion estimation/compensation. While the estimation is performed with a classical Block Matching Algorithm, the motion information is decoded by using an active mesh in order to implement the compensation stage. A mesh is positioned by taking into account the relevant spatial information of the image to be compensated and is used afterwards to reconstruct the motion information. Two main issues have to be addressed for conducting such a motion compensation technique: i) how to optimally design an active mesh, ii) how to reverse and interpolate a backward motion field estimated on an a priori grid of fixed-size blocks so as to determine a forward motion field on variable size triangular patches. While proposing a solution to these two problems, particular attention is paid to the computational burden. Such a scheme opens the possibility for added manipulation functionalities because of mesh capabilities.

ic981976.pdf (From Postscript)

TOP



Automatic Fitting and Tracking of Facial Features in Head-And-Shoulders Sequences

Authors:

Paul M Antoszczyszyn, The University of Edinburgh, Scotland (U.K.)
John M. Hannah, The University of Edinburgh, Scotland (U.K.)
Peter M. Grant, The University of Edinburgh, Scotland (U.K.)

Volume 5, Page 2609, Paper number 1027

Abstract:

Model-based video coding requires the application of both image processing and machine vision techniques for proper fitting of the semantic model and its subsequent tracking throughout the rest of the sequence of a certain type (e.g. 'head-and-shoulders' or 'head-only'). A method of automatic semantic wire-frame fitting and tracking based on principal component analysis using an independent reference data-base of facial images is presented. The method has been tested on widely used 'head-and-shoulders' video sequences with very good results. It was possible to accurately retrieve the position of the desired facial features in all cases. The position of the facial features in initial frames was subsequently used in automatic tracking. Experimental results are presented as a part of this contribution. Compressed movies illustrating these results can be viewed from our Internet site http://www.ee.ed.ac.uk/~plma/.

ic981027.pdf (From Postscript)

TOP



Fast Rate-Constrained N-Step Search Algorithm for Motion Estimation

Authors:

Muhammed Z Coban, Georgia Institute of Technology (U.S.A.)
Russell M. Mersereau, Georgia Institute of Technology (U.S.A.)

Volume 5, Page 2613, Paper number 1306

Abstract:

A fast N-step search algorithm for rate-constrained motion estimation is presented. The motion vectors are selected from a search window based on a rate-distortion criterion by successively eliminating the search positions at each step. The performance of the proposed algorithm is identical to the performance of the conventional rate-constrained N-step search algorithm, with considerable reduction in computation. Computational savings increase in parallel with the increases in the rate constraint and the number of steps.

ic981306.pdf (From Postscript)

TOP