Abstract: An encoding preprocessing part 1 extracts the amount of image feature relative to image data and passes the amount of image feature to a control part 2 as image feature amount information 11 and also sends image data 10 to an encoding part 3. The control part 2 determines whether there is a dissolve image or not based on the image feature amount information 11 and if it is determined that the image data 10 is the dissolve image, an encoding parameter 12 is set so that a configuration of GOP which is normally M=3 is changed into the configuration of GOP of M=2, and the encoding part 3 performs encoding based on the encoding parameter 12. As a result of that, a prediction error of a B-picture frame in a dissolve interval becomes substantially zero and on encoding in the dissolve interval, the amount of information occurrence in frames except I-picture and P-picture frames can be reduced and thus the amount of information occurrence as a whole can be reduced.

Abstract: A video encoding apparatus is provided with a resolution converting section, an encoding section, and a transmitting section. The resolution converting section enlarges or reduces a binary picture which represents the shape of an object. The encoding section encodes a binary picture reduced by the resolution converting section. The reduction ratio used by the resolution converting section is encoded, and the transmitting section transmits this encoded reduction ratio along with encoded data on the binary picture. The amount of encoded data produced from the encoding section is controlled by changing the enlargement/reduction ratio used by the resolution converting section.

Abstract: Data compression logic of the invention compresses data from a host to a connected cache memory for storage within a storage device. A compressor within the logic implements a compression algorithm on the data; and a plurality of Chunk RAMs store compressed and uncompressed data chunks from the compressor. Predictive digital logic assesses memory usage within the RAMS while uncompressed and compressed chunks are stored within the RAMs. The predictive digital logic selects one RAM to drain its data into the cache memory based upon the compression efficiency of the compressed data as compared to the uncompressed data and prior to the complete loading of the chunks within the RAMs, resulting in reduced latency in writing compressed data to the connected cache memory. The predictive digital logic can include calculation logic for dynamically calculating compression efficiency, used in selecting which RAM to drain.

Abstract: An image signal expressing pel values and a significance signal declaring for each pel whether the pel value is significant are supplied as input signals. By referring to the input significance signal values for the pels proximal to the pel being processed, the significant pels are identified and a resolution conversion characteristics selector selects one of two or more frequency conversion characteristics to be used for resolution conversion of the image signal using only significant pels. A resolution converter then converts the resolution of the input image signal using the selected resolution conversion characteristic, and outputs the result as the image conversion apparatus output signal. Resolution conversion of the input image signal can therefore be accomplished by means of pel subsampling or interpolation without being affected by nonsignificant pels, and resolution conversion with minimal image quality loss caused by the conversion process is achieved.

Abstract: Methods and apparatuses for still image compression, video compression and automatic target recognition are disclosed. The method of still image compression uses isomorphic singular manifold projection whereby surfaces of objects having singular manifold representations are represented by best match canonical polynomials to arrive at a model representation. The model representation is compared with the original representation to arrive at a difference. If the difference exceeds a predetermined threshold, the difference data are saved and compressed using standard lossy compression. The coefficients from the best match polynomial together with the difference data, if any, are then compressed using lossless compression. The method of motion estimation for enhanced video compression sends I frames on an “as-needed” basis, based on comparing the error between segments of a current frame and a predicted frame.

Abstract: The mode data of a block to be coded is predicted from the mode data of peripheral blocks already coded, and coded using a code word table switched according to a hitting ratio of prediction. In the code word table, the code word length is set shorter for coding modes with high hitting ratio.

Abstract: A video encoding apparatus is provided with a resolution converting section, an encoding section, and a transmitting section. The resolution converting section enlarges or reduces a binary picture which represents the shape of an object. The encoding section encodes a binary picture reduced by the resolution converting section. The reduction ratio used by the resolution converting section is encoded, and the transmitting section transmits this encoded reduction ratio along with encoded data on the binary picture. The amount of encoded data produced from the encoding section is controlled by changing the enlargement/reduction ratio used by the resolution converting section.

Abstract: The present invention is a method and apparatus for the lossless precompression and de-precompression of high resolution binary images that are to be stored or transmitted. More specifically, the present invention employs an area-based precompression/de-precompression technique that is particularly appropriate for high resolution bit replicated images. The technique searches for regularly sized image regions of a common color or binary state and represents the areas in a coded fashion. The compression technique employed by the present invention enables high resolution images to be compressed and stored or transmitted at an image size approximating the size of an image typically obtained by lossless compression of the original bitmap binary image from which the high resolution image was generated.

