Abstract: A semiconductor failure analysis system which includes a failure information collection unit for collecting, by bit, failure information concerned with a failure of a semiconductor, an inspection unit for examining relations between various types of inspection data obtained by inspection of the semiconductor and for examining relations between said inspection data and the failure information, a storage unit for storing information concerned with design of said semiconductor, an analysis unit for analyzing the failure information on the basis of output information output from the failure information collection unit, output information output from the inspection unit and design information stored in the storage unit, a display unit for displaying at least one of the result of analysis output from the analysis unit and the failure information, a failure cause estimation unit for estimating a cause of said failure information, and an unit for feeding the estimated cause of said failure information back to a proce

Abstract: An object of the present invention is to provide an image cutout method capable of moving a nozzle on a photographic image along a contour of a subject and binarizing image data in the nozzle to obtain the contour line of the subject, and cutting out the image along the obtained contour line, and as a result, allowing efficient cutout without putting a load on an operator. To achieve the object, when the nozzle is moved, a direction for moving the nozzle is determined based on a partial contour line in the obtained present nozzle. Thus, it is possible to move the nozzle along the contour of the subject without operator's operation of a pointing device and the like.

Abstract: A control means 101 is responsive to the shape of data inputted by inputting means 32 to control designating means 102 to switch interleaving patterns of addresses of a memory 18 designated for accessing means 103a to 103d. The designating means 102 designates to the accessing means 103a to 103d addresses of the memory 18 to be accessed under control by the control means 101. The accessing means 103a to 103d simultaneously access plural addresses of the memory 18 designated by the designating means 102. By switching to an appropriate interleaving pattern of simultaneously accessible addresses for accessing the memory with a minimum number of accessing operations for performing predetermined data processing operations, the efficiency of data processing may be improved.

Abstract: A method for compressing a mesh having a plurality of vertices, each vertex characterized by a degree equal to the number of edges incident thereon, including arranging substantially all of the vertices in a consecutive order, generating a topology list including the degrees of the vertices in the consecutive order, and providing a coded stream of signals including the topology list.

Abstract: A method of coding an object of an arbitrary shape. The arbitrary shape coding method includes the steps of: (a) determining whether or not a shape in a video object layer (VOL) is an arbitrary shape; (b) calculating the size of a video object plane (VOP) in each frame if the shape in the VOL is determined as being an arbitrary shape in the step (a); (c) coding information of each frame about whether or not all macroblocks in the VOP are opaque; (d) coding the VOP in macroblock units if the shape of each frame is determined not to be all opaque in the step (c); and (e) coding only motion and texture information in the VOP, by macroblock, if the shape in the VOL is determined to be a non-arbitrary shape in the step (a) or if the shape in the VOP in a frame is determined as all opaque in step (c).

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: A method restores a binary shape signal which has been downsized through the use of a sub-sampling or a down-sampling technique. The downsized binary shape signal contains a plurality of reference lines, wherein each reference line includes one or more segments having successive object pixels therein, and the binary shape signal is restored based on the downsized binary shape signal. Once interpolation lines corresponding to the reference lines are produced based on the number of segments on each of the reference lines, positions of the segments, and the number of object pixels on each of the segments, and then the restored binary shape signal is provided by alternately combining each of the interpolation lines and each of the reference lines.

Abstract: A digitized topology data compression and decompression method provides the digitized topology data of a collection of segments connected to each other via nodes. The method forms at least one composite line representing a chain of connected segments, which reduces an overall number of lines needed to represent the collection of segments and where each composite line has two end points at known coordinates, resulting in compression of the topology data. The method further represents each composite line by its respective end point coordinates. Next, the method enrolls each composite line into one of at least two sets of composite lines for minimizing a number of intersections between each of the composite lines within each of the sets of composite lines. Finally, the method reconstructs the nodes at a decompression time by calculating coordinates of intersecting composite lines belonging to different sets of composite lines.

