Abstract: A feature coding unit extracts and encodes a feature of a video signal so as to generate a feature stream. A feature identifying unit checks a decoded feature obtained as a result of decoding the feature stream against a search key from a user for a match so that a video content requested by the user is retrieved.

Abstract: The invention relates to a device for demultiplexing coded data corresponding to multimedia objects. The data is organized in a bitstream divided into individually accessible portions—for instance Access Units for an MPEG-4 compliant bitstream—themselves subdivided into smaller data entities—SL-packets in the cited example—which all the demultiplexing operations are applied to. The operations are mainly, for all the data received at the input of the demultiplexing device: reading and formatting of a buffer, extraction of successive Access Unit segments, progressive reconstruction of a complete Access Unit, transmission of the Access Unit to an output buffer or file.

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.

Abstract: An MPEG decoder in a high definition television receiver decodes and decompresses MPEG coded data to produce decompressed image pixel blocks, and includes a motion compensation network coupled to a frame memory to produce finally decoded pixel data for display. The decompressed MPEG data is recompressed by plural parallel recompressors prior to storage in frame memory. Each recompressor receives a datastream of interleaved pixel data, and predicts and compresses interleaved pixel values during each clock cycle, respectively. One of the recompressors is de-energized in a reduced data processing mode when pixel data is subsampled prior to recompression. Subsampled data is re-ordered prior to recompression. Multiple parallel decompressors coupled to the frame memory provide pixel data to the motion processing network. A control unit, insures an uninterrupted interleaved data flow to the decompressors by repeating last valid data when source data is interrupted.

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.

Abstract: A method and an apparatus for encoding and decoding an orientation interpolator indicating the locations of keyframes on a temporal axis and the rotation of an object in each of the keyframes are provided.

Abstract: A method and system for organizing and storing map data that facilitates use of the map data by navigation application programs such as those in navigation systems. The map data represent geographic features located in a region. The map data are organized into parcels such that each parcel contains a portion of the map data. The map data contained in each parcel represent those geographic features contained in a corresponding separate one of a plurality of rectangular areas located in the region. Each rectangular area has a uniform dimension in a first coordinate direction but has a dimension in the other coordinate direction such that the map data that represent the geographic features contained in the rectangular area are close to, but do not exceed, a maximum data size for a parcel.

Abstract: The present invention provides a method of supplementing a digital picture with a shorter delay time and less calculations. The padding method is applied to a picture having a great motion, and results in producing a prediction signal with small errors. The present invention also provides an apparatus using the same method. To be more specific about the method, in a digital picture data including picture information indicating an object, a picture is resolved into a plurality of regions adjoining with each other, and each of the insignificant sample value of a region containing the boundary of the object shape is supplemented (padded) by the values obtained from transforming of the significant pixels near to the insignificant pixels.

Abstract: A shape information coder divides the pixels in the shape information into subsets representing different subsamplings of the shape information. Each pixel in each subset is coded with reference to a context which may be derived from reference pixels in more than one of the subsets. The context preferably includes reference pixels located on all sides of the pixel being coded, which leads to efficient coding. The shape information coder may have two or more cascaded stages, each operating as above, with one subset of pixels passed from each stage to be coded in the next stage. The resulting coded shape information is useful in, for example, wavelet coding of pictures.

Abstract: A system and method is provided for compressing a grayscale pixel image of an object against a background. Processed data, including pixel intensity data, corresponding to an image, is received, and the pixels of the image are categorized as background or object pixels. The pixel intensity values of the image are run-length encoded, which includes background encoding to produce runs of background pixels, and object encoding to generate runs of pixels falling within respective ranges. Each range of the object-encoded runs is defined as a function of the intensity value of the first pixel of a given run. A maximum run-length of background pixel runs, and maximum run-length for object pixel runs is provided. The background and object pixel runs are stored as a compressed image.

Abstract: Methods and systems decode an image content. Such methods and systems decode a coded map signal indicative of the position and shape of a content in a screen inputted for every block of picture signals, perform the resolution transform of the map signal decoded, decode coded orthogonal transform coefficients, perform the inverse orthogonal transform of the orthogonal transform coefficients, and derive a regenerative picture signal resolution transformed from the results in the inverse orthogonal transform.

