# Oscar Chi-Lim Au, Hong Kong CN

## Oscar Chi-Lim Au, Hong Kong CN

Patent application number | Description | Published |
---|---|---|

20080247002 | MULTIMEDIA WATERMARKING TECHNIQUES WITH LOW DISTORTION - 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. | 10-09-2008 |

20080250056 | METHOD AND APPARATUS FOR WRITING BINARY DATA WITH LOW POWER CONSUMPTION - 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. | 10-09-2008 |

20080273693 | EFFICIENT ENCODING PROCESSES AND APPARATUS - 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 2 | 11-06-2008 |

20080285655 | DECODING WITH EMBEDDED DENOISING - 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. | 11-20-2008 |

20080316364 | RATE DISTORTION OPTIMIZATION FOR VIDEO DENOISING - 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. | 12-25-2008 |

20090003452 | WYNER-ZIV SUCCESSIVE REFINEMENT VIDEO COMPRESSION - 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. | 01-01-2009 |

20090003458 | VIDEO TRANSCODING QUALITY ENHANCEMENT - 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. | 01-01-2009 |

20090046776 | EFFICIENT TEMPORAL SEARCH RANGE CONTROL FOR VIDEO ENCODING PROCESSES - 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. | 02-19-2009 |

20090046850 | GENERAL DATA HIDING FRAMEWORK USING PARITY FOR MINIMAL SWITCHING - 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. | 02-19-2009 |

20090067495 | RATE DISTORTION OPTIMIZATION FOR INTER MODE GENERATION FOR ERROR RESILIENT VIDEO CODING - Optimal selection of an inter mode is provided for video data being encoded to achieve enhanced error resilience when the video data is decoded. End to end distortion cost from encoder to decoder for inter mode selection is determined based on residue energy and quantization error. Using the distortion cost function based on residue energy and quantization error, and an optimal Lagrangian parameter, the optimal inter mode is selected for use during encoding for maximum error resilience. The optimal Lagrangian parameter can be set to be proportional to an error-free Lagrangian parameter with a scale factor determined by packet loss rate. | 03-12-2009 |

20090074075 | EFFICIENT REAL-TIME RATE CONTROL FOR VIDEO COMPRESSION PROCESSES - In advanced video coding standards such as H.264, macro-blocks belong to more advanced MB types, such as skipped and non-skipped macro-blocks. In non-skipped macro-blocks, the encoder determines whether each of 8×8 luminance sub-blocks and 4×4 chrominance sub-block of a macro-block is to be encoded, giving the different number of sub-blocks at each macro-block encoding times. It has been found that the correlation of bits between consecutive frames is high. This correlation is even higher after macro-block normalization by considering advanced macro-block types. Based on this bit characteristic, a fast real-time H.264 rate control scheme is herein described. The empirical example results suggest that this scheme can achieve PSNR gain over JM10.2. | 03-19-2009 |

20090080688 | DIGITAL WATERMARKING FOR FEW-COLOR IMAGES - Systems and methodologies for embedding a watermark in a few-color image are provided herein. A digital watermarking algorithm named Spatial Unified Key Insertion (SUKI) can be utilized, wherein adaptive threshold halftoning can be performed in combination with contour shaping and modification to embed a binary logo into a digital image. Watermarking can be performed for an image using SUKI without introducing “salt-and-pepper” artifacts into the image. Further, watermarking techniques described herein can embed data into an image with a considerably high payload while providing excellent resistance against JPEG compression and other attacks and introducing no additional colors into an image. | 03-26-2009 |

20090103617 | EFFICIENT ERROR RECOVERY WITH INTRA-REFRESH - Systems and methodologies for concealing errors related to INTRA-frame losses in a transmitted video signal are provided herein. Systems and methodologies provided herein can refine a lost INTRA-coded frame and its subsequent INTER-coded frames using INTRA-coded macroblocks that are provided in a video bitstream in accordance with a Random INTRA Refresh (RIR) scheme. When an INTRA-frame is lost, INTRA-coded macroblocks can be used to refine neighboring INTER-coded macroblocks based on region filling, spatial interpolation, or other algorithms that are based on the strong correlation between values of adjacent pixels in a video signal. Further, motion compensation can be used to refine an INTER-coded pixel having an INTRA-coded pixel in its motion trajectory. | 04-23-2009 |

