Abstract: An image data expansion apparatus including a decoder for decoding compressed image data at a frame rate controlled to be lower in a scene where the change is small than that in a scene where the change is large; an expander for expanding the compressed image data decoded by the decoder, the input image data being reproduced such that the frame rate is lower in a scene where the change between images is small than the frame rate in a scene where the change between images is large; and an image interpolator for generating an interpolation image from the input predetermined compressed image data in accordance with the information on the frame rate outputted with the compression image data. The reproduced input image data is interpolated with an interpolation image generated by interpolation processing by the image interpolator, and the interpolated image data is outputted.

Abstract: To deeply encrypt and embed auxiliary information into image data, table generation means generates a table, based on a quantization error which occurs when image data S0 is converted from a first color space, to which the image data S0 belongs, to a second color space that is a destination of conversion. The table represents which color coordinate of a second color space a color coordinate of a first color space is mapped onto. In coding means, information H0 to be embedded is coded by referring to the table, whereby coded auxiliary information H1 is obtained. When the image data S0 is converted in color conversion means, the auxiliary information H1 is embedded into the quantization error, whereby image data S1 embedded with the auxiliary information H1 is obtained.

Abstract: The present invention relates to an image data reconstructing apparatus for reconstructing an original image by dividing image data into a plurality of blocks each comprising N×N picture elements, performing two-dimensional orthogonal transform on each of the blocks, quantizing and encoding the result of the two-dimensional orthogonal transform, decoding the encoded result, dequantizing and two-dimensional inverse orthogonal transforming the above result, wherein an operation associated with the multiplication is skipped if a multiplication by zero is detected when two-dimensional inverse orthogonal transform is performed. Before performing dequantization, two block volume of buffer is provided before or after performing two-dimensional inverse orthogonal transform for executing a pipeline process.

Abstract: An object of the invention is to enable not only to select an ODD signal and an EVEN signal on the same timing but also to set up a duty ratio of the ODD-signal component to the EVEN signal component to be 50%. The purposes are attained by use of a constitution wherein on an analogue signal processing circuit for processing the ODD-signal and the EVEN-signal divided from an output image signal produced from a CCD-type sensor to have the same phase which are then digitized by a singular A/D converter, a sample-hold circuit driven by a control signal during a CCD clock pulse period is provided in a correlated dual sampling circuit, which deals with the EVEN-signal, additionally with respect to another correlated dual sampling circuit, which deals with the ODD-signal, to shift a phase of the EVEN signal.

Abstract: A bit-plane processor reads out a code block, which serves as a unit for arithmetic coding, from an SRAM. After converting the code block to the form of a bit-plane, the bit-plane processor supplies bit data to a pass processor. The pass processor includes an s pass processor, an r pass processor and a c pass processor. Each of s pass, r pass and c pass processings are executed in parallel in a state such that start time thereof is shifted by a predetermined unit time by operation of two delay units.

Abstract: The present invention relates to an image coding apparatus/method, an image decoding apparatus/method, and a transmission medium, which conduct high-efficiency coding or decoding of an image, and applicable in a system performing efficient transmission or accumulation of images. In coding an image after splitting the image into a plurality of bands, the invention is characterized in a process comprising the steps of splitting the image into a plurality of bands, applying quadrature transformation to the images of the resultant band components, quantizing the resultant quadrature transformation coefficients, and generating a coded bit stream by variable-length-coding the quantization coefficient. This permits coding less susceptible to block strain at a high compression ratio.

Abstract: Image data compression method and apparatus which improves image quality in a scene where image greatly changes and reduces the image data, and image transmission system and monitoring system using the method and apparatus. The image data compression apparatus which compresses input image data and outputs compressed image data comprises a detection unit which detects a motion or change of each scene, a determination unit which determines the detected motion amount or change amount, a switch circuit which controls a frame rate in accordance with the results of determination, and a compression encoding unit which compression-encodes the image data. The apparatus performs control such that an image having small motion amount and small change amount with respect to a predetermined image is not compression-encoded, so that the frame rate in a scene where the motion or change is large is higher than that in a scene where the motion and change are small.

