Search result223 results

Construction of Low Complexity Regular Quantizers for Overcomplete Expansions in R^n
BeferullLozano, B.; Ortega, A.
(2001). ArticleWe study the construction of structured regular quantizers for overcomplete expansions in RN. Our goal is to design structured quantizers allowing simple reconstruction algorithms with low (memory and computational) complexity and having good performance in terms of accuracy. Most related work to date in quantized redundant expansions has assumed that uniform scalar quantization with the same stepsize was used on the redundant expansion and then has dealt with more complex methods to improve the reconstruction. Instead, we consider the design of scalar quantizers with different stepsizes for each coefficient of an overcomplete expansion in such a way as to produce an equivalent vector...
We study the construction of structured regular quantizers for overcomplete expansions in RN. Our goal is to design structured quantizers allowing simple reconstruction algorithms with low (memory and computational) complexity and having good performance in terms of accuracy. Most related work to date in quantized redundant expansions has assumed that uniform scalar quantization with the same stepsize was used on the redundant expansion and then has dealt with more complex methods to improve the reconstruction. Instead, we consider the design of scalar quantizers with different stepsizes for each coefficient of an overcomplete expansion in such a way as to produce an equivalent vector quantizer with periodic structure. The periodicity makes it possible to achieve good accuracy using simple reconstruction algorithms from the quantized coefficients of the overcomplete expansion.
Read more Hide 
LNCIS:An Architecture for Optimal Management of The Traffic Simulation Complexity in a Driving Simulator
Fernández, Marcos; Martín, Gregorio; Coma, Inmaculada; Bayarri, Salvador
(1999). ArticleArquitectura para gestión de tráfico en simuladores de conducción.

Coding Techniques for Oversampled Steerable Transforms
BeferullLozano, B.; Ortega, A.
(1999). ArticleIn this paper we study signal representation using oversampled steerable transforms. While in general it may not be efficient to use an oversampled representation for applications like compression, our work investigates efficient techniques for representing the oversampled data, given that after oversampling there exists substantial redundancy. We discuss different strategies which take advantage of this oversampling by establishing some consistency constraints on the representation that reduce uncertainty in the quantization. This results in a coding gain as we increase the oversampling in the steerable transform (number of orientations). Thus, while in general it will not be possible to...
In this paper we study signal representation using oversampled steerable transforms. While in general it may not be efficient to use an oversampled representation for applications like compression, our work investigates efficient techniques for representing the oversampled data, given that after oversampling there exists substantial redundancy. We discuss different strategies which take advantage of this oversampling by establishing some consistency constraints on the representation that reduce uncertainty in the quantization. This results in a coding gain as we increase the oversampling in the steerable transform (number of orientations). Thus, while in general it will not be possible to achieve as good compression performance as with a critically sampled transform, having a compressed steerable representation will be useful for applications where a feature is needed (many significant image features can be extracted from an orientation analysis), and where for performance reasons it is preferable not to have to decompress and analyze each image (as may be necessary if standard nonsteerable transforms are used for compression).
Read more Hide