20090110062 | OPTIMAL HEEGARD-BERGER CODING SCHEMES - Optimal Heegard-Berger coding methods, devices, and systems are provided based on the disclosed coding schemes. The disclosed schemes facilitate decoding even in the absence of side information, with lower coding complexity than conventional Wyner-Ziv based distributed coding techniques. The disclosed details enable various refinements and modifications according to system design considerations. | 04-30-2009 |

20090135901 | COMPLEXITY ADAPTIVE VIDEO ENCODING USING MULTIPLE REFERENCE FRAMES - Encoding techniques are provided that consider decoder complexity when encoding video data. A complexity adaptive encoding algorithm encodes video data by encoding current frame data based on reference frame data taking into account an expected computational complexity cost of decoding the current frame data. | 05-28-2009 |

20090135911 | FAST MOTION ESTIMATION IN SCALABLE VIDEO CODING - Scalable Video Coding is recently attracting attentions due to its high flexibility. The current H.264/AVC scalable extension has adopted the Motion Compensated Temporal Filter (MCTF) framework to provide temporal scalability. In this paper, described is another fast motion estimation (ME) algorithm based on the MCTF framework. Simulation results show that the herein described algorithm can reduce the encoding complexity significantly while maintaining similar bit rate and PSNR, comparing with existing fast ME algorithms implemented in the reference software. | 05-28-2009 |

20090147849 | INTRA FRAME ENCODING USING PROGRAMMABLE GRAPHICS HARDWARE - GPU-based intra frame processing techniques are provided to selectively offload computation loading from a CPU to a GPU. By rearranging the 4×4 block encoding order, the process can benefit from a parallel processing mechanism available on the GPU. Block list size has an effect on speed and by using the optimal block list size for a selection, up to about two times speed improvement in intra frame processing can be achieved. | 06-11-2009 |

20090190845 | MOTION-COMPENSATED RESIDUE BASED TEMPORAL SEARCH RANGE PREDICTION - Efficient temporal search range predication for motion estimation in video coding is provided where complexity of using multiple reference frames in multiple reference frame motion estimation (MRFME) can be evaluated over a desired performance level. In this regard, a gain can be determined for using regular motion estimation or MRFME, and a number of frames if the latter is chosen. Thus, the computational complexity of MRFME and/or a large temporal search range can be utilized where it provides at least a threshold gain in performance. Conversely, if the complex calculations of MRFME do not provide sufficient benefit to the video block prediction, a smaller temporal search range (a less number of reference frames) can be used, or regular motion editing can be chosen over MRFME. | 07-30-2009 |

20090268821 | BLOCK PARALLEL AND FAST MOTION ESTIMATION IN VIDEO CODING - Block parallel fast motion estimation for blocks of a video frame is provided where encoding of video blocks can be ordered to allow concurrent encoding thereof. Furthermore, motion vector prediction can be performed concurrently for independent video blocks where requisite blocks for calculating the prediction of a given block can be previously encoded, but not all blocks depend from each other; thus, parallel motion vector estimation is possible. Additionally, a fast motion estimation algorithm can be concurrently performed on a number of video blocks to search surrounding blocks to compute motion vectors as well. The concurrent processes can leverage the parallel architecture of one or more graphical processing units (GPU). | 10-29-2009 |

20090279600 | FLEXIBLE WYNER-ZIV VIDEO FRAME CODING - Efficient encoding and/or decoding of digital video is provided using multiple candidate reference frames, making playback of the digital video optionally reversible. For example, a source can be encoded as duplex coded frames having multiple candidate reference frames. The reference frames can be previous or future frames, and the duplex coded frames can be encoded at a bit-rate that ensures lossless decoding using any of the candidate reference frames. Therefore, the duplex coded frames can encoded in normal and/or reverse temporal order. In this regard, the ability to decode digital video frames using either a single previous or future frame enables reversible digital video, bit-stream switching and video splicing arbitrary time points, and provides for increased error resilience. | 11-12-2009 |

