Abstract: A method, medium, and system encoding and/or decoding image data by dividing image data into block units, and generating a bitstream by entropy encoding the image data in order of the divided blocks. The decoding method may include receiving an input of a bitstream, and restoring image data by entropy decoding the block units of the bitstream. According to the method, medium, and system, when image data is encoded and/or decoded by using a residue color transform, a bitstream can be generated and encoded in block units of the image, and when the bitstream is decoded, an image can be restored from the bitstream. By doing so, the conventional delay of image processing can be prevented.

Abstract: A code pattern for providing information is disclosed, which can effectively improve the ratio of effective marks, and the effective marks are distributed in a rhombus area. The code pattern comprises: a plurality of nominal positions and a plurality of information marks. The nominal positions are respectively located at a plurality of intersections of a plurality of first hypothetical lines and a plurality of second hypothetical lines, and the first hypothetical lines are parallel to one diagonal line within the rhombus area. The plurality of information marks are respectively disposed within the area formed by the nominal positions, and each information mark is used to represent one of at least two values.

Abstract: The present invention includes a method to use a phase modulating micromirror array to create an intensity image that has high image fidelity, good stability through focus and good x-y symmetry. Particular aspects of the present invention are described in the claims, specification and drawings.

Abstract: A method for classifying two-dimensional shapes comprising: creating a training dataset for the shape under study with a similar shape group and a dissimilar shape group; computing an average shape from the similar shape group; aligning all shapes in the database to the average shape; and classifying shapes into two clusters based on their similarity distances.

Abstract: A block (300) of image elements (310) is compressed by determining multiple base vectors (510, 520, 530, 540) based on the feature vectors (312) associated with the image elements. Additional vectors (560, 570) are calculated based on defined pairs of neighboring base vectors (510, 520, 530, 540). A vector among the base vectors (510, 520, 530, 540) and the additional vectors (560, 570) is selected as representation of the feature vector (312) of an image element (310). An identifier (550) associated with selected vector is assigned to the image element (310) and included in the compressed block (500) which also comprises representations of the determined base vectors (510, 520, 530, 540).

Abstract: A codec device is disposed in a display control device for instantly supplying decompressed image data to manipulating devices in the display control chip. Reference images are stored in compressed format after instantly compressed by the codec device. In addition, MSB portions and LSB portions are separately compressed for gaining higher compression ratio. Predication of the pixel value is also modified in variable length coding. On-chip line buffer is also applied with the instant compression mechanism. Fixed compression ratio is predetermined to actually downsize the chip design for the worst case.

Abstract: A method, system, computer-readable medium, and apparatus for identifying a boundary of a cluster in a bitmap, the bitmap having at least one initially set bit, for applying an expansion shape to each of the initially set bits in the bitmap and identifying vertex bits on the boundary of the cluster formed by at least one expansion shape. A method system, computer-readable medium, and apparatus for identifying vertex bits in a bitmap having at least two adjacent bits with non-zero values forming a boundary of a cluster, the interior bits of the cluster having a zero value, including starting from a current non-zero bit, evaluating at least a first adjacent bit and a second adjacent bit, setting an adjacent non-zero bit as the new current bit, and identifying the current bit as a vertex bit if a direction of motion from the current bit to the new current bit changes.

Abstract: A method determines a warping function between a first image and a second image. For each pixel in each scan-line of the first image, a distance matrix is constructed which represents distances between the pixel and a plurality of corresponding pixels of a second image. The distance matrices are ordered according a scan-line order of the pixels.

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 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 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 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: An efficient way to perform rendering operations in an image processing environment includes a warping engine having a warping module and a domain of definition (DOD) module. When an object is warped, a new DOD for the image is determined by the warping engine by comparing the location of certain pixels in the warped image with their corresponding locations in the original image. By maintaining a DOD for the warped images, only that portion of the DOD that intersects with a region of interest is computed, thus resulting in optimized performance.

Abstract: A method of representing motion of an object appearing in a sequence of images comprises deriving for each image a set of representative points representing the location of the object, deriving an approximate function representing the trajectory of a representative point in two or more of said sequence of images, and calculating an error value for said approximate function for the representative point for an image, characterised in that the error value is based on the difference between the area of the object as represented by the representative point and the area of the object with the representative point replaced by the respective approximate function value.

