Abstract: In a novel method of 3D modeling of an object from a video sequence using an SfM algorithm and a generic object model, the generic model is incorporated after the SfM algorithm generates a 3D estimate of the object model purely and directly from the input video sequence. An optimization framework provides for comparison of the local trends of the 3D estimate and the generic model so that the errors in the 3D estimate are corrected. The 3D estimate is obtained by fusing intermediate 3D reconstructions of pairs of frames of the video sequence after computing the uncertainty of the two frame solutions. The quality of the fusion algorithm is tracked using a rate-distortion function. In order to combine the generic model with the 3D estimate, an energy function minimization procedure is applied to the 3D estimate. The optimization is performed using a Metropolis-Hasting sampling strategy.

Abstract: A transcoder for resizing video data and outputting the resized video data to a reproduction apparatus. The reproduction apparatus reproduces the resized video data by repeating a display period and a non-display period alternately. The transcoder includes: a resizing unit that resizes the video data; and a control unit that causes the resizing unit to resize the video data to first video data having a first resolution so that the reproduction apparatus displays one image during each display period, and causes the resizing unit to resize, during each period between the resizing of the video data to the first video data, the video data to second video data having a second resolution that is lower than the first resolution.

Abstract: There is provided parallax correction means for correcting a parallax for each area calculated by parallax calculation means in accordance with the magnitude of a motion vector for the area detected by motion vector detection means in order to prevent the three-dimensional effect of a conversion video from greatly differing depending on an input video when the MTD method and the CID method are simultaneously used. When a depth estimate is converted into a parallax, the depth estimate is subjected to distance scale conversion in order to suppress the distortion of the conversion image, to find a tentative target phase for each parallax calculation area, and a dynamic range in which a phase difference between the parallax calculation areas is within a distortion allowable range is searched for and is subjected to distance scale conversion, to find a tentative target phase, which operations are repeated.

Abstract: methods of embedding and detecting a watermark in an information signal (x(n), y?(n)) which are robust against sampling rate conversions of the watermarked signal (y(n)) adapts frame lengths used by an embedder and the detector, respectively, so as to preserve a constant ratio between the respective sampling rate and frame length. The frame lengths may be calculated from a greatest common divisor of a set of sampling rates providing watermarks which are robust against sampling rate conversions between any sampling rates of the set of sampling rates.

Abstract: A method and apparatus for obtaining an attribute in homogenous space. After obtaining the vertices of a triangle, the world space coordinates and the attribute of each vertex are transformed to homogeneous coordinates and an attribute in viewer space. Then a set of homogenous coefficients of the triangle is computed based on the viewer space vertex homogeneous coordinates, and the viewer space coordinates of each vertex are projected to coordinates in screen space. Pixels in the screen space that are affected by the projected triangle are determined. For each pixel affected by the triangle, a set of barycentric coefficients in viewer space is computed, based on the homogenous triangle coefficients, and a linear interpolation is performed based on the set of viewer space barycentric coefficients and the viewer space attributes of the triangle vertices to obtain the attribute of the pixel affected by the triangle.

Abstract: A method, apparatus and programmed computer system provides the ability to process image data as picture screen elements having color components. A three-dimensional space is generated that represents a color spectrum containing the color conponents. A plurality of three-dimensional space transformation matrices are initiated and concatenated to initiate a single three-dimensional space transformation matrix. The plurality of three-dimensional space transformation matrices are populated in reply to user input data. The image data is adjusted by processing each of the color components with the single three-dimensional space transformation matrix.

Abstract: A method for scaling an image frame by an off-screen technology is provided. An image frame consisting of n rows and m columns of data is stored into a storage device. The image frame is divided into a plurality of image portions. Then, the plurality of image portions are picked in sequence to a frame buffer register. An image scaling operation is performed for each picked image portion, and then the scaled image portion is cleared from the frame buffer register.

