Motion-compensated interpolation using trajectories with acceleration

Michel Chahine; Janusz Konrad

doi:10.1117/12.206354

17 April 1995 Motion-compensated interpolation using trajectories with acceleration

Michel Chahine, Janusz Konrad

Proceedings Volume 2419, Digital Video Compression: Algorithms and Technologies 1995; (1995) https://doi.org/10.1117/12.206354
Event: IS&T/SPIE's Symposium on Electronic Imaging: Science and Technology, 1995, San Jose, CA, United States

Abstract

This paper is primarily concerned with motion-compensated interpolation of video sequences using multiple images. Due to the extended temporal support of such motion compensation, linear (constant-velocity) trajectory model is often inappropriate, for example due to insufficient temporal sampling. Recently, we have proposed a quadratic (constant-acceleration) trajectory model and a framework for the computation of its parameters. The approach is based on Markov random field models that lead to a regularized formulation solved by multiresolution deterministic relaxation. In this paper, we demonstrate advantages of using accelerated motion over linear trajectories in a plausible application using natural data. We apply the estimated trajectories to motion-compensated interpolation over multiple frames of progressive and interlaced video sequences. The experimental results for `Miss America' and `Femme et arbre' (interlaced) show, respectively, a 4 and 2 dB average improvement in the PSNR of the reconstruction error when quadratic trajectories are used instead of the linear ones. It is interesting to note that in `Miss America' the most significant improvements can be observed in the area of the mouth and the eyes which are in fact likely to exhibit acceleration. We envisage an application of the proposed method to post-processing in very low bit rate video coding.

Citation Download Citation

Michel Chahine and Janusz Konrad "Motion-compensated interpolation using trajectories with acceleration", Proc. SPIE 2419, Digital Video Compression: Algorithms and Technologies 1995, (17 April 1995); https://doi.org/10.1117/12.206354

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available