Abstract: A method and apparatus that allows for the identification and correction of defective pixels and/or pixel clusters in an imaging device. The method, and implementing apparatus determines that a pixel is defective based upon a comparison of its pixel signal value with the value of neighboring pixels. In one exemplary embodiment, a pixel is defective if it is beyond a pre-determined threshold of either a high or low value from its neighboring, corrected pixels. Pixels identified as defective can be corrected using exemplary methods of the invention such as substituting a value of the defective pixel with a value of one of its non-defective neighbors.

Abstract: A hybrid block matching prediction and transform based n dimensional signal sequence encoder, including an encoder motion estimator, having a cost function. A first embodiment includes an entropy-based cost function. A second embodiment includes a fast block matching search (motion estimation) method to learn the results from neighboring blocks and perform a large range search with only a small number of points to visit. A third embodiment includes a method to dynamically adjust the cost function parameters and other selected coding control parameters based on encoder outputs to optimize the quality and performance of the encoder. A fourth embodiment includes a method to enable exploring and rapid processing of fractional grid points for n dimensional block matching search (motion estimation). A fifth embodiment includes a hybrid block matching prediction and transform-based n dimensional signal sequence decoder.

Abstract: An image compression method for compressing groups of pixel data, including the following steps: MSB portions and LSB portions of the pixel data are compressed separately. Further, the LSB portions are grouped according to their associated MSB portions so that similar pixels are compressed together to gain higher a compression ratio. Some LSB portions are truncated to ensure a compression ratio. When performing compression, enhanced variable-length coding is adopted that predicts more accurate dividers by considering weighted combination of adjacent pixels. The quotient of each groups of compression portion is predicted and coded accordingly.

Abstract: A method of encoding digital samples of a set of data representing physical quantities, the encoding including the determination of a path among the samples of the set. The method includes measuring an encoding cost which depends on the path, and modifying the path, the steps of measuring and modifying being reiterated so as to determine a path which minimizes the encoding cost.

Abstract: A device including a variable length coding unit that includes an input unit connected to a stream switching unit, and an output unit connected to the stream switching unit. The input unit to encode at least two input streams simultaneously. The output unit to transmit output streams to an output interface connected to the output unit.

Abstract: There are provided an image processing section for carrying out processing to detect high frequency components of an image, a calculating section for calculating feature data representing distribution of frequency of appearances of high frequency components, a compression parameter setting section for setting compression parameters based on feature data, and a RAW compression processing section for carrying out RAW compression processing for image data based on compression parameters. Together with data size of lossless compression data, such as RAW data, not becoming large, the processing to do this is carried out in a short time.

Abstract: Provided are methods and systems for rate-distortion optimized quantization and for skipping transform blocks that can take into account the rate-distortion tradeoff as well as the perceptual quality of reconstructed video.

Abstract: An image processing apparatus performs variable-length compression on the image data of each block included in one page, and adds a bit to the resultant code data of each block to make it have a constant data length. The apparatus stores the data length of the added bit. On the other hand, the apparatus stores a variable-length code from which the added bit is erased in a storage. If it is determined that respective bits are added to all blocks to make them have the constant data length, the apparatus adds respective bits of different data lengths to variable-length codes read from the storage, thereby converting the data lengths of the blocks into a shorter constant data length than the constant data length.

Abstract: A variable bit rate (VBR) representation of an image sequence is segmented based on a plurality of time intervals. For each of at least two of the time intervals, the method comprises: determining which of the packets, denoted by Pp, in the VBR representation within the presently-considered time interval has a number of blocks of information per unit time greater than a baseline value; determining which of the packets, denoted by Pn, in the VBR representation within the presently-considered time interval has a number of blocks of information per unit time less than the baseline value; and creating a second representation of the image sequence in which some blocks of information Bp are removed from at least one Pp packet and interlaced with blocks of information in at least one Pn packet to produce reformatted packets.