Abstract: A method, for an use at an macroblock-based object oriented coding of image sequence having a stationary background comprising the steps of: dividing a background region and an object region from an inputted video; determining an coding techniques, for an individual macroblock belonging to each divided region, as a macro block-based object-oriented coding of image sequence having a stationary back ground or a discrete cosine transformation object-oriented coding of image sequence having a moving object region; coding the method information, by which each macroblock is coded, on condition that the total area of each region is identical to the area of the screen; and storing or transmitting the coded data.

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: The method for a sequential prediction of a binary element's state in a binary process and the system for the method implementation are based on the binary process representation by a unique sequence of binary elementary behavioral functions. These elementary behavioral functions are used for building a genotype of the binary process' behaviors. The behavioral genotype is periodically updated through the analysis of the binary process history. The behavioral genotype set defines a set of predicting functions with respect of an evaluation of the binary process' current instability level. The natural selection algorithm that operates upon the set of predicting functions is used in predicting procedures for a non-iterative determination of a state of the forthcoming binary process' element. If the binary process is non-stationary, then a cardinal number of the set of predicting functions is equal or less than a cardinal number of the behavioral genotype set.

Abstract: All macro blocks (MB) decided as an “all_0”, “all_255” or “intra predicted” mode are transmitted as an “intra not coded” mode. A receiving terminal also separates “all_0”, “all_255” and “intra predicted” from the “intra not coded” mode, referring to pixels of a lower layer. “Inter coded && MVD=0” and “Inter coded && MVD!=0” modes are represented as “Inter coded”, and “Inter not coded && MVD=0” and “Inter not coded && MVD!=0” modes are represented as “Inter not coded”. As its result, coding modes on an I-picture can be reduced to two modes and coding modes on a P-picture, or a B-picture, can be lessened to four modes.

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 computing-device implemented method for compressing data, where such devices include a computer, personal digital assistant (PDA), home appliance, and the like. The data includes bandwidth intensive information such as that used in video conferencing, MPEG and equivalent types of digital video encoding, multi-media data transfers, and interactive gaming. In one implementation, a 3D model has objects defined therein. Each object is defined according to a data collection, each element within the collection having a first data size. A distance is determined between a reference point in the model, and a bounding box for an object. A data reduction factor is selected based, at least in part, on the distance. The data collection is compressed according to the distance by mapping each data of the first data size to data having a second data size smaller than the first data size. Other compression methods and apparatus are disclosed.

Abstract: A coded object-based picture signal representing a picture is transcoded to a coded block-based picture signal representing the picture by culling signal portions that represent objects not visible in the picture from the coded object-based picture signal to generate a culled object-based picture signal. Portions of the culled object-based picture signal are partially decoded and from them are generated blocks of a partially-coded block-based picture signal in which the blocks have different coding states. Finally, the blocks of the partially-coded block-based picture signal are re-encoded to generate the coded block-based picture signal in which the blocks have a uniform coding state.

Abstract: A method for supplementing a digital image with picture elements, by which prediction signals having small errors can be generated for a digital image in which objects move greatly through a process which does not cause a long delay time and does not need a large quantity of calculation. In the method, the image is divided into areas. The insignificant sampled values of the areas containing the boundary of the shape of an object are transformed with a function of significant picture element values near insignificant picture element values and used to supplement the digital image. A digital image encoder and a digital image decoder both using the method are also disclosed.

Abstract: A method to transform video data having an interest region by wavelet transform signal processing. First, the video data is transformed to high frequency image data and low frequency image data. Then, first image data recording first information responding to the interest region of the video data and second image data recording second information responding to the interest region of the video data from the high frequency image data are received. The first image data and the low frequency image data are combined to form interest region data. The interest region data and the second image data are combined by bit plane coding to generate display data. Finally, a display device displays the display data.