Abstract: An optical signal processor for transforming a first vector into a second vector comprising: a plurality of linear light sources each of which provides light having an intensity responsive to a different component of the first vector, a spatial light modulator comprising a plurality of modulation zones each of which zones receives light from substantially only one of the light sources and transmits light in proportion to a transmittance that characterizes the modulation zone; and at least one light detector for each component of the second vector that receives light transmitted from a plurality of modulation zones, each of which is illuminated by light from a different light source, and generates a signal responsive to the received light that represents a component of the second vector.

Abstract: The image processing method and apparatus acquire input image data from the image recorded optically with a taking lens, acquire the information about the lens used to record the image and perform image processing schemes on the input image data using the acquired lens information, provided that the type of the lens used is identified from the acquired lens information and the intensity of sharpness enhancement of the corresponding image is altered in accordance with the identified lens type. Using the obtained lens characteristics as well as the position information for the recorded image, the input image data is subjected to aberration correction for correcting the deterioration in image quality due to the lens characteristics.

Abstract: A method, system, and data structure for the scaling of data is provided. An exemplary use of the disclosed embodiments involves the scaling up in size or the scaling down in size of computer images. n-dimensional transformed data representing some original n-dimensional real data is received. An m-dimensional inverse transform on the n-dimensional transformed data is performed to produce hybrid data, where 1?m<n. The hybrid data is scaled in p dimensions to produce scaled hybrid data representing a desired p-dimensional change in the n-dimensional real data where p?m. Finally, an m-dimensional forward transform is performed on the scaled hybrid data to produce n-dimensional scaled transformed data.

Abstract: A portable electronic data management and transport system includes a base unit and a wireless remote unit that incorporates, e.g., a graphic tablet digitizer for signaling signature data to a personal computer.

Abstract: A method and system for processing multidimensional data. A method of forming multiresolution representations of data includes partitioning the data in a first dimension at a first rate, and partitioning the data in a second dimension at a second rate, wherein the first rate is not equal to the second rate. In one embodiment, the first rate is set to one, and the second rate is computed as the ratio of a smoothness estimate of the first dimension data and a smoothness estimate of the second dimension data. The partitioned data may be processed further through data compression, noise removal, or similar data processing methods.

Abstract: A method and computer program product are disclosed for refining character segmentation in an optical character recognition system receiving as input a plurality of candidate objects. Each candidate object below a threshold character width is merged with another candidate object at one or more merge lines to form a composite object. The plurality of candidate objects are preclassified to identify a plurality of composite objects and a plurality of character portions. Proposed split lines are determined for each of the composite objects. Regions are defined within each of the composite objects from the position of the merge and split lines. The defined regions are classified to obtain an associated score for each region. Complete region sets are defined for each composite object, each with an associated set ranking determined from the associated score of the regions comprising the set. The set having the highest ranking is selected.

Abstract: Systems and methods are provided for improved two pass resampling in a computing system. The systems and methods address both bottleneck problem(s) and aliasing problem(s) to improve upon prior art two pass resampling techniques. In view of both bottleneck problem(s) and aliasing problem(s), for each of four possibilities associated with two pass resampling, the four possibilities being (1) pre-rotating the 2-D data and performing row-first processing (2) pre-rotating the 2-D data and performing column-first processing, (3) not pre-rotating the 2-D data and performing row-first processing and (4) not pre-rotating the 2-D data and performing column-first processing, the bottleneck error and the aliasing error associated with the possibility are calculated. Also, for each possibility, a value is computed based upon the bottleneck error and the aliasing error. The choice of the four possibilities is then selected in accordance with a comparison of the values.