Abstract: A method of transmitting pictorial data provides for reduction of required transmission bandwidth by constructing the pictorial data in the form of a composite image of primitive pictures. Each of the primitive pictures has a simple geometric form such as a line, a circle, a triangle, and a quadrilateral. Each of these primitive pictures is identified by a parameter, which may take the form of an alphanumeric character. Coordinates of a center of a circle, and of end points of a line, and of vertices of a polygon are identified by pairs of parameters giving the X and the Y coordinates of a two-dimensional display of the image. If desired, the image can be constructed as a perspective view of a three-dimensional object, in which case tetrahedrons, spheres, and hexahedrons may be employed. The parameters are converted to digital signals which are transmitted via a communication link to a display for the regeneration of the original image.

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: This relates to a method for image segmentation and video object tracking. While conventional methods rely on the motion homogeneity of the objects to be tracked, the present method is based on a concept of partition projection in which both spatial and motion information are now exploited, and implemented by means of a modified double partition approach, including a re-segmentation of a first partition followed by a projection step of the obtained fine partition into the current frame. Objects presenting non-homogeneous motion, static objects, and parts of an object with homogeneous motion can thus be tracked.

Abstract: Pattern encoding is carried out by 1) substituting an index data of a registered pattern for a position data in a library with respect to an index data peculiar to each of the extracted patterns, 2) taking a difference between an off-set position data of the extracted pattern and an off-set position data of the registered pattern whereby an off-set position difference data is provided, and 3) encoding the position data and the off-set position difference data and providing an encoded data. A pattern extracting unit obtains the extracted patterns from image data. An accumulating/checking unit accumulates the extracted patterns as accumulated patterns, assigns indexes specific to the accumulated patterns, and checks each extracted pattern by comparison with the accumulated patterns. When an accumulated pattern is found to match the extracted pattern, the accumulating/checking unit provides a position data within a library instead of the index data, and also provides the off-set position difference data.

Abstract: A method for scalably inter-contour coding a video signal including a previous and a current frames, wherein each of the previous and the current frames contains a contor, first generates a predicted contour by motion estimating and compensating a previous base layer, widens the predicted contour by a predetermined threshold D.sub.max (j), generates (j)th primary and secondary vertices, and reconstructs a current base layer, j being 0. Thereafter, the method widens the predicted contour by the predetermined threshold D.sub.max (j+1), generates (j+1)st primary and secondary vertices, and updates the (j)th primary and secondary vertices. Then, the (j)th primary and secondary vertices are encoded, and encoded primary and secondary vertex information is formatted in a predetermined way. Finally, the value of j is increased by 1, and the process from widening the predicted contour by D.sub.

Abstract: An image processing apparatus and method are adapted to prevent a decline in image quality while reducing the number of bits in a discrimination signal stored in memory. The apparatus includes an image compressing device for encoding image data in prescribed block units and then storing the encoded data in a memory, after which the stored image data is decoded and outputted. A black-character discriminating unit discriminates a plurality of attributes of the image data, and a black-character compressing device encodes the plural results of discrimination in conformity with the image processing. The plurality of codes are divided into blocks of different sizes in such a manner that resolution is reduced, and the codes are stored in memory. Thereafter, the stored codes are decompressed and sent to a masking UCR circuit and to a spatial filter. On the basis of the codes sent, the masking UCR circuit and spatial filter apply image processing to the image data outputted from the image compressing device.

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: 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: In a digital video compression system that includes both a real buffer of size B.sub.max, and a smaller virtual buffer of size B.sub.virtual, a method for controlling the generated bit rate of compressed video information to keep within the maximum buffer capacity is disclosed.

Abstract: A shape coding method of coding an object shape signal indicating a prescribed object shape in an image display signal, includes coding the object shape signal for each unit region of a prescribed size on a display screen to generate a coded shape bit stream, and decoding a signal which is in the middle of the coding to generate a locally decoded shape signal; analyzing the locally decoded shape signal for each unit region, and deciding at least one of a type of shape post-processing of the locally decoded shape signal for making an object shape obtained from the locally decoded shape signal smooth and whether to perform the shape post-processing to the locally decoded shape signal, in accordance with an analysis result; and outputting one of the locally decoded shape signal to which prescribed shape post-processing has been performed and the locally decoded shape signal to which the shape post-processing has not been performed, as a coding shape signal for use in coding a signal other than the object shape s

Abstract: An improved grid moving method using a selective pixel search method and an apparatus using the grid moving method which are capable of forming a grid with respect to an image of an object having a shape information and/or an image information, defining a unit region, moving the thusly formed grid, re-constructing an image grid, so that it is possible to reduce the number of blocks which are occupied by an object to be coded, thus significantly reducing the amount of computation and increasing a computation speed.