20090279615 | ERROR CONCEALMENT FOR FRAME LOSS IN MULTIPLE DESCRIPTION CODING - Systems and methodologies for concealing frame loss in a video transmission environment are provided herein. Multiple Description Coding (MDC) can be used as an Error Resilience technique for video coding. In case of transmission errors, Error Concealment can be combined with MDC to reconstruct a lost frame, such that the propagated error to following frames can be reduced. Further, multi-hypothesis decoding can be employed to enhance reconstructed video quality of MDC over packet loss networks. For instance, one or more frames after the lost frame in the same stream can be reconstructed using multi-hypothesis decoding, which combines directly decoding and temporally interpolating these frames. Moreover, output obtained from directly decoding and temporally interpolating each frame can be combined by generating a weighted sum of these hypotheses. Constant weights and/or adaptive weights (e.g., determined based on the minimum mean square error criterion) can be used for yielding the weighted sum. | 11-12-2009 |

20090295607 | FINDING A VARIABLE LENGTH CODE WITH OPTIMAL ERROR RECOVERY - Systems and methodologies for analyzing error recovery performance of variable length codes utilized for encoding and decoding data are provided herein. Synchronization recovery of a set of variable length codes can be evaluated assuming that an encoded bit stream is transmitted over a binary symmetric channel. Further, mean symbol error rates corresponding to each of the variable length codes in the set can be determined based upon the evaluation of the synchronization recovery. Moreover, a subset of the variable length codes with optimal error recovery can be selected as a function of the mean symbol error rates. | 12-03-2009 |

20090295934 | COLOR DEMOSAICKING USING DIRECTION SIMILARITY IN COLOR DIFFERENCE SPACES - Demosaicking optimizations are provided for still and/or moving image (e.g., video) processes that efficiently generate viewable images. A demosaicking process selects a direction before performing interpolation in order to avoid interpolation across edges and also to minimize color artifacts. The direction to be selected is based on a direction similarity measurement. A digital capture device can includes a system that processes the image data by performing interpolation based on the direction similarity measurement(s) for color difference spaces. The images created based on the directional similarities demonstrate performance gains in peak signal to noise ratio (PSNR). | 12-03-2009 |

20090304264 | FREE VIEW GENERATION IN RAY-SPACE - The claimed subject matter relates to an architecture that can facilitate more efficient free view generation in Ray-Space by way of a Radon transform. The architecture can render virtual views based upon original image data by employing Ray-Space interpolation techniques. In particular, the architecture can apply the Radon transform to a feature epipolar plane image (FEPI) to extract more suitable slope or direction candidates. In addition, the architecture can facilitate improved block-based matching techniques in order to determine an optimal linear interpretation direction. | 12-10-2009 |

20090309769 | System and method for encoding data based on a compression technique with security features - Described herein is an efficient encryption method and system having improved security features based on randomness. The method and system utilize a random dictionary insertion and a random dictionary permutation, and a key stream generated by a stream cipher. Security analysis results show that the method and system provides a higher level of security without incurring any coding efficiency loss, compared with a existing encoding methods. | 12-17-2009 |

20090316783 | BIDIRECTIONALLY DECODABLE WYNER-ZIV VIDEO CODING - Systems and methodologies for employing bidirectionally decodable Wyner-Ziv video coding (BDWZVC) are described herein. BDWZVC can be used to generate M-frames, which have multiple reference frames at an encoder and can be forward and backward decodable. For example, optimal Lagrangian multipliers for forward and backward motion estimation can be derived and/or utilized. The optimal Lagrangian multiplier for backward motion estimation can be approximately twice as large as the optimal Lagrangian multiplier for forward motion estimation. Further, an optimal P-frame/M-frame selection scheme can be employed to enhance rate-distortion performance when video is transmitted over an error prone channel. Accordingly, a first frame in a group of pictures (GOP) can be encoded as an I-frame, a next m−1 frames can be encoded as P-frames, and a remaining n-m frames can be encoded as M-frames, where n can be a length of the GOP and m can be optimally identified. | 12-24-2009 |