Abstract: Presented herein are system(s), method(s), and apparatus for decoding exponential Golomb codes. In one embodiment, there is presented a system for decoding codes having lengths (L) and information bits. The system comprises a circuit and a multiplexer. The circuit provides the information bits of the codes. The multiplexer provides values for the codes, the values for the codes being a function of 2trunc(L/2).

Abstract: A bitstream generator is described, for placing variable length coding (VLC) data into a fixed width data stream. The bitstream generator includes an input for receiving VLC data; the VLC data may be separated into a value component, and a length component. The bitstream generator also includes an output buffer, a memory module, for storing the VLC data before sending. The bitstream generator also incorporates a backup buffer, which is used to store any overflow data which does not fit in the output buffer. A comparator is used, to determine how much of the VLC data will fit in the output buffer. Any portion of the VLC data which does not fit in the output buffer is stored in the backup buffer.

Abstract: The present invention, in one embodiment, is comprised of a method of performing region-of-interest editing of a video stream in the compressed domain. In accordance with this method, a video stream frame comprising an unwanted portion and a region-of-interest portion is received. The video stream frame is compressed to obtain a compressed video stream frame. The compressed video stream frame is edited to modify the unwanted portion and obtain a compressed video stream frame comprising the region-of-interest portion. Other embodiments of the invention include a computer-readable storage media embodying this method, and a system for region-of-interest editing a compressed video stream to modify unwanted portions of data therein in accordance with this method.

Abstract: The present invention relates to an image capturing apparatus and method in which the image recording time is reduced and the memory capacity required for compression is also reduced. A number-of-bytes calculation unit 302 determines the number of bytes after compression based on an integrated value of high-frequency integrated data supplied from a high-frequency integration processor. Based on the determined number of bytes, a Q-scale calculation unit 303 determines a Q-scale based on which the image data can be compressed one time to a predetermined data size. A Q-table generation unit 304 generates a Q-table based on the Q-scale. A DCT unit 321 performs a discrete cosine transform on the input image data. A quantization processor 322 adjusts the compression ratio of the image data based on the up-to-date Q-table supplied from the Q-table generation unit 304.

Abstract: An apparatus includes a compact table generator module and a storage medium. The compact table generator creates a compact code table having multiple code word groups arranged in one or more hierarchies. Each of these code word groups includes a group mask that corresponds to one or more code words in a variable length code table. The storage medium stores information regarding the code word groups, such as a group mask for each of the code word groups, and a code index for each code word in the variable length code table.

Abstract: A process for improved, lossless data transformation with options for adaptive compression, multidimensional prediction, multi-symbol decoding.

Abstract: By providing an encoded image analysis unit for analyzing an amount of features of images for one screen of inputted encoded image signals, a decoding/regeneration unit for generating regenerative image signals by decoding the encoded image signals and a regenerative image correction unit for correcting the regenerative image signals generated by the decoding/regeneration unit on the basis of the amount of features analyzed by the encoded image analysis unit, an image signal processing device for performing a decoding process, a correction process and the like in order to quickly follow a rapid scene change and clearly display images, its image signal processing method and its image signal processing program product can be provided.

Abstract: An encoding device including: a variable-length code table generation section generating a variable-length code table based on first image data acquired by a first imaging section; and an encoded information generation section generating encoded information by encoding second image data acquired by a second imaging section based on the variable-length code table generated by the variable-length code table generation section.

Abstract: An image compressor of the present invention includes a difference calculating unit and a difference requantizing unit. The difference calculating unit calculates a predicted difference between a pixel value of image data and a predicted value (a calculated value of the pixel value predicted from known data). When a magnitude of the predicted difference exceeds a predefined threshold value, the difference requantizing unit applies the coarse quantization steps to requantize the predicted difference to keep a bit range to predetermined size. In this manner, compressed data, in which a bit length of the predicted difference for one pixel is adjusted to a fixed bit length, is generated.