Abstract: An image processing apparatus for extracting a desired target object from an image which includes the target object, includes a target object identification part identifying the target object from the image, a rectangle extracting part extracting a rectangle which includes the target object identified by said target object identification part, and an image cutting part cutting out a rectangular image including the target object from the rectangle extracted from the image by said rectangle extracting part.

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 two-step motion prediction for MPEG-2 interpolation case-D will yield visual artifacts if not corrected. An improved MPEG-2 decoder includes a logic gate, multiplexer, and adder. When both the horizontal (h0) and vertical (h1) motion vector components require a half pixel interpolation (case-D), the multiplexer forwards the constant minus three to the adder, otherwise a constant zero is used. Such adder modifies the DC coefficient input to the inverse discrete cosine transformer to include a correction term for the predicted pixels calculated by a two-step predictor. A correction value of −0.375 is evenly distributed over all sixty-four resulting spatial coefficients during the inverse discrete cosine transform. This results statistically in a slightly brighter set of correction terms. Such offsets result in a slightly darker prediction that is formed by the two-step predictor. The output frames are statistically correct images.

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 image encoding apparatus comprises: dynamic range estimating means 10101 for obtaining a dynamic range from a target multi-value image to be encoded; dynamic range encoding means 10105 for encoding the dynamic range and for outputting the same as dynamic range encoded data; smoothing function estimating means 10102 for estimating a smoothing function from the target multi-value image; multi-value to binary converting means 10103 for converting the multi-value image to a binary image based on a multi-value to binary conversion criterion determined to match the smoothing function; binary image encoding means 10104 for encoding the binary image and for outputting the same as binary image encoded data; smoothing function encoding means 10106 for encoding the smoothing function and for outputting the same as smoothing function encoded data. This configuration achieves efficient encoding of the multi-value image.

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≦×≦D+e. The output of the difference value rounder 7 is encoded by the decoder 8 to become the encoded signal 9.

Abstract: A compression video decoder and a method thereof, which decodes a standard compressed and encoded video stream, directly outputs the decoded image according to a screen size of a display device without using a special scale-down block for scaling down the image, increases a speed by reducing computational complexity for scaling down the image, maintains quality of the original image, and minimizes distortion.

Abstract: A method and apparatus for reducing video data. The apparatus is composed of a plurality of reducers. A block is received, corresponding to a plurality of color space components and having a width defined by a plurality of pixels digitally represented by bytes. The video data is first reduced by performing power of two reduction. This is followed by fine scale reduction to achieve the final reduced image.

Abstract: In a shape information coding apparatus and method of bordering a binary alpha block (BAB) by pixels to construct contexts when coding binary shape information, adaptive bordering and coding of the shape information is performed in such a manner of receiving the shape information and storing a BAB; determining whether to perform frame mode coding or field mode coding based upon characteristics of the BAB; and when the frame mode coding is selected, performing frame mode bordering before performing frame BAB coding, and when the field mode coding is selected, performing field mode bordering before performing field BAB coding.

Abstract: In a MPEG or other video coding system, regions of each frame may be independently coded for later, independent extraction or processing directly from a compressed bit stream. An encoder/transcoder receives raw video, standard compressed video or compressed video already having independently coded regions (“ICRs”) that are to be edited in some manner. The encoder/transcoder permits user creation of regions, and provides automatic tracking features to identify and select those objects or regions through multiple frames (notwithstanding object movement). The encoder/transcoder re-uses as much compressed input data as is available in generating an output, and so, may be used for real-time encoding and editing processes. To this effect, the encoder/transcoder re-uses original bit stream data as well as original or new motion vector data in compiling an output, or any mix of them as appropriate.

Abstract: Apparatus and methods for compressing data points. The invention compresses the representation of a sequence of points in a space by, for example, dividing the sequence of points into segments of successive points and then compressing each of the segments irrespective of the compression applied to the other segments. The dividing may include dividing the points sequence into segments of S successive points. The value of S may be the value of S generating the smallest of the multiple compressions. The compression may include compressing each of the segments of S successive, i-bit points into segments of j-bit points, where j<=i, j may vary from segment to segment and, for any given segment, j is the minimum number of bits necessary to represent the data in that given segment.

