Abstract: This invention implements a fast lossless transform almost free from a delay with a small calculation amount. The lossless transform can be used to perform lossless coding and lossy coding quickly. A first calculation unit multiplies data D0, D1, D2, and D3 input to the input terminals by respective weighting coefficients {a0, a1, a2, a3} of {½, ?½, ?½, ?½}, and summates the products. A rounding unit in the first calculation unit rounds the sum into an integer and outputs the integer value E. A second calculation unit multiplies the value E by weighting coefficients {b0, b1, b2, b3} of {?1, 1, 1, 1} set for the respective input data, and adds the products to the respective input data. This invention sets, for the relationship between the first and second weighting coefficients, a condition that a0*b0+a1*b1+a2*b2+a3*b3=?2 or 0.

Abstract: A display panel driver includes: a compression circuit, when receiving image data of N×M pixels of a target block, generating compressed image data corresponding to the target block by compressing the image data; an image memory storing the compressed image data; a decompression circuit generating decompressed image data by decompressing the compressed image data from the image memory; and a drive circuit driving a display panel in response to the decompressed image data. The compression circuit selects one of a plurality of compression methods based on a correlation between the image data of the N×M pixels, and generates the compressed image data by the selected compression method.

Abstract: Associative matrix compression methods, systems, computer program products and data structures compress an association matrix that contains counts that indicate associations among pairs of attributes. Selective bit plane representations of those selected segments of the association matrix that have at least one count is performed, to allow compression. More specifically, a set of segments is generated, a respective one of which defines a subset, greater than one, of the pairs of attributes. Selective identifications of those segments that have at least one count are stored. The at least one count that is associated with a respective identified segment is also stored as at least one bit plane representation. The at least one bit plane representation identifies a value of the at least one associated count for a bit position of the count that corresponds to the associated bit plane.

Abstract: A method and apparatus for encoding an image is provided. The method and apparatus include quantizing and entropy encoding a second frequency coefficient matrix that is generated by performing a partial exchange of one or more values between rows and between columns of a first frequency coefficient matrix. A method and apparatus for decoding image data that is encoded by using the method and apparatus for encoding the image is also provided.

Abstract: A method and apparatus of improving the compression efficiency of a motion vector by efficiently predicting a motion vector in an enhancement layer from a motion vector in a base layer in a video coding method using a multi-layer are provided.

Abstract: A method and apparatus for compressing data is described. A compressor builds a dictionary associated with the characters in the input string. A table in the dictionary is generated by looking backward from a current character being encoded in the input string to determine the last time the most recent one or more characters have occurred. The compressor determines whether the following characters at a point of encoding matches the next character being encoded.

Abstract: A system, computer program product and method are provided that smooth handwritten information following the transmission of handwritten data to a second computing device, thereby reducing the memory, processing and communications bandwidth requirements of a first computing device that captured the handwritten information. A system, computer program product and method are also provided for creating new points in the vicinity of at least some of the data points of the handwritten data after transmission of the data, thereby effectively improving the resolution of the handwritten information without increasing the memory, processing and communications bandwidth requirements of the first computing device.

Abstract: Methods and apparatus for generating images, compressing image data, decompressing image data, and processing the decompressed image data so that it can be used by a rendering circuit of a device, e.g., a set top box, are described. Images are generated in the native format used by the rendering circuit of the device which will ultimately control the display of the image avoiding the need to perform processing associated with converting color component information from one format to another. Uncompressed image data is arranged in a file with color component values being grouped separately from alpha values to facilitate compression by a standard file compression technique. The file is compressed using a conventional file compression operation. The compressed image file is decompressed when needed and the alpha data and color component data is reorganized so that the color component values and alpha value(s) corresponding to individual pixels are grouped together.

Abstract: When compressing continuous tone bit map image data, the image compression section of the image compressing apparatus segments the continuous tone bit map image data into bit map image data for lossy compression, index image data for lossless compression and bit map image data for lossless compression based on pixel identification information data. The lossy compression section of the image compression section performs lossy compression process according to the JPEG method for the bit map image data for lossy compression, and the first lossless compression section thereof performs lossless compression process according to the JBIG method for the index image data for lossless compression. Furthermore, the second lossless compression section thereof performs lossless compression process according to the JPEG-LS method for the bit map image data for lossless compression.