Abstract: Temporal and spatial scaling of video images including video object planes (VOPs) in an input digital video sequence is provided. Coding efficiency is improved by adaptively compressing scaled field mode video. Upsampled VOPs in the enhancement layer are reordered to provide a greater correlation with the input video sequence based on a linear criteria. The resulting residue is coded using a spatial transformation such as the DCT. A motion compensation scheme is used for coding enhancement layer VOPs by scaling motion vectors which have already been determined for the base layer VOPs. A reduced search area whose center is defined by the scaled motion vectors is provided. The motion compensation scheme is suitable for use with scaled frame mode or field mode video. Various processor configurations achieve particular scaleable coding results. Applications of scaleable coding include stereoscopic video, picture-in-picture, preview access channels, and ATM communications.

Abstract: An apparatus, for use in a context-based arithmetic encoding of a binary shape signal, generates a bordered block having a border of width D around a target block based on the binary shape signal which includes a plurality of blocks of P.times.Q pixels having one of a larger and a smaller binary values, P and Q being positive integers, respectively, and the target block is one of the blocks of P.times.Q pixels. In order to produce the bordered block, the apparatus first calculates a weighted mean for each of the border pixels in the bordered block by using N number of neighboring pixels, N being a positive integer. Each of the weighted means is compared with the larger binary value to thereby assign either the larger or the smaller binary value to each of the border pixels. After the binary value to be assigned to each of the border pixels is determined, the apparatus constructs the bordered block based on the binary values assigned to the border pixels and the binary shape signal.

Abstract: A system and method of encoding and decoding a dynamic mesh includes encoding and decoding a mesh geometry of a set of node points and encoding and decoding a mesh node motion vector for each node point.

Abstract: A sprite generation method used in video coding generates a sprite from the video objects in the frames of a video sequence. The method estimates the motion between a video object in a current frame and a sprite constructed from video objects for previous frames. Specifically, the method computes motion coefficients of a 2D transform that minimizes the intensity errors between pixels in the video object and corresponding pixels inside the sprite. The method uses the motion coefficients from the previous frame as a starting point to minimizing the intensity errors. After estimating the motion parameters for an object in the current frame, the method transforms the video object to the coordinate system of the sprite. The method blends the warped pixels of the video object with the pixels at corresponding positions in the sprite using rounding average such that each video object in the video sequence provides substantially the same contribution to the sprite.

Abstract: Provided is a gray scale shape data encoder in shape data coding devices, including: video signal generating device for receiving a video signal, extracting and outputting shape data; transparency data extracting device for receiving the shape data from the shape data extracting device, extracting and outputting transparency data; boundary block merging device for receiving the transparency data output from the transparency data extracting device, performing a boundary block merging, and outputting the merged signal; transparency data coding device for receiving the transparency data merged in the boundary block merging device, coding and outputting them; supporting device for receiving the shape data from the shape data extracting device and extracting binary shape data; binary shape data coding device for receiving binary shape data from the supporting device, coding and outputting them; and binary shape data decoding device for receiving the coded binary shape data from the binary shape data decoding devic

Abstract: A method and apparatus for generating region frames from video frames are disclosed which employs an industry standard encoder to lessen the negative impact on the quality of the transmitted video sequence while consuming fewer bits. The invention utilizes image segmentation and color replacement techniques to create the region frames. Each region frame includes a subject region, zero or more previously segmented regions and zero or more non-subject regions. The subject region is defined by the pixels of the original video frame. The previously segmented regions and non-subject regions are assigned replacement pixels P.sub.n,y and C.sub.n, respectively. The replacement pixel C.sub.n is chosen to indicate a color that is not likely to be confused with any color in the subject region R.sub.n. The replacement pixels P.sub.n,y are chosen such that the compression ratio of the region frame data is maximized.

Abstract: A video signal encoder codes texture information of a video signal which includes the texture information and shape information on each of macroblocks. The encoder generates a predicted coded block pattern type (CBPY) bit-number based on the shape information on a target macroblock. In the meantime, a DCT.sub.-- type of the target macroblock is determined based on the texture information on the target macroblock, wherein the DCT.sub.-- type represents a more effective coding technique between a progressive and an interlaced coding techniques for encoding the texture information, thereby producing DCT.sub.-- type information representing the DCT.sub.-- type. In response to the DCT.sub.-- type, the texture information on the target macroblock is transformed and CBPY information for the target macroblock is generated based on the transformed texture information.

