Sciweavers

653 search results - page 75 / 131
» Efficient reconstruction from non-uniform point sets
Sort
View
ICIP
2002
IEEE
16 years 1 months ago
Data rate smoothing in interactive walkthrough applications using 2D prefetching
Compared to a geometric approach, image based rendering applied to 3D view reconstruction doesn't require 3D model construction and doesn't depend on the complexity of t...
Vitali Zagorodnov, Peter J. Ramadge
3DIM
2003
IEEE
15 years 3 months ago
Approximate K-D Tree Search for Efficient ICP
A method is presented that uses an Approximate Nearest Neighbor method for determining correspondences within the Iterative Closest Point Algorithm. The method is based upon the k...
Michael A. Greenspan, Mike Yurick
ACCV
2010
Springer
14 years 6 months ago
A Direct Method for Estimating Planar Projective Transform
Estimating planar projective transform (homography) from a pair of images is a classical problem in computer vision. In this paper, we propose a novel algorithm for direct register...
Yu-Tseh Chi, Jeffrey Ho, Ming-Hsuan Yang
JEC
2006
73views more  JEC 2006»
14 years 11 months ago
Frame packing algorithms for automotive applications
The set of frames exchanged in automotive applications must meet two constraints: it has to be feasible from a schedulability point of view and it should minimize the network bandw...
Rishi Saket, Nicolas Navet
ICDE
2008
IEEE
336views Database» more  ICDE 2008»
16 years 1 months ago
Dominant Graph: An Efficient Indexing Structure to Answer Top-K Queries
Given a record set D and a query score function F, a top-k query returns k records from D, whose values of function F on their attributes are the highest. In this paper, we investi...
Lei Zou, Lei Chen 0002