The sensory cortex has been interpreted as coding information rather than stimulus properties since Sokolov in 1960 showed increased response to an unexpected stimulus decrement. The motor cortex is also organized aro...
详细信息
The sensory cortex has been interpreted as coding information rather than stimulus properties since Sokolov in 1960 showed increased response to an unexpected stimulus decrement. The motor cortex is also organized around expectation, coding the goal of an act rather than a set of muscle movements. Expectation drives not only immediate responses but also the very structure of the cortex, as demonstrated by development of receptive fields that mirror the structure of the visual world.
This paper surveys recent trends and perspectives in distributed video coding. More specifically, the status and potential benefits of distributed video coding in terms of coding efficiency, complexity, error resilien...
详细信息
This paper surveys recent trends and perspectives in distributed video coding. More specifically, the status and potential benefits of distributed video coding in terms of coding efficiency, complexity, error resilience, and scalability are reviewed. Multiview video and applications beyond coding are also considered. In addition, recent contributions in these areas, more thoroughly explored in the papers of the present special issue, are also described. Copyright (C) 2009 Frederic Dufaux et al.
We say a subset C subset of & nbsp;& nbsp;{1, 2, ..., k}(n) is a k-hash code (also called k-separated) if for every subset of k codewords from C, there exists a coordinate where all these codewords have distin...
详细信息
We say a subset C subset of & nbsp;& nbsp;{1, 2, ..., k}(n) is a k-hash code (also called k-separated) if for every subset of k codewords from C, there exists a coordinate where all these codewords have distinct values. Understanding the largest possible rate (in bits), defined as (log(2) |C|)/n, of a k-hash code is a classical problem. It arises in two equivalent contexts: (i) the smallest size possible for a perfect hash family that maps a universe of N elements into {1, 2, ..., k}, and (ii) the zero-error capacity for decoding with lists of size less than k for a certain combinatorial channel.& nbsp;A general upper bound of k!/k(k-1) on the rate of a k-hash code (in the limit of large n) was obtained by Fredman and Komlos in 1984 for any k >=& nbsp;4. While better bounds have been obtained for k = 4, their original bound has remained the best known for each k >=& nbsp;5. In this work, we present a method to obtain the first improvement to the Fredman-Komlos bound for every k >=& nbsp;5. (C)& nbsp;2021 Elsevier Inc. All rights reserved.
Energy-efficient and reliable channels are provided for on-chip interconnection networks (OCINs) using a self-calibrated voltage scaling technique with self-corrected green (SCG) coding scheme. This self-calibrated lo...
详细信息
Energy-efficient and reliable channels are provided for on-chip interconnection networks (OCINs) using a self-calibrated voltage scaling technique with self-corrected green (SCG) coding scheme. This self-calibrated low-power coding and voltage scaling technique increases reliability and reduces energy consumption simultaneously. The SCG coding is a joint bus and error correction coding scheme that provides a reliable mechanism for channels. In addition, it achieves a significant reduction in energy consumption via a joint triplication bus power model for crosstalk avoidance. Based on SCG coding scheme, the proposed self-calibrated voltage scaling technique adjusts voltage swing for energy reduction. Furthermore, this technique tolerates timing variations. Based on UMC 65 nm CMOS technology, the proposed channels reduces energy consumption by nearly 28.3% compared with that for uncoded channels at the lowest voltage. This approach makes the channels of OCINs tolerant of transient malfunctions and realizes energy efficiency.
Fault-tolerant quantum computation with quantum error-correcting codes has been considerably developed over the past decade. However, there are still difficult issues, particularly on the resource requirement. For fur...
详细信息
Fault-tolerant quantum computation with quantum error-correcting codes has been considerably developed over the past decade. However, there are still difficult issues, particularly on the resource requirement. For further improvement of fault-tolerant quantum computation, here we propose a soft-decision decoder for quantum error correction and detection by teleportation. This decoder can achieve almost optimal performance for the depolarizing channel. Applying this decoder to Knill's C-4/C-6 scheme for fault-tolerant quantum computation, which is one of the best schemes so far and relies heavily on error correction and detection by teleportation, we dramatically improve its performance. This leads to substantial reduction of resources.
Mukerjee and Wu（2001） employed projective geometry theory to find the wordlength pattern of a regular mixed factorial design in terms of its complementary set, but only for the numbers of words of length 3 or 4. In ...
详细信息
Mukerjee and Wu（2001） employed projective geometry theory to find the wordlength pattern of a regular mixed factorial design in terms of its complementary set, but only for the numbers of words of length 3 or 4. In this paper, by introducing a concept of consulting design and based on the connection between factorial design theory and coding theory, we obtain some combinatorial identities that relate the wordlength pattern of a regular mixed-level （2^r）2^n factorial design to that of its consulting design. Consequently, a general rule for identifying minimum aberration （2^r）2^n factorial designs through their consulting designs is established. It is an improvement and generalization of the related result in Mukerjee and Wu（2001）.
In order to utilize digital images effectively, specific techniques are needed to reduce the number of bits required for their representation. This Tutorial Text provides the groundwork for understanding these image c...
详细信息
ISBN:
(数字)9780819478528
ISBN:
(纸本)9780819406484
In order to utilize digital images effectively, specific techniques are needed to reduce the number of bits required for their representation. This Tutorial Text provides the groundwork for understanding these image compression tecniques and presents a number of different schemes that have proven useful. The algorithms discussed in this book are concerned mainly with the compression of still-frame, continuous-tone, monochrome and color images, but some of the techniques, such as arithmetic coding, have found widespread use in the compression of bilevel images. Both lossless (bit-preserving) and lossy techniques are considered. A detailed description of the compression algorithm proposed as the world standard (the JPEG baseline algorithm) is provided. The book contains approximately 30 pages of reconstructed and error images illustrating the effect of each compression technique on a consistent image set, thus allowing for a direct comparison of bit rates and reconstucted image quality. For each algorithm, issues such as quality vs. bit rate, implementation complexity, and susceptibility to channel errors are ***, in its many forms, is a valuable commodity in today's society, and the amount of information is increasing at a phenomenal rate. As a result, the ability to store, access, and transmit information in an efficient manner has become crucial. This is particularly true in the case of digital images. A large number of bits is typically required to represent even a single digital image, and with the rapid advances in sensor technology and digital electronics, this number grows larger with each new generation of products. Furthermore, the number of digital images created each day increases as more applications are found.
In order to utilize digital images effectively, specific techniques are needed to reduce the number of bits required for their representation. The branch of digital image processing that deals with this problem is called image c
In Augmented Reality applications, the human perception is enhanced with computer-generated graphics. These graphics must be exactly registered to real objects in the scene and this requires an effective Augmented Rea...
详细信息
In Augmented Reality applications, the human perception is enhanced with computer-generated graphics. These graphics must be exactly registered to real objects in the scene and this requires an effective Augmented Reality system to track the user's viewpoint. In this paper, a robust tracking algorithm based on coded fiducials is presented. Square targets are identified and pose parameters are computed using a hybrid approach based on a direct method combined with the Kalman filter. An important factor for providing a robust Augmented Reality system is the correct handling of targets occlusions by real scene elements. To overcome tracking failure due to occlusions, we extend our method using an optical flow approach to track visible points and maintain virtual graphics overlaying when targets are not identified. Our proposed real-time algorithm is tested with different camera viewpoints under various image conditions and shows to be accurate and robust.
Dynamics of coded information over Bloch channels is investigated. We show that the coded information is sent with high accuracy over the Bloch channel by increasing the absolute equilibrium value of the information c...
详细信息
Dynamics of coded information over Bloch channels is investigated. We show that the coded information is sent with high accuracy over the Bloch channel by increasing the absolute equilibrium value of the information carrier or decreasing the ratio of relaxation time. The robustness of coded information in maximum and partial entangled states is discussed. It is shown that, the maximum entangled states are more robust than the partial entangled state over these types of channels. The dynamics of the local and the non-local information is investigated for different values of the channel's parameters and the initial state setting. It is found that by increasing the absolute equilibrium values for both qubits, the local information of both qubits decreases faster and consequently the information gained by the eavesdropper increases.
Differential-I/O configurations can substantially reduce power and groundnoise internal to an IC (references 1 and 2). The resulting circuits require fewer power and groundpins than might otherwise be necessary. Unfor...
详细信息
Differential-I/O configurations can substantially reduce power and groundnoise internal to an IC (references 1 and 2). The resulting circuits require fewer power and groundpins than might otherwise be necessary. Unfortunately, differential signaling doubles the number ofI/O drivers, BGA balls, and pc-board interconnects. Specialized data codes can reduce power andground noise without doubling the number of interconnects. A data code judiciously assigns to eachM-bit binary word a unique binary pattern (a code word) that it selects from a larger field of N-bitpo,ssibilities,.in which N is greater than M. Each individual code word has a weight, w, whichequals the number of ones in that word. For an N-bit word, the possible weights range from zero toN.
暂无评论