Abstract: Coded data are inputted from a stream analyzing unit to an entropy decoding unit. A group of peripheral information registers stores peripheral information on a target pixel for estimating a context used for arithmetic decoding of the coded data. Based on the peripheral information stored in the group of peripheral registers, a context estimation unit estimates a context and delivers the estimated context to an arithmetic decoding unit. The arithmetic decoding unit decodes the coded data based on a context label, then derives a decision and supplies the decision to an inverse quantization unit. The peripheral information stored in the group of peripheral registers is updated by a decoding result of the arithmetic decoding unit in the same cycle as the decoding.

Abstract: There are included an image data storing means for accumulating image data of JPEG format; an image dividing means for dividing the accumulated JPEG images; and a distributing means for distributing the divided image data to a client. The image dividing means decides a title area containing an image area required for display at the client, and extracts coefficient data, which corresponds to the title area, from the image data accumulated in the image data storing means. The image dividing means then calculates, as coefficient data to be distributed to the client, the values of AC components of the extracted coefficient data as they are but, as to DC components thereof, a result of addition of the values of the DC components to those in the adjacent, immediately preceding title area. The distributing means distributes, as the image data, the coefficient data as calculated to the client.

Abstract: A process for improved, lossless data transformation with options for adaptive compression, multidimensional prediction, multi-symbol decoding.

Abstract: A method, system and computer-readable medium for achieving a target compression ratio for binary images with a minimum of image degradation. Portions of the binary image are strategically replicated and used to replace adjacent portions of the image. This process is continued until a compressed version of the image data satisfies a target compression ratio.

Abstract: In a method for transmission of video information between HTTP servers and clients in a shared network resource, particularly Internet, the video information is stored as a video file consisting of packet-divided video streams compression-coded with average bit rates t(c) which cover the clients' expected channel bit rates s. Each packet and the video file are supplied with a header containing information for realizing a bandwidth-scalable video transmission over a suitable version of HTTP. During transmission switching between the video streams takes place on the basis pf an estimation of the channel bit rate s and the information in the packet header, such that the bit rate t(c) is adapted to the client's actual channel bit rate s. In a method for client-executed search and retrieval of video information in a shared network resource, particularly searching of a video frame Fx in a packet-divided video stream, the packets in a video stream are divipacket packet in each group.

Abstract: The invention relates to a method of selecting data of a compressed digital signal comprising a plurality of levels of spatial granularity of data, in a communication network comprising at least two communication apparatuses connected together by the network, the digital signal being available at least at one, so-called first, of the communication apparatuses, the data being adapted to be transmitted from the first apparatus to the other, so-called second, communication apparatus, and that data being sufficient to reconstitute a spatial part of the signal termed region of interest which is specified at the second apparatus, characterized in that the method comprises the following steps: determining (S76; S78; S80) at least one level of spatial granularity of data as a function of the region of interest and of the structure and organization of the data in the signal; selecting (S77; S79; S81) data for each determined level of granularity as a function of the region of interest and of the structure and organ

Abstract: A method and an apparatus to encode a series of quantized coefficients of a transform of a block of image data. The method includes forming modes for each encountered non-zero amplitude and forming events for the modes in the mode-modified series formed by setting to zero all non-zero amplitudes other than the amplitude defining the mode. An event for modes for amplitudes greater than 1 is a run of none or more zero-valued coefficients followed a non-zero amplitude in the mode-modified series. A first mode is defined for amplitude 1 wherein an event is a run of none or more zero-valued coefficients followed the amplitude 1 coefficient in the mode-modified series. In another embodiment, a first mode is defined for amplitude 1 wherein an event is a run in the mode-modified series of none or more zero-valued coefficients followed by a run of one of a predefined set of sequences, each sequence in the set being a sequence of l's and 0's starting with a coefficient of amplitude 1.

Abstract: A method for performing a reordering operation on a matrix of input data values, the method comprising: loading the data values into a computer store by forming a plurality of data strings, each data string comprising a plurality of data sub-strings and each data sub-string representing at least one of the data values, and storing each data string in a register of the computer store in which its sub-strings are not individually addressable; and performing a series of data reordering steps operating on one or more of said data strings to reorder said data values; the reordering operation being a scan-wise reordering operation.