Abstract: In a coding system, an input picture is split into regions with adaptive configurations to a reference picture, a selected region with precedence data is detected of its configuration and of its relative motion to a corresponding region of the reference picture, a prediction region is generated from the corresponding region of the reference picture and the relative motion, a difference region is determined between the selected region and the prediction region, and the precedence data, detected configuration, relative motion and difference ergion are coded. In a decoding system, a decoded prediction region is generated from a decoded relative motion and a corresponding region of a reference picture selected by a decoded precedence data, and a decoded difference region is added to the decoded prediction region to obtain a decoded picture region, which is configuration-corrected by a decoded configuratrion data, before synthesizing a plurality of decoded picture regions to obtain a synthesized picture region.

Abstract: An object-based image/video coding algorithm that encodes arbitrary shaped objects using LOTs defined on rectangular and L-shaped regions. The regions of support of the blocks in the L-shaped regions are extended to form tapered overlapping regions that meet at the object's exterior and concave corners. The overlapping regions taper to the corners with a slope having a magnitude .delta./.epsilon., where .delta. and .epsilon. are the amounts of overlap between the blocks. This allows the basis and tapered window functions to be defined in the L-shaped region and specifically in the tapered overlapping regions in a manner that maintains the orthogonality of the basis functions while providing a smooth transition at the edges.

Abstract: A method for encoding input contour image including a current contour based on a previous contour, the contour encoded previously, is provided. In this method a predicted contour is generated from motion estimating and compensating the previous contour based on the current contour. By indexing the contour pixels on the predicted contour and encoding the indices of the end-points of matched segments, parts where the predicted and the current contours overlap, encoded major vertex information is provided. Unmatched segments, parts on the current contour which are not included on any of the matching segments, are polygonal approximated to find minor vertices and relative location of the minor vertices are encoded to provide encoded minor vertex information. When encoding the minor vertices, modes for encoding the number of minor vertices are selected to minimize the number of bits for encoding the number of minor vertices.

Abstract: A method for content-scalable shape representation is described. In content-scalable shape representation, the more important parts of the image are encoded using a larger number of bits within a single hierarchical layer, or within one or more layers of multiple hierarchical layers. This representation may be used with the framework of a hierarchical vertex-based shape representation technique. The method described herein provides for the representation of shapes either by selected verticles along a contour, or by binary bit maps. The resulting representation facilitates content-scalable coding.

Abstract: A method and apparatus for dynamic image processing in which an image is compressed and subsequently expanded or synthesized into an image for display, wherein the image processing is carried out by considering the image information as distributed in a three-dimensional space composed of the two-dimensional image plane and a time axis defined by the time of each of successive video image frames of the input video signal. A multiple resolution filter is employed that has different resolutions provided by increased orders of differentiation and two-dimensional image data is analyzed as it is distributed along the time axis.

Abstract: A method and device for processing image data for a document includes the steps of reading RGB image data for the document; dividing the document image data into a plurality of blocks including a prescribed pixel matrix; calculating an average value information and a gradation range index for each of the blocks; converting the data for each pixel of each of the blocks into coded image data based on the average value information and the gradation range index so that the coded image data defines each pixel with fewer gradation levels than the original image data; storing in a memory unit the gradation range index and coded data, which were obtained for each block through the converting step; forming letter distribution histograms for a primary scanning direction and a secondary scanning direction for each block determined to belong to a letter image; identifying a direction in which letters of the document are aligned based on a number of change points in the histogram for the primary scanning direction and a n

Abstract: Image data compression apparatus for generating groups of encoded image data representing respective sub-areas of an image, in which the degree of data compression applied to each sub-area is specified at least in part by an attribute value associated with that sub-area, comprises selection logic for selecting the attribute value to be associated with each sub-area of an image; an attribute encoder for encoding the attribute value for each sub-area of the image according to a selected one of a plurality of predetermined sets of attribute codes, different sets of attribute codes being encoded using different respective quantities of data; a comparator for comparing attribute values for a group of the data blocks to detect whether the attribute values for the group of sub-areas could be encoded using a replacement one of said sets of attribute codes requiring a smaller quantity of data; and replacing logic responsive to a detection that the attribute values for the group of sub-areas could be encoded using a re

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: An image encoder for encoding the image data so as to make the image quality of a selected area better than that of the other areas without increasing the amount of data is disclosed.

