Abstract: Systems and methods for compressive sense imaging are provided. In one aspect, a system and method is provided for determining at least one kernel matrix based on the relative motion of an object during a time period corresponding to the acquisition of one or more compressive measurements of the object. An uncompressed image of the object is generated using the compressive measurements using a reconstruction basis matrix that is different from the compressive basis matrix used to acquire the compressive measurements of the object. To compensate for the relative motion of the object, the reconstruction basis matrix is determined based on the at least one kernel matrix and the compressive basis matrix.

Abstract: Systems and methods for compressive sense imaging are provided. In one aspect, a system and method is provided for determining at least one kernel matrix based on the relative motion of an object during a time period corresponding to the acquisition of one or more compressive measurements of the object. An uncompressed image of the object is generated using the compressive measurements using a reconstruction basis matrix that is different from the compressive basis matrix used to acquire the compressive measurements of the object. To compensate for the relative motion of the object, the reconstruction basis matrix is determined based on the at least one kernel matrix and the compressive basis matrix.

Abstract: Systems and methods for compressive sense imaging are provided. In one aspect, incident light reflecting from an object is received via an aperture array and a sensor and intermediate compressive measurements are generated using compressive sequence matrices that are determined based on the properties of the aperture array and the sensor. The intermediate compressive measurements are further processed to generate compressive measurements representing the compressed image of the object. An uncompressed image of the object is generated from the compressive measurements using a determined reconstruction matrix that is different from the sequence matrices used to acquire the intermediate compressive measurements.

Abstract: Providing a fast channel change function in a digital television system by processing compressed video streams to provide high priority (HP) and low priority (LP) encoded streams, which streams may also be hierarchically modulated to provide, respectively, long interleave and short interleave modulated signals for transmission, wherein a receiver may rapidly demodulate and use information within the low priority signal of a new channel to more rapidly change to the new channel.

Abstract: Providing a fast channel change function in a digital television system by hierarchically modulating each channel to provide both high priority (long interleave) and low priority (short interleave) signals, wherein a receiver may rapidly demodulate and use information within the low priority signal of a new channel to more rapidly change to the new channel.

Abstract: Providing a fast channel change function in a digital television system by hierarchically modulating each channel to provide both high priority (long interleave) and low priority (short interleave) signals, wherein a receiver may rapidly demodulate and use information within the low priority signal of a new channel to more rapidly change to the new channel.

Abstract: A method is disclosed for decoding multiple-coded symbols from a coded input symbol stream in a single clock cycle. The method constructs an original Huffman look-up table by extending the associated Huffman tree to decode multiple symbols in one clock cycle in a first embodiment and decodes multiple DCT coefficient symbols in an alternate embodiment. An advantage of the method is that the depth of the new Huffman tree is adjustable thereby making the method easily adaptable to various hardware architectures. A further advantage of the present invention is that the decoding process speed is significantly increased while the size of the lookup table is nominally increased.

Abstract: A method is disclosed for decoding multiple-coded symbols from a coded input symbol stream in a single clock cycle. The method constructs an original Huffman look-up table by extending the associated Huffman tree to decode multiple symbols in one clock cycle in a first embodiment and decodes multiple DCT coefficient symbols in an alternate embodiment. An advantage of the method is that the depth of the new Huffman tree is adjustable thereby making the method easily adaptable to various hardware architectures. A further advantage of the present invention is that the decoding process speed is significantly increased while the size of the look-up table is nominally increased.

Abstract: A method of encoding a video sequence including a sequence of video images includes comparing elements of a portion of a first video image with elements of a portion of a second video image to generate respective intensity difference values for the element comparisons. Then, a first value is assigned to the intensity difference values that are at least above a visually perceptible threshold value and a second value is assigned to the intensity difference values that are not at least above the visually perceptible threshold value. Next, the method includes dividing the portion of the first video image into sub-portions and summing the first and second values associated with each corresponding sub-portion to generate respective sums. If a respective sum is at least greater than a decision value, a variable associated with that sub-portion is set to a first value. If a respective sum is not at least greater than the decision value, the variable associated with that sub-portion is set to a second value.