1-D Transforms for the Motion Compensation Residual

Download
2011-04-01
Transforms used in image coding are also commonly used to compress prediction residuals in video coding. Prediction residuals have different spatial characteristics from images, and it is useful to develop transforms that are adapted to prediction residuals. In this paper, we explore the differences between the characteristics of images and motion compensated prediction residuals by analyzing their local anisotropic characteristics and develop transforms adapted to the local anisotropic characteristics of these residuals. The analysis indicates that many regions of motion compensated prediction residuals have 1-D anisotropic characteristics and we propose to use 1-D directional transforms for these regions. We present experimental results with one example set of such transforms within the H.264/AVC codec and the results indicate that the proposed transforms can improve the compression efficiency of motion compensated prediction residuals over conventional transforms.
IEEE TRANSACTIONS ON IMAGE PROCESSING

Suggestions

Intra Prediction Based on Markov Process Modeling of Images
Kamışlı, Fatih (Institute of Electrical and Electronics Engineers (IEEE), 2013-10-01)
In recent video coding standards, intraprediction of a block of pixels is performed by copying neighbor pixels of the block along an angular direction inside the block. Each block pixel is predicted from only one or few directionally aligned neighbor pixels of the block. Although this is a computationally efficient approach, it ignores potentially useful correlation of other neighbor pixels of the block. To use this correlation, a general linear prediction approach is proposed, where each block pixel is pre...
Geometry-Aware Neighborhood Search for Learning Local Models for Image Superresolution
Ferreira, Julio Cesar; Vural, Elif; Guillemot, Christine (Institute of Electrical and Electronics Engineers (IEEE), 2016-03-01)
Local learning of sparse image models has proved to be very effective to solve inverse problems in many computer vision applications. To learn such models, the data samples are often clustered using the K-means algorithm with the Euclidean distance as a dissimilarity metric. However, the Euclidean distance may not always be a good dissimilarity measure for comparing data samples lying on a manifold. In this paper, we propose two algorithms for determining a local subset of training samples from which a good...
Extending Correlation Filter-Based Visual Tracking by Tree-Structured Ensemble and Spatial Windowing
Gundogdu, Erhan; Özkan, Huseyin; Alatan, Abdullah Aydın (Institute of Electrical and Electronics Engineers (IEEE), 2017-11-01)
Correlation filters have been successfully used in visual tracking due to their modeling power and computational efficiency. However, the state-of-the-art correlation filter-based (CFB) tracking algorithms tend to quickly discard the previous poses of the target, since they consider only a single filter in their models. On the contrary, our approach is to register multiple CFB trackers for previous poses and exploit the registered knowledge when an appearance change occurs. To this end, we propose a novel t...
MARS - A TOOL-BASED MODELING, ANIMATION, AND PARALLEL RENDERING SYSTEM
AKTIHANOGLU, M; OZGUC, B; AYKANAT, C (Springer Science and Business Media LLC, 1994-01-01)
This paper describes a system for modeling, animating, previewing and rendering articulated objects. The system has a modeler of objects that consists of joints and segments. The animator interactively positions the articulated object in its stick, control vertex, or rectangular prism representation and previews the motion in real time. Then the data representing the motion and the models is sent to a multicomputer [iPSC/2 Hypercube (Intel)]. The frames are rendered in parallel, exploiting the coherence bet...
Minimization of Monotonically Levelable Higher Order MRF Energies via Graph Cuts
Karci, Mehmet Haydar; Demirekler, Mübeccel (Institute of Electrical and Electronics Engineers (IEEE), 2010-11-01)
A feature of minimizing images of submodular binary Markov random field (MRF) energies is introduced. Using this novel feature, the collection of minimizing images of levels of higher order, monotonically levelable multilabel MRF energies is shown to constitute a monotone collection. This implies that these minimizing binary images can be combined to give minimizing images of the multilabel MRF energies. Thanks to the graph cuts framework, the mentioned class of binary MRF energies is known to be minimized ...
Citation Formats
F. Kamışlı, “1-D Transforms for the Motion Compensation Residual,” IEEE TRANSACTIONS ON IMAGE PROCESSING, pp. 1036–1046, 2011, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/34772.