Abstract: An image processing apparatus is composed of an image memory comprising a plurality of memory elements, and a processor unit comprising a plurality of processor elements. By suitably engineering the arrangement of the image memory of memory elements, the arrangement of the processor unit of processor elements and the connections among the memory elements and processor elements, it is possible to realize, through a simple construction, high-speed image processing such as image density conversion, image color conversion, image masking, image spatial filtering, image enlargement, image reduction, image rotation, image compression, image extension and image color correction. Also provided are an image processing apparatus for a color image, composed of a plurality of image memories and a plurality of processor elements, and a generalized, multifunctional data parallel processing apparatus capable of processing a large volume of data at high speed.

Abstract: A method and apparatus for processing an input signal for transmission and/or storage, uses an analysis filter bank (21;51) to decompose the signal into sub-band signals which are used to modulate a plurality of carriers. The carriers are combined into a single encoded signal for transmission/storage. The encoder/decoder is especially applicable to telecommunications systems and recording systems. The analysis filter bank may comprise a multiresolution filter, such as an octave band filter bank (40A/B/C/D . . . 43A/B/C/D) implementing Discrete Wavelet Transform. The modulation may comprise double-sideband, single sideband, quadrature amplitude modulation, and so on. Where the input signal is analog, the carriers may be modulated directly by the sub-band signals. Where the input signal is digital, however, the sub-band signals are interpolated, all to the same rate, and then used to modulate the carriers.

Abstract: A method and system for compressing video data in a computer has video processing that is distributed between preprocessing hardware in a video capture/controller card and a central processing unit of the computer. Frames of video data are passed to a motion estimation unit of the preprocessing hardware. This unit generates motion information describing inter-frame changes in the video data. Next, motion-compensated temporal filtering is performed on the frames of video data using the motion information. A video frame processing unit of the controller card, used for processing video data to the monitor, is reused for the temporal filtering of the input video data. Finally, the temporally-filtered video data is passed to the central processing unit, which performs inter-frame and/or intra-frame compression with reference to the motion information.

Abstract: Method and system aspects for reducing memory storage requirements during decompression of tiled image data are described. Included in a method aspect, and system for achieving same, are identification of a number of tiles in each row of an image, and decompression of a bitstream of compressed image data from the number of tiles in parallel to fill a band buffer with a minimum number of lines needed for processing a scan line of the image.

Abstract: A diagnostic system includes an image acquisition unit (1), an image coding and recording unit (2) and an image information retrieval unit (9). The image acquisition unit (1) acquires moving-image information relating to an object (3) to be examined which information represents a series of images that succeed one another in time. The image coding and recording unit (2) includes a first coding unit (4) for converting the series of images into a first data stream in accordance with first conversion rules optimised for the compression of moving-image information, and a second coding unit (6) for converting the series of images into a second data stream in accordance with second conversion rules optimized for the compression of still-image information. The average amount of information per coded image is smaller for the first coding unit (4) than for the second coding unit (6).

Abstract: The invention provides a picture data decompression apparatus which reduces the time required for decompression of picture data and operates at a high speed. The picture data decompression apparatus includes a module switching section for extracting code patterns in units of n bits the compressed picture data, m decoding and dequantization modules, and an inverse orthogonal transform section for inverse orthogonal transforming decoded and dequantized data from the m decoding and dequantization means. Each of the decoding and dequantization modules decodes and dequantizes, from a code pattern in units of n bits extracted by the module switching section, only a predetermined variable length code of a single unique code pattern of n bits from among m different predetermined patterns.

Abstract: A digital video encode system, method and computer program product are described wherein a picture is divided into multiple active areas that are parallel encoded using multiple encoders. The encoders associated with adjoining active areas of the picture are configured to exchange reference data to facilitate avoiding appearance of a seam between the adjoining active areas of a subsequent picture in a sequence of pictures due to separate encoding thereof by the multiple encoders. The reference data transferred from one encoder to an adjoining encoder is an encoded and decoded section of the picture and is used by the adjoining encoder as an expanded reference area for motion estimation when encoding the subsequent picture.