Abstract: A method and system of projecting light on a planar surface to produce an image for tracing is disclosed. The system includes a projector that has a light source and a signal conditioner that is operably connected to the projector. A computer is operably connected to the signal conditioner. A scanner is connected to the projector. A test pattern from the computer is projected from the projector through the scanners to visually align an image to a sector on a work surface. A grid is operably aligned with the work surface. A geometric pattern from the computer is then projected by the projector on the planar work surface for tracing. The method comprises the steps of creating a pattern, tracing lines along the pattern on the planar work surface, cutting the pattern along the traced lines, discarding pieces of the planar surface outside the pattern, and placing edging along an outer edge of the pattern.

Abstract: A model characterizes an error pattern that is functionally related to first and second patterns and to one or more model parameters, which may be unknown. The error pattern may be derived by deforming one or both of the first and second patterns, such as by applying a generally smooth, non-uniform deformation field. A likelihood for the model that the error pattern is zero, given the second pattern, is determined. If the model parameter(s) is unknown, the likelihood may be used to estimate (or infer) the parameter(s) that tend to maximize the likelihood for a plurality of stored patterns. The estimated parameters may, in turn, be employed to determine the likelihood as a measure of similarity between an observed pattern and the patterns that the model is capable of generating. In addition, the likelihood may be used to classify an observed pattern according to the likelihood that the observed pattern has relative to one or more models.

Abstract: Digital image coding/decoding apparatus using watermarking, and methods thereof are provided.

Abstract: A one-dimensional algorithm for perform the merging of complementary portions from two independent overlapped images on the same 8×8 grid without the computational expense of conversion to and from the real domain is extended to a two-dimensional procedure. The merging process is performed exclusively in the frequency domain. The extension to two dimensions is done by shifting and/or merging rows of side-by-side two-dimensional transformed data blocks using the one-dimensional algorithm. Then a vertical shifting and/or merging can be performed on the horizontally shifted and/or merged blocks again using the one-dimensional algorithm with an independent shift/merge parameter.

Abstract: A method of transform domain processing of transformed data is applied to image processing in various applications. A one-dimensional algorithm allows for the selection of an arbitrary contiguous eight component DCT sub-block from two adjacent DCT blocks that foregoes the expense of image manipulation in the real domain. Due to the fact that non-zero DCT coefficients are generally sparse, this algorithm lends itself nicely to the development of special cases which are faster than methods in use today. The de-quantization and re-quantization can be combined at execution time with the constants.

Abstract: A method for the geometric transformation of a compressed image, stored on a source appliance connected to one or more other appliances by a computer communication network, comprising the steps of choosing a set of appliances in the computer communication network adapted to implement a geometric transformation of an image in compressed form; selecting an appliance in the set for implementing the geometric transformation of the image in compressed form; of transmitting the compressed image to the selected appliance if it is different from the source appliance; and geometrically transforming the image in compressed form by means of the selected appliance. This method is used notably for a computer and printer installed on a network.

Abstract: An image processing apparatus and method capable of decoding and varying at high speed encoded image data having an arbitrary image size by using a memory of a small capacity, and a recording medium storing programs executing such a method are provided. In the image processing apparatus and method, image data encoded in each of block units is decoded in the block unit basis. In order to convert the decoded block scan sequential image data into raster scan sequential image data, the decoded image data is divided in the horizontal direction and converted, and the divided and converted data is varied.

Abstract: A high definition radar imaging system receives SAR image data and adaptively processes the image the data to provide a high resolution SAR image. The imaging technique employs an adaptive filter whose tap weights are computed based upon a constrained Maximum Likelihood Method (MLM). The MLM technique chooses the filter tap weights (i.e., a weighting vector &ohgr;) to satisfy several criteria including: 1) they preserve unity gain for a point scatter at the desired location, and 2) they minimize the perceived energy in the output image. The weights &ohgr; are constrained in norm ∥&ohgr;∥≦&bgr;, to reduce the loss of sensitivity to bright scatters. Significantly, the present invention applies an additional constraint on the iterative selection of the weighting vector &ohgr;, such that the weighting vector &ohgr; shall confined to a particular subspace in order to preserve background information in the image.