Abstract: Th invention relates to a method and system for modifying a digital image (100) consisting of pixels. Said digital image is divided into areas (103). At least one area value is assigned to each area Zi (103). At least one parameter value Vpij (203) is assigned to each of said areas (103). A set of couples (Zi, Vpij) forms a parameter image (201). The inventive method consists (a) in determining the determined parameter values Vpir for each area (103), the parameter image (201) being called determined parameter image, (b) in adjusting the determined parameter image by reducing the variations thereof, (c) in modifying pixel values (102) of the determined pixel (101) of said digital image (100) according to the parameter values (203) of said adjusted parameter image, whereby the digital image is differentially modified for each of said pixels and quasi regularly for contiguous areas.

Abstract: The invention concerns a method for encoding at least a source image using a hierarchical mesh defining at least two nested spaces corresponding each to a decomposition level of said meshing, which consists, at least at a decomposition level n (except the first decomposition level), in delivering only image coefficients expressed in a base of functions defined in a space orthogonal to the space corresponding to the preceding decomposition level n?1, said functions being selected so that said image coefficients enable to optimize for said decomposition level n the data already transmitted for the preceding decomposition level n?1, so as to produce a reconstructed image, representing said source image, with optimized restoration quality for said decomposition level n.

Abstract: A graphic contour extracting method includes: acquiring an image of a graphic form to be inspected; defining an inspection region for the image of the graphic form to be inspected by an inspection graphic form including at least one of a circle, an ellipse, a rectangle, a first rectangular graphic form, a second rectangular graphic form and a closed curved graphic form, at least one end of the first rectangular graphic form being replaced with any one of a semi-circle, a semi-ellipse and a parabola, at least one of four corners of the second rectangular graphic form being replaced with a ¼ circle or a ¼ ellipse, the closed curved graphic form being expressed by the following expression: ( x - x 0 ) 4 a 4 + ( y - y 0 ) 4 b 4 = 1 , and the inspection graphic form having an edge searching direction previously defined for at least one component thereof; and searching an edge of the graphic form to be inspected on the basis of the inspection graphic form to acquire contour infor

Abstract: A graphical data-compressor for compressing received arbitrary graphical data for subsequent transmission; where the graphical data-compressor comprises an input for receiving the received arbitrary graphical data, the input being linked to an analyzer for analysis of the received arbitrary graphical data into constituent geometrical parts, the analyzer being linked to an analytic scene describer, for description of said constituent geometrical parts as an analytic description of the received arbitrary graphical data, the analytic scene describer being linked to a transmitter, the transmitter being for transmission of the analytic description.

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 system and methods for displaying data distribution information for time-series data is described. The methods include computing a condensed quantile function that may be used to generate approximate histograms for the time-series data, while decreasing the data storage requirements for generating a series of histograms for time-series data. The methods further include displaying the data distribution information using stack-bar histograms, many of which may be shown in a single display to permit a user to discern trends in the data distribution information. Methods for merging condensed quantile function tables are also described.

Abstract: A method, system, and computer program product for adjusting a unit image area within an input image according to information importance within the unit area. An image receiver configured to receive the input image. An image warper is coupled to an importance map as is configured to generate a warped image such that regions of higher importance in the input image are expanded in the warped image and regions of lower importance in the input image are compressed in the warped image. The importance map is configured to delineate the regions of higher importance and the regions of lower importance in the input image. Texture coordinates may also be warped in a similar manner. Thus, the image is unwarped automatically by modern graphics adapters having texture mapping capabilities.

Abstract: According to a method for recording of electronic handwriting, a handwriting movement is digitized into a sequence of points along a writing curve that corresponds to the handwriting movement. The sequence of points is resampled by eliminating those points that are judged not to be necessary for being able to reconstruct the writing curve later with the required visual quality. A resampled representation of the writing curve is created from the points remaining—that is not eliminated—after the resampling. The resampling is carried out on successive and partially overlapping partial sequences of the points, the resampled representation of the writing curve being extended successively after resampling of a respective partial sequence.

Abstract: Ray-intersection methods and apparatus that greatly facilitate processing associated with computer graphics are described. In the described embodiment, a collection of shapes are defined that approximate an object. The described shapes are polygons, with exemplary polygons comprising triangles. A ray is cast toward the approximated object, and a reference object which, in the described embodiment comprises one or more planes, is defined to contain the ray. Aspects of the individual shapes are pre-characterized to provide characteristic data. In the described embodiment, pre-characterization takes place by testing each of the vertices of the polygons to ascertain their position relative to the reference object. The characteristic data is then used to ascertain the position of the shapes that are defined by the vertices, relative to the reference object. This provides a sub-set of shapes that might be intersected by the ray.