Abstract: A data handling method is provided for handling digitized data through compression/decompression and utilization. By this method, the original digitized data are concurrently compressed into a first set of compressed data through a low-compression-rate compression process and a second set of compressed data through a high-compression-rate compression process. Then, the first and second sets of compressed data are transferred together to an information processing unit, such as a personal computer. At the personal computer, the first set of compressed data are decompressed to obtain a set of decompressed data representing the original digitized data for output of the original digitized data at an output device, while the second set of compressed data remain in compressed form for storage and further transfer. Since the information processing unit needs to perform just a simple decompression process to decompress the low-compression-rate set of compressed data, the overall system efficiency can be increased.

Abstract: A multiple description (MD) joint source-channel (JSC) encoder in accordance with the invention encodes n components of a signal for transmission over in channels of a communication medium. In illustrative embodiments, the invention provides optimal or near-optimal transforms for applications in which at least one of n and m is greater than two, and applications in which the failure probabilities of the m channels are non-independent and non-equivalent. The signal to be encoded may be a data signal, a speech signal, an audio signal, an image signal, a video signal or other type of signal, and each of the m channels may correspond to a packet or a group of packets to be transmitted over the medium. A given n×m transform implemented by the MD JSC encoder may be in the form of a cascade structure of several transforms each having dimension less than n×m. The transform may also be configured to provide a substantially equivalent rate for each of the m channels.

Abstract: A digital information reproduction apparatus for compressing frames of data so as to intermittently reproduce the data in fast-forward speed. A data re-write device retrieves a reproduction-target frame for the fast-forward reproduction and a parameter-calculation-target frame exclusively for calculation of the frame data parameters. The frames then are transferred to a RAM. A decoder determines the frame data in the RAM, calculates the parameter-calculation frame data, and decodes the reproduction frame data by use of the parameter obtained as above. The described operation prevents expending the reproduction frame data with an incorrect parameter so as to normally fast-forward reproduce the compressed data. Furthermore, the present can select a frame used in the fast forward reproduction according to a feature index so that a section subjected to the fast-forward reproduction can be easily grasped by the user.

Abstract: The invention provides a parallel data processing device having an array of parallel processing elements (LPA1 . . . 320) for processing a signal to obtain parallel streams of data, and means (TSMM1 . . . 80) for shuffling the parallel streams of data in a block-wise manner. The data shuffling means (TSMM1 . . . 80) have an array of addressable switch memory matrices (TSMM1 . . . 80) which are each coupled to a predetermined number of processing elements (LPA1 . . . 320). The array of switch memory matrices (TSMM1 . . . 80) solves data flow limitations of highly parallel linear array processors as well as intermediate storage requirements of image processing algorithms. In a camera system the parallel data processing device is combined with a sensor array (S).

Abstract: The invention relates, in encoding/decoding systems, to an improved method of switching from a first coded video sequence to a second one. In order to avoid underflow or overflow of the decoder buffer, a transcoding of the input streams IS1 and IS2 is used to shift the temporal position of the switching point and to obtain at the output of the provided transcoders (11, 12) streams TS1 and TS2 containing an identical entry point and the same decoder buffer characteristics.

Abstract: A system is disclosed for error diffusion dithering. The system includes an input for receiving an input matrix representative of image data, and a plurality of processors. The plurality of processors processes the input matrix and provides output data. Each of the processors is in communication with at least a portion of the input matrix. At least one processor processes a portion of the input matrix defined at least in part by a substantially diagonal edge within the image matrix.

Abstract: An image encoding apparatus and method for encoding an HDTV signal to a high quality of image by using a plurality of MPEG-2 MP@ML encoding devices by simple control, which divide an input image into four at an image division device, input the divided images to divided image encoding devices, set bit rates in the divided image encoding devices at an assigned bit rate processing unit based on generated code amounts of previous frames etc. so that the sum of bit rates of the four divided image encoding devices is constant, encode the divided images at the divided image encoding devices based on the set bit rates by MP@ML, and integrate the encoded images at a video stream integration device to create and output an MP@HL video stream, and apparatus and methods relating to the same.

Abstract: A method and system for compressing bitmap data in a system for sharing an application running on a host computer with a remote computer, wherein the shared application's screen output is simultaneously displayed on both computers. Simultaneous display of screen output is achieved by efficiently transmitting display data between the host computer and the remote computer. When a font used by the host computer for displaying text is not available on the remote computer, the host computer sends a bitmap representation of the text for display, rather than the text itself. Bitmap representations are cached by the remote computer, so that the same bitmap representation need not be repeatedly transmitted from the host computer to the remote computer. Bitmap representations are compressed by the host computer prior to transmission, transmitted, then decompressed by the remote computer.

