A data compression scheme that exploits locality of reference, such as occurs when words are used frequently over short intervals and then fall into long periods of disuse, is described. The scheme is based on a simple heuristic for self-organizing sequential search and on variable-length encodings of integers. We prove that it never performs much worse than Huffman coding and can perform subst...

This paper introduces a new structure for stack lter-ing, where the lter adapts to the local characteristics encountered in data. Both supervised and unsupervised techniques for optimal design are investigated. We split the image into small regions and select the stack lter to process each region according to the spatial domain or threshold level domain characteristics of the input signal. This...

The topic of Doppler and Bearing Tracking (DBT) problem is to achieve a target trajectory using the Doppler and Bearing measurements. The difficulty of DBT problem comes from the nonlinearity terms exposed in the measurement equations. Several techniques were studied to deal with this topic, such as the unscented Kalman filter. Nevertheless, the performance of the filter depends directly on the...

Incremental learning of sensorimotor transformations in high dimensional spaces is one of the basic prerequisites for the success of autonomous robot devices as well as biological movement systems. So far, due to sparsity of data in high dimensional spaces, learning in such settings requires a significant amount of prior knowledge about the learning task, usually provided by a human expert. In ...

Current schemes for texture compression fail to exploit spatial coherence in an adaptive manner due to the strict efficiency constraints imposed by GPU-based, fragment-level decompression. In this paper we present a texture compression framework for quasi-lossless, locally-adaptive compression of graphics data. Key elements include a Hilbert scan to maximize spatial coherence, efficient encodin...

The OFDM-based MC-CDMA/FDMA transmission scheme is candidate for the air-interface of beyond 3G mobile communications. An efficient adaptive subband allocation (ASBA) approach has been recently shown to provide a considerable gain in the uncoded system performance. In this paper, adaptive coding is proposed for application in conjunction with ASBA. This is proved to yield a significant performa...

In this paper, a non-linear mixture-of-subspaces model is proposed to describe images. Images or image patches, when translated, rotated or scaled, lie in low-dimensional subspaces of the high-dimensional space spanned by the grey values. These manifolds can locally be approximated by a linear subspace. The adaptive subspace map is a method to learn such a mixture-of-subspaces from the data. Du...

Image and audio data are examples of domains in which DPCM (Diierential Pulse Coded Modulation) is an eeective method for removing much of the linear correlation between data samples. However, most simple DPCM schemes cannot simultaneously cater for smooth signals, noisy signals, and discontinuities such as edges in images. To overcome this, many adaptive DPCM schemes have been proposed, includ...

Combinatorial auctions, where bidders are allowed to submit bids for bundles of items, are preferred to single-item auctions when bidders have complementarities and substitutabilities among items and therefore achieve better social efficiency. A large unexplored area of research is the design of bidding strategies. In this paper, we propose a new adaptive bidding strategy for combinatorial auct...

This work is focused on the computational complexity (CC) reduction of locally-adaptive processing 3D tensor images, based recursive approaches. As a basis, local averaging operation used, implemented as sliding mean filter (SM3DF) with central symmetric kernel. Symmetry plays very important role in constructing working window. The presented theoretical approach could be adopted various algorit...