Abstract: A method for improving the definition of a digital image whose pixels are memorized light intensity values which are arranged in rows and columns in the form of a starting matrix Axy. A matrix section Aij is enlarged by reflection and subjected to a fast Fourier transform. The transformed matrix Bij is converted by elementary multiplication with an aberration correction matrix Cij to give a correct transformed matrix B′ij. This is transformed back into an intensity matrix A′ij from which a core section is set to a corrected intensity matrix A′xy. Following this, one matrix section after another is stagger-processed until a completely corrected intensity matrix A′xy has been obtained. The correcting function can be determined in different ways, in particular from an MFT of the imaging lens.

Abstract: A photobooth includes an electronic camera for capturing and producing a digital image of a customer, processes the digital image to apply a special effect to the image and prints the processed digital image. A display for displaying the processed digital image to the customer produces a motion image display simulating the sequential production of the processed image while the image is being processed and printed thereby entertaining the customer during the interval while the image is being processed and printed.

Abstract: An apparatus and method for correcting the sharpness of an image signal, using a Haar Wavelet transform and a difference between pixel values adjacent to the edge of the image signal to be corrected while reducing the occurrence of overshoot and undershoot at the edge of the image signal, are provided. The apparatus includes an edge detector for detecting data on the edge of the image signal, by performing a multi-stage Haar Wavelet transform on the image signal, a gain detector for detecting a gain for correcting the image edge, a pixel value detector for detecting a corrected pixel value regarding the edge data at a position to be corrected by performing an operation on the edge data, at least one pixel adjacent to the edge data, and the gain, and an image signal generator for generating an image whose edge is formed based on the corrected pixels.

Abstract: A wavelet transform coding technique is provided, which may be part of TROBIC or may be used independently in a wide variety of compression applications. The wavelet coding technique is carried out by a simple block codec with wavelets (SBCW) that uses wavelet filters to transform 32×2 image blocks into subband coefficients organized in a tree structure. These coefficients are then encoded using a novel entropy coding technique with precise rate control. The Two Row Buffer Image Compression (TROBIC) technique operates on 32×2 blocks of pixels and uses a block-based coding scheme to provide alternative coding modes for image blocks containing different types of image data.

Abstract: An interlace noise filter which can obtain a high resolution still image from an interlace motion picture. An original image either in an even number field or in an odd number field is sampled by a sampling means (1) along only the horizontal direction of the original image. Then, it is Haar wavelets transformed. Thereafter, the gradation change of the original image is enlarged by a reconstituting means (3), while interpolating unsampled original image with sub pixel accuracy.

Abstract: The invention is directed to a method for motion correction given series of two-dimensional images of a rigid body, whereby the rigid body does not lie completely in the coverage area of the images and is cut off at one image edge or, respectively, at two image edges that do not lie opposite one another. Given two time-successive images, the mirror image or, respectively, the mirror images of the other are respectively attached to the one. A simple motion correction method is then implemented between the two newly arisen images that now show an approximately rigid body that lies completely within the coverage area of these newly arisen images.

Abstract: Systems and processes that automate receiving of unstructured information contained in electronic documents, detecting the document type, determining the corresponding document format, extracting structured information from the source document, and populating an information store with the extracted information for analysis purpose, are described. Generally, the electronic documents are pre-characterized and the extraction and mapping/translation details are developed as scripts on a per document type basis. These extraction and mapping/translation scripts are then automatically selected and used to automatically drive the subsequent information extraction processes.

Abstract: A print control apparatus and method executes print processing in a minimum time by utilizing a maximum of resources for printing because an optimal print mode can automatically be set for each page or each job regardless of the print mode set by a user. In one embodiment, a print apparatus for transforming graphics commands from an application into print control commands is provided. The apparatus includes an acquisition unit for acquiring transformation-time coefficient data; a computation unit for computing transformation periods in units of pages; a selecting unit for selecting one print mode for each page which has the least transformation period by comparing the transformation periods; a determination unit for determining whether the selected one print mode for each page is identical to a set print mode; and a changing unit for changing the set print mode into the selected one print mode.