Abstract: A fast method with logarithmic complexity for image compression and expansion is provided, implementable on the Geometric Arithmetic Parallel Processor (GAPP) or any similar fine-grained, mesh-connected Single Instruction-Multiple Datastream (SIMD) array processor. Efficient decomposition of the original image into multiple subimages enables the method to exploit the parallelism of the SIMD computer for implementing powerful multiresolution pyramid and hierarchical image processing techniques on a massively parallel processor.

Abstract: A data compression system separates input data into color planes prior to compression. If needed for legacy game consoles, compression is performed by a game cartridge transparent to the console. To minimize the number of passes required of a coder/decoder, color planes are ordered by density and the densest color plane is coded first. After the first color plane is coded, other color planes are coded, but pixels which are known to have colors from previously coded color planes are not coded. The last color plane is not coded, but is deduced from all the other color planes. Alternatively, pixel color values are represented by vectors with components thereof separately coded by subcolor planes. Also, each color plane can be coded until a threshold number of pixels are coded, and the remaining pixels coded by bit plane. The image data could be coded using pixel position information as context.

Abstract: A method and apparatus for transcoding of digital video images using a queuing system model. Multiple transcoding processors are arranged in parallel. In a first architecture, an input bitstream of n channels is partitioned into processing units, such as slices or frames, the processing units are split into m sub-streams, and each sub-stream is processed in a corresponding branch. A separate queue is provided for each sub-stream. In a second architecture, the processing units are assigned to any available processor from a common queue. Independent processing units are processed concurrently according to the queuing system model to minimize an average processing time. In particular, processing of a reference picture (I-picture) unit and an associated predicted picture (P- or B-picture unit) unit at the same time is avoided.

Abstract: An improved technique for processing a color or gray scale pixel map representing a document is disclosed. The pixel map is decomposed into a three-plane representation, a reduced-resolution “upper” plane, a reduced-resolution “lower” plane, and a high-resolution binary selector plane. The “upper” and “lower” planes contain the color or gray scale for the page as well as the continuous tone pictures that are contained on the page. The selector plane stores information for selecting from either the foreground plane or background plane during decompression. Information contained in the selector plane is first used to pre-process the upper and lower planes to reduce the amount of data on each of the other two planes that will be subjected to further processing. Each of the pre-processed planes is compressed using a compression technique optimal for the type of data that resides upon it.

Abstract: In variable data printing, a Variable data Job (varJob) is made out of variable data pages (varPages) which are composed by merging pregenerated labels (e.g. color separated compressed rectangular swatches). Labels are applied on any position in the page. All necessary clipping is preferably performed before labels are submitted to the VarJob. Labels are preprocessed as soon as they become available. Presumably many labels are generated once and applied many times, albeit at different positions in the page. A label preprocessor processes labels after their submission to the job by cutting them into swaths and creating auxiliary information for further planning and scheduling purposes. A page planner analyzes the page composition, estimates times and bandwidth requirements, and prepares a page composition descriptor (PCDesc) that specifies the way the page is composed. A page composer takes in a PCDesc and the necessary preprocessed labels and composes the page.

Abstract: This invention is to generate image data at a high speed in units of bands on the basis of input data while effectively utilizing limited resources. Each of compression/expansion circuits (201, 202) independently operates in a compression or expansion mode in accordance with a signal set in a register (205). When bitmap image data stored in a RAM (19) is to be simply compressed, a switch (206) is connected to a terminal (B) such that the compression/expansion circuits (201, 202) are substantially connected in parallel to efficiently perform compression. When compressed data must be edited, the compression/expansion circuit (201) is set in the expansion mode, and the compression/expansion circuit (202) is set in the compression mode. The switch (206) is connected to a terminal A such that the compression/expansion circuits (201, 202) are connected in series.

