Sciweavers

916 search results - page 75 / 184
» Using redundancies to find errors
Sort
View
TIM
2010
108views Education» more  TIM 2010»
14 years 4 months ago
Reversible Watermarking by Modulation and Security Enhancement
This paper presents a watermarking algorithm that is suitable for the data represented in floating- or fixed-point numbers. By keeping the modulation information, every value in th...
Hao-Tian Wu, Yiu-ming Cheung
ICASSP
2011
IEEE
14 years 1 months ago
Quantization with an adjustable codeword length penalty
Quantizers are generally designed either for fixed-rate coding or variable-rate coding. Under common conditions, variable-rate quantization leads to the same mean distortion for ...
W. Bastiaan Kleijn, Moo Young Kim
ICRA
2002
IEEE
132views Robotics» more  ICRA 2002»
15 years 2 months ago
Visually Built Task Models for Robot Teams in Unstructured Environments
In field environments it is not usually possible to provide robotic systems with valid geometric models of the task and environment. The robot or robot teams will need to create t...
Vivek A. Sujan, Steven Dubowsky
AAAI
2010
14 years 11 months ago
Representation Discovery in Sequential Decision Making
Automatically constructing novel representations of tasks from analysis of state spaces is a longstanding fundamental challenge in AI. I review recent progress on this problem for...
Sridhar Mahadevan
TSP
2008
124views more  TSP 2008»
14 years 9 months ago
Dictionary Preconditioning for Greedy Algorithms
This article introduces the concept of sensing dictionaries. It presents an alteration of greedy algorithms like thresholding or (Orthogonal) Matching Pursuit which improves their...
Karin Schnass, Pierre Vandergheynst