Sciweavers

16 search results - page 2 / 4
» Fast computation of geometric moments using a symmetric kern...
Sort
View
ICASSP
2011
IEEE
12 years 10 months ago
Fast orthogonal decomposition of Volterra cubic kernels using oblique unfolding
Discrete-time Volterra modeling is a central topic in many application areas and a large class of nonlinear systems can be modeled using high-order Volterra series. The problem wi...
Rémy Boyer, Roland Badeau, Gérard Fa...
CVPR
2004
IEEE
14 years 8 months ago
Bayesian Assembly of 3D Axially Symmetric Shapes from Fragments
We present a complete system for the purpose of automatically assembling 3D pots given 3D measurements of their fragments commonly called sherds. A Bayesian approach is formulated...
Andrew R. Willis, David B. Cooper
CG
2004
Springer
13 years 6 months ago
Point cloud surfaces using geometric proximity graphs
We present a new definition of an implicit surface over a noisy point cloud, based on the weighted least squares approach. It can be evaluated very fast, but artifacts are signifi...
Jan Klein, Gabriel Zachmann
COMPGEOM
2011
ACM
12 years 9 months ago
Comparing distributions and shapes using the kernel distance
Starting with a similarity function between objects, it is possible to define a distance metric (the kernel distance) on pairs of objects, and more generally on probability distr...
Sarang C. Joshi, Raj Varma Kommaraju, Jeff M. Phil...
ICIP
2003
IEEE
14 years 7 months ago
Fast indexing for image retrieval based on local appearance with re-ranking
This paper describes an approach to retrieve images containing specific objects, scenes or buildings. The image content is captured by a set of local features. More precisely, we ...
Hao Shao, Tomás Svoboda, Vittorio Ferrari, ...