20090317017 | IMAGE CHARACTERISTIC ORIENTED TONE MAPPING FOR HIGH DYNAMIC RANGE IMAGES - A method and system map high dynamic range images to low dynamic range images. An input set of luminance values can be divided into separate regions corresponding to particular luminance value ranges. A region value can be determined for each region. Based at least in part on the region value, a quantity of range assigned to each region for tone mapping can be dynamically adjusted until each region meets a decision criterion or stopping condition, referred to herein as “concentration.” A region can be said to be concentrated if all luminance values therein are within a concentration interval or range. After a region is concentrated, it can be tone-mapped by quantization. | 12-24-2009 |

20100020877 | MULTIPLE REFERENCE FRAME MOTION ESTIMATION IN VIDEO CODING - Multiple reference frame motion estimation for video frame blocks is provided. A plurality of copies of a block list of a reference frame can be loaded into texture memory. Encoding of video blocks of the video frame can be ordered to allow concurrent encoding of the video blocks. Furthermore, motion vector prediction can be performed concurrently for independent video blocks, the motion vectors can be related to each one of the plurality of copies of the block list of the reference frame and determined for the at least a portion of the plurality of blocks ordered for concurrent encoding. Additionally, a fast motion estimation algorithm can be concurrently performed on a number of video blocks to search surrounding blocks and compute motion vectors. Further, concurrent processing of multiple slices can be performed. Such concurrent processes can leverage the parallel architecture of at least one graphical processing unit. | 01-28-2010 |

20100027909 | CONVEX OPTIMIZATION APPROACH TO IMAGE DEBLOCKING - Images encoded at low-bit rate may suffer from blocking artifacts, which can dramatically degrade the visual quality of the images. In accordance with the claimed subject matter, a convex optimization approach is provided in order to mitigate such blocking artifacts. Based on the analysis of image coding process as well as natural image properties (e.g., image complexity), a set of constraint functions can be constructed. In addition, an objective function can be constructed based upon, e.g. analysis of a quantization noise model. All functions included in the set as well as the objective function can be convex function. Accordingly, image deblocking can be formulated as a convex optimization problem which can be easily solved using numerical methods. Moreover, the feasibility of the convex optimization problem can be utilized to detect the true object edges and avoid blurring. | 02-04-2010 |

20100039556 | MULTI-RESOLUTION TEMPORAL DEINTERLACING - System and methodologies are provided herein for de-interlacing a video sequence. Various aspects described herein can utilize a motion adaptive video de-interlacing algorithm based on block-based texture classification and a multi-level decision hierarchy to interpolate missing fields of an interlaced video signal in the spatial and temporal domains. In accordance with various aspects described herein, respective blocks of an interlaced video sequence can be classified by a texture classifier as “textured” or “non-textured.” Based on this classification, one or more motion detection schemes can be utilized to determine whether the respective blocks are static or moving. Missing pixels from one or more blocks can then be estimated using the texture and motion classifications based on values of neighboring lines and/or pixels in the field from which the block was obtained as well as values of corresponding pixel locations in temporally adjacent fields. | 02-18-2010 |

20100067688 | Method and system for encoding multimedia content based on secure coding schemes using stream cipher - Described herein are various embodiments of a coding technique that utilize a stream cipher for switching between first and second coding conventions for encoding a symbol sequence. The first coding convention specifies a first mapping between a symbol and a first codeword and the second coding convention specified a second mapping between the symbol and a second codeword. According to the invention, a key generated by the stream cipher is used to selected one of the first and second coding convention and the mapping of the selected coding convention is then utilized for encoding the symbol. | 03-18-2010 |

20100074333 | Method and system for transcoding based robust streaming of compressed video - Described herein is a novel transcoding technique called lossless inter frame transcoding (LIFT) for improving the error resilience of video streaming. According to various embodiments, conventional coded blocks are selectively transcoded into new transcoded block. At the decoder, the transcoded block can be transcoded back to the conventional coded block when the prediction is available and can also be robustly decoded independently when the prediction is unavailable. According to another embodiment, an offline transcoding and online composing technique is provided for generating a composite frame using the transcoded and conventional coded blocks and adjusting the ratio of the transcoded blocks, thereby achieving error robustness scalability. | 03-25-2010 |

