Sciweavers

564 search results - page 26 / 113
» Linear Time Algorithms for Exact Distance Transform
Sort
View
ESANN
2006
13 years 9 months ago
OnlineDoubleMaxMinOver: a simple approximate time and information efficient online Support Vector Classification method
Abstract. We present the OnlineDoubleMaxMinOver approach to obtain the Support Vectors in two class classification problems. With its linear time complexity and linear convergence ...
Daniel Schneegaß, Thomas Martinetz, Michael ...
ESA
2000
Springer
112views Algorithms» more  ESA 2000»
13 years 11 months ago
Resource Constrained Shortest Paths
The resource constrained shortest path problem (CSP) asks for the computation of a least cost path obeying a set of resource constraints. The problem is NP-complete. We give theore...
Kurt Mehlhorn, Mark Ziegelmann
ICIP
2007
IEEE
13 years 9 months ago
Motion Estimation using Tangent Distance
In this paper, we present a method based on tangent distance to estimate motion in image sequences. Tangent distance combines an intuitive understanding and effective modeling of ...
Jonathan Fabrizio, Séverine Dubuisson
ESANN
2004
13 years 9 months ago
Robust overcomplete matrix recovery for sparse sources using a generalized Hough transform
We propose an algorithm for recovering the matrix A in X = AS where X is a random vector of lower dimension than S. S is assumed to be sparse in the sense that S has less nonzero e...
Fabian J. Theis, Pando G. Georgiev, Andrzej Cichoc...
TASLP
2008
133views more  TASLP 2008»
13 years 7 months ago
Adaptive System Identification in the Short-Time Fourier Transform Domain Using Cross-Multiplicative Transfer Function Approxima
In this paper, we introduce cross-multiplicative transfer function (CMTF) approximation for modeling linear systems in the short-time Fourier transform (STFT) domain. We assume tha...
Yekutiel Avargel, Israel Cohen