Abstract: A syntax interpretation part interprets a syntax of a given code sequence; and a code sequence creation part creates another code sequence based on the syntax interpreted by said syntax interpreting part. The given code sequence and the other code sequence both comprise code sequence decompressable to be transformed into still image data.

Abstract: A first feature is extracted from first encoded data of a first image. A second feature is extracted from second encoded data of a second image. A first reconstructed image is obtained by decoding the first encoded data. A second reconstructed image is obtained by decoding the second encoded data. The first or second reconstructed image is corrected based on the first and second features. The first and second reconstructed images are synthesized.

Abstract: An apparatus for the verification of compressed objected-oriented video bitstream includes a set of verifier models: Video Complexity Verifier (VCV), Video memory Verifier (VMV) and Video Presentation Verifier (VPV). The models specify the behavior of a decoder for variable VOP size and rate and define new parameters and bounds to measure and verify the computational and memory resources that the bitstream demands. They can be used in the video encoder or in the verification of pre-compressed video distribution.

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: The invention describes a method and system for coding a sequence of pictures using an active triangular mesh coding scheme and a partition tree. It subdivides the current picture into a mesh of blocks with nodes located on high gradient points, further subdividing the blocks into two triangles. The system comprises a projection circuit, for estimating on the basis of the mesh defined for a previous picture a projected mesh made of polygons and corresponding to the current picture, a mesh coding circuit for coding motion and texture associated to said projected mesh, and a texture error detection and coding circuit. Applications are very low bit rate coding, multimedia applications.

Abstract: Since images stored in an image database are encoded, they must be decoded to detect their features. For this reason, when the number of test images is large or each image size is large, the search speed lowers. To solve this problem, a shape information generation unit (4) generates query data on the basis of an image shape input by a shape input unit (3). A comparison unit (5) compares the query data with encoded data of an image read out from an image database (1). If similarity between these two data is high, the comparison unit makes a decoder (6) decode the encoded data of the image; if the similarity is low, it requests the input unit (2) to input encoded data of the next image.

Abstract: A method for producing a compressed bit-stream from a digital image includes the steps of a) processing the digital image to produce a main subject belief map containing a continuum of belief values relating to the importance of subject and background regions in the image, b) performing a spatio-frequency transformation on the digital image to produce an array of transform coefficients, c) deriving a distortion-weighting factor for each transform coefficient from the belief map, and d) producing a compressed bit stream using an image compression system that is responsive to the distortion-weighting factors. The specific image compression system may be selected from a variety of image compression systems, including JPEG compression, JPEG2000 compression or vector quantization.

Abstract: A method and apparatus for compressing a digitized image. Boundaries of regions within a digitized image are identified. Shapes are selected from a bank of shapes based on the identified boundaries to represent the regions. Position and size information based on the position and size of the regions within the digitized image are associated with the selected shapes. Values are transmitted indicating the selected shapes and the associated position and size information as a representation of the digitized image.

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: Picture data which has been caused to undergo repetitive transform encoding (e.g., fractal encoding) is caused to undergo repetitive transform decoding while implementing scaling at a repetitive transform decoding unit 20 to temporarily preserve the decoded picture thus obtained at a buffer section 9. At the shape information calculating section 12, an approach is employed to calculate shape of object while implementing scaling thereto to send the object shape thus obtained (e.g., polygon) to a picture mapping section 10 to implement mapping to decoded picture from the buffer section 9. Thus, there is realized a texture mapping apparatus such that picture quality of texture is difficult to be deteriorated even when deformation takes place, such as, for example, at the time of zooming, etc.

Abstract: A method and system for compression encoding a video signal representative of a plurality of image frames which include a starting frame, an ending frame, and at least one intermediate frame, provides for identifying key points of at least one object in the starting and ending frames. For each object, a mathematical transformation is determined which estimates a representation of the corresponding key points in each intermediate frame by mapping the feature points from the starting frame to the ending frame. The representation of the object in the starting frame and the mathematical transformation are encoded and multiplexed to form an object bit stream. Each object bit stream produced in response to a set of image frames is then multiplexed to form an image bit stream. A signal-to-noise ratio can be scaled by adjusting the number of feature points identified, which in turn allows the compression ratio to be selectively changed.

