Class / Patent application number | Description | Number of patent applications / Date published |
382253000 | Vector quantization | 13 |
20090010559 | ENCODING DEVICE AND DYNAMIC IMAGE RECORDING SYSTEM HAVING THE ENCODING DEVICE - To always maintain good image quality no matter whether the target bit rate for encoding is high or low. | 01-08-2009 |
20090175550 | Successively Refinable Lattice Vector Quantization - A vector quantizer includes a lattice quantizer ( | 07-09-2009 |
20090252428 | IMAGE DESCRIPTOR QUANTIZATION - Image descriptor quantization technique embodiments are presented which quantize an image descriptor defined by a vector of number elements. This is generally accomplished by lowering the number of bits per number element to a prescribed degree. The resulting quantized image descriptor exhibits minimal loss of matching reliability while at the same time reducing the amount of storage space needed to store the descriptor in a database. Lowering the number of bits per number element also allows for increased matching speed. | 10-08-2009 |
20090279805 | Method of coding a continuous data flow using vector quantization - Methods and systems for compressing a continuous data flow for numerous applications where it is necessary to process large data sets such as hyper-spectral data cubes in real-time. A predetermined number of 2D focal plane frames in a boundary area of a previous regional data cube close to a current regional data cube are included in a training set used for codevector training for the current region. Therefore, no artificial boundary occurs between the two adjacent regions when codevectors trained in this way are used for codebook generation and encoding of the spectral vectors of the current regional data cube. This process substantially reduces image artifacts between adjacent regions. A remedy for the single bit error problem is also provided. Full redundancy of compressed data for a regional data cube is obtained by combining a previous regional data cube and the current regional data cube for codebook training. In order to obtain redundancy for the index map, the codebook is used to encode the current regional data cube as well as the previous regional data cube producing a baseline index map for the current regional data cube and a redundant index map for the previous regional data cube. Therefore, full redundancy for a regional data cube is provided allowing restoration of a regional data cube even if its codebook and/or index map are corrupted or lost due to single bit errors. | 11-12-2009 |
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 |
20100104207 | SYSTEM AND METHOD FOR IMAGE COMPRESSION - A method for compressing image data into a sequence of codes, the image data being represented by a plurality of input color vectors. The method includes a repetitive processing of one color vector at a time with the following steps: receiving one of the input color vectors; comparing the received input color vector with codebook words in a codebook, the codebook words being expressed as color vectors; compressing the received input color vector to generate a code based on the comparison; updating the codebook with a color vector, the color vector being generated by decoding the code; and outputting the code before receiving a next one of the input color vectors; wherein the updating may include rearranging the order of the codebook words based on the comparison. | 04-29-2010 |
20100129000 | VECTOR-BASED IMAGE PROCESSING - A block of image elements is compressed by determining a parameter representative of a size of a bounding section in vector space encompassing feature vectors associated with the image elements. This size parameter is used to provide a deterministic, pseudo-random pattern of multiple representation vectors encompassed by the bounding section. A vector among multiple representation vectors is selected as representation of the feature vector of an image element. An identifier associated with selected vector is assigned to the image element and included in the compressed block which also comprises representations of the size parameter. | 05-27-2010 |
20100172594 | Data System and Method - Vector-based images and documents, such as those written in SVG and Adobe Flash, can be converted into equivalent bitmap or other non-vector-based image by parsing the vector-based image to detect objects in the vector-based code. For each detected object, a separate bitmap of the object is created and information about where that image lies on the z-axis is retained. A separate bitmap image is created for each object, and the separate bitmap images are layered on top of one another, which is to say ordered along the z-axis in accordance with their z-axis coordinates. Animation of an image can be implemented by selectively rendering different ones of the bitmap images as transparent. | 07-08-2010 |
20110164826 | METHOD FOR CONSTRUCTING IMAGE DATABASE FOR OBJECT RECOGNITION, PROCESSING APPARATUS AND PROCESSING PROGRAM - Provided is a method for constructing an image database for object recognition, which includes a feature extraction step of extracting local descriptors from object images which are to be stored in an image database, a scalar quantization step of quantizing a numeric value indicating each dimension of each of the local descriptors into a predetermined number of bit digits, and a storing step of organizing each of the local descriptors after the quantization to be able to be searched for in the closest vicinity, giving to the local descriptor an identifier of the image from which the local descriptor has been extracted, and storing the local descriptor to which the identifiers are given in the image database. The storing step comprises extracting the local descriptors from the object images when a search query is given, scalar-quantizing each dimension, determining a local descriptor in the closest vicinity of each of the local descriptors from the image database, and storing each local descriptors so as to be able to identify one image by majority vote processing from the images including any determined local descriptor. The scalar quantization step comprises quantizing each dimension of each of the local descriptors into 8 bits or less. Also provided are a processing program for the method and a processing device for performing the processing. | 07-07-2011 |
20120237134 | IMAGE DESCRIPTOR QUANTIZATION - Image descriptor quantization technique embodiments are presented which quantize an image descriptor defined by a vector of number elements. This is generally accomplished by lowering the number of bits per number element to a prescribed degree. The resulting quantized image descriptor exhibits minimal loss of matching reliability while at the same time reducing the amount of storage space needed to store the descriptor in a database. Lowering the number of bits per number element also allows for increased matching speed. | 09-20-2012 |
20130294707 | GEOMETRIC MODELIZATION OF IMAGES AND APPLICATIONS - A method for processing images includes identifying empiric model elements (EMEs) in an original high resolution photo-realistic image, where each EME includes a straight central segment, a color profile, and a control area; and geometrically modeling the EMEs in vectorized forms to achieve a generally full visual quality for a representation of said image. | 11-07-2013 |
20140037224 | QUANTIZATION METHOD AND APPARATUS - Quantization for oversampled signals with an error minimization searches based upon clusters of possible sampling vectors where the clusters have minimal correlation and thereby decrease reconstruction error as a function of oversampling (redundancy) ratio. | 02-06-2014 |
20140270561 | COMPRESSING DATA REPRESENTING COMPUTER ANIMATED HAIR - Data representing animated hair in a computer generated imagery (CGI) scene may be compressed by treating hair data as arrays of parameters. Hair data parameters may include control vertices, hair color, hair radius, and the like. A principal component analysis (PCA) may be performed on the arrays of hair data. PCA may yield new basis vectors, varying in length, with the largest basis vector corresponding to a new dimension with the largest variance in hair data. The hair data may be quantized based on the varying lengths of new basis vectors. The number of bits allocated for quantizing each new dimension corresponding to each new basis vector may be determined based on the relative lengths of new basis vectors, with more bits allocated to dimensions corresponding to longer basis vectors. The quantized hair data may be bit-packed and then compressed using lossless entropy encoding. | 09-18-2014 |