Sciweavers

999 search results - page 116 / 200
» Finding shapes in a set of points
Sort
View
ICCV
2009
IEEE
14 years 7 months ago
An algebraic model for fast corner detection
This paper revisits the classical problem of detecting interest points, popularly known as "corners," in 2D images by proposing a technique based on fitting algebraic sh...
Andrew Willis, Yunfeng Sui
CGF
2008
135views more  CGF 2008»
14 years 10 months ago
Streaming Surface Reconstruction Using Wavelets
We present a streaming method for reconstructing surfaces from large data sets generated by a laser range scanner using wavelets. Wavelets provide a localized, multiresolution rep...
Josiah Manson, G. Petrova, Scott Schaefer
CVPR
2007
IEEE
15 years 12 months ago
Isotropy, Reciprocity and the Generalized Bas-Relief Ambiguity
A set of images of a Lambertian surface under varying lighting directions defines its shape up to a three-parameter Generalized Bas-Relief (GBR) ambiguity. In this paper, we exami...
Ping Tan, Satya P. Mallick, Long Quan, David J. Kr...
APDC
1997
14 years 11 months ago
An Improved Parallel Algorithm for Delaunay Triangulation on Distributed Memory Parallel Computers
Delaunaytriangulationhas beenmuchusedin suchapplicationsas volumerendering, shape representation, terrain modeling and so on. The main disadvantage of Delaunay triangulationis lar...
Sangyoon Lee, Chan-Ik Park, Chan-Mo Park
SSD
2007
Springer
243views Database» more  SSD 2007»
15 years 4 months ago
Continuous Medoid Queries over Moving Objects
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
Stavros Papadopoulos, Dimitris Sacharidis, Kyriako...