Abstract: There is described in one embodiment an indicia reading terminal having an image sensor pixel array incorporated therein, wherein the terminal is operative for decoding of decodable indicia and for providing color frames of image data for storage or transmission. An imaging terminal in one embodiment can include an image sensor having a hybrid monochrome and color image sensor pixel array including a first subset of monochrome pixels and a second subset of color pixels. Embodiments of data compression circuits and/or methods for processing image data from the hybrid image sensor pixel array are provided.

Abstract: High depth grayscale images, (e.g. <8 bits per pixel) are losslessly cross channel encoded to multi-channel image formats for transformation and display by display devices not capable of displaying high depth grayscale. DICOM and other images may be encoded and provided to web browser based client image viewers that leverage native code for handling multi-channel images. Transformations are applied to reconstitute the high depth grayscale images.

Abstract: The temporal and/or spatial characteristics of a macroblock are analyzed in order to reduce the number of modes for which motion estimation and rate distortion efficiency calculations are to be performed. In one embodiment, macroblock mean and variance characteristics are analyzed to merge sub-blocks together within the macroblock. These merged sub-blocks may be used to identify both inter and intra modes for the macroblock.

Abstract: A pixel block (300) is losslessly compressed into a candidate compressed block. If the bit length of the candidate block exceeds a threshold value, the property values of the pixels (310-317) in the block (300) are quantized and the quantized values are losslessly compressed into a new candidate compressed block. The procedure is repeated until a candidate compressed block having good image quality and a bit length below the threshold value is found. A compressed representation (400) of the block (300) is determined based on the found candidate compressed block (420) and an identifier (410) of the used quantization parameter.

Abstract: During compressing an image at the compression processing section (image compressing apparatus), the color image processing apparatus detects edge of text and/or line art, generates the foreground layer represented by binary image for showing the detected edge, compresses the foreground layer with lossless compression, and compresses the background layer which is an image except the foreground layer with lossy compression. Furthermore, the color image processing apparatus sets the foreground layer color different from a color of text or line art, and provides information representing the set color into the compression file. As the set color, the color image processing apparatus utilizes the overall color representative for whole region of the image, or the text-vicinity color in the image. The edge region of the text and/or line art are represented with such the set color on the reproduced image based on the compression file.

Abstract: An image processing method of processing image portrayal information used for rendering by attaching textures includes separating a texture area to which the texture is attached and a non-texture area to which the texture is not attached in a coordinate system of a rendering-completed image represented by the image portrayal information, compressing the image portrayal information of the non-texture area by a first compression method, and compressing the image portrayal information of the texture area by a second compression method different from the first compression method.

Abstract: An apparatus and method generate encoded data including lossless- and lossy-encoded data together within a unit time period while fully using the lossy encoding processing capability, by appropriately setting a threshold associated with the number of tiles. To this end, an image encoding apparatus has a lossless encoding processing unit and a lossy encoding processing unit. The lossless encoding processing unit outputs one of lossless-encoded data and non-encoded data from a selection unit to a memory based on the attribute information for each tile. Every time the total data size of non-encoded data output from the selection unit exceeds a predetermined threshold, a resolution converting unit executes processing for decreasing the resolution of the non-encoded data in the memory. Upon completion of storage of data for one page in the memory, a lossy encoding unit begins to generate lossy-encoded data from the non-encoded data.

Abstract: An arithmetic encoder is provided for converting an event sequence comprised of a plurality of events to an information sequence comprised of at least one information piece, and includes a core engine for receiving an event of the event sequence, and a probability estimate from a probability estimator, and generating zero or more pieces of the information sequence responsive to the received event and the probability estimate by bounding the ratio of events to information pieces. An arithmetic encoder is provided that is capable of constraining a number of events in at least one event sequence as a function of the number of generated information pieces in at least one information sequence.

Abstract: In order to output amplitude data with the clock frequency higher than the clock frequency of phase data, the direct digital synthesizer for transmission and detection comprises: a transmitting phase for outputting a first phase data with a first clock frequency; a curtailing unit for outputting a second phase data with a second clock frequency smaller than the first clock frequency, and outputting additional data for compensating for phase information disappeared with curtailing process; an interpolating unit for outputting a third phase data with a third clock frequency larger than the first frequency by implementing interpolating process to the second phase data, and a detecting waveform for outputting amplitude data in accordance with the third phase data. The detecting signal amplitude data can be outputted with the third clock frequency higher than the second clock frequency of the second phase data transmitted.