20100150463 | EFFICIENT RATE ALLOCATION FOR MULTI-RESOLUTION CODING OF DATA - There are disclosed three fast rate control methods that can efficiently reduce or remove the computation and memory usage redundancy over conventional PCRD methods. The first method, called successive bit-plane rate allocation (SBRA), assigns the maximum allowable bit-rate for each bit-plane of each code-block by using the currently available rate-distortion information only. The second method is called priority scanning rate allocation (PSRA). This first predicts the order of magnitude of each truncation point's rate-distortion slope and then encodes the truncation points based on the order (priority) information. The third method uses PSRA to obtain a significantly smaller amount of data than PCRD for optimal truncation and is called priority scanning with optimal truncation (PSOT). SBRA provides the highest computational complexity and memory usage reduction, and the lowest coding/transmission delay. The computational complexity reduction can be up to about 90% of the entropy coding process. However this method gives the lowest PSNR performance of the three. PSRA provides higher PSNR performance than SBRA with the penalty of lower memory usage reduction and higher delay. PSOT provides the best (optimal) quality while it is the least efficient method in term of computational complexity, memory usage and the coding/transmission delay. The three methods provide different degree of computation complexity and memory reduction, coding/transmission delay and PSNR performance. The most suitable rate control method can be chosen based on application requirements. | 06-17-2010 |

20100215106 | EFFICIENT MULTI-FRAME MOTION ESTIMATION FOR VIDEO COMPRESSION - There is disclosed a method of digital signal compression, coding and representation, and more particularly a method of video compression, coding and representation system that uses multi-frame motion estimation and includes both device and method aspects. The invention also provides a computer program product, such as a recording medium, carrying program instructions readable by a computing device to cause the computing device to carry out a method according to the invention. | 08-26-2010 |

20100289816 | ADAPTIVE SUBPIXEL-BASED DOWNSAMPLING AND FILTERING USING EDGE DETECTION - Systems, methods, and apparatus for sampling images using edge detection are presented herein. A gradient component can calculate at least one gradient of a luminance of a block of pixels based on at least one direction; and select a minimum gradient of the at least one gradient of the luminance. Further, a direction component can determine a direction of the block based on a direction of the minimum gradient of the at least one gradient of the luminance. Moreover, a sampling component can alternately select subpixels of the block based on the direction of the block. In addition, a filter component can calculate at least one gradient of a color of a subpixel of the subpixels based on the at least one direction; determine a direction of the subpixel based on the at least one gradient of the color; and filter the subpixels based on the direction of the subpixel. | 11-18-2010 |

20100322306 | SCALAR QUANTIZATION USING BIT-STEALING FOR VIDEO PROCESSING - Systems, methods, and apparatus for adaptively zeroing out transform coefficients utilizing a bit-stealing parameter are presented herein. A partitioning component can be configured to separate an image into blocks of video data. Further, a frequency transform component can be configured to transform pixels of a block of the blocks into transform coefficients. Furthermore, a bit-stealing quantization component configured to predefine quantization intervals. Moreover, the bit-stealing quantization component can modify a size of a quantization interval of the quantization intervals based on a variable bit-stealing parameter. Further, the bit-stealing component can quantize a transform coefficient of the transform coefficients, based on the quantization interval, to a quantized coefficient value of quantized coefficient values. | 12-23-2010 |

20110013803 | METHOD AND APPARATUS FOR HIDING DATA FOR HALFTONE IMAGES - 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 neighbouring 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. | 01-20-2011 |

