Abstract: A technique of efficiently extracting and synthesizing an object image from a plurality of images captured at different image magnifications. An image processing method of the present invention includes the steps of generating a first background image corresponding to a first image captured at a predetermined image magnification, extracting a first object image from the first image, generating a second background image corresponding to a second image captured at an image magnification higher than the predetermined image magnification, based on the first background image and the first object image, and extracting a second object image from the second image and the second background image.

Abstract: In an input scanning system, as would be present in a digital copier, a “template” of similar visual elements or objects, such as logos and other designs, is detected among a series of scanned images. The common objects form a reference image against which subsequently-recorded input images are compared. If bounding boxes around objects in the input images match those in the reference image, the objects in the bounding boxes are attempted to be matched to those in the reference image. If objects in the input image and reference image match, then the image data from the input image is coded using a pointer to the corresponding object in the reference image.

Abstract: A method for spectrally compressing data sets enables the efficient analysis of very large multivariate images. The spectral compression algorithm uses a factored representation of the data that can be obtained from Principal Components Analysis or other factorization technique. Furthermore, a block algorithm can be used for performing common operations more efficiently. An image analysis can be performed on the factored representation of the data, using only the most significant factors. The spectral compression algorithm can be combined with a spatial compression algorithm to provide further computational efficiencies.

Abstract: The present invention is intended to generate data optimal for both display and reuse from an image. From an input image, vector data of a display foreground layer, vector data of a non-display foreground layer, and a display background layer in which a portion of the input image is filled are generated. Next, electronic data including the display foreground layer, display background layer, and the non-display foreground layer is generated. By using the multi-layered electronic data, a composite image of the display foreground layer and the display background layer is provided for display, and the layers for display are switched for reuse. This makes it possible to provide data optimal for both display and reuse.

Abstract: The present invention provides an image information compressing apparatus of high coding efficiency with little deterioration in picture quality, capable of effectively extracting feature components from an image in an image information feature-extraction and coding method.

Abstract: Video images in, e.g., a multimedia stream are scanned prior to compression for transmission to recognize symbols, such as graphics symbols and alpha-numeric characters. The types, positions, sizes, etc. of the symbols are recorded to render symbol information, and then the images are compressed with or without compressing the symbols, which may be removed from the images prior to compression if desired. The compressed video and symbol information are sent to a receiver, which decompresses the video, optionally transforms the symbols, and then inserts the symbols where indicated by the symbol information.

Abstract: A method of adjustable spatial and/or temporal compression of an image including a face includes identifying a group of pixels that correspond to a face within a digitally-acquired image. A first compression portion of the image including the group of pixels is determined. A second compression portion of the image other than the group of pixels is also determined. The first compression portion may be automatically compressed with higher-grade compression than the second compression portion to generate a compressed image including the face, or an option to provided the compressed image including the different grade compressions may be provided.

Abstract: A method and apparatus for encoding digital image data wherein region of interest can be specified either before the encoding process has begun or during the encoding process (127), such that the priority of the encoder outputs are modified so as to place more emphasis on the region of interest, therefore increasing the speed and/or increasing the fidelity of the reconstructed region of interest. The system, therefore, enables more effective reconstruction of digital images over communication lines (128).

Abstract: Provided are an image processing apparatus and method whereby even if shape data representing the shape of an object in a moving image undergoes a major change temporarily, a frame that is to be corrected can be detected and corrected in ideal fashion and it is possible to execute moving-image coding that is outstanding both visually and in terms of coding efficiency. In one example, a moving image composed of a plurality of frames is acquired from a image input unit (101) and the background image of the moving image is acquired by a background image generating unit (102). A background subtraction processor (103) extracts an object by comparing each of the frames constituting the moving image with the background image, and an abnormal-data discrimination unit (105) discriminates whether shape data representing the shape of the extracted object is abnormal or not. If the shape data is abnormal, a shape-data correction unit (106) corrects the shape data.