Abstract: A method for re-indexing a palette-indexed image is disclosed. The method uses an array of symbol cross-counts that indicate the degree of occurrence, within the image, of symbols in one or more predefined contextual relationships, such as symbol adjacency. One objective of the method is to manipulate the palette index such that adjacent symbols in the image are assigned indices that are as close as possible in symbol space, thus enhancing the subsequent compressability of the image with many lossless compressors. As global minimization is generally computationally impracticable, the disclosed embodiments present a greedy suboptimal solution to this problem. The basic method uses a one-dimensional reassignment pool and a seed symbol. A single symbol is selected for positioning either to the immediate right or left of the seed in the pool, according to a potential function that uses the cross-count array.

Abstract: An imaging apparatus receives a stream of image data compressed according to a token based compression algorithm. The token dictionary is decompressed and processed according to desired standards such as optimizing for a particular image output device. After revision, the revised tokens are stored in a revised dictionary which is accessed upon decompression of image content. When the image content is decompressed the locations in the compressed or coded input data stream refer to locations in the revised dictionary which are extracted and output either to hard copy or for further processing.

Abstract: The invention relates to a method of coding a sequence of pictures using a segmentation operation of each of the pictures followed by a coding operation of each of the obtained successive partitions, and to a corresponding system. The system includes a projection circuit (11), for estimating on the basis of the mesh defined for a previous picture a projected mesh made of polygons and corresponding to the current picture, a mesh coding circuit (12, 13, 14, 15) for coding motion and texture associated to the projected mesh, and a texture error detection and coding circuit (16, 17).

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.

Abstract: A digital image coding method comprises the steps of: dividing an image into plural regions each having an arbitrary shape, subjecting an image signal of a required region of the plural regions to transformation so that an arbitrary shape of the required region of a boundary between the required region and a region adjacent thereto is-transformed, and compressively coding the image signal of the required region and compressively coding image signals of regions except the required region with-out subjecting them to transformation; generating identifiers for identifying respective regions; generating list information which describes an identifier of a region adjacent to the required region, which is required for restoring the transformed shape to the shape before transformation; and outputting compressively coded data in which the image signals of respective regions have been compressively coded, the identifiers of respective regions, and the list information an a coded image signal.

Abstract: In decoding code data encoded in object units, decoders corresponding to the number of objects are needed. However, it is impossible to always provide a sufficient number of decoder. Accordingly, when code data 8 is decoded, an object combiner 43 refers to the number s of objects included in the code data 8, detected by an object counter 41, and the number d of object decoders, detected by an object decoder counter 42. If s>d holds, the object combiner 43 regulates the number of the objects of the input code data 8 to d.

Abstract: A decoder decodes encoded binary image data on each block in order to recover a target block of the binary image. The image decoder includes motion compensated blocking which obtains a reference block from a reference binary image by applying motion compensation using motion information. A selector selects a statistical model from among a plurality of statistical models, based on states of pixels surrounding a reference pixel in the reference block, in which the reference pixel also corresponds to a target pixel in the target block. An arithmetic decoder recovers the target block by decoding the encoded data using the selected statistical model. In one embodiment, the pixels surrounding the reference pixel in the reference block are pixels positioned within one pixel distance from the reference pixel.

Abstract: An image data encoding apparatus includes a wavelet transform unit which produces a first subband coefficient and a second subband coefficient as an output in response to each of blocks of the input image data, the first and second subband coefficients being produced by performing a multiple decomposition process in which only the first subband coefficient is further decomposed. A first text transform unit produces an intensity coefficient of a first kind as well as a set of coefficients of a second kind as an output in response to each block, the intensity coefficient including significant bits, and only the intensity coefficient being further decomposed in the first text transform unit. A second text transform unit produces a set of coefficients of the second kind as an output in response to each block, one of the coefficients of the second kind including significant bits but not being further decomposed.