Results 221 to 230 of about 184,535 (247)

Blind Error-Free Detection of Transform-Domainwatermarks

2007 IEEE International Conference on Image Processing, 2007
In this paper we propose a new blind, error-free detection algorithm for watermarking in transform domains. The detection scheme uses linear decoding techniques from the theory of compressive sensing (CS), whose central idea is that a small number of non-adaptive linear projections of a sparse signal are sufficient for error-free reconstruction of the ...
Mona A. Sheikh, Richard G. Baraniuk
openaire   +1 more source

Error-free arithmetic for discrete wavelet transforms using algebraic integers

16th IEEE Symposium on Computer Arithmetic, 2003. Proceedings., 2004
A novel encoding scheme is introduced with applications to error-free computation of discrete wavelet transforms (DWT) based on Daubechies wavelets. The encoding scheme is based on an algebraic integer decomposition of the wavelet coefficients. This work is a continuation of our research into error-free computation of DCTs and IDCTs, and this extension
Khan A. Wahid, Vassil S. Dimitrov, Graham A. Jullien   +2 more
openaire   +1 more source

Error-Free Transformations in Real and Complex Floating Point Arithmetic

IEICE Proceeding Series, 2007
Error-free transformation is a concept that makes it possible to compute accurate results within a floating point arithmetic. Up to now, it has only be studied for real floating point arithmetic. In this short note, we recall the known error-free transformations for real arithmetic and we propose some new error-free transformations for complex floating
Graillat, Stef, Ménissier-Morain, Valérie   +1 more
openaire   +2 more sources

Error free transformations of floating point numbers and its applications to constructing efficient error free numerical algorithms

Proceedings of the 2009 conference on Symbolic numeric computation, 2009
We have proposed error free transformations for floating point numbers[1]-[3]. In the first place, this talk will briely survey this result. Then, the suthor will clarify that this new methodology is very usefull to make efficient error free numerical algorithms including error free fast computational geometric algorithms[4], [5].
openaire   +1 more source

Fast and Error-Free Negacyclic Integer Convolution Using Extended Fourier Transform

2021
With the rise of lattice cryptography, (negacyclic) convolution has received increased attention. E.g., the NTRU scheme internally employs cyclic polynomial multiplication, which is equivalent to the standard convolution, on the other hand, many Ring-LWE-based cryptosystems perform negacyclic polynomial multiplication.
openaire   +2 more sources

Accurate Floating Point Arithmetic through Hardware Error-Free Transformations

2011
This paper presents a hardware approach to performing accurate floating point addition and multiplication using the idea of error-free transformations. Specialized iterative algorithms are implemented for computing arbitrarily accurate sums and dot products.
Manouk V. Manoukian, George A. Constantinides   +1 more
openaire   +1 more source

Radiological image compression using error-free irreversible two-dimensional direct-cosine-transform coding techniques

Journal of the Optical Society of America A, 1987
Some error-free and irreversible two-dimensional direct-cosine-transform (2D-DCT) coding, image-compression techniques applied to radiological images are discussed in this paper. Run-length coding and Huffman coding are described, and examples are given for error-free image compression.
H K, Huang, S C, Lo, B K, Ho, S L, Lou
openaire   +2 more sources

“Error-free” calculation of the convolution using generalized Mersenne and Fermat transforms over algebraic fields

1997
A method of the calculation of a discrete convolution via number-theoretic transforms realized without multiplications is described. It is shown that the data representation over algebraic fields allows to generalize the known Mersennse and Fermat transforms onto a wider set of periods of transformed sequences.
Vladimir M. Chernov, Maria V. Pershina
openaire   +1 more source

Fast (Parallel) Dense Linear System Solvers in C-XSC Using Error Free Transformations and BLAS

2009
Existing selfverifying solvers for dense linear (interval-) systems in C-XSC provide high accuracy, but are rather slow. A new set of solvers is presented, which are a lot faster than the existing solvers, without losing too much accuracy. This is achieved through two main changes.
Walter Krämer, Michael Zimmer 0002
openaire   +1 more source

Memory Reduced Implementation of Error-Free Transformation of Matrix Multiplication and its Performance

IEICE Proceeding Series, 2014
Ozaki, Katsuhisa, Ogita, Takeshi, Oishi, Shin'ichi   +2 more
openaire   +1 more source