Abstract: An image reading apparatus reads every picture element of an original image, converts the as-obtained analog signals of the respective picture elements into image data which are multilevel digital signals, image-processes the converted image data, and outputs binary image data corresponding to the respective picture elements. The original image is divided into a plurality of picture element blocks which are repeated every one or plural basic units with a basic unit of one or plural picture elements being continuous in a main scanning direction. The image data of the divisional picture element blocks are subjected to image processing such as trimming, masking, simple binarization processing and pseudo half tone processing in a parallel manner. Thereafter the image data of the picture element blocks are combined with each other so that image data corresponding to the original image are outputted.

Abstract: An image scanner apparatus scans a document and provides image data in digital form representing the scanned document. The compression apparatus detects characteristics of the image data and compresses the image data using parallel compressors, each employing a different encoding scheme. The apparatus then selects compressed image data encoded by one of the compressors in accordance with the detected characteristics and stores the selected data.

Abstract: In a method for encoding a contour of an object in a video signal based on a vertex information representing a position and an index of an octant corresponding to each vertex of the contour, a maximum length line segment (MLLS) is first detected among line segments for the contour based on the vertex information (VI). Then, an initial vertex position information (IVPI) and a final vertex position information (FVPI) for the contour are encoded, the initial vertex and the final vertex being two vertices constituting the MLLS. Thereafter, a first bit number (FBN) and a second bit number (SBN) for the contour are set, wherein the FBN is the number of bits required to encode the MLLS and the SBN is the number of bits calculated by using the FBN, typically being FBN-1. In a subsequent step, each of the vertices are classified based on the SBN and the VI either as a first vertex (FV) or as a second vertex (SV) to thereby provide first vertices (FV's) and second vertices (SV's).

Abstract: A compression process of dividing each word to be compressed into least and most significant bits, and applying a different compression ratio to each. If the compression processes are lossy, both parts of the output can also be losslessly compressed before being output. Hierarchical vector quantization can be issued for either lossy compressor.

Abstract: A method and system takes advantage of both lossy and lossless compression techniques to increase processing speed and efficiency, and to decrease required image storage space. In the system and method, the input image data is divided into pixel blocks. Segmentation tags are used to determine if pixel block contains sharply defined images, such as text or low frequency halftone. If the answer is “no,” i.e., a selected or predetermined number of the pixels are not classified as text or low frequency halftone, or the pixels classified as text or low frequency halftone occur only in selected or predetermined areas of the block, then lossy compression is performed on the pixel block. An artificial block is generated and losslessly compressed. The artificial block includes pixels having values that will be losslessly compressed by a large compression ratio. If the answer is “yes,” i.e.

Abstract: A system for creating copy restrictive media is disclosed. The system comprises printing a first pattern of microdots (80) on a first set of documents and printing a second pattern of microdots (82) on a second set of documents. A first key code is associated with the first microdot pattern (80), which allows a copy machine to copy the first set of documents, and a second key code is associated with the second microdot pattern (82), which allows a copy machine to copy the second set of documents. This system allows individual copyright owner to insure that no one else is able to reproduce their copyrighted documents.

Abstract: An image compression system for implementing a zerotree wavelet compression algorithm. The compression system uses a wavelet based coding system wh takes advantage of the correlation between insignificant coefficients at different scales. The compression system uses parallel arrays of processing elements which include single instruction multiple data processors in its encoder and decoder to increase throughput and scalability. A single instruction decoder forces each processing element of the array to perform exactly the same operation on its data as the other processor elements of the array are performing on their data. If an operation must be performed only by some of the processing elements of the array, then those processing elements not performing the operation are turned off for one instruction cycle. The algorithm of the compression system is partitioned into two major components which are the wavelet transform and zerotree computations.

Abstract: To compress a digitized medical image, a first wavelet including quadrants respectively having LL, LH, HL and HH frequencies is provided, preferably in parallel. L and H respectively represent low and high frequency ranges. L and H representations may be respectively provided by averaging, and taking the difference between, two (2) successive pixels values. The first and second letters in each quadrant respectively refer to the frequency range in a pair of co-ordinates. A second wavelet may include, in the first wavelet LL quadrant, quadrants respectively having LL, LH, HL and HH frequency ranges. Successive wavelets may be similarly provided. Each wavelet is provided from the LL quadrant of the previous wavelet because most of the frequency information resides in the LL quadrant. Individual compressions may be provided in parallel of the representations in the LH, HL and HH quadrants in the first wavelet, preferably on a lossy basis (e.g. discrete cosine transform and then Huffman coding).