Abstract: A color image residue transform and/or inverse transform method and apparatus, and a color image encoding and/or decoding method and apparatus using the same are provided. The residue transform method includes: obtaining a residue corresponding to the difference of an original image and a predicted image; and transforming the residue by using a relation between residues of color image components. The residue inverse transform method includes: generating a residue for each component by performing residue inverse transform of the residue transformed original image; and restoring the original image by adding a predicted image to the residue of each component. Also, the color image lossless encoding method using the residue transform includes: obtaining a residue corresponding to the difference of an original image and a predicted image; and performing encoding by transforming the residue by using the relation between residues of predetermined components.

Abstract: Methods for compression of two-dimensional data arrays which are piece-wise smooth in one direction and have oscillating events in the other direction. In one embodiment, a wavelet transform is applied in the piece-wise smooth direction and a local cosine transform (LCT) is applied in the direction with oscillatory events, both producing respective transform coefficients. The LCT coefficients are reordered to mimic a wavelet transform coefficient order, and both wavelet transform and reordered LCT coefficients are quantized and entropy coded to obtain a compressed 2D image. In some embodiments with oscillatory events in both directions, a LCT is applied in both directions and all the LCT coefficients in each direction are reordered before the quantization and entropy coding.

Abstract: Systems and methods for streaming video information to a hand-held device include dynamically modifying video image properties of captured video frames to generate video data packets of a size suitable for transmission over a low bit-rate channel to a hand-held device for viewing. The systems and methods may dynamically and automatically control image properties via a hardware capture card device driver to produce a video data packet of a desired maximum data size such that subsequent compression and coding strategies produce a data packet suitable for transmission to the hand-held device for decoding and decompression to display the streaming video in near real-time.

Abstract: An encoding method for dividing a bit string of an input signal at a position of x bits from a least significant bit into a high-order bit string and a low-order bit string, performing variable-length-encoding of the high-order bit string, and performing fixed-length-encoding of the low-order bit string includes deriving a reference integer I close to 2x (x=m/2, m is an integer of 0 or more); obtaining a quotient and a remainder that are determined by performing a dividing operation on numerical values represented respectively by the bit strings by using the reference integer I; and performing variable-length-encoding of each of quotients of two consecutive bit strings, combining remainders corresponding to the quotients and performing fixed-length-encoding of the result, and generating a codeword.

Abstract: A method and apparatus are provided for communicating information. This may include comparing a current item list with a reference item list and determining a type of classification based on the comparison. That is, the comparison may determine a difference between the current item list and the reference item list. Information regarding this difference may be sent from a first entity to a second entity.