Abstract: A method and apparatus for coding video data permits coding of video information with optional, enhanced functionalities. Video data is coded as base layer data and enhancement layer data. The base layer data includes convention motion compensated transform encoded texture and motion vector data. Optional enhancement layer data contains mesh node vector data. Mesh node vector data of the enhancement layer may be predicted based on motion vectors of the base layer. Thus, simple decoders may decode the base layer data and obtain a basic representation of the coded video data. However, more powerful decoders may decode both the base layer and enhanced layer to obtain decoded video permitting functionalities. An embodiment of the present invention provides a back channel that permits a decoder to affect how mesh node coding is performed in the encoder. The decoder may command the encoder to reduce or eliminate encoding of mesh node motion vectors.

Abstract: An image data coding and/or decoding system according to the present invention has an input terminal for inputting an image data signal, a screen-area determining section for determining the area of the produced screen by analyzing the image data signal, a code amount assigning section for assignment of the screen on the basis of the determined results from the screen-area determining section, and a coding section for coding the image data signal inputted using the control signal from the code amount assigning control section.

Abstract: An image encoding device is provided that can transmit encoded image data without lowering the frame rate even when the transmission speed of the transmission path is lowered. An encoded region designator (41, 42) selects the region that is to be encoded, in the input image, depending on the bit rate of the transmission path. Only such a region that is designated by the encoded region designator (41, 42) is encoded. The encoded region designator may be one which selects the region that is to be encoded, according to the bit rate of the transmission path, and the motion vector detected by the image encoding circuit (2). As an alternative, an encoded region designator may be used which selects the region that is to be encoded according to the bit rate of the transmission path, and the information on the designated region supplied from the outside.

Abstract: MPEG-4 encoded data is input, and a shape code decoder decodes shape data contained in the encoded image data to obtain ROI information contained in that image. The frequency transforms of the decoded image data are computed to generate transform coefficients. A bit shift unit bit-shifts transform coefficients, corresponding to the ROI, of the generated transform coefficients, to upper bit planes, stuffs “0”s in blank fields outside the ROI, which are generated by the bit shift process, and stuffs audio data from an audio buffer in blank fields within the ROI, which are generated by the bit shift process.

Abstract: A method and apparatus for compression and restoration of images, videos, surfaces, curves and, generally, pixel-based data sets, including: feature-based quantization using a set of N isocontours; compressing each of these N contours using a level set-based compression of curves or surfaces—and/or combining the quantization with a conventional method for compression of surfaces; and decompressing the compressed data using a nonoscillatory reconstruction. The method is naturally multiscale, but does not use wavelets or other multiscale-basis functions. The method performs compression and decompression (1) without excessive computational complexity, even in the presence of topological changes such as merging or breaking of isocontours as the scale changes, (2) with excellent image fidelity, (3) without unacceptable artifacts such as ringing, blurring, or blocking, (4) with simple and natural grid based ways of calculating geometric features such as normals, principal curvatures.

Abstract: Disclosed is a method and apparatus for converting the color borders of a raster image into a more abstract mathematical representation that can be converted into a vector format without significantly fragmenting the image. The invention involves scanning a neighborhood of cells in the form of a square matrix through the raster image in order to generate a surface string (or an indicia thereof) representing the color border at each pixel, and then to sequence the surface strings into string sequences which represent the color borders. By assigning color values to the neighborhood of cells that indicate whether the perimeter cells are the same or different in color than the center cell, the present invention is capable of defining color borders in raster images comprising three or more colors (as opposed to black and white images). The string sequences are generated by sequencing together string IDs rather than simple slopes which provides optimal information for generating vectors.

Abstract: An improved video information coding method for an object boundary block merging/splitting technique which makes it possible to use an object boundary block merging and a merging/separation as a reverse process thereof which are capable of enhancing a coding efficiency by using a space surplus of an intra-video and inter-video which exist in a block or a neighboring block by merging, coding and transmitting the BBM. The method includes the steps of merging a plurality of object boundary objects, judging whether there is an overlapped block signal among the block signals using shape information of the object boundary blocks, and merging the blocks in which no overlapped pixels exist as a result of the judgement.