Abstract: An image compression system and method is described, which makes use of the symmetry found in faces and heads to perform the compression. The image is divided along the line of symmetry, and pairs of corresponding pixels on the two divided sides are determined. A weighted average and a weighted variance of the pixel values of the pairs is computed, and is used to encode the image. A transform such as the Karhunen-Loeve transform is used to compute the weighted averages and variances.

Abstract: A method of representing an object appearing in a still or video image, by processing signals corresponding to the image, comprises deriving a plurality of sets of co-ordinate values representing the shape of the object and quantising the co-ordinate values to derive a coded representation of the shape, and further comprises quantising a first co-ordinate value over a first quantisation range and quantising a smaller co-ordinate value over a smaller range.

Abstract: A method of compressing depth maps including the steps of determining the boundary of at least one object within a depth map, applying a curve to the boundary of each object, and converting the continuous depth data within an area bounded by the curve into at least one ramp function.

Abstract: The invention is related to methods and apparatus that encode redundant motion vectors for predictive-coded visual object planes (P-VOPs) to increase the robustness of transmitted video signals. One embodiment provides the redundant motion vectors in a user data video packet of an MPEG-4 compliant bitstream, which thereby allows the enhanced bitstream to remain compliant with MPEG-4 syntax and backwards compatible with MPEG-4 decoders. The enhanced bitstreams allow a video decoder to display a video with a better picture and relatively less error and error propagation when portions of the bitstream are disturbed or corrupted by interference, delays, and the like.

Abstract: A region data describing method for describing, over a plurality of frames, region data about the region of an arbitrary object in a video, the method specifying the object region in the video with at least either of an approximate figure approximating the region or characteristic points of the region, approximating a trajectory obtained by arranging position data of the representative points or the characteristic point in a direction in which frames proceed with a predetermined function and describing the parameter of the function as region data. Thus, the region of a predetermined object in the video can be described with a small quantity of data. Moreover, creation and handling of data can easily be performed.

Abstract: A method of progressively coding/decoding 3-D mesh information, and an apparatus therefor are provided. The progressive 3-D mesh information coding method includes the steps of reconstructing an input 3-D mesh into a plurality of mesh components, coding each of the plurality of mesh components, and multiplexing the plurality of coded mesh components into a compressed bit stream and transmitting the compressed bit stream. The method of progressively decoding the transmitted, compressed bit stream which has been coded by the coding method, includes dividing the transmitted bit stream into a plurality of coded mesh components, decoding each of the plurality of coded mesh components, and reconstructing a 3-D mesh by synthesizing the plurality of decoded mesh components.

Abstract: A plurality of image production processing parts each of which generates drawing data for image drawing processing from image drawing instructions obtained through data compression. A dividing part which divides the given image drawing instructions into a plurality of sets of image drawing instructions without decompressing them in such a manner that each set of image drawing instructions can be processed by any of the plurality of image producing processing part without referring to any other set of image drawing instructions. A distributing part which distributes the plurality of sets of image drawing instructions to the plurality of image production processing parts.

Abstract: Provided are an input file generation method and system using a meta language regarding graphics data compression. The method includes making an extensible markup language (XML) schema that defines at least a compression node describing object data to be compressed, and parameters used to data compression; making style sheets which support conversion of an input XML file into a file, which is to be input to a data compression encoder, based on the XML schema; and generating a file, which is to be input to the data compression encoder, by parsing the input XML file based on the XML schema and the style sheets. Accordingly, an author can easily use and compress three-dimensional (3D) data using the meta language during authoring 3D contents. Further, the author can select a data compression format and controls data compression. Whether data is to be compressed or not and the format of data compression can be determined by representation of the metal language.

Abstract: The present invention is related to video encoding. In an embodiment, a bit budget is calculated for a first scene. In addition, bit budgets for corresponding frames, including at least a first frame, within the first scene are determined. Optionally, bit budgets corresponding to macroblocks within the first frame are also determined.