Abstract: The present invention relates to an image processing method and apparatus for processing compressed image generated by segmenting image data into a plurality of MCUs and using a compression method in which a frequency transformation is applied to each MCU. In a case that the compressed image is decoded, each MCU is classified according to the frequency coefficients therein, and color separated data is generated for each MCU based on the decoded data resulting from the decoding and the results of the MCU classification.

Abstract: Apparatus and method for selecting an appropriate parameter at decompression are disclosed. In particular, when adaptive block size discrete cosine transform compression is used to compress data, different combinations of sub-blocks can be generated. To decompress the different combinations of sub-blocks, the appropriate parameter is selected based on block size assignment information and the address of data in the data block.

Abstract: An image sending apparatus is provided, in which the image sending apparatus comprises an analyzing syntax of code sequence data, a generation unit generating another code sequence data from the code sequence data by using the analysis result, a unit to measure the load of the generation unit; a unit to generate a parameter corresponding to the load, wherein the generation unit generates the another code sequence data by using the parameter such that the data amount of the another code sequence data to be sent is adjusted according to the load.

Abstract: Embodiments of the present invention may provide a method of compressing an ultrasound image. The method of compressing ultrasound images by coding pixel values of the ultrasound images with a Huffman table, comprises: a) receiving consecutive ultrasound images each having a plurality of pixels; b) determining characteristics of the pixels of the ultrasound images; c) updating the Huffman table based on the characteristics of the pixels of first to (n?1)th ultrasound images, wherein n is an integer greater than 1; and d) coding the pixels of an nth ultrasound image with the updated Huffman table.

Abstract: The present invention relates to a Huffman decoding method. Firstly, a Huffman table including multiple Huffman codes and multiple corresponding size/symbol codes is extracted. Each Huffman code comprises a codeword and each size/symbol code comprises a size code and a symbol code. Then, multiple mask codes are generated according to the size codes. Then, masking operations are performed on successive 16 bits of the compression bit stream and the mask codes, thereby outputting multiple masking results. Subsequently, logic operations on the masking results and the Huffman codes, thereby generating multiple are performed on the new Huffman codes, wherein each new Huffman code includes the codeword. It is discriminated whether the 16 bits of the compression bit stream complies with a specific one of new Huffman codes, thereby outputting the size/symbol code corresponding to the codeword.

Abstract: A circuit generally including a first module, a second module and a third module is disclosed. The first module may be configured to (i) generate a plurality of parsed residual blocks by parsing a plurality of 4×4 CAVLC (context-based adaptive variable length coding) residual blocks received in an input signal and (ii) generate a plurality of metric signals resulting from the parsing of the 4×4 CAVLC residual blocks. The second module configured to generate a plurality of scanning position signals based on the metric signals. The third module configured to generating an 8×8 CABAC (context-based adaptive binary arithmetic coding) residual block in an output signal by up-sampling the parsed residual blocks based on the scanning position signals.

Abstract: A method of context adaptive binary arithmetic coding (CABAC) of a sequence of data slices permits for quick initialization of context models. The data slices include a plurality of binarized symbols with context individual values having one or more bins of the binarized symbol. The method includes resetting an addressable status register for each new data slice where the status register includes status flag for one of a plurality of available context variable values. Context models are selected for each of a plurality of context individual values and are coded according to a selected context model. A selected context model is updated for an actual context index value based on the previous context index value.

Abstract: The invention provides an image encoding/decoding device and method. An encoding/decoding architecture of the invention includes: encoders for encoding image data into data blocks; a reordering multiplexer for receiving the data blocks and determining an order by which the data blocks are written into a memory according to an order of an achieved percentage of an encoding progress for each encoder; a memory writing unit, a memory dispatcher, a memory controller, and a memory reading unit, for writing the data blocks into the memory and reading the data blocks from the memory; a request demultiplexer for receiving the read data blocks from the memory reading unit and outputting the received data blocks according to data request signals; and decoders for generating the data request signals, receiving the output data blocks from the request demultiplexer, decoding the received data blocks, and then outputting the decoded data blocks.