Abstract: A computer implemented method transforms an image comprised of pixels into a vectorized image specified by a plurality of polygons that can be subsequently used to aid in image processing and understanding. The pixelated image is processed to extract edge pixels that separate different colors and a constrained Delaunay triangulation of the edge pixels forms a plurality of triangles having edges that cover the pixelated image. A color for each one of the plurality of triangles is determined from the color pixels within each triangle. A filter is formed with a set of grouping rules related to features of the pixelated image and applied to the plurality of triangle edges to merge adjacent triangles consistent with the filter into polygons having a plurality of vertices. The pixelated image may be then reformed into an array of the polygons, that can be represented collectively and efficiently by standard vector image.

Abstract: Methods of connectivity encoding polygonal mesh representations of objects are described, along with methods of decoding encoded connectivity information for polygonal mesh representations of objects. In the encoding process, an active vertex queue is initialized with one or more vertices incident to a seed face. A vertex is selected from the queue, and the ring of the vertex traversed. If an unprocessed face is encountered during the traversal, the degree of the face, and the valences of any unprocessed vertices incident to the face are output. Any such unprocessed vertices are also entered into the queue. The method iterates until no more vertices remain on the active queue. In one implementation, an encoded data stream is output, which comprises two logical streams, one for face-degree information and the other for vertex-valence information. In the decoding process, the encoded data stream is received, and the connectivity of the mesh regenerated.

Abstract: An object-region-data describing method for describing object region data relating to a time-series variation of an object region in video data including a plurality of frames, the method comprising obtaining a conversion parameter representing conversion from a reference object region into a target object, approximating a time-series variation of the conversion parameter by an approximate function, and describing the object region data using an approximate function parameter identifying the approximate function and information on the reference object region. Thus, it is possible to describe a region of the desired object in video data by a small quantity of data and facilitate generating the object regions and handling data on the object region.

Abstract: A camera-based document scanning system produces electronic versions of documents, based on a plurality of images of discrete portions of the documents. The system compares each pair of consecutive images and derives motion parameters that indicate the relative motion between each pair of consecutive images. The system utilizes the derived motion parameters to align and merge each image with respect to the previous images, thereby building a single, mosaic image of the document. In the illustrative embodiment, the motion parameters are derived by minimizing a sum of squared differences equation on a pixel-by-pixel basis.

Abstract: A method of analysing a sequence of images of a deformable object in non-rigid motion involves modeling the boundary using a non-rigid contour. A representation of movement of the contour through the sequence of images is calculated using a tracking space shape. The calculated movement representation is decomposed using an interpretational space shape that is different than the tracking space shape.

Abstract: A method for decoding a bitstream data obtained by encoding a target image comprises the steps of: (a) extracting from the bitstream data, coordinates point date indicating frame coordinates points of the reference image, coordinates number data indicating a number of the frame coordinates points and a compressed image signal related to a target image to be decoded; (b) selecting an image transformation parameter used for obtaining a predicted image, based on the extracted coordinates number data; (c) obtaining the predicted image from the reference picture, based on the selected image transformation parameter and the extracted coordinate point data; (d) obtaining a decompressed differential image by decoding the compressed image signal; and (e) reproducing a reproduced image by summing the predicted image and the decompressed differential image.

Abstract: The invention relates to scalable video encoders, and, more precisely, to an encoder comprising a base layer and at least an enhancement layer circuit, said circuits being capable of generating enhancement layer video data associated with compressed base layer video data and suitable for transmission to a video decoder. In said encoder, the implemented encoding method, based on a hierarchical triangular mesh representation to which a matching pursuit error coding step is specifically adapted, comprises a base layer encoding step and enhancement layer encoding steps. The invention also relates to a corresponding decoding method.

Abstract: The invention relates to a method for estimating the motion between two digital images and to the use of this method for coding images. The aim of the method is to eliminate the disturbances caused by the mesh being overturned during the motion estimation process. According to the invention, the method consists of carrying out a first motion estimation in order to identify the faulty mesh, i.e. the mesh that is overturning or is overlapping after the displacement vectors have been applied; then carrying out a second motion estimation, excluding at least said faulty mesh, in order to minimize prediction error on the remaining mesh of the model.

