Abstract:
An interactive photo system that provides an interesting and entertaining way to link photos from the digital and analog domains. The system enables easy conversion of a paper-based photo into digital form. The conversion process generally involves a user holding up a paper-based photo image in front of a camera of the system, such that the captured image is rendered in a specific location on a display screen. The system adjusts the captured image for orientation and illumination irregularities in creating a digital version of the paper-based photo. The system further includes a database of digital images and a content retrieval engine to which content from the just-converted digital image can be used as a search query to search the database for other similar digital photos.
Abstract:
Improved error resiliency of an encoding device, such as a video codec or encoder, operating in a compressed data transmission system, is achieved by enabling the encoding device to “shadow” or mimic the error conditions of a decoding device that receives and decodes compressed data sent by the encoding device. The encoding device is made aware of the specific error concealment scheme that the decoding device employs to reconstruct video frame data from a bit stream that contains bit or packet errors, and is also made aware of the location(s) in the frame to which the erroneous data corresponds and the particular manner in which the erroneous data was handled. The error-concealed data then can be used not only for the present encoding, but for subsequent encodings as well, to achieve synchronization between the encoder and decoder. Advantageously, the present invention improves on, but can work with, conventional error concealment schemes.
Abstract:
A method for reducing the memory requirements for decoding a bit stream is provided. The method initiates with receiving a video bit stream. Then, a frame of the bit stream is decoded into a transform domain representation. Next, non-zero coefficients of the transform domain representation are identified. Then, a hybrid data structure is assembled. The hybrid data structure includes a fixed size array and a variable size overflow vector. Next, the non-zero coefficients of the transform domain representation are inserted into the hybrid data structure. A computer readable media, a printed circuit board and a device configured to decode video data are also provided.
Abstract:
A prediction mode for encoding data is selected using a reduced number of rate-distortion cost computations. This reduction in rate-distortion cost computations is caused by filtering the number of potential intra prediction modes based on two criteria. First, the number of potential prediction modes is reduced based on at least one characteristic of a quantization procedure performed during the encoding procedure. Second, the number of potential prediction modes is reduced based on an error value calculated for each of the potential prediction modes.
Abstract:
An efficient compressed-domain-based algorithm that works by combining the IDCT and pixel-domain averaging into a single compressed domain operation, where a part of the cost of even this simplified operation can be absorbed into the de-quantization process. The original image need not be decompressed fully, only to the point of extracting the transform coefficients. Compressed-domain scaling for all scales k/8 for 1≦k≦8, including ⅜, ⅝, ¾, ⅞, is provided. By chaining multiple operations, any scale factors of the form k1k2 . . . kl/8l for integers ki's in the range [1,7] can be achieved.
Abstract translation:通过将IDCT和像素域平均组合成单个压缩域操作来工作的有效的基于压缩域的算法,其中甚至这种简化操作的成本的一部分可以被吸收到去量化过程中。 原始图像不需要完全解压缩,只能提取变换系数。 提供了1 <= k <= 8的所有尺度k / 8的压缩域缩放,包括3/8,5 / 8,¾,7/8。 通过链接多个操作,可以使用形式k <1> 2 2>的任何比例因子。 。 。 对于[1,7]范围内的整数k i i i,可以实现k 1/1/1/1。
Abstract:
Automatic defocusing of displayed multimedia information (e.g., video) on a client in a client-server system by monitoring dynamic display properties of the client provides more efficient use of resources in the system. In one embodiment, bandwidth is conserved by configuring the server with the capability of defocus select data being sent to the client based on the client's dynamic display properties. The defocused data can be sent at a lower bit-rate. In another embodiment, the client's decoder is configured to receive and process the monitoring information and make adjustments on the client side. In this situation, only viewable data is decoded accurately; other, obstructed data can be decoded at a lower accuracy.
Abstract:
A watermarking scheme for images which includes techniques for inserting and extracting fragile watermarks in the frequency domain and for determining whether an image so watermarked has been tampered with. Watermark insertion is accomplished by embedding the bits of a digital signature of a hash function of the image in the frequency coefficients of the image. Tamper detection is accomplished generally as follows: the fragile watermark which was embedded during the watermark insertion process is extracted from the image; the hash function of the image is computed as in the insertion process; it is verified using a public key whether the extracted watermark is a valid signature of the hash value. If so, then there is assurance that the image has not been tampered with. Otherwise, there is reason to conclude that the image has been tampered with.
Abstract:
This disclosure provides a method of block-based motion estimation used in video compression. The compression process, derives change data for a new frame of data (with respect to a reference frame) by first dividing the frame structure into data tiles (or data blocks) of identical size. Each tile in the new frame is compared to a localized window (about the tile's expected position) in the reference frame to search for a best fit, and thereby provide motion data for the particular tile. Once the best fit is determined, motion-compensated difference data is determined, and stored with the motion data for each tile to complete the process. To achieve computation efficiency, each tile under analysis is preferably converted to single-bit value data and searching and comparisons are performed based on such transformed single-bit data. The single-bit data is computed by convolving the original image data with a low-pass filter to obtain a threshold matrix. The original image data is then compared with the threshold matrix, and converted to single-bit values in dependence on whether the values of the data exceed counterparts in the threshold matrix. Comparison is performed using an exclusive-or function and bit-summation of results.
Abstract:
An inverse discrete cosine transform ("IDCT") implementation specifically for the decompression of JPEG, MPEG and Px64 encoded image and video data uses a preprocessing step embedded in a Huffman decoding process to classify data blocks prior to computing the IDCT. The use of data block classification, along with the use of pruned IDCTs appropriate for the specific block class, reduces the total number of multiply and addition operations necessary to decompress an encoded data block, and thereby allows faster data decompression. Synthesis of coefficients suitable for multiplication allows efficient implementation of the novel decompression technique in typical microprocessor architectures, including RISC processor architectures.
Abstract:
Techniques described in the disclosure are generally related to enhancing portions of an image relative to other portions of the image. The example techniques may utilize depth information in conjunction with one or more viewer perceivable information to enhance portions of the image relative to other portions. The techniques may then display the enhanced image to provide the viewer with a possibly more realistic image.