Motion‐Compensated Transform Coding

Interframe Hybrid Transform/dpcm Coders Encode Television Signals by Taking a Spatial Transform of a Block of Picture Elements in a Frame and Predictively Coding the Resulting Coefficients using the Corresponding Coefficients of the Spatial Block at the Same Location in the Previous Frame. These Coders Can Be Made More Efficient for Scenes Containing Objects in Translational Motion by First Estimating the Translational Displacement of Objects and Then using Coefficients of a Spatially Displaced Block in the Previous Frame for Prediction. This Paper Presents Simulation Results for Such Motion‐compensated Transform Coders using Two Algorithms for Estimating Displacements. the First Algorithm, Which is Developed in a Companion Paper, Recursively Estimates the Displacements from the Previously Transmitted Transform Coefficients, Thereby Eliminating the Need to Transmit the Displacement Estimates. the Second Algorithm, Due to Limb and Murphy, Estimates Displacements by Taking Ratios of Accumulated Frame Difference and Spatial Difference Signals in a Block. in This Scheme, the Displacement Estimates Are Transmitted to the Receiver. Computer Simulations on Two Typical Real‐life Sequences of Frames Show that Motion‐compensated Coefficient Prediction Results in Coder Bit Rates that Are 20 to 40 Percent Lower Than Conventional Interframe Transform Coders using Frame Difference of Coefficients. Comparisons of Bit Rates for Approximately the Same Picture Quality Show that the Two Methods of Displacement Estimation Are Quite Similar in Performance with a Slight Preference for the Scheme with Recursive Displacement Estimation. © 1979 the Bell System Technical Journa

Vector Quantization Video Encoder Using Hierarchical Cache Memory Scheme

A system compresses image blocks via successive hierarchical stages and motion encoders which employ caches updated by stack replacement algorithms. Initially, a background detector compares the present image block with a corresponding previously encoded image block and if similar, the background detector terminates the encoding procedure by setting a flag bit. Otherwise, the image block is decomposed into smaller present image subblocks. The smaller present image subblocks are each compared with a corresponding previously encoded image subblock of comparable size within the present image block. When a present image subblock is similar to a corresponding previously encoded image subblock, then the procedure is terminated by setting a flag bit. Alternatively, the present image subblock is forwarded to a motion encoder where it is compared with displaced image subblocks, which are formed by displacing previously encoded image subblocks by motion vectors that are stored in a cache, to derive a first distortion vector. When the first distortion vector is below a first threshold TM, the procedure is terminated and the present image subblock is encoded by setting flag bit and a cache index corresponding to the first distortion vector. Alternatively, the present image subblock is passed to a block matching encoder where it is compared with other previously encoded image subblocks to derive a second distortion vector. When the second distortion vector is below a second threshold Tm, the procedure is terminated by setting a flag bit, by generating the second distortion vector, and by updating the cache.Georgia Tech Research Corporatio

Mesh-based video coding for low bit-rate communications

In this paper, a new method for low bit-rate content-adaptive mesh-based video coding is proposed. Intra-frame coding of this method employs feature map extraction for node distribution at specific threshold levels to achieve higher density placement of initial nodes for regions that contain high frequency features and conversely sparse placement of initial nodes for smooth regions. Insignificant nodes are largely removed using a subsequent node elimination scheme. The Hilbert scan is then applied before quantization and entropy coding to reduce amount of transmitted information. For moving images, both node position and color parameters of only a subset of nodes may change from frame to frame. It is sufficient to transmit only these changed parameters. The proposed method is well-suited for video coding at very low bit rates, as processing results demonstrate that it provides good subjective and objective image quality at a lower number of required bits

Complete experimental toolbox for alignment-free quantum communication

Quantum communication employs the counter-intuitive features of quantum physics to perform tasks that are im- possible in the classical world. It is crucial for testing the foundations of quantum theory and promises to rev- olutionize our information and communication technolo- gies. However, for two or more parties to execute even the simplest quantum transmission, they must establish, and maintain, a shared reference frame. This introduces a considerable overhead in communication resources, par- ticularly if the parties are in motion or rotating relative to each other. We experimentally demonstrate how to circumvent this problem with the efficient transmission of quantum information encoded in rotationally invariant states of single photons. By developing a complete toolbox for the efficient encoding and decoding of quantum infor- mation in such photonic qubits, we demonstrate the fea- sibility of alignment-free quantum key-distribution, and perform a proof-of-principle alignment-free entanglement distribution and violation of a Bell inequality. Our scheme should find applications in fundamental tests of quantum mechanics and satellite-based quantum communication.Comment: Main manuscript: 7 pages, 3 figures; Supplementary Information: 7 pages, 3 figure

Visual Learning In The Perception Of Texture: Simple And Contingent Aftereffects Of Texture Density

Novel results elucidating the magnitude, binocularity and retinotopicity of aftereffects of visual texture density adaptation are reported as is a new contingent aftereffect of texture density which suggests that the perception of visual texture density is quite malleable. Texture aftereffects contingent upon orientation, color and temporal sequence are discussed. A fourth effect is demonstrated in which auditory contingencies are shown to produce a different kind of visual distortion. The merits and limitations of error-correction and classical conditioning theories of contingent adaptation are reviewed. It is argued that a third kind of theory which emphasizes coding efficiency and informational considerations merits close attention. It is proposed that malleability in the registration of texture information can be understood as part of the functional adaptability of perception

Low-Complexity Context-Based Motion Compensation for VLBR Video Encoding

A significant improvement of block-based motion estimation strategies is presented, which provides fast computation and very low bitrate coding. For each block, a spatio-temporal context is defined based on nearest neighbors in the current and previous frames, and a prediction list is built. Then, the best matching vector within the list is chosen as an estimation of the block motion. Since coder and decoder are synchronous, only the index of the selected vector is needed at the decoder to reconstruct the motion field. To avoid the propagation of the error, an additional correction vector can be sent when prediction error exceeds a threshold. Furthermore, bitrate saving is achieved through an adaptive sorting of the prediction list of each block, which allows to reduce the entropy of the motion indexes. Tests demonstrate that the proposed method ensures a speed up over 1:200 as compared to full search, and a coding gain above 2, with a negligible loss of accuracy. This allows real-time implementation of VLBR software video coders on conventional PC platforms