Sciweavers

1764 search results - page 153 / 353
» Robustness in Motion Averaging
Sort
View
3DPVT
2006
IEEE
213views Visualization» more  3DPVT 2006»
16 years 18 days ago
Generalized RANSAC Framework for Relaxed Correspondence Problems
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...
Wei Zhang, Jana Kosecka
ESA
2008
Springer
99views Algorithms» more  ESA 2008»
15 years 8 months ago
Robust Kinetic Convex Hulls in 3D
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, ...
COMGEO
2010
ACM
15 years 6 months ago
Approximation algorithm for the kinetic robust K-center problem
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...
Sorelle A. Friedler, David M. Mount
ICMCS
2005
IEEE
124views Multimedia» more  ICMCS 2005»
16 years 3 days ago
A perceptual bit allocation scheme for H.264
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...
Hongtao Yu, Feng Pan, Zhiping Lin, Yin Sun
VLBV
2005
Springer
16 years 2 hour ago
Reduced Frame Quantization in Video Coding
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 ...
Tuukka Toivonen, Janne Heikkilä