Abstract: An apparatus is disclosed for converting a raster image comprising a plurality of pixels into a plurality of data tags representing at least one shape in the raster image. The apparatus comprises a computer program, or an integrated circuit implementing the steps of the computer program, wherein the computer program comprises: (a) a border definer for generating a border string sequence representing a color border in the raster image, wherein: (b) the border string sequence comprises a plurality of surface strings; and (c) a surface string comprises a receive slope and a send slope representing a slope of the border passing through a predetermined area of the raster image; and (d) a surface string sequencer for converting the border string sequence into one or more surfaces, wherein a surface comprises one or more surface string sequences representing a section of the border string sequence.

Abstract: A method represents a shape of an object in an image. Portions of the image interior to a boundary of the object are ordered. A medial axis for the ordered portions of the image is derived. The medial axis is segmented to produce an ordered tree. The ordered tree is transformed to a partial ordered tree to represent the shape of the object.

Abstract: An apparatus and method of adaptively coding/decoding interlace shape information estimates the amount of motion with respect to the binary alpha block (BAB). A type of the BAB is determined according to the estimated amount of motion. When the BAB falls under a type which needs coding differences between pixel pairs in each line pair comprising an odd and an adjacent even line are calculated and summed up to compute an error of the frame. Differences between pixel pairs in consecutive odd line pairs and differences between pixel pairs in consecutive even line pairs are calculated and summed up to compute an error of individual fields. When the error of the frame is larger than that of the separate fields, field type coding where coding is independently performed with respect to each field is selected. When the error of the separate fields is larger than that of the frame, frame type coding where coding is performed with respect to the frame is selected.

Abstract: An image coding apparatus and method code an object image by separating the object image into a shape representing the outline of the object image and a texture representing the pixel values of the object image. The coded object image is decoded by an image decoding apparatus and method adapted for the image coding apparatus and method. The image decoding apparatus and method generate a shape code by coding the shape in predetermined units, generate a texture code by coding the texture in predetermined units, and generate a synchronization code with respect to the shape code for each predetermined unit and the texture code for each predetermined unit. The generated synchronization code is added to the shape code for each predetermined unit and the texture code for each predetermined unit, which thus provides codes enabling restoration from an erroneous condition.

Abstract: An image processing apparatus in which an image signal is divided into blocks each comprising a plurality of pixels and a quantization and a variable length encoding are executed so that a code amount of a plurality of blocks lies within a certain range. As a plurality of blocks, the position of the block which is selected at the nth order approaches the periphery of a picture screen with an increase in value of (n).

Abstract: An image is coded by counting runs of non-background picture elements, and counting consecutive scanning lines having only background picture elements. Consecutive scanning lines of this type are coded as a single command and value, giving the number of scanning lines. Consecutive scanning lines having identical numbers of runs of non-background picture elements are coded as another single command and value, giving the run count, followed by run information describing each run. Sparse images, consisting mostly of background area, can be coded efficiently in this way.

Abstract: A method and an apparatus for predictively coding shape information of a video signal. An error between the current shape information and the previous shape information is obtained through the comparison therebetween. If the obtained error is greater than or equal to a predetermined reference value, the current shape information is coded. However, in the case where the obtained error is smaller than the predetermined reference value, the current shape information is reconstructed using the previous shape information. Therefore, a time-axis redundancy of the shape information is removed to prevent the transmission of unnecessary information, resulting in an increase in compression coding efficiency.

Abstract: An image coding apparatus inputs pixel data of a part image of high resolution. An upper layer coding portion (101), a second shape data generating portion (102), and a second shape data coding portion (103) perform coding of shape data and pixel data in the upper layer. A down sampling portion (104) generates pixel data of low resolution. A lower layer coding portion (105), a first shape data generating portion (106), and a first shape data coding portion (107) code shape data and pixel data in the lower layer.

Abstract: An object data processing apparatus for decoding N pieces of coded data (N=positive integer) obtained by compressively coding N pieces of object data which constitute individual data to be recorded or transmitted and have a hierarchical structure, for each object data. This apparatus includes hierarchical information extraction means for extracting hierarchical information showing the hierarchical relationship of the N pieces of object data, according to the coded data; and table creation means for creating, according to the hierarchical information, an object table on which the respective object data are correlated with coded data of the respective object data. Therefore, the apparatus can perform extraction, selection, or retrieval of coded data corresponding to a specific object at high speed, and this enables the user to edit or replace the object data in short time with high controllability.

Abstract: This invention provides an image processing apparatus and method characterized by inputting successive image data, detecting a change in the image data, generating initial contour information for extracting an object present in the image data in accordance with the detection result, and extracting object image data corresponding to the object on the basis of the generated initial contour information.

