Abstract: A method is proposed for converting an image in which each pixel takes one of two binary values, into an image in which each pixel can take continuous values. The method is iterative and works in the space domain. For each pixel, a neighborhood of the image is defined containing that pixel and other pixels. In a first iteration, the method obtains a continuous value for each pixel as a weighted sum of the binary values of the pixels in its neighborhood. In further iterations, the method obtains a continuous value for each pixel as a weighted sum of the values of the pixels in its neighborhood at the previous iteration.

Abstract: A framework is provided for reducing the number of locations modified when hiding data, such as a digital watermark, in binary data. The framework complements data hiding techniques, such as digital watermarking techniques. After determining potential embedding locations according to an underlying technique, a data structure is created with values associated with those locations. A parity calculation is performed on the values in the data structure. The calculated parity is compared with hidden data to determine locations for modifications. Manipulations are then performed to reduce the total number of modifications needed to represent the hidden data. Modifications are made to the binary data according to the underlying technique. During decoding of the hidden data, the same locations can be determined, the same data structure can be created with the modified values, and a parity calculation is then performed to decode the hidden data.

Abstract: Gain Saturation (GS) for MRFME is where searching in more previous frames offers very limited or even no performance gain. Similarly, gain aggregation (GA) is where significant gain can be obtained by searching more frames. By dynamically determining, while encoding, if either condition applies, and changing the search range accordingly, complexity is reduced and speed can be increased.

Abstract: Motion estimation (ME) optimizations are provided for video encoding and compression processes that efficiently share data processing between host and graphics processing models. The optimizations take into account block level dependencies introduced by a corresponding encoding model, such as dependencies introduced by H.264/AVC among adjacent blocks. Arithmetic intensity of the graphics processing is adjustable to the underlying graphics hardware for further optimization, resulting in improved, real-time encoding of video data.

Abstract: A system and methodology for encoding or decoding hidden data, such as a digital watermark, in raster media is provided in delta domain, a domain that creates a high-pass version of the raster media. Hidden data, such as a watermark, can be embedded in the general smooth region (low variance region) while a strong edge is preserved. A Mean-Square Error (MSE) reduction can be obtained by embedding the watermark in the delta domain. Using checkerboard-pattern watermark sequences and the delta domain, at least half of the total pixels in the image remain unchanged after watermark embedding. In order to recover the hidden data, some side information can be conveyed, in-band or out-of-band, to a decoder, such as various parameters used when performing the method. If protection from attacks, such as a JPEG encoding attack is desired, a location map can be provided to assist with hidden data recovery.

Abstract: Improved methods, systems, and devices for Wyner-Ziv video compression are provided based on the disclosed successive resolution refinement techniques. The disclosed resolution refinement schemes improve rate-distortion performance, visual quality and decoding speed with lower complexity than conventional bitplane refinement methods. The disclosed details enable various refinements and modifications according to system design considerations.

Abstract: System and methodologies are provided herein for reconstructing a video signal from multiple video streams. Various aspects described herein can utilize a least square estimate (LSE) algorithm to jointly decode multiple video bitstreams that are generated from a common original video sequence at different bit rates. As described herein, the LSE algorithm can reconstruct an original video sequence by determining and computing a weighted sum of collocated video information reconstructed from different video bitstreams. The weights applied can be adaptively determined to minimize the mean square error (MSE) of the reconstructed video sequence as compared to the original.

Abstract: Systems and methodologies for lossless visible watermarking of images are provided herein. The provided systems and methodologies can utilize a Pixel Value Mapping Algorithm (PVMA), wherein a watermark can be embedded into an image by transforming respective intensities of areas of the image corresponding to the watermark using a bijective mapping function. Additionally and/or alternatively, a Pixel Position Shift Algorithm (PPSA) can be used to embed a watermark into an image by shifting the position of pixels in the image corresponding to the watermark over a specified shift distance. Further, provided systems and methodologies can facilitate enhanced watermarking security by embedding a visible watermark into an image based on a secret key.

Abstract: Based on maximum a posteriori (MAP) estimates, video denoising techniques for frames of noisy video are provided. With the assumptions that noise is similar to or satisfies Gaussian distribution and an a priori conditional density model measurable by bit rate, a MAP estimate of a denoised current frame can be expressed as a rate distortion optimization problem. A constraint minimization problem based on the rate distortion optimization problem is used to vary a lagrangian parameter to optimize the denoising process. The lagrangian parameter is determined as a function of distortion of the noise.

Abstract: Methods and systems for denoising embedded digital video decoding. Prediction and residue block of a current frame are obtained from motion vector. Variance of residue block is calculated using prior reference blocks, and a causal temporal linear minimum square error estimator is used to calculate a filter coefficient. The residue block is modified using the filter coefficient, and an output digital bitstream of blocks of pixels of the current frame is produced using the modified residue block and prior denoised prediction value of prior frames.

