The space-time distortion perceived subjectively during saccadic eye movements is an associative phenomenon of a transient shift of observer’s visual frame of reference from one position to another. Here we report that the lines of subjective simultaneity defined as two spatially separated flashes perceived during saccades were nearly uniformly tilted along the physical time-course. The causali...

Our ability to explore our surroundings requires a combination of high-resolution vision and frequent rotations of the visual axis toward objects of interest. Such gaze shifts are themselves a source of powerful retinal stimulation, and so the visual system appears to have evolved mechanisms to maintain perceptual stability during movements of the eyes in space. The mechanisms underlying this p...

In fractal image compression the encoding step is computationally expensive. A large number of sequential searches through a list of domains (portions of the image) are carried out while trying to find best matches for other image portions called ranges. Our theory developed here shows that this basic procedure of fractal image compression is equivalent to multi-dimensional nearest neighbor sea...

Two compression algorithms for the image sequences generated by pulsed-transient thermography for non-destructive testing were developed. The first algorithm allows to balance the quality of the original measurement data reproduction against the compression ratio. This algorithm comprises a dedicated space/time mapping (STM) method and an image compression algorithm (JPEG2000). The second algor...

We use the tensor product theory to formulate a closed-form algorithm for converting Hilbert space-filling curve indices of individual points. A twodimensional Hilbert space-filling curve is specified as a permutation which rearranges two-dimensional 2n×2n data elements stored in the row-major order as in C language or the column-major order as in FORTRAN language to the order of traversing a t...

In this paper, using the tight-binding model, we extend the real-space renormalization group method to time-dependent Hamiltonians. We drive the time-dependent recursion relations for the renormalized tight-binding Hamiltonian by decimating selective sites of lattice iteratively. The formalism is then used for the calculation of the local density of electronic states for a one dimensional quant...

Minimum redundancy coding (also known as Huffman coding) is one of the enduring techniques of data compression. Many efforts have been made to improve the efficiency of minimum redundancy coding, the majority based on the use of improved representations for explicit Huffman trees. In this paper, we examine how minimum redundancy coding can be implemented efficiently by divorcing coding from a c...

Best basis searc hing algorithm based on binary in general M ary segmentation was constructed by Coifman and Wickerhauser and widely used for signal processing How ever there are several problems with the binary scheme First the binary segmentation is in exible in group ing signals along the axis Secondly the binary based segmentation method is very sensitiv e to time space shifts of the origin...

In this paper, we propose a compression scheme for animated semi-regular meshes. This scheme includes a spatio-temporal wavelet filtering to exploit the coherence both in time and space. In order to optimize the quantization of both spatial and temporal wavelet coefficients, the proposed compression scheme also includes a model-based bit allocation. The experimental results show that this appro...

Most data-intensive applications are confronted with the problems of I/O bottleneck, poor query processing times and space requirements. Database compression alleviates this bottleneck, reduces disk space usage, improves disk access speed, speeds up query response time, reduces overall retrieval time and increases the effective I/O bandwidth. However, random access to individual tuples in a com...