Sciweavers

1693 search results - page 50 / 339
» fast 2008
Sort
View
ICIP
2008
IEEE
14 years 10 months ago
The path assigned mean shift algorithm: A new fast mean shift implementation for colour image segmentation
This paper presents a novel method for colour image segmentation derived from the mean shift theorem. When applied to colour image segmentation tasks, the path assigned mean
Akash Pooransingh, Cathy-Ann Radix, Anil C. Kokara...
ICIP
2008
IEEE
14 years 3 months ago
Fast fluid extensions for image registration algorithms
The present paper shows a sytematic way to derive fluid-like registration equations. The novel technique is demonstrated for the case of optical flow-based and diffusion-based r...
Jens-Peer Kuska, Patrick Scheibe, Ulf-Dietrich Bra...
AAECC
2008
Springer
83views Algorithms» more  AAECC 2008»
13 years 9 months ago
Fast separable factorization and applications
Abstract. In this paper we show that the separable decomposition of a univariate polynomial can be computed in softly optimal time, in terms of the number of arithmetic operations ...
Grégoire Lecerf
COLING
2002
13 years 8 months ago
A Cheap and Fast Way to Build Useful Translation Lexicons
The paper presents a statistical approach to automatic building of translation lexicons from parallel corpora. We briefly describe the pre-processing steps, a baseline iterative m...
Dan Tufis
INTEGRATION
2007
69views more  INTEGRATION 2007»
13 years 8 months ago
A fast algorithm for rectilinear block packing based on selected sequence-pair
In this paper, we present a method of rectilinear block packing using selected sequence-pair (SSP), a rectangle packing representation. We also propose a fast algorithm to obtain ...
Kunihiro Fujiyoshi, Chikaaki Kodama, Akira Ikeda