Abstract: A system and methodology for concealing an error in a video signal is provided. In accordance with one aspect of the present invention, the system and methodology employ a Spatio-Temporal Boundary Matching Algorithm, which utilizes a distortion function that takes into account both the spatial and temporal smoothness properties of a video sequence. Further, the methodology for concealing an error in a video signal comprises receiving a video signal having an erroneous frame, creating a candidate set of motion vectors, selecting a motion vector from the candidate set of motion vectors that best keeps temporal and spatial continuity through the erroneous frame, and reconstructing the erroneous frame using the selected motion vector.

Abstract: Improved systems and methods for error concealment of multiple description coding (MDC) encoded streams are provided based on a three loop interpolation of lost frames. Error concealment of the present invention can be combined with the error resilience provided by MDC to reconstruct lost frames, such that the propagated error to the following frames is reduced.

Abstract: A system and methodology for encoding or decoding hidden data, such as a digital watermark, in visual raster media is provided. The lossless data hiding methodology uses multiple predictors to choose an embedding location to be either a low variance region or a high variance region. Bijective mirror mapping is used to encode hidden data at an embedding location and bijective pixel value shifting is performed to ensure reversibility back to the original image without additional information. The system and methodology can be used either in the spatial domain or the wavelet domain. The Peak Signal to Noise Ratio and the payload capacity are relatively high with the methodology.

Abstract: A method for encoding video includes receiving data, and encrypting the data using at least four Huffman trees. A method for encoding video includes receiving data, and encrypting the data such that an internal state of a stream cipher is independent of plaintext and ciphertext. A video encoding system for encoding video in a computing environment includes means for accessing data, and means for encrypting the data such that there are approximately 2106 possibilities.

Abstract: A method and a computer-readable medium containing computer program for encoding a frame of video data are presented. The frame of video data has a plurality of macro-blocks. Each of the macro-blocks includes a macro-block header having multiple elements and macro-block residue data. An element of the macro-block header is encoded based on the value of the same element of a previous macro-block header so as to reduce overall bits in the macro-block header. The element of the macro-block header is encoded by grouping the elements of the plurality of the macro-blocks.

Abstract: Systems and methodologies are provided herein for representing information in a data processing system with low power consumption. As described herein, parity relationships between multiple nodes of to-be-written binary information and original information can be leveraged as described herein to reduce the amount of toggling required to write information in a memory, thereby reducing power consumption. Various algorithms for leveraging parity relationships are described herein, including a Champagne Pyramid Parity Check (CPPC) algorithm and a Tree-Based Parity Check (TBPC) algorithm.

Abstract: System and methodologies are provided herein for low-distortion image watermarking. Parity relationships between multiple pixels and/or regions of an image can be leveraged as described herein to reduce the amount of toggling required to embed a watermark in an image, thereby increasing watermark efficiency and reducing visual artifacts introduced in a watermarked image. Various algorithms for leveraging parity relationships are described herein, including a Block-Overlapping Parity Check (BOPC) algorithm, a Champagne Pyramid Parity Check (CPPC) algorithm, and a Tree-Based Parity Check (TBPC) algorithm.

Abstract: A method includes performing a single pass filtering that integrates a first pass demosaicking and a second pass demosaicking into a single pass operation. The method can include interpolating in a vertical direction as well as interpolating in a horizontal direction. The vertical interpolation can be compared with the horizontal interpolation and one interpolation can be selected. The method can include comparing a vector with a plurality of neighbor vectors and selecting the direction with the smallest vector difference. A digital camera is provided that includes at least one data store for storing a plurality of video images, and a host system that processes the video images by performing a single pass filtering that integrates a first pass demosaicking and a second pass demosaicking into a single simple pass (SP) filtering operation. The host system compares a vertical interpolation with a horizontal interpolation and selects one interpolation, in another exemplary non-limiting embodiment.

Abstract: We propose methods for generating a halftone image, in which each pixel takes one of two tone values. The generated image contains hidden data, which is present at data storage pixels chosen using a pseudo-random number generator. In a first case, the data is hidden within an existing halftone image by reversing the tone value at certain of the data storage pixels, and at pixels neighboring the data storage pixels. In a second case, the halftone image is generated from a grey-scale image, and data is hidden during this conversion process.

Abstract: A novel method, system, and apparatus for efficient multi-block motion estimation in a digital signal compression and coding scheme. This invention selects only a few representative block sizes for motion estimation when certain favourable conditions occur, rather than using all available block sizes. This invention produces significantly reduced computational costs with virtually no sacrifice in visual quality and in bit-rate.