Sciweavers

742 search results - page 127 / 149
» Pattern matching for sets of segments
Sort
View
ICPR
2002
IEEE
14 years 8 months ago
Bayesian Pot-Assembly from Fragments as Problems in Perceptual-Grouping and Geometric-Learning
A heretofore unsolved problem of great archaeological importance is the automatic assembly of pots made on a wheel from the hundreds (or thousands) of sherds found at an excavatio...
David B. Cooper, Andrew R. Willis, Stuart Andrews,...
GIS
2008
ACM
14 years 8 months ago
Fast and extensible building modeling from airborne LiDAR data
This paper presents an automatic algorithm which reconstructs building models from airborne LiDAR (light detection and ranging) data of urban areas. While our algorithm inherits t...
Qian-Yi Zhou, Ulrich Neumann
BMCBI
2008
149views more  BMCBI 2008»
13 years 6 months ago
MD-SeeGH: a platform for integrative analysis of multi-dimensional genomic data
Background: Recent advances in global genomic profiling methodologies have enabled multidimensional characterization of biological systems. Complete analysis of these genomic prof...
Bryan Chi, Ronald J. deLeeuw, Bradley P. Coe, Raym...
ECCV
2008
Springer
14 years 9 months ago
Pose Priors for Simultaneously Solving Alignment and Correspondence
Abstract. Estimating a camera pose given a set of 3D-object and 2Dimage feature points is a well understood problem when correspondences are given. However, when such correspondenc...
Francesc Moreno-Noguer, Vincent Lepetit, Pascal Fu...
COCO
2009
Springer
128views Algorithms» more  COCO 2009»
14 years 2 months ago
An Almost Optimal Rank Bound for Depth-3 Identities
—We show that the rank of a depth-3 circuit (over any field) that is simple, minimal and zero is at most O(k3 log d). The previous best rank bound known was 2O(k2 ) (log d)k−2...
Nitin Saxena, C. Seshadhri