Abstract: A computer-implemented method for representing a movie having a sequence of frames includes generating a pixel level frame to frame correspondence; representing the original frame sequence as a multi-image morph; and deriving from the multi-image morph a basis of feature vectors describing principal changes among frames and representing the movie in terms of the basis.

Abstract: An apparatus encodes a binary shape signal and decodes the encoded binary shape signal by using a modified binary arithmetic coding and decoding method. In accordance with the modified binary arithmetic coding method, the binary shape signal is first scanned in a predetermined scanning order and a pixel value of its first scanned pixel is provided as one bit data. Then, the apparatus compares each of pixels in the binary shape signal with its precedingly scanned and adjacent pixel by using the scanned binary shape signal and produces a first or a second comparison signal. In response to the first or the second comparison signal, the apparatus assigns one of two mapping values to each of the pixels in the binary shape signal to thereby produce a mapping signal by using the assigned mapping values corresponding to the pixels in the binary shape signal. The mapping signal is arithmetically encoded based on probabilities corresponding to the two mapping values to thereby produce the encoded mapping signal.

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: A video compression method and system including object-oriented compression plus error correction using decoder feedback.

Abstract: An object of this invention is to provide a coding method and a coding apparatus for efficiently coding both a pixel value signal and a shape signal which are included in an image signal to be coded, wherein a prediction changing unit outputs a reference pixel value changing signal and a reference shape signal to a switching circuit which selects a reference pixel value signal and to a switching circuit which selects a reference shape signal, respectively, so as to control the switching circuit in a way that appropriate reference signals are to be selected.

Abstract: An apparatus encodes a binary shape signal by using a zig-zag scanning technique. The apparatus zig-zag scans the binary shape signal to thereby output each of the pixels in the binary shape signal sequentially in order of scanning. Then, a context corresponding to each of the pixels is selected from pixels processed prior to said each of the pixels by taking the scanning order into account. By using the context of said each of the pixels, the apparatus ciphers a context number corresponding to said each of the pixels and detects its probability based on the corresponding context number. Through the above procedure, if the probabilities for all of the pixels in the binary shape signal are detected, the apparatus arithmetically encodes the binary shape signal by using the detected probabilities to thereby produce the encoded binary shape signal.

Abstract: A block including a subject pixel is formed from an original image. A first class information generation circuit calculates similarity between a decimated block that is obtained by decimating pixels constituting the block and a reduced block obtained by reducing the block (self-similarity of an image). On the other hand, a second class information generation circuit detects a pattern of pixel values of pixels that are arranged in a direction with highest self-similarity in the reduced block (or the decimated block). A final class determination circuit determines a class of the block including the subject pixel based on outputs of both of the first class information generation circuit and the second class information generation circuit. A process corresponding to the thus-determined class is executed.

Abstract: An object of this invention is to provide a coding method and a coding apparatus for efficiently coding both a pixel value signal and a shape signal which are included in an image signal to be coded, wherein a prediction changing unit outputs a reference pixel value changing signal and a reference shape signal to a switching circuit which selects a reference pixel value signal and to a switching circuit which selects a reference shape signal, respectively, so as to control the switching circuit in a way that appropriate reference signals are to be selected.

Abstract: An object of this invention is to provide a coding method and a coding apparatus for efficiently coding both a pixel value signal and a shape signal which are included in an image signal to be coded, wherein a prediction changing unit outputs a reference pixel value changing signal and a reference shape signal to a switching circuit which selects a reference pixel value signal and to a switching circuit which selects a reference shape signal, respectively, so as to control the switching circuit in a way that appropriate reference signals are to be selected.

Abstract: A code compaction based on macro substitutions is presented wherein the choice of possible macro substitutions is guided by an evolutionary algorithm process. In a preferred embodiment, a random population of sets of macro substitutions are generated and a compaction effectiveness is evaluated for each set. This random population is partitioned into pairs of “parents”, and each pair of parents produce a pair of “offspring”. The effectiveness of the compaction provided by each of the offspring is evaluated, and a “survival of the fittest” algorithm is applied to identify the individuals that have the best compaction effectiveness. These preferred individuals are partitioned into pairs of parents who produce pairs of offspring, and the most compaction-effective individuals are selected to be parents for the next generation. This process continues until subsequent generations show insignificant improvement, and the best individual is selected as the solution.