Abstract: An apparatus for encoding a digital video signal to reduce a transmission rate of the digital video signal, which comprises a feature point based motion compensation circuit for selecting a set of feature points from the reconstructed reference frame to detect a set of motion vectors between a current frame and a original reference frame corresponding to the set of feature points by using a feature point based motion estimation, and for generating a second predicted frame based on the set of motion vectors and the reconstructed reference frame. The feature point based motion estimation employs a convergence process in which a displacement of each of the feature points are given to a motion vector thereof and the six triangles of each of the hexagon are affine-transformed independently using the displacements of their vertex feature points. If the displacements provide a better PSNR, the motion vector of the subject feature point is sequentially updated.

Abstract: A picture encoding method in which a picture constituting a motion vector is divided into an object picture in which the main concern is a picture making up the moving picture and the other picture, the object picture is further divided into a texture picture representing brightness and color hue of the picture and a shape picture representing the shape of an object and the texture and shape pictures are respectively encoded. The motion vector of the shape picture is detected to output the motion vector of the shape picture, and the shape picture is encoded based on the motion vector of the shape picture to output encoded data of the shape picture. The motion vector of the shape picture is encoded to output encoded data of the motion vector of the shape picture, and the motion vector of the texture picture is decoded, using the motion vector of the shape picture, to output the motion vector of the texture picture.

Abstract: A method for encoding mode signals of a target block of M.times.N pixels having a binary value `0` or `255` is provided. If the target block is determined as neither "all.sub.-- 0" nor "all.sub.-- 255", the target block is divided into a top field and a bottom field, wherein the top field contains every odd row of the target block to have M/2.times.N pixels and the bottom field contains every even row of the target block to have M/2.times.N pixels. After encoding the top field, the method encodes the bottom field based on the top field to generate modified bottom field-coded data and a modified bottom mode.

Abstract: In a video analysis device, a frame separator separates from frame images respresentative of a moving object at least first and second key frames based on either a scene change or a great movement of the object. Responsive to color and edge information, a region divider divides each key frame into region data. A vector detector applies block matching to the key frames to detect block motion vectors and detects in response to the region data of the first key frame a plurality of region motion vectors. Responsive to the region data and the region motion vectors, a correspondence establishing unit establishes correspondence between one of the region data of the first key frame and the region data of the second key frame to identify the object.

Abstract: A transformation method provides a multi-dimensional affine transformation for representing motion between corresponding image components of successive video image frames. The multi-dimensional affine transformations can represent complex motion that includes any or all of translation, rotation, magnification, and shear. The transformation method of this invention includes determining motion transformations between corresponding pixels in the image components of the first and second video image frames. From the motion transformations between corresponding pixels, multi-dimensional affine motion transformations between the corresponding image components are determined. This transformation method increases the accuracy with which complex motion is represented and results in fewer compression or encoding errors in comparison to conventional methods, thereby increasing compression efficiency.

Abstract: A method for compression and decompression of dithered images is disclosed. Logical units (tiles) of the binary representation are classified into equivalence classes which are then compressed. Each equivalence class represents tiles having similar gray levels (i.e. the same number of black pixels), but which may have different sequences of black and white pixels. Each equivalence class has associated with it a predefined set of rendering exemplars. Each of the exemplars has a similar gray level. Upon decompression, each instance of an equivalence class takes on the value of one of the rendering exemplars which is selected pseudo-randomly.