Abstract: The present invention presents an image processing apparatus that performs rotation, enlargement, reduction, clipping or overlapping processing of images at high speed using low capacity memories instead of page memories and without the need to read image data in repetition. A first band data storing element receives input image data line by line and stores it as local data. The local data stored in the first band data storing element is transformed by local data transforming element and then stored in a transformed data storing element. The local data is then read in the order it is to be output and stored in a second band data storing element. An image output element then outputs the local data as an output image.

Abstract: A structure for implementing a plurality of two-dimensional digital filters, such as finite impulse response filters, in an efficient manner. The structure includes a plurality of first stage filters operating in a first dimension in combination with a single second stage filter, operating in a second dimension. The second stage filter being suitable for receiving output from one of the first stage filters. A controller, operating in conjunction with the first and second stage filters is utilized for controlling the operation of all filters, as well as the selection of the input source for the second stage filter.

Abstract: A method and system for recognizing an object in an image. A model of the sought object is transformed according to a set of preselected transformations to produce a set of transformed models, each transformed model including a plurality of transformed model pixels. A hash table is constructed, each entry of the hash table corresponding to an image pixel that in turn corresponds to a transformed model pixel of at least one of the transformed models, each entry of the hash table including a list of all the transformed models that include that transformed model pixel. The feature pixels of the image are determined, and are augmented by a distance transformation to provide a set of relevant pixels. Each relevant pixel that appears in the hash table contributes a score to the corresponding transformed models. For each transformed model, the sums of the scores provides a tally.

Abstract: The invention provides machine vision systems for morphological transformation of a source image e.g., adapted for use with zero or uniform offsets. The systems have application, for example, in image erosion or dilation of images of varied image quality. Systems according to the invention compare each pixel in a first row (or line) of the image with a corresponding pixel in a second row of the image. In each comparison, the system identifies the pixel intensity of selected rank. Where the system effects a dilation-type transformation, for example, the comparison seeks a maximum of the compared pixels. For an erosion-type transformation, the comparison seeks a minimum. The pixel intensity value of selected rank (e.g., minimum or maximum) determined from each comparison is retained and, in turn, compared with the intensity values of the corresponding pixels in every other row in the 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≦x≦D+e. The output of the difference value rounder 7 is encoded by the decoder 8 to become the encoded signal 9.

Abstract: Specified image transformation is applied to a first source video signal to generate a main image and symmetric image transformation is applied to a second source video signal same as or different from the first source video signal in accordance with the image transformation applied to the main image and the point, line, or plane specified as a symmetry yardstick to generate a symmetric image point-symmetric, line-symmetric, or plane-symmetric to the main image. Thereby, it is possible to easily obtain a symmetric image symmetric to a main image to which image transformation is applied only by specifying a point, line, or plane serving as a symmetry yardstick.

Abstract: The invention provides an integrated systolic architecture which can perform both forward and inverse Discrete Wavelet Transforms with a minimum of complexity. A plurality of processing cells, each having an adder and a multiplier, are coupled to a set of multiplexers and delay elements to selectively receive a single input datastream in the forward DWT mode and two datastreams in the inverse DWT mode. In the forward DWT mode, the integrated architecture decomposes the input datastream into two output sequences—a high frequency sub-band output and a low frequency sub-band output. In the inverse DWT mode, the integrated architecture reconstructs the original input sequence by outputting even terms and odd terms on alternating clock cycles. As a result, the architecture can achieve 100% utilization and is suitable to be implemented in VLSI circuitry.