20110222770 | SUBPIXEL-BASED IMAGE DOWN-SAMPLING - Systems, methods, and apparatus for sampling images using minimum mean square error subpixel-based down-sampling (MMSE-SD) are presented herein. A partition component can receive a first array of pixels, and divide the first array of pixels into two-dimensional (2-D) blocks of pixels. Further, a sampling component can diagonally down-sample subpixels of a block of the 2-D blocks, and generate a second array of pixels based on the down-sampled subpixels. The sampling component can alternately sample subpixels of adjacent pixels of the block in a diagonal direction, and generate the second array of pixels based on the subpixels. A reconstruction component can create a virtual image based on, at least in part, the second array of pixels. A MMSE-SD component can determine an optimal low resolution image based on, at least in part, respective color components of the virtual image and a high resolution image associated with the first array of pixels. | 09-15-2011 |

20110254847 | SUBPIXEL-BASED IMAGE DOWN-SAMPLING - Systems, methods, and apparatus for sampling images using minimum mean square error subpixel-based down-sampling are presented herein. A partition component can be configured to divide a first array of pixels into two-dimensional (2-D) blocks of pixels. A sampling component can be configured to receive a query from a device including information associated with a display of the device; diagonally down-sample subpixels of a block of the 2-D blocks and generate a second array of pixels based on the down-sampled subpixels and the query. The sampling component can communicate at least a portion of the second array to the device based on the query. The information associated with the display can include a dimension associated with the display. Further, sampling component can be associated with a web browser; and the query can include an internet based query. | 10-20-2011 |

20110293012 | MOTION ESTIMATION OF IMAGES - Provided is sub-block motion estimation that includes a full search with a reduced search area around a motion vector predictor. Also provided are a single (or unified) motion vector predictor and a function similar to a rate-distortion cost function. Also provided is a scanning order that can reduce or substantially eliminated redundant data loading and/or that can achieve different data re-use ratio. Further, provided herein is a reconfigurable multi-resolution motion vector re-use hardware architecture based on a single motion vector predictor and a function similar to a rate-distortion cost function. Further, through utilization of the disclosed aspects, only a small number of past motion vectors are propagated and the disclosed aspects can be reconfigured for video with different spatial resolution. | 12-01-2011 |

20120162224 | FREE VIEW GENERATION IN RAY-SPACE - The claimed subject matter relates to an architecture that can facilitate more efficient free view generation in Ray-Space by way of a Radon transform. The architecture can render virtual views based upon original image data by employing Ray-Space interpolation techniques. In particular, the architecture can apply the Radon transform to a feature epipolar plane image (FEPI) to extract more suitable slope or direction candidates. In addition, the architecture can facilitate improved block-based matching techniques in order to determine an optimal linear interpretation direction. | 06-28-2012 |

20120207344 | METHOD AND APPARATUS FOR HIDING DATA FOR HALFTONE IMAGES - 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 neighbouring 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. | 08-16-2012 |

20120230416 | FAST MOTION ESTIMATION IN SCALABLE VIDEO CODING - Scalable Video Coding is recently attracting attentions due to its high flexibility. The current H.264/AVC scalable extension has adopted the Motion Compensated Temporal Filter (MCTF) framework to provide temporal scalability. In this paper, described is another fast motion estimation (ME) algorithm based on the MCTF framework. Simulation results show that the herein described algorithm can reduce the encoding complexity significantly while maintaining similar bit rate and PSNR, comparing with existing fast ME algorithms implemented in the reference software. | 09-13-2012 |

20120288014 | ERROR CONCEALMENT FOR FRAME LOSS IN MULTIPLE DESCRIPTION CODING - Systems and methodologies for concealing frame loss in a video transmission environment are provided herein. Multiple Description Coding (MDC) can be used as an Error Resilience technique for video coding. In case of transmission errors, Error Concealment can be combined with MDC to reconstruct a lost frame, such that the propagated error to following frames can be reduced. Further, multi-hypothesis decoding can be employed to enhance reconstructed video quality of MDC over packet loss networks. For instance, one or more frames after the lost frame in the same stream can be reconstructed using multi-hypothesis decoding, which combines directly decoding and temporally interpolating these frames. Moreover, output obtained from directly decoding and temporally interpolating each frame can be combined by generating a weighted sum of these hypotheses. Constant weights and/or adaptive weights (e.g., determined based on the minimum mean square error criterion) can be used for yielding the weighted sum. | 11-15-2012 |