Abstract: A data encoding apparatus operable to encode a plurality of data blocks produces encoded data in accordance with at least one of a selectable target data quantity or a selectable target data quality.

Abstract: A coding method and system with an adaptive bitplane coding mode is provided to code multiple bitplanes of a frame consisting of multiple macroblocks. Each bitplane consists of macroblock modes used by the macroblocks of the frame. The method includes the steps of: (A) initializing a bitplane coding mode of the frame as a compress mode; (B) coding the frame and the bitplanes to thereby obtain coded bitplanes, and calculating the bit number of coded bitplanes; (C) calculating the bit number of uncoded bitplanes; (D) executing step (A) when the bit number of coded bitplanes is smaller than the bit number of uncoded bitplanes; (E) initializing the bitplane coding mode of the frame as a raw mode when the bit number of coded bitplanes is not smaller than the bit number of uncoded bitplanes.

Abstract: An image coding apparatus is provided with a unit operable to scan a two-dimensional array of quantized coefficients into scanned quantized coefficients, the scanning being performed from a low frequency component toward a high frequency component; a unit operable to convert the scanned quantized coefficients into a run value and a level value, the run value indicating the number of continuous quantized coefficients, each having a zero value, and the level value indicating a value of a quantized coefficient having a non-zero value; a unit operable to code the run value; and a unit operable to code the level value, wherein the coding of the run value is performed, from a high frequency component toward a low frequency component, in accordance with information that represents a total number of uncoded quantized coefficients which have not been coded.

Abstract: Method and apparatus for encoding image data is described. In an example, a memory stores bit-planes associated with the image data. Each of the bit-planes is partitioned into data units. A bit modeler communicates with the memory and produces modeled data in response to each of the data units for each of the bit-planes. An arithmetic coder communicates with the bit modeler and produces a coded data in response to each of the modeled data produced by the bit-modeler. In another example, the bit-modeler processes at least two of the bit-planes in parallel.

Abstract: The image quality value of the code block currently processed is monitored, and when it falls below a threshold, encoding of the code block is terminated (in other words, encoding in the subsequent passes is omitted for the code block) to shift to encoding of the next code block.

Abstract: An apparatus for recording image data has an encoding processor that compresses original image data (for example, RAW data), having a plurality of pixels, in accordance with a lossless compression coding; and a recording processor that records the compressed image data or the original image data into a memory. If the size of the compressed image data is larger than that of the original image data, the recording processor records the original image data into the memory without carrying out a compression process.

Abstract: An image forming apparatus having a reading unit which reads image information on an original, a first compression unit which compresses the image information into compressed image information, a first encoding unit which encodes the compressed image information, an interface unit which acquires printing information in a page description language from exterior, a generating unit which generates printing image information on the basis of the printing information, a second compression unit which compresses the printing image information into compressed printing image information, a second encoding unit which encodes the compressed printing image information, a decoding expansion unit which decodes and expands the encoded compressed image information and the encoded compressed printing image information, and a forming unit which forms an image onto a recording medium on the basis of the image information and the printing image information which have been decoded and expanded.

Abstract: An image coding apparatus provides a run-length encoding unit RLE1 that subjects quantized coefficients which are obtained by quantizing frequency components of an image signal to a variable length coding process by using a run value Run that indicates the number of successive zero coefficients and a level value Lev that indicates a value of a non-zero coefficient following the zero coefficients.

Abstract: An apparatus for generating an encrypted data stream representing an audio and/or video signal comprises an encoder for encoding an input signal to generate a data stream with a predefined data stream syntax as output signal. The apparatus further comprises an encryption means coupled with the decoder in order to influence encoder internal data and/or the output signal of the encoder in a uniquely reversible manner based on a key such that the generated encrypted data stream comprises payload information differing from payload information of a data stream that would be generated by the apparatus without the presence of an encryption means and that the generated encrypted data stream comprises the predefined data stream syntax.