Abstract: Disclosed herein are easy-to-realize multivalued image coding and decoding devices, each of which is capable of reducing memories in number while the accuracy of calculations necessary upon coding and decoding is being held and relaxing a probability estimate. An image disassembler disassembles a bit string indicative of pixels into a plurality of parts in response to image data inputted from an image input unit. Further, the image disassembler sends the value of each disassembled pixel to be coded and the value of each disassembled pixel for reference to an image analyzer as disassembled image data. The image analyzer sends the value of each disassembled pixel to be coded to a coding unit as disassembled pixel-value data and transmits the value of the reference pixel to a probability estimate unit as status data. The probability estimate unit sends probability estimate data corresponding to the status data to the coding unit.

Abstract: The invention discloses a 9-cell array architecture with data-rings for 3-step hierarchical search (3SHS) block-matching algorithm. With the efficient data-rings and memory organization, the regular raster-scanned data flow and comparator tree-like structure can be used to simply internal I/O controller and reduce latency. In addition, we can utilize techniques to reduce external memory accesses and interconnections. The results demonstrate that the array architecture with the data-rings is low in terms of latency, memory bandwidth and costs and a high performance solution for the 3 SHS.

Abstract: Disclosed herein are easy-to-realize multivalued image coding and decoding devices, each of which is capable of reducing memories in number while the accuracy of calculations necessary upon coding and decoding is being held and relaxing a probability estimate. An image disassembler disassembles a bit string indicative of pixels into a plurality of parts in response to image data inputted from an image input unit. Further, the image disassembler sends the value of each disassembled pixel to be coded and the value of each disassembled pixel for reference to an image analyzer as disassembled image data. The image analyzer sends the value of each disassembled pixel to be coded to a coding unit as disassembled pixel-value data and transmits the value of the reference pixel to a probability estimate unit as status data. The probability estimate unit sends probability estimate data corresponding to the status data to the coding unit.

Abstract: The invention discloses an apparatus for decoding a video sequence, compressed according to a known data modeling method suitable for transmission or storage, into decompressed frames, suitable for viewing, the data model comprising a plurality of spatial intensity changes patterns, called intensity loads, a plurality of spatial address change patterns, called address loads, and a plurality of values, called scores, specifying for each frame how much of each load should be present. Each of the loads includes respective hardware components for storing and processing it. The respective components are connected in a pipeline consisting of parallel synchronous data paths, through which pipeline the intermediate image and motion field are continuously transmitted.

Abstract: A progressive (non-interlaced) video decoding system has a memory for buffering a video bitstream received from a transmission channel and a transferring device for multiplexing and transferring the video bitstream to multiple video decoders and display buffers. A demultiplexer coupled to the display buffers de-multiplexes the video for display. A controller controls the multiplexing and demultiplexing operation.

Abstract: For handling data having a fixed-order context, a data compression system uses a pipeline control unit to enable an occurrence frequency modeling unit and entropy coding unit to operate in pipelining. A data restoration system uses a pipeline control unit to enable an entropy decoding unit and occurrence frequency modeling unit to operate in pipelining. For handling data having a blend context, occurrence frequency modeling units associated with orders are operated in parallel for data compression or data restoration. Furthermore, word data is separated byte by byte, and byte data items are encoded or restored on the basis of the correlation thereof in a word-stream direction.

Abstract: A method and apparatus for coding and decoding an image signal, and also a recording medium for storing a coded image signal wherein low resolution image signal including a plurality of pixels and also a high resolution image signal including a plurality of pixels are received. The low resolution image signal is coded thereby generating a resultant coded low resolution image signal. The high resolution image signal is predicted from the low resolution image signal thereby generating a predicted high resolution image signal. After that, the predicted high resolution image signal is divided into a plurality of blocks each including n.times.m pixels. The feature of each block is detected and a judgement code corresponding to the detected feature is generated. Then a coding table is selected in accordance with the judgement code. The n.times.m pixels in the corresponding block of the high resolution image signal are coded using the selected coding table to generate coded data.