Abstract: A method for forming a two-dimensional map of a three-dimensional object has the steps of mapping the three-dimensional object to an ellipsoid and then mapping the ellipsoid to a two-dimensional surface. Mapping of the three-dimensional object to the ellipsoid is accomplished by forming a plurality of generally parallel, generally planar slices of the three-dimensional objects which correspond to similar slices of the ellipsoid and projecting each point on the surface of a slice of the three-dimensional object to a corresponding point of the ellipsoid. Mapping the ellipsoid to two-dimensional surface may be done according to various different contemporary methodologies.

Abstract: Methods and apparatus for combining linear image post-processing operations with an inverse discrete cosine transform (IDCT) operation are described. In accordance with various embodiments of the present invention IDCT and downsampling operations are combined into a single operation to achieve the same image processing result as sequential IDCT and downsampling operations. By combining the two operations and performing downsampling in the DCT, as opposed to pixel domain, significant complexity reduction is achieved over embodiments where the two operations are performed sequentially. In one particular embodiment, when interlaced images are being processed, combined IDCT/downsampling circuits which perform field based, as opposed to frame based, downsampling in the DCT domain are employed. The method and apparatus of the present invention can be used to implement circuits which perform a combined full order IDCT/downsampling operation and/or a reduced complexity combined full order IDCT/downsampling operation.

Abstract: An image processing device of the present invention includes a photoelectric transducing section for transforming input image information to an electric signal. An analog-to-digital converter converts the electric signal to a digital signal. An image processing section for processing the digital signal has a shading correcting section, a filtering section, a magnification changing section, a gamma correcting section, and a tonality processing section. The filtering section is capable of selecting a particular filter intensity for each of two perpendicular directions in accordance with a desired magnification change ratio. The device is capable of varying an MTF (Modulation Transfer Function) characteristic in the subscanning direction in accordance with a magnification change ratio with simple hardware.

Abstract: Method, apparatus and computer program products for transforming from model to screen coordinates by assigning specified subsets of the plurality of parallel processing elements respective model space geometric primitives. The respective specified subsets of the plurality of parallel processing elements are then provided a plurality of transformation matrices associated with respective model space geometric primitives. A unified transformation matrix for each primitive is then produced from the plurality of transformation matrices associated with each particular model space geometric primitive. The resulting unified transformation matrices are then applied to said geometric primitives by the processing elements to translate the geometric primitive from model coordinates to screen coordinates.

Abstract: An image processing apparatus, which improves the qualitative effect or 3-dimensional effect on feeling of a subject picture, first analyzes the feature of the input picture thereby to evaluate feature values such as the mean value, histogram center value, variance, etc. pertaining to the lightness, saturation, and edge value. It discriminates the picture to be a texture stuff, colored stuff, etc. based on these feature values, and determines an image process operator and an image process parameter suitable for the purpose of process. It implements the image process that best matches with the picture based on the determined process operator and process parameter.

Abstract: A recording and reproducing apparatus is disclosed. Each of main pixel blocks of (m pixels in a horizontal direction.times.m pixels in a vertical direction.times.n pixels in a time direction), m and n being an integer, included in a video signal is divided into a first and a second block. The horizontal pixel number of the first block is made half and the vertical pixel number of the second block is made half. Correlation between continuous two main pixel blocks is detected in the horizontal and vertical directions. Three-dimensional orthogonal transform is applied to either of the first or the second block according to the detected correlation. And, the video signal, the first or the second block thereof being applied with the three-dimensional orthogonal transform, is encoded to form a signal to be recorded. In reproduction, the formed signal is decoded.

Abstract: A two-dimensional inverse discrete cosine transformation circuit of an MPEG2 video decoder including a one-dimensional inverse discrete cosine transformation circuit, an input switching circuit for receiving input of new data and data already subjected to first one-dimensional inverse discrete cosine transformation and sending one of them to the one-dimensional inverse discrete cosine transformation circuit, an input switching control circuit for controlling the input switching circuit so as to alternately and continuously output data output from a first serial-parallel conversion circuit and data output from a second serial-parallel conversion circuit, and a data allocation circuit for switching and controlling an output destination of output data of the one-dimensional inverse discrete cosine transformation circuit based on the timing of switching by the input switching control circuit.