Abstract: An alpha-map encoding apparatus includes a first down-sampling circuit (21) for down-sampling an alpha-map signal which represents the shape of an object and the position in the frame of the object at a down-sampling ratio based on size conversion ratio information, an up-sampling circuit (23) for up-sampling the alpha-map signal at an up-sampling ratio based on size conversion ratio information given to restore the down-sampled alpha-map signal to an original size, and outputting a local decoded alpha-map signal, a motion estimation/compensation circuit (25) for generating a motion estimation/compensation signal on the basis of the previous decoded video signal and a motion vector signal, a second down-sampling circuit (26) for down-sampling the motion estimation/compensation signal at the down-sampling ratio, a binary image encoder for encoding the alpha-map signal down-sampled by the first down-sampling circuit to a binary image in accordance with the motion estimation/compensation signal down-sampled by t

Abstract: A method for encoding a binary alpha block (BAB) type of a target block of an interlaced shape signal is provided. After no_update BAB_type which does not require supplemental encoded data is determined, either frame-basis or field-basis encoding is selected as an encoding_type based on a degree of correlation between the target block and its two field blocks. If field basis encoding is selected as encoding_type, it is determined whether or not said two field blocks correspond to one_field_no_update, which indicates at least one fields of said two field blocks require no supplemental data to be transmitted. If said two field blocks are decided as one_field_no_update, top or_bottom and BAB_type_field are detected to be encoded.

Abstract: A decoding LSI adaptable to MPEG4 is provided with a padding means for performing padding on decoded texture data, an arithmetic decoding means for performing arithmetic decoding on coded shape data, and a composition means for compositing a plurality of texture data to generate composite image data. The padding means, the arithmetic decoding means, and the composition means are implemented by hardware circuits, i.e., a padding engine, an arithmetic decoding engine, and a composition engine, respectively. Therefore, the decoding LSI can perform high-speed decoding on a bitstream corresponding to plural objects, such as images, which are compressively coded by the MPEG4 coding method, with reduced cost of the hardware circuits performing the decoding process.

Abstract: An object of this invention is to provide a coding method and a coding apparatus for efficiently coding both a pixel value signal and a shape signal which are included in an image signal to be coded, wherein a prediction changing unit outputs a reference pixel value changing signal and a reference shape signal to a switching circuit which selects a reference pixel value signal and to a switching circuit which selects a reference shape signal, respectively, so as to control the switching circuit in a way that appropriate reference signals are to be selected.

Abstract: Image data of plural objects are inputted, the inputted image data are encoded on an object basis, a priority order of code amount allocation is set for the objects, and encoding conditions for the objects in the encoding step are controlled in accordance with the priority order. The encoding conditions are controlled so that a total code amount obtained by encoding the image data of the plural objects does not exceed a predetermined code amount.

Abstract: A position detecting section 20 detects visual point position of operator on the basis of output of a bisected light detector 2 in an eyeball movement measurement element. A position processing section 21 determines central position of a visual point position vicinity area on the basis of information from the position detecting section 20, and a size processing section 23 determines size of the visual point position vicinity area on the basis of output of a size adjust lever 18. A video signal 10 is encoded by a compressing section 11 and is inputted to a code quantity reduction section 13. A system control section 30 controls the code quantity reduction section 13 so that code quantity allocated to the area except for the visual point position vicinity area is smaller than code quantity allocated to the visual point position vicinity area to allow it to carry out reduction of code quantity.

Abstract: An apparatus encodes a video signal composed of texture information and shape information by selectively using a progressive and an interlaced coding technique. The shape information is divided into a multiplicity of BABs of M×N pixels having one of a first and a second binary values and the texture information has a plurality of macroblocks of the same number of pixels as a BAB. Specifically, the apparatus determines a motion vector of a target BAB of the shape information based on a corresponding motion vector predictor selected among candidate motion vectors including frame-based and field-based motion vectors for BABs which surround the target BAB and have been previously encoded and frame-based and field-based motion vectors for macroblocks which surround the macroblock corresponding to the target BAB and also have been previously encoded according to predetermined priority, and encodes the motion vector of the target BAB.

Abstract: There is provided an improved scan interleaving method suitable for multipurpose encoding of binary image data, and for selectively encoding a part or the whole of object image data according to presence or absence of exceptional sampling data (ESD). In the present invention, when the pixel data of base image data and the corresponding pixel data of the object image data to be scan-interleaved are the same (in the case of predictive sampling data), no encoding is performed on the pixels of the object image data which have no ESD, thus simplifying the algorithm and system implementation. As a result, the overall encoding performance can be improved.

