Sciweavers

791 search results - page 150 / 159
» A structure from motion inequality
Sort
View
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
156
Voted
ESA
2008
Springer
99views Algorithms» more  ESA 2008»
15 years 7 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, ...
TIP
2010
153views more  TIP 2010»
15 years 4 months ago
A Versatile Model for Packet Loss Visibility and its Application to Packet Prioritization
In this paper, we propose a generalized linear model for video packet loss visibility that is applicable to different group-of-picture structures. We develop the model using three...
Ting-Lan Lin, Sandeep Kanumuri, Yuan Zhi, David Po...
ECCV
2008
Springer
16 years 7 months ago
Learning Optical Flow
Assumptions of brightness constancy and spatial smoothness underlie most optical flow estimation methods. In contrast to standard heuristic formulations, we learn a statistical mod...
Deqing Sun, Stefan Roth, J. P. Lewis, Michael J. B...
ECCV
2010
Springer
15 years 7 months ago
Location Recognition Using Prioritized Feature Matching
We present a fast, simple location recognition and image localization method that leverages feature correspondence and geometry estimated from large Internet photo collections. Suc...
Yunpeng Li, Noah Snavely, Daniel P. Huttenlocher