Finding correspondences between two (widely) separated views is essential for several computer vision tasks, such as structure and motion estimation and object recognition. In the...
Abstract. Kinetic data structures provide a framework for computing combinatorial properties of continuously moving objects. Although kinetic data structures for many problems have...
Umut A. Acar, Guy E. Blelloch, Kanat Tangwongsan, ...
Clustering is an important problem and has numerous applications. In this paper we consider an important clustering problem, called the k-center problem. We are given a discrete p...
This paper aims at improving perceptual quality of encoded video sequences, and proposes a new perceptual bit allocation scheme for H.264. Firstly, a new motion complexity measure...
We vary the quantization parameter in H.264 video encoding by increasing it by a well-chosen offset in every other frame, which we call reduced frames. As the motion compensation ...