Sciweavers

1439 search results - page 57 / 288
» Fast approximation of centrality
Sort
View
88
Voted
ICIP
2005
IEEE
16 years 2 months ago
Approximate separable 3D anisotropic Gauss filter
Anisotropic Gaussian filters are useful for adaptive smoothing and feature extraction. In our application, micro - tomographic images of fibers were smoothed by anisotropic Gaussi...
Oliver Wirjadi, Thomas M. Breuel
138
Voted
ISBI
2004
IEEE
16 years 1 months ago
Multi-Modal Non-Rigid Registration Using a Stochastic Gradient Approximation
We present a new fast implementation of a non-rigid registration algorithm, based on a finite element elastic deformation model using the mutual information metric with a linear e...
Aloys du Bois d'Aische, Benoît Macq, Florian...
104
Voted
ICASSP
2008
IEEE
15 years 7 months ago
Identification of linear systems with adaptive control of the cross-multiplicative transfer function approximation
In this paper, we extend the cross-multiplicative transfer function (CMTF) approach for improved system identification in the shorttime Fourier transform (STFT) domain. The propo...
Yekutiel Avargel, Israel Cohen
PPAM
2007
Springer
15 years 6 months ago
A Parallel Approximation Algorithm for the Weighted Maximum Matching Problem
Abstract. We consider the problem of computing a weighted edge matching in a large graph using a parallel algorithm. This problem has application in several areas of combinatorial ...
Fredrik Manne, Rob H. Bisseling
VMV
2003
154views Visualization» more  VMV 2003»
15 years 2 months ago
Piecewise Linear Approximation of Signed Distance Fields
The signed distance field of a surface can effectively support many geometry processing tasks such as decimation, smoothing, and Boolean operations since it provides efficient a...
Jianhua Wu, Leif Kobbelt