| Patent application number | Description | Published |
|---|
| 20080238942 | Object-Based Image Inpainting - Systems and methods provide object-based image inpainting. The object-based inpainting can recover part of a missing object or can synthesize visual objects that are entirely missing. In one implementation, an exemplary system generates a target visual object to be inpainted into an image, by geometrically matching key features with a model visual object that can be selected from the same or another image. Borders of the target object are refined through pixel-based contour deformation and textures for the target object are obtained either by pixel interpolation or by patch-based modeling of pre-existing texture in the image. Graph-cut segmentation rectifies image overlap as the target object is embedded in the image. Poisson editing filters visual seams, and edge filling completes visual gaps around the border of the target object. | 10-02-2008 |
| 20080291065 | Wyner-Ziv Coding with Multiple Side Information - A Wyner-Ziv coding scheme jointly utilizes multiple side information at the decoder is described. A new probability model is introduced based on an extended turbo decoding trellis, so that the transitional probability is calculated from the probabilities conditioned on multiple side information. The proposed scheme handles multiple side information in a multi-dimensional manner to potentially achieve coding performance better than either selecting one side information or generating a single side information by averaging several side information. When the decoder receives multiple streams of parity bits, the conditional probabilities on the parity bits from the multiple streams all contribute in turbo decoding. The errors existing in some of the streams can be automatically eliminated during the decoding process. | 11-27-2008 |
| 20080292005 | Enhancement layer switching for scalable video coding - An exemplary system includes a data encoder generating a base layer bitstream encoded at a base bit-rate, and a plurality of enhancement layer bitstreams encoded at different enhancement layer bit-rates, and a bitstream selection module selecting one of the enhancement layer bitstreams every video frame based on available channel bandwidth. A method includes transmitting a first enhancement layer bitstream encoded at a first bit-rate, detecting a transition in network bandwidth through a switching bit-rate, and transmitting a second enhancement layer bitstream encoded at a second bit-rate based on the transition in network bandwidth. | 11-27-2008 |
| 20080310506 | Joint Spatio-Temporal Prediction for Video Coding - Systems and methods are described for joint spatio-temporal prediction (JSTP) during video coding. A given block of pixels is simultaneously predicted via inter frame prediction and intra frame prediction. The joint spatio-temporal prediction provides a new JSTP coding mode besides inter and intra modes in coding schemata such as the H.264/AVC video coding standard. In one implementation, subband decomposition obtains a high-pass component of inter frame prediction of a block and a low-pass component of intra frame prediction of the same block. The high-pass component of the inter prediction and the low-pass component of the intra prediction are combined to produce the joint spatio-temporal prediction. In one implementation, a difference between the original block and the JSTP prediction is coded in a bitstream to represent the block. | 12-18-2008 |
| 20090003430 | Video Coding Using Spatio-Temporal Texture Synthesis - Systems and methods for video coding using spatio-temporal texture synthesis are described. In one aspect, a video data coding pipeline portion of the codec removes texture blocks from the video data to generate coded video data. The removed texture blocks are selected based on an objective determination that each of the remove texture blocks can be synthesized from spatio-temporal neighboring samples during decoding operations. The objective determinations are made using local block-based motion information independent of global motion models. An indication of which texture blocks were removed is provided to a decoder in addition to the coded video data. Decoding logic of the codec decodes the video data using a standard decoding algorithm. The decoding logic also restores the removed texture blocks via spatio-temporal texture synthesis to generate synthesized video data. The decoded and synthesized video data is presented to a user. | 01-01-2009 |
| 20090003720 | EFFICIENT IMAGE REPRESENTATION BY EDGES AND LOW-RESOLUTION SIGNAL - An exemplary method for encoding an image includes receiving image data, detecting edges in the image data, selecting at least some of the detected edges, encoding the selected edges as selected edge information, down-sampling the image data, encoding the down-sampled image as down-sampled image information and multiplexing the selected edges information and the down-sampled image information. In such a method, the selected edges information and the down-sampled image information can be stored as an encoded image file. Other exemplary methods, devices, systems are also disclosed. | 01-01-2009 |
| 20090067491 | Learning-Based Image Compression - Learning-based image compression is described. In one implementation, an encoder possessing a first set of learned visual knowledge primitives excludes visual information from an image prior to compression. A decoder possessing an independently learned set of visual knowledge primitives synthesizes the excluded visual information into the image after decompression. The encoder and decoder are decoupled with respect to the information excluded at the encoder and the information synthesized at the decoder. This results in superior data compression since the information excluded at the encoder is dropped completely and not transferred to the decoder. Primitive visual elements synthesized at the decoder may be different than primitive visual elements dropped at the encoder, but the resulting reconstituted image is perceptually equivalent to the original image. | 03-12-2009 |
| 20090074307 | Textual Image Coding - Textual image coding involves coding textual portions of an image. In an example embodiment, a textual block of an image is decomposed into multiple base colors and an index map, with the index map having index values that each reference a base color so as to represent the textual block. A set of neighbor index values are ascertained for a particular index of the index map. A context that matches the neighbor index values is generated from among multiple contexts. The matching context includes a set of symbols. At least one symbol-to-value mapping is determined based on the matching context and a symbol to which the particular index corresponds. The particular index is remapped to a particular value in accordance with the symbol-to-value mapping and the symbol to which the particular index corresponds. | 03-19-2009 |
| 20090103606 | Progressive Distributed Video Coding - Progressive distributed video coding is described. In one implementation, video data maybe encoded by arranging the data into bit-planes. The arrangement of bit-planes is adapted by shifting the first non-zero bit-plane left by one place in the binary digits and moving the sign bit immediately in the place vacated by the shifted non-zero bit-plane. The adapted bit-planes are then encoded using an asymmetric Slepian-Wolf encoder. | 04-23-2009 |
| 20090238267 | Methods And Apparatuses For Use In Switching Between Streaming Video Bitstreams - Improved methods and apparatuses are provided for switching of streaming data bitstreams, such as, for example, used in video streaming and other related applications. Some desired functionalities provided herein include random access, fast forward and fast backward, error-resilience and bandwidth adaptation. The improved methods and apparatuses can be configured to increase coding efficiency of and/or reduce the amount of data needed to encode a switching bitstream. | 09-24-2009 |
| 20090238476 | Spectral information recovery for compressed image restoration - Aspects of the subject matter described herein relate to image restoration for compressed images. In aspects, image restoration is accomplished by recovering spectral information from data corresponding to a compressed image. The spectral information is recovered using an algorithm to search through a solution space of possible solutions while constraints are imposed on the solution space to trim undesirable solutions from the space. An algorithm described herein may be iteratively applied to improve the quality of the recovered image. | 09-24-2009 |
| 20090238484 | LIFTING-BASED DIRECTIONAL LAPPED TRANSFORMS - A “directional lapped transform coder” (“DLT Coder”) provides various techniques for designing directional lapped transforms. In general, lapped transforms are factorized into lifting steps. A “directional operator” is then introduced into each lifting step in order to construct the directional lapped transform by selecting data elements from a data signal along a path corresponding to the directional operator. The resulting directional lapped transform preserves the advantages of conventional lapped transforms while also providing more efficient representation directional signals. In various embodiments, the resulting directional lapped transform is used to enable an image/video coding scheme that provides significant improvement over conventional state-of-the-art image lapped transform based coding schemes for images with strong directional correlations. | 09-24-2009 |
| 20090245373 | VIDEO CODING - Improved video coding is described to encode video data within a sequence of video frames. To this end, at least a portion of a reference frame is encoded to include motion information associated with the portion of the reference frame. At least a portion of a predictable frame that includes video data predictively correlated to said portion of said reference frame is defined based on the motion information. At least said portion of the predictable frame is encoded without including corresponding motion information and including mode identifying data. The mode identifying data indicate that the encoded portion of the predictable frame can be directly derived using at least the motion information associated with the portion of the reference frame. | 10-01-2009 |
| 20090252146 | CONTINUOUS NETWORK CODING IN WIRELESS RELAY NETWORKS - Described is continuous network coding, in which a relay sends probability data comprising a continuous number for use as parity data. The node receives streams of bits sent from sources towards a destination, and computes the probability data based on current noise data and/or fading data. A selected set of the bits (all or some subset thereof) are combined, e.g., XOR-ed or concatenated, and send to the destination. Phase modulation is performed to convey probability information based on the probability data. The destination demodulates the signal to obtain the probability information, and combines the probability information with the data directly received from sources to perform joint decoding. The number of bits in the set of selected bits may be adaptively chosen based on current channel conditions, e.g., increased when the channel conditions from the sources directly to a destination are poor relative to the channel conditions via the relay. | 10-08-2009 |
| 20090252431 | Image Resizing for Web-based Image Search - Image resizing for web-based searching is described. In one implementation, a system resizes a user-selected thumbnail image into a larger version of the image that emulates the quality of a large, original image, but without downloading the original image. First, the system extracts resizing parameters when each thumbnail image is created. Then, the system creates a codebook of primitive visual elements extracted from a collection of training images. The primitive visual elements in the codebook provide universal visual parts for reconstructing images. The codebook and a resizing plug-in can be sent once to the user over a background channel. When the user selects a thumbnail image for enlargement, the system resizes the thumbnail image via interpolation and then refines the enlarged image with primitive visual elements from the codebook. The refinement creates an enlarged image that emulates the quality of the large, original image, without downloading the original image. | 10-08-2009 |
| 20090279462 | STATEFUL SCHEDULING WITH NETWORK CODING FOR ROADSIDE-TO-VEHICLE COMMUNICATION - Described is a technology by which a roadside-to-vehicle communication system may be implemented, including via a stateful scheduling with network coding scheme that enhances network capacity. Moving vehicles request and receive data from a roadside access points. Each of the access points operate a stateful scheduling algorithm that serves multiple vehicles by integrating network coding within a timeslot. In one aspect, the state of each vehicle's previously received and retained data is obtained, and used to enhance network capacity by combining as many packets as possible for multiple recipients in network coding. | 11-12-2009 |
| 20090285148 | NATURAL NETWORK CODING FOR MULTI-HOP WIRELESS NETWORK - Described herein is technology for, among other things, natural network coding in a wireless mesh network. The technology involves wireless mesh network systems, methods and devices based on the natural network coding. By encoding signals in their natural forms using their channel strengths, more efficient transmission of signals is possible in the wireless mesh network. | 11-19-2009 |
| 20090296670 | PULL-BASED DATA TRANSMISSION APPROACH - A network can include a number of nodes that link a source node to a sink node. When a first node in a network sends a packet to its downstream node, this information is also received at its upstream node. In response to learning that the first node has sent a packet, the upstream node sends another packet to the first node. In essence, a pull-based transmission approach is used to mitigate congestion and address the funneling effect in data transmission networks such as wireless video sensor networks. | 12-03-2009 |
| 20090304298 | HIGH DYNAMIC RANGE TEXTURE COMPRESSION - A method for compressing a high dynamic range (HDR) texture. A first block of texels of the HDR texture in a red-green-blue (RGB) space may be transformed to a second block of texels in a luminance-chrominance space. The first block may have red values, green values and blue values. The second block may have luminance values and chrominance values. The chrominance values may be based on a sum of the red values, a sum of the green values and a sum of the blue values. The luminance values and the chrominance values may be converted to an 8-bit integer format. The luminance values may be modified to restore a local linearity property to the second block. The second block may be compressed. | 12-10-2009 |
| 20090315905 | LAYERED TEXTURE COMPRESSION ARCHITECTURE - Various technologies for a layered texture compression architecture. In one implementation, the layered texture compression architecture may include a texture consumption pipeline. The texture compression pipeline may include a processor, memory devices, and textures compressed at varying ratios of compression. The textures within the pipeline may be compressed at ratios in accordance with characteristics of the devices in the pipeline that contains and processes the textures. | 12-24-2009 |
| 20090322777 | UNIFIED TEXTURE COMPRESSION FRAMEWORK - A method for compressing textures. A first block of texels is transformed from a red-green-blue (RGB) space to a second block of texels in a luminance-chrominance space. The first block has red values, green values and blue values. The second block has luminance values and chrominance values. The chrominance values may be based on a sum of the red values, a sum of the green values and a sum of the blue values. The chrominance values may be sampled for a first subset of texels in the second block. The luminance values and the sampled chrominance values may be converted to an 8-bit integer format. The luminance values of the first subset may be modified to restore a local linearity property to the first subset. The second block may be compressed into a third block. | 12-31-2009 |
| 20100020882 | Barbell Lifting for Wavelet Coding - A method for encoding motion-compensated video data includes generating, for a current frame, a high-pass wavelet coefficient based on a function of pixels in a temporally adjacent frame. The operations are repeated for multiple pixels in an array of pixels in the current frame to form an array of high-pass wavelet coefficients. A low-pass wavelet coefficient is generated based on a function of the high-pass wavelet coefficients. A system for coding video data includes a temporal wavelet decomposition module decomposing a pixel into a high-pass coefficient by performing a discrete wavelet transform on the pixel, a function of pixels in a previous frame, and/or a function of pixels in a subsequent frame. The system includes a motion estimation module generating motion vectors associated with the pixels in the previous frame and in the subsequent frame. | 01-28-2010 |
| 20100046849 | Image Restoration By Vector Quantization Utilizing Visual Patterns - The restoration of images by vector quantization utilizing visual patterns is disclosed. One disclosed embodiment comprises restoring detail in a transition region of an unrestored image, by first identifying the transition region and forming blurred visual pattern blocks. These blurred visual pattern blocks are compared to a pre-trained codebook, and a corresponding high-quality visual pattern blocks is obtained. The high-quality visual pattern block is then blended with the unrestored image to form a restored image. | 02-25-2010 |
| 20100074549 | IMAGE UPSAMPLING WITH TRAINING IMAGES - Images are upsampled using a knowledge base derived from a plurality of high-quality training images. The knowledge base is used to refine a high-frequency component including high-frequency aspects of a high-resolution, low-frequency image, interpolated from a low-resolution full-frequency image, into a high-frequency component. An enhancement step is performed without using a knowledge base to construct a high-compatibility component from the low-resolution, full-frequency image. The low-resolution, full-frequency image is combined with the coarse high-frequency component to yield an enhanced high-frequency component. A second knowledge base step is performed to construct an improved high-frequency component from the enhanced high-frequency component. The improved high-frequency component is blended with a high-resolution, low-frequency image to yield a high-resolution image. | 03-25-2010 |
| 20100080488 | FAST DIRECTIONAL IMAGE INTERPOLATOR WITH DIFFERENCE PROJECTION - Described is a technology in which a low resolution image is processed into a high-resolution image, including by a two interpolation passes. In the first pass, missing in-block pixels, which are the pixels within a block formed by four neighboring original pixels, are given values by gradient diffusion based upon interpolation of the surrounding original pixels. In the second interpolation pass, missing on-block pixels, which are the pixels on a block edge formed by two adjacent original pixels, are given values by gradient diffusion based upon interpolation of the values of those adjacent original pixels and the previously interpolated values of their adjacent in-block pixels. Also described is a difference projection process that varies the values of the interpolated pixels according to a computed difference projection. | 04-01-2010 |
| 20100135390 | VIDEO CODING - Improved video coding is described to encode video data within a sequence of video frames. To this end, at least a portion of a reference frame is encoded to include motion information associated with the portion of the reference frame. At least a portion of a predictable frame that includes video data predictively correlated to said portion of said reference frame is defined based on the motion information. At least said portion of the predictable frame is encoded without including corresponding motion information and including mode identifying data. The mode identifying data indicate that the encoded portion of the predictable frame can be directly derived using at least the motion information associated with the portion of the reference frame. | 06-03-2010 |
| 20100158400 | Accelerated Screen Codec - An accelerated screen codec technique is described that provides a general screen compression framework, which, in one embodiment, is Graphics Processor Unit (GPU) friendly. In one embodiment, in order to compress screen data, blocks in a compound screen image containing both images and text are segmented into text blocks and pictorial blocks using a simple gradient-based procedure. The text and pictorial blocks are then compressed respectively via different compression techniques. Additionally, a GPU acceleration architecture of one embodiment of the accelerated screen codec technique provides a screen codec that maximally exploits a GPU's high parallelism and reduces the download bandwidth from GPU to Computer Processing Unit (CPU). | 06-24-2010 |