Abstract: A picture signal encoding system capable of transmitting a motion picture at an extremely low rate while sufficiently controlling the occurrence of a retransmission mode and the occurrence of a picture freeze. The encoding system comprises an encoding control section, an attribute memory, an attribute prediction section and an area extraction and recognition processing section. For realizing the extremely low rate transmission, the encoder system integrally performs the alteration of the syntax, the substitute of the code word, the adaptive control for the prediction of the current frame encoding attribute based on the past encoding attribute and the attribute decision, the object area extraction based on the motion and a model, the area-separated quantization control, and the control of the necessary number of transformation coefficients according to the use mode, the transmission rate and the motion occurrence quantity. A protocol transformer is provided to match the current picture compression standard (H.

Abstract: A process for producing a compressed representation of 2D and 3D images. The image is represented in a compressed form by approximating regions with slowly changing brightness or color, by a background, formed by low degree polynomials. Fast brightness or color changes are represented by special models, including local models and curvilinear structures. Visual adjacency relations between the models are identified, the background partition represents these adjacency relations, curvilinear structures are approximated by spline functions. The three-dimensional image is represented by producing one or several compressed images of the scene from different positions, in which a depth value is associated to each model. A view of the scene from any prescribed point is produced by a geometric processing of these compressed data.

Abstract: A hierarchical object encoding technique or process capable of representing general binary arbitrary shapes that include, for example, embedded or disconnected components. The method decomposes successive layers of general binary arbitrary shapes into simple arbitrary shapes. Each mask formed in this manner is a simple arbitrary shape having only a continuous outer boundary. Accordingly, each outer boundary is encoded, preferably by a contour encoding method, to provide accurate encoding of general binary shapes.

Abstract: Methods and systems for compressing data representing a video sequence having a plurality of image frames include obtaining a plurality of basis image frames which represent an anticipated range of motion of at least one object in the video sequence and an actual current image frame and a previous image frame of the at least one object. A plurality of feature points of the at least one object are located in each of the plurality of basis image frames, the previous image frame, and the actual current image frame. A mathematical transformation which maps locations of the feature points in each of the plurality of basis image frames and the previous image frame to locations in the actual current image frame is determined. The mathematical transformation is then encoded for transmission.

Abstract: Video encoding and decoding processes provide compression and decompression of digitized video signals representing display motion in video sequences of multiple image frames. The encoder process utilizes object- or feature-based video compression to improve the accuracy and versatility of encoding interframe motion and intraframe image features. Video information is compressed relative to objects or features of arbitrary configurations, rather than fixed, regular arrays of pixels as in conventional video compression methods. This reduces the error components and thereby improves the compression efficiency and accuracy. The decoder process decompresses the encoded video information to reconstruct the objects or features of arbitrary configurations.

Abstract: A processing of causing a face image of a person A as an object of encoding to be deformed in correspondence to expression and motion of a face image of a person B as a reference image. The expression change and the motion from the model wire-frame are treated as fitting information, and this fitting information is made WA1 with respect to a first image of an object for photographing, while is made Wb1 with respect to a second image of an object for photographing. For example, the fitting information from a model wire-frame W00 to an image A1 is Wa1, and the fitting information from the image A1 to the model wire-frame W00 is Wa1. Next, an image A2 into which the first image A1 is caused to be deformed by a texture Ta1 of the first image A1 and a wire-frame function Wb1 Wa1 is obtained through composition.

Abstract: An apparatus for encoding input images and methods of operating the same result in a video encoder that improves compression performance of the video encoder engine. The video encoder comprises image interpolation resources configured to interpolate an input image to provide an interpolated input image. Block matching resources is coupled to the image interpolation resources having a last encoder input image to provide a best match input image from the interpolated input image in response to the last encoder input image. An encoder engine is coupled to the block matching resources to provide the last encoder input image to the block matching resources and to encode the best match input image.

Abstract: In two-dimensional model based image coding, an image is partitioned into domains, and the pixels of each domain are modeled with a polynomial intensity function. An image coded in this fashion is comprised of a description of the domain boundaries and individual descriptions of polynomial intensity functions. In order to trade rate for distortion it is desirable that the accuracy of the descriptions be proportional to their length. A polynomial description that is natural for trading rate for distortion is a sequence of samples of its generated surface. If the locations of the samples are implicitly determined from domain shape, an n term polynomial description is comprised of n sample values, and rate is traded for distortion via sample value quantization. In order to bound the sample values to the dynamic range of the image, their locations must be constrained to lie within their associated domain.

Abstract: An improved grid moving method of an object image and an apparatus using the same which are capable of reducing the amount of information with respect to the image of an object by moving the grid in accordance with a position in which an image of the object having shape information exists, which include the steps of: a moving step for forming a grid over an image of an object having shape information, segmenting the image into a plurality of unit regions, and moving the formed grid; a judging step for judging an amount of the information at each position to which the grid is moved in the moving step; a detecting step for detecting a position at which the amount of the information is reduced; a compaction step for reforming the grid in accordance with the position detected in the detecting step and for coding the image of the object existing in unit regions of the reformed grid; and a motion estimation step for reforming the grid in accordance with the position detected in the detecting step and for estimating