Abstract: An apparatus for coding keys of graphic animation data and a method thereof are provided. The coding apparatus for encoding key data corresponding to time variables among graphic animation comprises a quantizer which quantizes the key data and generates quantized data; a differential pulse code modulation (DPCM) processing unit which DPCM processes the quantized data, receives the DPCM processed data, and by repeatedly performing DPCM processing, selects and outputs DPCM data having the lowest dispersion among N-th order DPCM data generated in the DPCM processing; a polar value removing unit which reduces the range of data by removing a polar value in the DPCM data output form the DPCM processing unit; and an entropy encoder which removes the redundancy of binary bits in the data output from the polar value removing unit and generates a compressed and encoded binary bit stream.

Abstract: A video coding and decoding method, wherein a picture is first divided into sub-pictures corresponding to one or more subjectively important picture regions and to a background region sub-picture, which remains after the other sub-pictures are removed from the picture. The sub-pictures are formed to conform to predetermined allowable groups of video coding macroblocks (MBs). The allowable groups of MBs can be, for example, of rectangular shape. The picture is then divided into slices so that each sub-picture is encoded independent of other sub-pictures except for the background region sub-picture, which may be coded using another sub-pictures. The slices of the background sub-picture are formed in a scan-order with skipping over MBs that belong to another sub-picture. The background sub-picture is only decoded if all the positions and sizes of all other sub-pictures can be reconstructed on decoding the picture.

Abstract: A system and method facilitating compression of bi-level images with explicit representation of ink clusters is provided. The present invention includes a cluster shape estimator that analyzes connected component information, extracts clusters and stores the cluster in a global dictionary, a page dictionary or a store of unclustered shapes. A bitmap estimation from clusters component determines dictionary positions for clusters stored in the global dictionary which are then encoded. A cluster position estimator determines page positions of clusters of the global dictionary and/or the page dictionary that are then encoded. Further, the global dictionary, the page dictionary and the store of unclustered shapes are also encoded.

Abstract: A method and an apparatus for encoding/decoding key value data of a coordinate interpolator used in a three-dimensional graphic animation are provided. The apparatus for encoding key value data of a coordinate interpolator representing the position of each vertex of an object using coordinates of each of the vertices including x, y, and z components includes a quantizer, which quantizes a coordinate interpolator input there into with predetermined quantization bits, a DPCM processor, which performs a DPCM operation of a predetermined mode on each component of each vertex of the quantized coordinate interpolator and generates differential data based on the temporal variation of the coordinates of each of the vertices and differential data based on the spatial variation of the coordinates of each of the vertices.

Abstract: A method for reducing data with limited distortion of an image formed of the data includes determining whether reduction of the data is feasible and reducing the data if reduction of the data is feasible. Determining whether reduction of the source data is feasible includes determining whether clipping has been performed. Determining whether reduction of the source data is feasible includes determining whether merging has been performed. Determining whether reduction of the source data is feasible includes determining whether a difference between the width of the source data and the height of the source data is big. Determining whether reduction of the source data is feasible includes determining whether the source data is few. Determining whether reduction of the source data is feasible includes determining whether magnification has been performed.

Abstract: The present invention relates to creating electronic versions of printed documents. A printed document will include steganographic, but machine-readable, indicia thereon. The steganographic indicia provides clues on how best to create a corresponding electronic version of the printed document.

