Sciweavers

1489 search results - page 58 / 298
» Optimizing Feature Sets for Structured Data
Sort
View
ICCV
2007
IEEE
15 years 4 months ago
Scale-Dependent 3D Geometric Features
Three-dimensional geometric data play fundamental roles in many computer vision applications. However, their scale-dependent nature, i.e. the relative variation in the spatial ext...
John Novatnack, Ko Nishino
CVPR
2006
IEEE
15 years 11 months ago
Automatic Kinematic Chain Building from Feature Trajectories of Articulated Objects
We investigate the problem of learning the structure of an articulated object, i.e. its kinematic chain, from feature trajectories under affine projections. We demonstrate this po...
Jingyu Yan, Marc Pollefeys
3DPVT
2004
IEEE
136views Visualization» more  3DPVT 2004»
15 years 1 months ago
Efficient Model Creation of Large Structures based on Range Segmentation
This paper describes an efficient 3D modeling method from 3D range data-sets that is utilizing range data segmentation. Our algorithm starts with a set of unregistered 3D range sc...
Ioannis Stamos, Marius Leordeanu
KDD
2006
ACM
150views Data Mining» more  KDD 2006»
15 years 10 months ago
Maximally informative k-itemsets and their efficient discovery
In this paper we present a new approach to mining binary data. We treat each binary feature (item) as a means of distinguishing two sets of examples. Our interest is in selecting ...
Arno J. Knobbe, Eric K. Y. Ho
CORR
2008
Springer
74views Education» more  CORR 2008»
14 years 10 months ago
Biased Range Trees
A data structure, called a biased range tree, is presented that preprocesses a set S of n points in R2 and a query distribution D for 2-sided orthogonal range counting queries. The...
Vida Dujmovic, John Howat, Pat Morin