Abstract: A multiresolution method and apparatus for searching of a database of images where the search is performed on compressed images, without first decompressing them. The method searches the database of compressed images first at a low resolution to obtain the relative quality of a match between a search template and a candidate image. If the match is below a particular threshold, the search is terminated without committing any further computational resources to the search. Conversely, if the match is above a particular threshold, the method enhances the resolution of the candidate image and then performs another match. As long as the relative quality of the match is above the particular threshold, the resolution of the candidate image is successively enhanced, until a match determination is made at a full resolution of the candidate image.

Abstract: A decimation device for digital data sequences includes a multiplexer mounted in cascade with a calculator producing, alternately, during a first calculation cycle, the mean M.sub.i of at least two data sequences representing the pixels P(i,j) and P(i,j+1) in a line L.sub.i, and during a following calculation cycle, the mean M.sub.c. The mean M.sub.c is composed of the mean M.sub.i and of an intermediate sequence previously calculated and stored in a storage register arranged between an output for the calculation stage and at least one of the inputs to the multiplexer. The intermediate sequence represents the mean M.sub.i-1 of at least two data sequences representing pixels P(i-1,j) and P(i-1,j+1) in a line L.sub.i-1, where i varies from 0 to N-1 and j varies from 0 to M-1.

Abstract: Methods and apparatus are provided for processing a source image in an image processing system including an electronic digital computer and image processing software for operating the computer. The source image is processed by convolution of pixels of the source image with coefficients of a convolution kernel to provide an output image. A lookup table is generated before new pixel values are determined. The table includes products of each coefficient and each possible value of the pixel in the source image. For each of the coefficients, the product that corresponds to the pixel value in a convolution window is accessed in the table. The accessed products are summed to provide a new pixel value in the output image. The steps of accessing the products in the table and summing the accessed products are repeated for each of the source pixels being convolved.

Abstract: A transformation unit 102 transforms an entered image to multi-resolution space. A quantizer 105 performs vector quantization on a local pattern of an image of a multi-resolution representation. A perspective-order calculating unit 107 extracts a plurality of code words, positions corresponding thereto and/or angle of rotation and/or scale, and the perspective-order relationship of a plurality of these representative vectors, from the quantized image. An algebraic encoder 108 encodes the input image based upon the extracted information. As a result, there are provided an image processing apparatus and method for asymmetric encoding without motion in three dimensions and extraction of a three-dimensional structure. Further, a transformation unit 1103 transforms an entered image to vector field, and a singularity detector 1104 detects a singularity in the transformed image.

Abstract: A data processing system and method for performing a wavelet-like transformation and a corresponding inverse wavelet-like transformation is disclosed. The wavelet-like transformation is performed on input data so as to produce decomposed data. For each set of decomposed data samples of the decomposed data, each decomposed data sample of the set is produced by computing a weighted sum of a predefined set of data samples selected from (A) subsets of the set of input data samples, (B) one or more spatially shifted subsets of the set of input data samples, (C) the sets of decomposed data samples, and (D) one or more spatially shifted sets of the sets of decomposed data samples. The weighted sum is computed using only add and bit shift operations. Similarly, the inverse wavelet-like transformation is performed on decomposed data so as to produce reconstructed data.

Abstract: In a computer implemented method, possible arrangements of items, such as components to be placed on a semiconductor die, are described in a permutation space expressed as a data structure stored in a memory. The data structure is in the form of a balanced tree. In the tree, each node is a possible permutation. The ordering in the permutation space is transformed to an ordering described in a vector space using an inversion table. A best ordering of items is determined in the vector space according to a predetermined criterion such as an objective function. The best ordering as determined in vector space is then transformed back to the permutation space to determine an optimal placement of the item according to the predetermined criterion.