Abstract: A method of compressing a color image is provided. The color image comprises color data for a plurality of pixels. The method includes the step of obtaining red, green and blue pixel values of an object of interest in the image. A calculation is made of the complement of the red, green and blue values of the object of interest. Transformation coefficients are calculated which transform the complements of red, green and blue values of the object of interest into representations in a transformation color space. The transformation coefficients are applied to all the pixels in the image to thereby obtain a transformed data set representing the image having components along three mutually orthogonal axes (A, B and C herein) in a three-dimensional transformed color space. The transformed data set is scaled in accordance with the color quantization used in the system; e.g., the A, B and C values are between 0 and 255 for an 8 bit quantization. A compression algorithm, e.g.

Abstract: A feature extractor samples points on an input pattern drawn in real time. In addition to X and Y coordinates, each sample has an up/down or Z coordinate value representing whether or not the sample point is a perceptible part of the pattern. The groups of coordinate values are transformed into respective sets of coefficients of Chebyshev polynomials by least-squares fit. A recognition unit can use the coefficients as features to identify the character. Additional features, such as aspect ratio and center of gravity, are also derived to aid in recognizing the pattern or reconstructing its image.

Abstract: The present invention provides an encoder and a decoder of digital picture data, and the encoder/decoder can realize high precision transform with less quantity of transferred data, when a parameter of the digital picture data is not an integer but has numbers of digits, to which the Affine transformation can be applicable. The encoder/decoder comprises the following elements: (a) picture compression means for encoding an input picture and compressing the data, (b) coordinates transform means for outputting coordinate data which is obtained by decoding the compressed data and transforming the decoded data into a coordinate system, (c) transformation parameter producing means for producing transformation parameters from the coordinates data, (d) predicted picture producing means for producing predicted picture from the input picture by the transformation parameter, and (e) transmission means for transmitting the compressed picture and the coordinates data.

Abstract: A method and apparatus is provided for analyzing and processing images by identification of characteristic lines and corresponding parameters. More particularly, the method and apparatus transforms an image into mathematical models derived from the characteristic lines and parameters, based on repetitive image patterns. The parameters include central lines, signatures, cross-sections, characteristic strips, margins, end areas, fitting transformations and fitting sequences. Each of the parameters associated with the identified characteristic lines are representable by mathematical models, which accurately approximate the geometric and brightness (or color) attributes of the respective characteristic lines.

Abstract: A method for processing information about a polygonal pattern in the context of pattern recognition in a computer environment, the method comprising the steps of: (a) taking the corners of the pattern in turn in order from a first of the corners through the last of the corners, forming a first ordered sequence M of values representing the respective scalar distances between each corner of the polygonal pattern and each other corner, the sequence including (i) the distances between said first of said corners and each other corner in turn and (ii) taking each other corner in turn, the distances between that other corner and each other corner starting with the said first corner, and (iii) including at appropriate positions in the sequence zero values to correspond to the distance between each corner and itself; (b) re-ordering the values of said first sequence M to form a second ordered sequence P1 comprising a set of values p1 which includes for each corner starting with said first corner, values in a series

Abstract: The present invention provides a scheme for compressing and decompressing the depth, or Z, components of image data. Image data is grouped into a plurality of tiles. A test is performed to determine if a tile can be compressed so that its size after compression is less than its size before compression. If so, the tile is compressed. A tile table includes a flag that can be set for each tile that is compressed. In one scheme, each tile comprises a 4×4 block of pixels. For each pixel, the visible depth complexity is determined where each visible level of depth complexity is represented by a plane equation. Depending on the depth complexity, a compression scheme is chosen that stores multiple plane equations in cache lines. The compression scheme can be used with unsampled or multisampled data and provides higher levels of compression in multisampled environments.

Abstract: A polygon finder and pruned tree search are provided. The polygon finder uses a geometric matcher to compare corner features from a polygon model against extracted corner features from an input image to locate an object in the image that matches the polygon. Any geometric match technique may be used to locate the polygons based on their corner features. The preferred geometric matcher is a pruned tree search which calculates pose and match fit errors during search tree construction. If the pose falls outside predefined pose bounds or the fit errors are larger than the maximum limit imposed by features uncertainty bounds, the search branch is truncated. The preferred geometric matcher may be used to locate any type of geometry.

