129 results about "Run length coding" patented technology

A method, system and computer program product for optimal encoding for an image defined by image data. The quantization table, run-length coding and Huffman codebook are selected to minimize a Lagrangian cost function, wherein the minimization includes iteratively determining the optimal run-size pairs and in-category indices for minimizing a rate-distortion cost function, and wherein the rate-distortion cost function includes a perceptual weighting factor applied to a quantization error. The perceptual weighting factor adjusts the rate-distortion cost function to apply greater weight to lower frequency quantization error than to higher frequency quantization error.

A computer readable storage medium tangibly embodying machine-readable digital data arranged to facilitate expedited searching. The data includes a plurality of words residing in a table having rows and columns, each word residing in a different row and each letter of the word occupying a different column in that row. Each continuous run of same letters in a column forms an interval. The words are positioned relative to each other to maximize lengths of the intervals, and / or optimize efficiency of compression of the columns by run length encoding.

Image data is efficiently encoded using a predict coding unit and a run-length coding unit. The predict coding unit encodes a target pixel X on the basis of difference between the value of the target pixel and a predict value calculated from pixels neighboring the target pixel. The run-length coding unit starts the measuring the run when the number of colors contained in four pixels “a”, “b”, “c”, and “d” near the target pixel X is 1, and outputs encoded data of the run when the target pixel is different from an immediately preceding pixel “a”. Then, the predict coding unit starts the encoding. At this time, since the target pixel is different from the preceding pixel, the preceding pixel is excluded from references for generating the predict value. Instead of the preceding pixel, an pixel, which has been encoded, satisfying a specific condition is referred to.

In a mobile wireless communication system automatic speech recognition is performed in a distributed manner using a mobile station based near or front end stage which extracts and vector quantizes recognition feature parameters from frames of an utterance and an infrastructure based back or far end stage which reverses the vector quantization to recover the feature parameters and subjects the feature parameters to a Hidden Markov Model (HMM) evaluation to obtain a recognition decision for the utterance. In order to conserve network capacity, the size (Sz) of the codebook used for the vector quantization, and the corresponding number of bits (B) per codebook index B, are adapted on a dialogue-by-dialogue basis in relation to the vocabulary size |V| for the dialogue. The adaptation, which is performed at the front end, accomplishes a tradeoff between expected recognition rate RR and expected bitrate RR by optimizing a metric which is a function of both. In addition to the frame-wise compression of an utterance into a string of code indices (q-string), further “timewise” compression is obtained by run-length coding the string. The data transmitted from the front end to the back end includes the number of bits (B) per codebook value, which also indicates the codebook size (Sz).

A method, system and computer program product for optimal encoding for an image defined by image data. The quantization table, run-length coding and Huffman codebook are selected to minimize a Lagrangian cost function, wherein the minimization includes iteratively determining the optimal run-size pairs and in-category indices for minimizing a rate-distortion cost function, and wherein the rate-distortion cost function includes a perceptual weighting factor applied to a quantization error. The perceptual weighting factor adjusts the rate-distortion cost function to apply greater weight to lower frequency quantization error than to higher frequency quantization error.

A computer implemented method of video data encoding generates a mask having one bit corresponding each spatial frequency coefficient of a block during quantization. The bit state of the mask depends upon whether the corresponding quantized spatial frequency coefficient is zero or non-zero. The runs of zero quantized spatial frequency coefficients determined by a left most bit detect instruction are determined from the mask and run length encoded. The mask is generated using a look up table to map the scan order of quantization to the zig-zag order of run length encoding. Variable length coding and inverse quantization optionally take place within the run length encoding loop.

Embodiments of the present invention relate to run-length encoded sequences and supporting efficient offset-based updates of values while allowing fast lookups. In an embodiment of the present invention, an indexing scheme is disclosed, herein called count indexes, that supports O(log n) offset-based updates and lookups on a run-length sequence with n runs. In an embodiment, count indexes of the present invention support O(log n) updates on bitmapped sequences of size n. Embodiments of the present invention can be generalize to be applied to block-oriented storage systems.

The invention relates to a graphic space superposition analysis drafting method of a complex vector polygon, belonging to the technical field of spatial analysis drafting and spatial data mining techniques in a geographic information system. The method comprises the steps of: converting two vector polygon graphs into precision run length coding graphs; carrying out overlying transverse superposition, polygon spanning detection and decomposition on another vector polygon graphic chain segment in an interleaved mode and a mode that one of the precision run length coding graphs is used as a background base graph, so as to obtain resolved and unresolved chain segments; screening a qualified chain segment which conforms to the superposition mode to be used as a constituting chain segment of a superposition achievement vector polygon graph; and constructing the superposition achievement vector polygon graph containing a definite spatial relationship. According to the graphic space superposition analysis drafting method, the intersecting judgment of a great number of chain segments and possible misjudgment and omission which are caused by the direct superposition of vector polygon graphs are avoided, the condition for effectively establishing a new topology relationship is created, the operability, the robustness and the practicability of a vector polygon graphic spatial superposition analysis drafting technique are improved.

A computer readable storage medium tangibly embodying machine-readable digital data arranged to facilitate expedited searching. The data includes a plurality of words residing in a table having rows and columns, each word residing in a different row and each letter of the word occupying a different column in that row. Each continuous run of same letters in a column forms an interval. The words are positioned relative to each other to maximize lengths of the intervals, and / or optimize efficiency of compression of the columns by run length encoding.

Methods and systems for compressing an image are described. A plurality of transformed and quantized values associated with a block of image data is accessed. The block corresponds to a position within the image. A count of the number of bits encoded during run-length encoding of the block is made. Run-length encoding of the block is concluded should the count reach a limit.