Sciweavers

10608 search results - page 684 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
ICIP
2003
IEEE
16 years 9 months ago
Spread transform watermarking for video sources
Spread Transform (ST) is a quantization watermarking algorithm in which vectors of the wavelet coefficients of a host work are quantized, using one of two dithered quantizers, to ...
John Earl, Nick G. Kingsbury
ICIP
2001
IEEE
16 years 9 months ago
Segmentation-based spatially adaptive motion blur removal and its application to surveillance systems
Various image restoration methods have been studied for removing space-variant motion blur such as iterative and POCS method. However, their computational complexity of the method...
SangKyu Kang, Jihong Min, Joon Ki Paik
ICPR
2006
IEEE
16 years 8 months ago
Robust Image Registration Based on Markov-Gibbs Appearance Model
A new approach to align an image of a textured object with a given prototype is proposed. Visual appearance of the images, after equalizing their signals, is modeled with a Markov...
Alaa E. Abdel-Hakim, Aly A. Farag, Ayman El-Baz, G...
ICPR
2000
IEEE
16 years 8 months ago
Stereo Analysis Using Individual Evolution Strategy
This paper presents an individual evolutionary strategy devised for image analysis applications. The example problem chosen is obstacle detection using a pair of cameras. The algo...
Jean Louchet
STOC
2002
ACM
107views Algorithms» more  STOC 2002»
16 years 7 months ago
Quantum lower bound for the collision problem
The collision problem is to decide whether a function X : {1, . . . , n} {1, . . . , n} is one-to-one or two-to-one, given that one of these is the case. We show a lower bound of...
Scott Aaronson