Abstract: A vector block information indicating a plurality of line segment rows is read out from a block map. Each line segment row divides an area of a block from an area of a road in an image drawing region. Each point at which one end of a line segment row contacts with a boundary line of the image drawing region is set as a boundary point. In this case, a road crossing the boundary line of the image drawing region is indicated by a pair of line segment rows having a pair of boundary points close to each other. To determine an area of the road, the pair of boundary points are connected with each other through a connecting line segment. Therefore, a road area in the image drawing region can be automatically extracted from the block map.

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 printer forms an approximate of a Bezier curve as a sequence of line segments. Two parametric equations, X(t) and Y(t), are employed. Two methods can be used to evaluate the parametric equations. Both use fixed point integer arithmetic to directly calculate points along the curve which are the values of the X(t) and Y(t) equations. The first method sets the number of steps of the parametric variable are equal to an integral power of 2. This gives a predictable execution time and uses line segments to connect the points as a piecewise straight line approximation to the curve. The number of steps is set as the next higher power of 2 than an estimated length of the curve. The second method allows Y(t), the scan line variable, to change only in predetermined integer steps. The value of X(t) is evaluated for each t corresponding to the integer step in Y(t). This second method has a natural advantage, if a closed path is being decomposed as a run array rather than a collection of trapezoids.

Abstract: A progressive coding and decoding method of three-dimensional (3D) mesh data used in the fields of motion picture experts group-4 synthetic and natural hybrid coding (MPEG-4 SNHC), virtual reality modelling language (VRML) and the like. In transmitting 3D objects composed of 3D mesh data, it is very important to progressively restore transmitted data as well as to effectively code the 3D mesh data. In the progressive restoration, in the event that a transmission data error is generated, partial restoration of the transmitted data is allowed. Thus, it is possible to minimize the amount of mesh data to be transmitted again. The progressive restoration method which is resistant to such transmission errors can be effectively applied in wireless communications or low transmission rate communications.

Abstract: In an image processing apparatus for processing an image sensed by an image sensing unit which includes an optical system and an image sensing element for converting a subject image formed by the optical system into an electric signal, a group of correction data, which is calculated on the basis of relative positional information of an optical axis of the optical system and a center of an effective range of the image sensing element, for correcting an image sensed by the image sensing unit is read out from a storage unit, and the image is corrected based upon the group of correction data read out from the storage unit. A minimum value of the group of correction data is associated with a position substantially coinciding with the optical axis position on the image sensing element or a position between the optical axis of the optical system and the center and closer to the optical axis.

Abstract: The invention relates to a method of coding segmented pictures, or partitions, divided into homogeneous regions. Said method, called intra-mode coding process, comprises, for each successive partition, the steps of translating the picture of the labels associated to the regions into a description in terms of a contour element chain in which the elements are defined by means of their movements through successive basic cells, tracking inside each successive cell each contour from its initial contour point, previously extracted, to its end by storing chain symbols corresponding both to input, internal and output contour elements of said cell and to priorities between possible multiple outputs elements, and repeating these steps up to the end of each successive contour segment of the concerned partition.

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 method and system for creating seamless textured three dimensional models of objects includes unwrapping a plurality of images, joining the plurality of images and feathering the textures of the images where transitions or seams are visible. The unwrapping process includes processing the images whereby the ratio of texture area to surface area is nearly constant across the model. This can be accomplished by selecting a starting polygon in a mesh of polygons and re-orienting each polygon adjacent to the starting polygon by rotating or projecting the polygon onto the plane of the starting polygon. Each polygon adjacent to a re-oriented polygon is also re-oriented until all the polygons are oriented into the plane of the starting polygon. Where re-orienting a polygon resulting in a gap or crack, one or more vertexes of the polygon can be relocated to avoid the gap, even though some distortion may occur.

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 method for compressing 3D geometry data that is capable of compressing both regularly tiled and irregularly tiled surfaces is disclosed. In one embodiment, the method comprises examining 3D geometry data to detect the presence of regularly tiled surface portions. The 3D geometry data is then compressed by: (1) encoding any regularly tiled surface portion using a first encoding method, and (2) encoding any irregularly tiled surface portions using a second encoding method, wherein the second encoding method is different from the first encoding method. The first encoding method may encode the regularly tiled surface portions as vertex rasters, while the second method may encode the irregularly tiled surface portions by geometry compression using a generalized triangle mesh.

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 compressing and displaying a digital ink trace. Raw ink data is smoothed, and sharp points of the smoothed line are found. Curve-fitting is then used to generate a mathematical expression that defines the line segments between adjacent sharp points. The ink trace then is represented by a backbone spline that includes the sharp points and the mathematical expressions for the line segments. Thickness information, such as pressure or acceleration information, is combined with the backbone spline to provide a compressed ink file that represents a contour curve of the original ink trace. A display module uses an algorithm to separate the contour curve into a sequence of straight lines. A set of pixels is then generated for the display of each straight line using a novel antialiasing method. The pixels at the ends of adjacent straight lines are aligned using a weighting algorithm.