Abstract: A configurable data processing pipeline for processing data, such as print data, provides configuration flexibility, thereby allowing the data processing operations to be optimized for the data, while achieving improved data processing speed. In the preferred embodiment, the configurable data processing pipeline is implemented in an ASIC. The configurable data processing pipeline includes compression/decompression modules, a page strip manager, a color space conversion module, a merge module and a halftone module. A method for controlling the pipeline accepts raster image data after it has been processed by image rendering firmware and prepares the raster image data for transfer to the pipeline. Page rendering firmware performs this function. Next, pipeline control firmware takes control and thereafter operates the pipeline ASIC, independently of the page rendering firmware.

Abstract: An advanced video compression coding system which employs variable block size transforms to improve the compression efficiency for transmission of video pictures. A picture block segmentation map is transmitted as a one-dimensional series of block-size codes by scanning the segmentation map in accordance with a predetermined scanning pattern and on the basis of block size. A block-size code is skipped when the scanning pattern intersects a block which has already been scanned earlier. The series of block-size codes is then run-length and Huffman-coded before being transmitted.

Abstract: It is an object of the present invention to simultaneously perform input or output of picture signals for a plurality of components. An image data input interface (310) is capable of input of picture signals (Pm) of three components at its maximum. For example, when picture signals (Pm) of three components are inputted, a clock divider (410) supplies a 1/3 divided signal of a clock signal (CLK) to the image data input interface (310) on the basis of a selection signal (SEL). In the image date input interface (310), the picture signals (Pm) of three components are simultaneously inputted in synchronization with the 1/3 divided signal and they are sent out to a discrete cosine transform unit (4) in synchronization with the clock signal (CLK). The component to which the sent picture signals (Pxy) belong sequentially changes for every 8.times.8 picture elements.

Abstract: An image memory outputs a target encoding pixel and a plurality of reference pixels in the vicinity thereof. A boundary mode determining unit determines a maximum value and a minimum value of the reference pixels, determines an average value of the maximum value and the minimum value, compares the respective reference pixel values with the average value, detects a boundary in the target encoding pixel and the reference pixels based on comparison results, and detects a pixel distribution state of the reference pixels based on the detected boundary. An adaptive predictor calculates a prediction value by performing a calculation based on a function corresponding to the pixel distribution state and the reference pixels. A prediction difference calculating unit determines a difference value between the prediction value and a value of the target encoding pixel.

Abstract: A two-dimensional inverse discrete cosine transformation circuit of an MPEG2 video decoder including a one-dimensional inverse discrete cosine transformation circuit, an input switching circuit for receiving input of new data and data already subjected to first one-dimensional inverse discrete cosine transformation and sending one of them to the one-dimensional inverse discrete cosine transformation circuit, an input switching control circuit for controlling the input switching circuit so as to alternately and continuously output data output from a first serial-parallel conversion circuit and data output from a second serial-parallel conversion circuit, and a data allocation circuit for switching and controlling an output destination of output data of the one-dimensional inverse discrete cosine transformation circuit based on the timing of switching by the input switching control circuit.

Abstract: In the image data processing of the digital copying machine (M), number of blocks Bn of image data in auxiliary scanning direction is set to the number of expanders (30, 31) Dn times a natural number N (N.times.Dn). This configuration makes it possible to utilize the (30, 31) expanders efficiently regardless of whether the image is to be rotated by 90.degree. or not when expanding compressed image data and printing the image. Thus such a situation that the expanders (30, 31) are forced to suspend the expanding operation does not occur, making it possible to start printing earlier and improve the printing speed. In the image reader 1 of the digital copying machine (M), when dividing image data corresponding to original document into a plurality of blocks and compressing the image data in the unit of block, length of the original document in the auxiliary scanning direction is estimated from width of the original document (size in principal scanning direction).

Abstract: A decompressing method for generally providing more than four bits of decompressed data in each clock cycle. The decompressing method of this invention is capable of decoding four non-long horizontal codes in parallel and selecting either the decompressed data of the first code if it generates four or more bits of decompressed data or selecting the decompressed data of the first code with a combination of the decompressed data of the following codes if the first code generates less than four bits of decompressed data. The decompressing method decompresses the long horizontal codes (codes which generate more than four bits of data) separately.