Abstract: A system and method for facilitating low bandwidth video image transmission in video conferencing systems. A target is acquired (video image of a person's head) and processed to identify one or more sub-regions (e.g., background, eyes, mouth and head). The invention incorporates a fast feature matching methodology to match a current sub-region with previously stored sub-regions. If a match is found, an instruction is sent to the receiving computer to generate the next frame of video data from the previously stored blocks utilizing a texture synthesis technique. The invention is applicable for video conferencing in low bandwidth environments.

Abstract: A method, apparatus, and information bearing medium for merging display items in encoded form involve providing display items to be merged in an encoded format, such as a run length encoded format (e.g., modified enhanced run length encoded format). The display items are examined on the basis of item priority. A target item having a target area is defined. The display items in the target area are merged according to item priority to produce the target item. The target item is representative of the merged display items. The encoded data associated with the display items to be merged includes control data and color data. In one embodiment, tokens are produced using the encoded data associated with the display items to be merged. The display items are merged using the tokens. The tokens represent counts of repeated data or pointers to pass-thru data associated with the display items to be merged.

Abstract: Detection of the direction of an original is effected not at the time of scanning the original, but at the time of standby for the start of printing. Thereby, the scanning performance is prevented from deteriorating.

Abstract: A method for controlling the watermarking of a set of multimedia data includes performing a first detection operation for detecting the presence of a first type of watermark in the multimedia data and generating a first partial authorization or prohibition parameter in response to this first detection operation. The method further performs a second detection operation for detecting the presence of a second type of watermark in the multimedia data and generates a second partial authorization or prohibition parameter in response to this second detection operation. A final authorization or prohibition parameter is then generated on the basis of the partial authorization or prohibition parameters generated to authorize or prohibit the transmission of the multimedia data. A device for carrying out the method is also proposed.

Abstract: The present invention allows higher quality video images to be transmitted without a concomitant increase in a total number of video data bits transmitted per frame. Quantization parameters are applied to coefficients of macroblocks within a given video frame. A lower value of the quantization parameter is applied near a central region of a video frame. This central region is referred to as a prime video region. Applying the lower quantization parameter to the prime video region has the effect of increasing the video data bit density within that area. Outside of the prime video region, the video data bit density per macroblock is decreased so as to have a zero net-gain in bit density over the entire video frame. Furthermore, there may be a plurality of prime video regions where quantization parameters are dynamically coded. In this case, the value of the quantization parameter will increase or decrease within a given prime video region based on a relative importance of a particular prime video region.

Abstract: An image input unit acquires a first image and a second image. A matching processor computes a matching between those images such that corresponding points are obtained on the second image with respect to lattice points of a mesh taken on the first image and generates a corresponding point file based on the matching. The corresponding point file comprises positional information on the corresponding points and difference data on attribute values of the corresponding points. An intermediate image generator generates an intermediate image of the first image and the second image, based on the first image and the corresponding point file. In particular, for an attribute such as color, the color difference data on a pair of corresponding points of the first image and second image are used when interpolating, such that the second image is not needed in the interpolation.

Abstract: The present invention relates to an encoding method processing video object planes (VOPs) of I, P or B type and including a dynamic allocation of said VOPs. According to said method, for each input frame a preliminary forward motion estimation is carried out between current and previous frames. Current and previous motion fields are then used to evaluate a coherence factor, expressed as connected to the sums of local differences within current and previous motion field. According to the value of the coherence factor with respect to an empirically determined threshold, a decision is finally taken on the type of the frame to be coded.

Abstract: Various systems, methods, and programs embodied in computer readable mediums are provided for compression of a page frame that includes a number of pixels. In one embodiment, an object map is generated that includes a number of values, each of the values being associated with a corresponding one of the pixels in the page frame. Also, a compressed image file is generated of the page frame that is associated with the object map. Each of the values in the object map indicates whether a blank color conversion or one of a number of predefined color conversions is to be performed during a reconstruction of a corresponding one of the pixels, wherein each of the predefined color conversions includes a corresponding degree of gray component replacement.

Abstract: An encoding system encodes and decodes video data using an exposed area fill processor. A nonkey frame is encoded as a set of kinetic information relating segments of a reference frame to the nonkey frame and the nonkey frame is decoded from segments of at least one reference frame, the kinetic information and results of an exposed area fill process that estimates contents of the nonkey frame not already covered by the segments and the kinetic information. The exposed area fill results can be determined at the encoder and conveyed to the decoder or the decoder can determine the results independently. The encoded video data can include an indication of which of a plurality of fill schemes are used, or the decoder can determine the indication by itself. The exposed area fill information might include bounds of areas to be filled and/or pixel values of pixels therein.

Abstract: A method of reconstructing a previously occluded area of a video image frame exposed by the motion of a segment within said image frame. In one embodiment the method involves approximating the color values of the pixels in the newly exposed area from the color values of the neighboring image segments. The process is refined by identifying a set of neighboring segments to the exposed area, called fill segments, that most closely resemble the color values of the pixels within the exposed area. These fill segments are then used to reconstruct the color values of the exposed area. In one embodiment, the identities of the fill segments are transmitted to an exemplary decoder.

Abstract: This invention has as its object to provide an image processing apparatus and method which can efficiently compress an image while maintaining high image quality, and a storage medium for implementing the method.

Abstract: Representing source data with predefined data patterns, or identifying predefined data patterns in source data, where each data pattern includes a unique combination of pattern elements, without comparing every pattern element of each data pattern to the source data. A hierarchical structure of relationships between the data patterns is predetermined in an initialization stage by comparing the data patterns to identify identical pattern elements among groups of the data patterns. Selected node elements in a resulting relationship tree are compared to the source data to determined deviations. The deviations are propagated and accumulated throughout the relationship structure of the tree, and data patterns having the minimum deviation are selected to represent corresponding source data cells. A graphics pipeline preferably is used to determine the deviations and select data patterns in real time.

Abstract: The present invention concerns a way of compressing an initial data structure that defines an image as an array of pixel elements. The method includes generating a new data structure that defines contours at least some of which are contours having a constant color value to within a tolerance.

Abstract: Systems and methods for encoding and decoding document images are disclosed. Document images are segmented into multiple layers according to a mask. The multiple layers are non-binary. The respective layers can then be processed and compressed separately in order to achieve better compression of the document image overall. A mask is generated from a document image. The mask is generated so as to reduce an estimate of compression for the combined size of the mask and multiple layers of the document image. The mask is then employed to segment the document image into the multiple layers. The mask determines or allocates pixels of the document image into respective layers. The mask and the multiple layers are processed and encoded separately so as to improve compression of the document image overall and to improve the speed of so doing. The multiple layers are non-binary images and can, for example, comprise a foreground image and a background image.

Abstract: A system and method facilitating document image compression utilizing a mask separating a foreground of a document image from a background is provided. The invention includes a pixel energy analyzer adapted to partition regions into a foreground and background. The invention further provides for a merge region component adapted to attempt to merge regions if the merged region would not exceed a threshold energy. Merged regions are partitioned into a new foreground and new background. Thereafter, a mask storage component stores the partitioning information in a binary mask.

Abstract: A method and apparatus to receive an image and to create a smaller representation of the image from a wavelet representation of the image is described. The size of the smaller representation of the image is selected to compensate for the content of the image and physical properties of the display device to display the smaller representation of the image.

Abstract: In a compression and decompression coding method, arrangement and computer program product, a data signal containing a number of symbols is converted into a series of codewords. A set of codewords is established and the data signal is monitored to determine the most frequently occurring symbols therein and/or sequences of symbols therein containing at least two symbols. A codeword is then allocated to each of the most frequently occurring of the symbols and/or symbol sequences. At least one codeword is reserved for indicating uncompressed data. When compressing a signal, the incoming symbols are first checked to determine if they correspond to a codeword. If a symbol corresponds to more than one codeword, further symbols are read until a symbol occurs which corresponds to one codeword only. That codeword is then transmitted. Any symbol that does not correspond to a codeword is supplemented with a codeword indicative of no compression and is then transmitted.

Abstract: In an embedded DCT-based (EDCT) image coding method, decoded images which give better PSNR over earlier JPEG and DCT-based coders are obtained by a scanning order starting, for each bitplane, from the upper left corner of a DCT block (corresponding to the DC coefficient) and transmitting the coefficients in an order of importance. An embedded bit-stream is produced by the encoder. The decoder can cut the bit-stream at any point and therefore reconstruct an image at a lower bitrate. The quality of the reconstructed image at this lower rate is the same as if the image was coder directly at that rate. Near lossless reconstruction of the image is possible, up to the accuracy of the DCT coefficients. The algorithm is very useful in various applications, like WWW, fast browsing of databases, medical imaging, etc.

Abstract: A coding protocol provides for coding video data that has been organized as video objects. The protocol provides a keyregion to permit coding of a region of data within the video object having common attributes. According to the protocol a keyregion is identified by a keyregion header, which includes a resync marker that uniquely identifies the keyregion header, a keyregion position signal indicating an origin and a size of the keyregion; and data of the common attribute. Data following the keyregion is coded according to the common attribute.

Abstract: The present invention relates to methods of marking objects produced through a molding process. The marking facilitates authentication of the objects. A cellular phone faceplate is steganographically marked in one implementation of the invention.

Abstract: In an image-data processing system, as would be found in a digital copier or scanner, a relatively quick calculation is performed to estimate a compression ratio or compression time resulting from applying a compression algorithm to an image data set. If the estimated compression ratio or compression time is determined to be unfavorable, the system is advised not to apply the compression algorithm. The method can also be used to select a type of compression algorithm, such as CCITT G4 or JBIG2, according to the requirements of the larger system.

Abstract: An accurate encoding of image data representing a source image, which data is divided into a multiplicity of blocks is performed in accordance with features of the source image by defining a plurality of sub-areas each of which including one or more blocks; quantizing the multiple blocks; counting the number of valid coefficients among the quantization coefficients in each sub-area; adjusting the quantization coefficients of the plural sub-area in accordance with a distribution of the number of valid coefficients over the plural sub-areas (that is, a degree of appearance of the valid coefficients of each sub-area); and encoding the adjusted quantization coefficients. In addition to the accuracy, encoding of image data using sub-areas enhances a speed of processes.

Abstract: In one embodiment, a scene change detection component of a video encoder uses motion vectors to determine whether a scene change occurs in a video sequence. The scene change detection component uses field motion vectors determined by a motion estimator and compares the field motion vectors to a threshold to determine whether a scene change occurs. In another embodiment, if a scene change occurs, the video encoder can begin a new Group of Pictures (GOP).

Abstract: An image data coding system comprises a screen-area determining means for determining the area of a screen reproduced on the basis of an input image data; a code-amount assigning control means for controlling regions to which data on the screen are to be assigned and the code amount assigned to each of the regions, on the basis of the results determined on the area of the reproduced screen; and a coding means for coding the image data signal inputted in accordance with the code amount assigned to each of the regions. In an image data coding and/or decoding system, a coding system performs the two-dimensional orthogonal transform of picture signals of all the pixels with respect to inside blocks and of only picture signals of pixels contained in a content with respect to edge blocks, in accordance with a map signal indicative of the position and shape of the content, and it codes the map signal.

Abstract: Determining a geometric error of a polygon in a subdivision surface includes obtaining a value that corresponds to an angular difference between a face vector normal to a face of the polygon and a vertex vector normal to a vertex of the polygon, determining a geometric error associated with the vertex based on the value and the face vector, and calculating the geometric error of the polygon using the geometric error associated with the vertex.

Abstract: This invention is to provide a decoding apparatus/method in which a bitstream obtained by coding a plurality of object data in units of objects and multiplexing the coded data is input, coded data of each object is separated from the bitstream, a predetermined object is selected from the plurality of objects contained in the bitstream, the coded data of the object selected by selection means is decoded, object data is output, and the decoded object data is synthesized.