Abstract: An image coding apparatus comprises a subtraction unit operable to output difference data between image data of a target block in a present frame and image data of a prediction block for the target block, as image data of a difference block; a data compressor operable to compress the image data of the difference block to output image data of a compressed difference block; a data decompressor operable to decompress the image data of the compressed difference block to restore the difference data as image data of a decompressed difference block; an adder operable to add the image data of the decompressed difference block and the image data of the prediction block to generate image data of a reproduced block; a padding unit operable to output the image data of the reproduced block after replacing insignificant pixel values constituting the reproduced block with a predetermined padding value when the reproduced block is an ineffective block comprising only insignificant pixels, and output the image data of the rep

Abstract: A video coding system that codes video objects as scalable video object layers. Data of each video object may be segregated into one or more layers. A base layer contains sufficient information to decode a basic representation of the video object. Enhancement layers contain supplementary data regarding the video object that, if decoded, enhance the basic representation obtained from the base layer. The present invention thus provides a coding scheme suitable for use with decoders of varying processing power. A simple decoder may decode only the base layer of video objects to obtain the basic representation. However, more powerful decoders may decode the base layer data of video objects and additional enhancement layer data to obtain improved decoded output. The coding scheme supports enhancement of both the spatial resolution and the temporal resolution of video objects.

Abstract: A predictive coding in a video coding system, which can enhance the coding efficiency by predictively coding DC coefficients of a block to be coded using DC gradients of a plurality of previously coded neighboring blocks. The predictive coefficient is selected according to the difference between the quantized DC gradients (coefficients) of a plurality of neighboring blocks of the block to be coded, and the DC coefficient of the block to be coded is predictively coded by the selected predictive coefficient, thereby enhancing the coding efficiency.

Abstract: A color image of a dot-sequential system is converted into a color image of a field-sequential system and a color image can be encoded/decoded at a high speed with a high compression ratio. A pixel value of image data of a dot-sequential system is sequentially inputted to a reference area generating means, and the reference area generating means outputs target pixel data and reference area data. A same pixel value distributing and generating means generates and outputs a same pixel value distribution from the target pixel data and the reference area data. A predictive information encoding means encode data in accordance with an encoding generating table, and outputs predictive information encoded data and an encoding result signal. A dot-sequential/field-sequential image converting means converts pixel data of dot-sequential system into image data of field-sequential system when data cannot be encoded.

Abstract: An image processing apparatus and method for accurately reproducing an edge part at which luminance (brightness) abruptly changes with respect to dynamic image information. A dynamic image memory records a plurality of frames of information of the dynamic image. An information change analyzing unit performs a three-dimensional analysis for the dynamic image information. A characteristic point detection unit detects locations at which characteristic points exist by processing the results of the analysis. The characteristic point encoding unit further processes the results of analysis of the characteristic point detection unit and expresses the locations at which the characteristic points exist as a curved surface. An information encoding unit executes the analysis for obtaining information necessary for reproducing an input dynamic image at the characteristic points. A total coding unit codes output information of the characteristic point encoding unit and a subtraction circuit.

Abstract: A recursive dilation method and apparatus reduces the boundary artifacts occurring in hybrid compression. Documents containing both pictures and text are most efficiently compressed using a first compression standard for the picture region and a second compression standard for the text region, and thus inherently produce boundary blocks of both types, but such boundary blocks are most efficiently compressed when they contain only picture data and completely contain picture data, or only text data and completely contain text data. The non-picture data or non-text data in such boundary blocks can be considered “missing” data. The recursive dilation method and apparatus assigns the values of the boundary pixels to the neighboring pixels which have missing data.

Abstract: It is an object to encode an image signal or a shape signal more efficiently than the prior art. As a means to accomplish the object, the change pixel detector 2 receives the input signal 1 as an input signal and detects the pixel which changes the two-valued pixel value. Further, the change pixel predictor 4 also reads out the reference image stored in the memory 3, and predicts the change pixel of the particular input signal. The difference value calculator 5 subtracts the output of the change pixel predictor 4 from the output of the change pixel detector 2. The difference value rounder 7 compares the tolerance value e and the prediction error D, and outputs x which requires the minimum bit number for being encoded in the value D−e≦x≦D+e. The output of the difference value rounder 7 is encoded by the decoder 8 to become the encoded signal 9.