Abstract: A method and apparatus for variable accuracy inter-picture timing specification for digital video encoding is disclosed. Specifically, the present invention discloses a system that allows the relative timing of nearby video pictures to be encoded in a very efficient manner. In one embodiment, the display time difference between a current video picture and a nearby video picture is determined. The display time difference is then encoded into a digital representation of the video picture. In a preferred embodiment, the nearby video picture is the most recently transmitted stored picture. For coding efficiency, the display time difference may be encoded using a variable length coding system or arithmetic coding. In an alternate embodiment, the display time difference is encoded as a power of two to reduce the number of bits transmitted.

Abstract: A circuit for encoding a data stream is described. The circuit comprises a non-zero count circuit coupled to receive the data stream and output a count of non-zero coefficients of a block of data of the data stream; a trailing ones detection circuit coupled to receive the data stream and output a number of trailing ones of the block of data; and a memory coupled to the non-zero count circuit and the trailing ones detection circuit and storing encoded data values, the memory outputting an encoded data value for a non-zero coefficient of a block of data based upon the count of non-zero coefficients and the number of trailing ones for the block of data. A method of encoding a data stream is disclosed.

Abstract: The image coding apparatus is constituted comprising an atom extraction section 109 for acquiring position data indicating the positions of atoms of prediction residual data in macroblocks, for each of the macroblocks; and a variable length encoding section 113 for determining the frequency of occurrence distribution of the position data in the macroblocks to be encoded, in accordance with the number of atoms of prediction residual data present in the macroblocks, and for performing arithmetic coding of the position data on the basis of the frequency of occurrence distribution thus determined. An improvement in the efficiency of the entropy coding of the atom parameters of Matching Pursuits coding is therefore feasible.

Abstract: In an image coding method of the present invention, after a process such as DCT is performed to digital image data, quantization process is performed, and then, to resultant quantized transform coefficients, variable length coding process is performed with reference to a variable length code table showing how variable length codes are allocated, and in a comparison process between an event derived from the quantized transform coefficients and a reference event included in the variable length code table, transformation process is performed to increase a possibility of performing variable length coding with satisfactory coding efficiency.

Abstract: An image encoding method forms units respectively made up of a plurality of pixels belonging to within one period of a digital image data having a periodic property, and carries out an encoding using the units as units of encoding, so that two units which are consecutively encoded are separated by an integer multiple of the period.

Abstract: Data of both MPEG-2 and MPEG-4 is generated simultaneously with a small circuit scale and a small power consumption. A moving picture encoding apparatus for encoding a moving picture through motion-compensated inter-frame prediction has: a MPEG-2 encoding unit including a motion vector estimator, a frame memory, a forward prediction circuit, a bidirectional prediction circuit, a prediction selection circuit, an intra-frame encoding circuit and a local decoding circuit; a MPEG-4 encoding unit including a frame extraction circuit for extracting a predetermined MPEG-2 frame and a transcoder for encoding the extracted frame; a motion vector calculator calculating a motion vector to be used for MPEG-4 prediction from a motion vector to be used for MPEG-2 prediction; and a prediction mode controller controlling the prediction mode of the MPEG-2 encoding unit in such that the MPEG-2 prediction mode becomes coincident with the MPEG-4 prediction mode.

Abstract: Disclosed is a video transcoding apparatus converting a specific bit rate of an MPEG (moving pictures experts group) bit stream into a different rate thereof for transportation. The present invention includes a video pre-processing unit having a predetermined matrix structure and down-sampling a macro block decoded by the video decoder by transforming the macro block into a corresponding picture structure to the compressed video bit stream, a transcoding parameter control unit detecting information about a picture from a previous bit stream variable-length-decoded by the video decoder and setting up an encoding mode for a transcoding in accordance with the detected information, etc. Therefore, the present invention does not need the motion estimation unit of encoder and reduce the complexity of the bit allocation unit. When changing HD-rated MPEG sequence over 10 Mbps into NTSC-rated MPEG sequence below 6 Mbps, the present invention reduces calculation time and complexity of hardware.