Abstract: Current methods of embedding hidden data in an image inevitably distort the original image by noise. This distortion cannot generally be removed completely because of quantization, bit-replacement, or truncation at the grayscales 0 and 255. The distortion, though often small, may make the original image unacceptable for medical applications, or for military and law enforcement applications where an image must be inspected under unusual viewing conditions (e.g., after filtering or extreme zoom). The present invention provides high-capacity embedding of data that is lossless (or distortion-free) because, after embedded information is extracted from a cover image, we revert to an exact copy of the original image before the embedding took place. This new technique is a powerful tool for a variety of tasks, including lossless robust watermarking, lossless authentication with fragile watermarks, and steganalysis. The technique is applicable to raw, uncompressed formats (e.g., BMP, PCX, PGM, RAS, etc.

Abstract: An image communication apparatus includes an unit for obtaining a threshold value that determines a coding format used for transmission of an image stored for the transmission from an information of the image stored for the transmission; and a transmission controlling unit flat transmits the image stored for the transmission using a JBIG format if a size of the image stored for the transmission exceeds the threshold value, and transmits the image using a coding format having a compression ratio lower than that of the JBIG format if the size of the image stored for the transmission does not exceed the threshold value.

Abstract: An apparatus for downloading a multimedia file including a file converter configured to convert a larger multimedia file into a smaller multimedia file by deleting prescribed medial information based on a media format contained in the larger file. Further, the file converter converts the larger file into the smaller file by deleting multi bit-rate media not corresponding to a selected bit rate or by deleting enhancement layer video.

Abstract: A system and method for bit-exact lossless compression coding of still and moving images. An original image is encoded to produce a lossy compressed image, and is also used to construct a sorted list of bin values to which the lossy image is compared to generate output from which the original image can be losslessly reconstructed. The similarity of corresponding pixel values between the lossy image and the original image permits efficient generation of a lossless residual that allows for bit-exact reproduction of the original image. Pixel values nearly equidistant from two sorted list values are on a “cusp” and either directly coded or flagged as cusp values from which corresponding lossless values can be re-determined. Non-cusp pixel values are coded as the difference between the index of the sorted bin having a value nearest to the floating point value being processed, and the index of the sorted bin containing the exact pixel value of the original image.

Abstract: The present invention relates to a method of storing and restoring an iris image, the method comprising the steps of: acquiring an original image Iori including an iris portion from a camera; acquiring a first image Iextract1 configured with an area removed of portions outside of an outer circle and images included within an inner circle (hereinafter, referred to as an ‘iris enveloping annulus’) in order to extract an iris image to be stored from the original image; acquiring a second image Iextract2 removed of an occlusion portion of the iris, such as a pupil, a white of an eye, an eyelash, an eyelid, hairs, and the like, from the first image; converting the second image Iextract2 removed of the occlusion portion into a polar image Ipolar of a polar coordinate system, or acquiring a compressed image Icomp compressing the converted polar image; storing the compressed image Icomp in memory, together with restoration information H, as storage image data Istore; and acquiring a restored image Irestored using a r

Abstract: A data compression system and method for that is capable of detecting and eliminating repeated phrases of variable length within a window of virtually unlimited size.

Abstract: In an image processing device, a transfer unit enlarges or reduces the image data at the transfer magnification by performing an enlarging or reducing process on the image data once, when the transfer magnification is equal to or smaller than an upper limit or equal to or greater than a lower limit. The transfer unit also repeats, by a plurality of times, a process of performing an enlarging or reducing process on an image data stored in a first region of a storage unit at a divided-transfer magnification equal to or smaller than the upper limit or equal to or greater than the lower limit and then storing the image data in a second region of the storage unit, when the transfer magnification is above the upper limit or below the lower limit.

Abstract: Color conversion apparatus and methods are provided for converting a first color value, such as an RGB, L*a*b* or XYZ color value, to a second color value, such as an RGB, CMY, CMKY, L*a*b*, L,C1C2, or XYZ color value, without saturation error.

Abstract: The method compresses image data into a fixed sized memory. The image is encoded in scans, where the scans are ordered from a perceptually most significant scan to a perceptually least significant scan. The scans also have an attribute 210 determining whether a scan is active or inactive. The method comprises an encoding, transferring and setting step. The encoding step 326, 348 encodes active scans of image data into scan bit-stream data. The transferring step 330, 352 transfers the encoded scan bit-stream data to the fixed size memory. The setting step 452 sets, if the fixed size memory becomes full, the attribute of a perceptually least significant scan to inactive.

Abstract: In a method for compressing an image, source data is converted into a series of blocks each containing one or more colors. A baseline target block size is determined based upon a target compression ratio for the source data. For each block in turn, a compression mode is selected from mode families, where the mode families include an n-color mode family, an interpolated mode family, a raw mode family, a BTC-VQ mode family, a lossless mode family, and a 4×4 transform mode family. In addition, for each block in turn, the block is compressed using the selected compression mode to yield a corresponding compressed block.

Abstract: An imaging system incorporating adaptive compression which includes determining linear predictive differential residuals from an imager array pixel row. The differential residuals are classified into categories, each category having a range of differential residuals associated with it. The categories are analyzed to produce an ordered list having categories with most to least frequent residuals falling within a respective residual range associated with a respective category. The ordered list is then used to select a variable length encoding table with a matching ordered list. Variable length encoded category and range position offset data is output to a serializer unit, where the range position offset refers to a position in a range associated with a particular category.

Abstract: This invention implements a fast lossless transform almost free from a delay with a small calculation amount. The lossless transform can be used to perform lossless coding and lossy coding quickly. A first calculation unit multiplies data D0, D1, D2, and D3 input to the input terminals by respective weighting coefficients {a0, a1, a2, a3} of {½, ?½, ?½, ?½}, and summates the products. A rounding unit in the first calculation unit rounds the sum into an integer and outputs the integer value E. A second calculation unit multiplies the value E by weighting coefficients {b0, b1, b2, b3} of {?1, 1, 1, 1} set for the respective input data, and adds the products to the respective input data. This invention sets, for the relationship between the first and second weighting coefficients, a condition that a0*b0+a1*b1+a2*b2+a3*b3=?2 or 0.

Abstract: A computer implemented method of storing pixel data corresponding to a pixel is disclosed. A first and a second set of pixel data is determined for the pixel. Parity bits for the first set of pixel data are generated, using error correction. An encoded version of the first set of pixel data including the parity bits is stored. An encoded version of the second set of pixel data is stored, using lossless data compression, for use in decoding the first set of pixel data.

Abstract: Resolution interpolation data is generated by relatively simple processing. This enables image encoding by simple and quick processing to attain high image quality and high compression performance. To do this, a tile divider extracts tile data of 32×32 pixels from encoding target original image data. A resolution converter samples one pixel of a block of 2×2 pixels in the tile data, thereby generating reduced tile data of a reduced image. An interpolation data generator generates interpolation data to be used to generate tile data having the original resolution from the reduced tile data. Based on the interpolation data of a tile of interest, an encoding method selector outputs a control signal indicating which one of lossless encoding and lossy encoding should be executed for the reduced tile data. A code stream generator outputs the generated encoded data and interpolation data as encoded image data.

Abstract: The methods and apparatuses detect a plurality of pixels within a frame; separate a portion of the plurality of pixels into a lossless category based on inclusion of the portion of the plurality of pixels within a color list; and identify a particular pixel as an isolated pixel through a single point identification module wherein the particular pixel is within the portion of the plurality of pixels.

Abstract: Entropy coding and decoding techniques are described, which may be implemented separately or in combination. For example, a video encoder uses two-layer run level coding to reduce bitrate for frequency transform coefficients in a quick and efficient manner, and a video decoder uses corresponding two-layer run level decoding. This two-layer coding/decoding can be generalized to more than two layers of run level coding/decoding. The video encoder and decoder exploit common patterns in run level information to reduce code table size and create opportunities for early termination of decoding. Using zoned Huffman code tables helps limit overall table size while still providing a level of adaptivity in encoding and decoding. Using embedded Huffman code tables allows the encoder and decoder to reuse codes for 8×8, 8×4, 4×8, and 4×4 blocks.

Abstract: An image compression algorithm (10) and complementary decompression algorithm (20) are disclosed. The compression algorithm (10) maintains a set of reference points (610, 611, 612 and 613), each reference point having a predetermined spatial relationship with a current pixel (600). An adjustment along scanlines of the reference points is determined. Each of the reference points (611, 612 and 613) is then adjusted by the determined adjustment. A search for a match between one of the strings of consecutive previously scanned pixels including one of the adjusted reference pixels and the string of consecutive pixels including the current pixel is then conducted, and if a match is found, then an identifier for the reference pixel included in the match and the length of the matching string of consecutive pixels are encoded to an output stream.

Abstract: In an image generation and rendering system, a quality stamp indicative of image fidelity is embedded in image data units resulting from image data compression/encoding. At decoding, the image quality stamp is captured and when the decoded image is rendered, a fidelity indicator is displayed along with the image.

Abstract: The present invention performs a lossless four-point orthogonal transformation with reduced rounding errors using a simple configuration. A data transformation apparatus receives four items of vector data X0, X1, X2, and X3, ( Y 0 Y 1 Y 2 Y 3 ) = 1 1 + a 2 ? ( 1 a a a 2 a - 1 a 2 - a a a 2 - 1 - a a 2 - a - a 1 ) ? ( X 0 X 1 X 2 X 3 ) and determines D0 to D3 as: D0=X0+aX1+aX2+a2X3; D1=aX0?X1+a2X2?aX3; D2=aX0+a2X1?X2?aX3; and D3=a2X0?aX1?aX2+X3. Integer data smaller than half a divisor {1+a2} is added to D1 to determine D1?, and a value equal to half the divisor is added to D0, D2, and D3 to determine D0?, D2?, and D3?, respectively. D0?, D1?, D2?, and D3? are divided by the divisor and the results are rounded such that resulting integers are smaller than the results of division, and outputting the resulting integers.

Abstract: The invention relates to a method as well as a system, a device, an encoder and a decoder, and a computer software product for image processing by the method. In the invention, the number of bits is limited in the bit string of a pixel to be processed, wherein the pixel is encoded with the limited number of bits. A prediction value corresponding to said pixel is searched for. If it is found, the difference between the pixel and the prediction value is determined, to select the method for encoding the bit string of said pixel. Also, a code word is encoded in the bit string, to indicate the selected encoding method. If the prediction value is missing, the number of bits in said pixel is limited by quantizing. By means of the invention, a fixed number of bits is obtained for all encoded pixels in an image.

Abstract: Microsoft's recently proposed new image compression codec JPEG XR is currently undergoing ISO standardization as JPEG-XR. Even though performance measurements carried out by the JPEG committee indicated that the PSNR performance of JPEG XR is competitive, the visual performance of JPEG XR showed notable deficits, both in subjective and objective tests. This paper introduces various techniques that improve the visual performance of JPEG XR without leaving the current codestream definition. Objective measurements performed by the author indicate that the modified encoder, while staying backwards compatible to the current standard proposition, improves visual performance significantly, and the performance of the modified encoder is similar to JPEG.

Abstract: In accordance with one or more implementations of the present principles, digital medical images may be efficiently transmitted between industry protocol compliant stations. Proxies may be employed to intercept messages and data transmitted between the stations and to enable transmission of data between the stations in compressed form. Further, the proxies may be incorporated into existing systems without altering integrated components to permit efficient and seamless implementation of one or more compression schemes.

Abstract: In a lossless compression-encoding device, a calculation part calculates differences between different types of pixel data representing the first, second and third color components of an image, and outputs the calculated differences as a plurality of types of difference data. A lossless compression-encoding part performs lossless compression-encoding on each of color component data which include the different types of the pixel data representing the first to third color components and the plurality of the types of the difference data, and outputs a plurality of types of compressed data which correspond to the respective types of the color component data.

Abstract: A method for quantizing signal values of a signal received or to be transmitted via a radio interface including quantizing signal values that lie within a first value range according to a first quantization having a multiplicity of quantization steps wherein the quantization step width between two quantization steps differs from a linear quantization with the same number of quantization steps at most by the step width of the linear quantization with the same number of quantization steps; and quantizing signal values that lie within a second value range according to a second quantization having a multiplicity of quantization steps wherein the quantization step width between two quantization steps is larger than the quantization step width between two quantization steps of the first quantization.

Abstract: Predictive lossless coding provides effective lossless image compression of both photographic and graphics content in image and video media. Predictive lossless coding can operate on a macroblock basis for compatibility with existing image and video codecs. Predictive lossless coding chooses and applies one of multiple available differential pulse-code modulation (DPCM) modes to individual macro-blocks to produce DPCM residuals having a closer to optimal distribution for run-length, Golomb Rice RLGR entropy encoding. This permits effective lossless entropy encoding despite the differing characteristics of photographic and graphics image content.

Abstract: Lossless image compression is performed by receiving and opening an original image file representing an image. A pixel path is determined in the image by analyzing one or more complex structures in the image. The one or more complex structures are represented using a mathematical expression. Each of the pixels along the determined pixel path is replaced to minimize the complex structure, thus providing a compressed image file having a smaller file size than the original image file. A comment is inserted in the compressed image file specifying the determined pixel path. The compressed image file is stored on a computer-readable storage medium.

Abstract: An image processing method is provided. The image processing method includes obtaining a least significant bit (LSB) associated with a pixel block. Further, two bits are reduced from a bit number of each of the pixels of the pixel block. Thereafter whether to carry the pixel or not is determined according to the LSB. When the LSB is 01 or 11, the carry manners of each pixel of the pixel block in two consecutive frames are asymmetric one to another. Further, under the conditions of when the LSB is 01 and 11, respectively, the carry manners of the pixels of the pixel block mutually compensate. Therefore, the display performance of a display is improved.