Sciweavers

999 search results - page 52 / 200
» Finding shapes in a set of points
Sort
View
ALENEX
2004
107views Algorithms» more  ALENEX 2004»
15 years 3 months ago
Approximating the Visible Region of a Point on a Terrain
Given a terrain T and a point p on or above it, we wish to compute the region Rp that is visible from p. We present a generic radar-like algorithm for computing an approximation o...
Boaz Ben-Moshe, Paz Carmi, Matthew J. Katz
PAMI
1998
94views more  PAMI 1998»
15 years 1 months ago
Unconstrained Automatic Image Matching Using Multiresolutional Critical-Point Filters
—This paper proposes a novel method for matching images. The results can be used for a variety of applications: fully automatic morphing, object recognition, stereo photogrammetr...
Yoshihisa Shinagawa, Tosiyasu L. Kunii
SIGMOD
2000
ACM
173views Database» more  SIGMOD 2000»
15 years 5 months ago
Efficient Algorithms for Mining Outliers from Large Data Sets
In this paper, we propose a novel formulation for distance-based outliers that is based on the distance of a point from its kth nearest neighbor. We rank each point on the basis o...
Sridhar Ramaswamy, Rajeev Rastogi, Kyuseok Shim
ECCV
2010
Springer
15 years 2 months ago
Geodesic Shape Retrieval via Optimal Mass Transport
This paper presents a new method for 2-D and 3-D shape retrieval based on geodesic signatures. These signatures are high dimensional statistical distributions computed by extractin...
Julien Rabin, Gabriel Peyré, Laurent D. Coh...
COMGEO
2008
ACM
15 years 2 months ago
Recursive geometry of the flow complex and topology of the flow complex filtration
The flow complex is a geometric structure, similar to the Delaunay tessellation, to organize a set of (weighted) points in Rk. Flow shapes are topological spaces corresponding to ...
Kevin Buchin, Tamal K. Dey, Joachim Giesen, Matthi...