Abstract: A two-dimensional coordinate transformations software program and method thereof is described. In one aspect, the present invention solves problems of accurately and efficiently placing data from Records of Surveys, subdivision plats, deeds, highway right of way plats, and other map data onto the State Plane Coordinate Systems or other projection systems. The users of the software include engineers, especially those involved in right-of-way engineering, and Geographic Information Systems (GIS) and Land Information Systems (LIS) specialists. In one aspect, a utility program is intended to supplement the coordinate geometry and GIS/LIS software currently used by surveyors and GIS/LIS specialists. In one embodiment, there is an efficient and speedy method to surveying, offering a preferred point and click approach using a unique graphical user interface of the two-dimensional coordinate transformation program.

Abstract: A scanning system includes one or more stereo camera sets (10) for detecting qualitative and quantitative anomalies of an object (40). Each stereo camera set (10) includes two cameras (12, 14) and a projector (16). Each camera (12, 14) is calibrated to correct any distortion due to misalignment of the CCD matrix array (18) and deficiencies of the optical system. The projector (16) projects an absolute encoded pattern (32, 34, 36) onto the object (40) to be measured and is capable of varying the intensity of the emitted electromagnetic energy in the infrared, visible and ultraviolet spectrums. A plurality of camera sets (10) can be combined in a scanning system matrix (42, 44) capable of detecting anomalies of the object (40) in a three-dimensional room (26). The three-dimensional room (26) can be of any desirable size, depending on the number of stereo camera sets (10).

Abstract: The invention provides techniques for wrapping a two-dimensional texture conformally onto a surface of a three dimensional virtual object within an arbitrarily-shaped, user-defined region. The techniques provide minimum distortion and allow interactive manipulation of the mapped texture. The techniques feature an energy minimization scheme in which distances between points on the surface of the three-dimensional virtual object serve as set lengths for springs connecting points of a planar mesh. The planar mesh is adjusted to minimize spring energy, and then used to define a patch upon which a two-dimensional texture is superimposed. Points on the surface of the virtual object are then mapped to corresponding points of the texture. The invention also features a haptic/graphical user interface element that allows a user to interactively and intuitively adjust texture mapped within the arbitrary, user-defined region.

Abstract: Systems and methods for enhancing the combined image of multiple attributes without comprising the image of either attribute. The combined image of the multiple attributes is enhanced for analyzing a predetermined property revealed by the attributes. The combined image can be interactively manipulated to display each attribute relative to an imaginary light source or highlighted using a specular component. The systems and methods are best described as particularly useful for analytical, diagnostic and interpretive purposes.

Abstract: A system for generating a warping effect in an image having a plurality of regions, each associated with a distortion vector. The system includes a programmable processor; and a computer-readable medium including a computer program product comprising instructions operable to cause the programmable processor to receive a source image; receive a user input specifying a movement; modify one or more distortion vectors of the distortion vector field; and modify the source image. The system also includes defining a path segment vector in response to user movement of a brush cursor; modifying one or more distortion vectors having originations covered by the cursor based on the path segment vector; and repeating defining and modifying to produce a warping effect.

Abstract: Methods and apparatuses for blending two images using vector table look up operations. In one aspect of the invention, a method to blend two images includes: loading a vector of keys into a vector register; converting the vector of keys into a first vector of blending factors for the first image and a second vector of blending factors for the second image using a plurality of look up tables; and computing an image attribute for the blended image using the blending factors.

Abstract: By determining a center physical grid dot at intersects of virtual grid lines of a fetched scene on an encoded dotmap, and by defining a blank dot closest to the determined center physical grid dot on the fetched scene, the orientation of encoded blocks on the encoded dotmap may be determined. And therefore, a plurality of data dots on the fetched scene may also be decoded easily.

Abstract: A system and method are provided for computing partial differential equations in a hardware graphics pipeline. Initially, input is received in a hardware graphics pipeline. Next, the input is processed to generate a solution to a partial differential equation utilizing the hardware graphics pipeline.

Abstract: Methods and apparatus, including computer systems and program products, to provide an image editing application including a perspective editing tool for performing edits in regions of an image having perspective. The perspective editing tool enables the user to identify one or more regions having perspective, i.e., perspective areas. The user can perform various editing operations on an object such that the edited object conforms to the perspective of the perspective area. The image editing application can also automatically create a perspective area from an existing perspective area. The editing tool enables the user to move objects from a source perspective area to a destination perspective area such that the edited object conforms to the perspective of the destination perspective area.

Abstract: Methods and products are disclosed concerning extraction of selected components of a warping of an image. Given a warped image and a distortion grid, the distortion at any point in the image may be viewed locally as a displacement and a linear transform. The linear transform can be manipulated to extract elements of the local distortion such as skew, rotation, magnification and combinations. The selected components may then be selectively applied at other locations of the same or a different image, using a variety of virtual paintbrushes for different effects.

Abstract: In a method for reversibly transforming a data format, a forward transformation and a backward transformation are reciprocally conducted for data between unit systems having different resolution levels, and the forward transformation and the backward transformation, a first unit system having a lower resolution level is used as a common unit system, and a reversible data conversion is conducted by an integer operation for data in the first unit system having the lower resolution level and data in a second unit system having a higher resolution level higher than the first unit system.

Abstract: A method for representing images for pattern classification extends the conventional Isomap method with Fisher Linear Discriminant (FLD) or Kernel Fisher Linear Discriminant (KFLD) for classification. The extended Isomap method estimates the geodesic distance of data points corresponding to images for pattern classification, and uses pairwise geodesic distances as feature vectors. The method applies FLD to the feature vectors to find an optimal projection direction to maximize the distances between cluster centers of the feature vectors. The method may apply KFLD to the feature vectors instead of FLD.

Abstract: Generating an image includes receiving a light at sensors, where the light is associated with images. A previous matrix is determined, where the previous matrix includes image information associated with an image. For each sensor, a current image data corresponding to a current image is generated and a current matrix is determined using the previous matrix and the current image data. The current matrix includes image information associated with the current image. A fusion matrix is computed according to the current matrix of each sensor, where the fusion matrix initiates generation of a fused image.

Abstract: The present invention provides a method for rotating YUV4:2:0 image in a digital display device, such as TV image system. A YUV4:2:0 image is separated to a Y division matrix and a U and V division matrix. Then the Y division is performed a rotation matrix calculation. And the U and V division matrix is performed a reverse rotation matrix calculation. A rotated YUV4:2:0 image is obtained by combining the processed Y division matrix and the processed U and V division matrix.

Abstract: A display apparatus for a vehicle includes display screen having a plurality of display areas such as a tachometer display area, a speedometer display area, and an auxiliary display area. The display apparatus for a vehicle further includes a CPU for controlling images displayed on the display screen. A display partition member is mounted on a part of the display screen.

Abstract: A displaying method that makes the following possible: Executing an operation from either of two approaches, i.e. a processing oriented to an object to be processed or a processing oriented to a task to be processed, and effectively dealing with a lot of tasks and various types of objects, and performing a flexible operation. In the displaying method in an information processing apparatus, both displays, i.e. a display intended for selecting the task to be processed and a display intended for selecting the object to be processed, are displayed on a display apparatus in such a manner that the two displays are distributed into two tabs, respectively. This condition makes it possible to select the task to be processed with a selection of the tabs, and also makes it possible to execute in an arbitrary order the processing oriented to the task and the processing oriented to the object.

Abstract: The present invention provides a processor including: a plurality of memory banks; a read-address generation circuit for supplying a read address to each of the memory banks on the basis of a read-register specification and a read-register scan direction; a read control circuit for executing control to rearrange a plurality of pieces of read data, which is read out from the memory banks in accordance with the read addresses, on the basis of the read-register specification and a read-register displacement; and a processing unit for carrying out a plurality of operations on the rearranged pieces of read data output by the read control circuit.

Abstract: An apparatus and method for enhancing the combined image of multiple attributes without compromising the image of either attribute. The combined image of the multiple attributes is enhanced for analyzing a predetermined property revealed by the attributes. The combined image can be interactively manipulated to display each attribute relative to an imaginary light source or highlighted using a specular component. The method and apparatus are best described as particularly useful for analytical, diagnostic and interpretive purposes.

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

Abstract: A method is provided for decoding an encoded point matrix image including a first set of real grid points aligned along a first axis, a second set of real grid points aligned along a second axis intersecting the first axis, and a plurality of encoded data points distributed throughout the encoded point matrix image. The method includes: locating the first and second axes according to a first predetermined principle; finding a set of virtual grid points according to a second predetermined principle, each of the virtual grid points being located at an intersection of a corresponding first virtual line parallel to the first axis and a corresponding second virtual line parallel to the second axis; and decoding each of the encoded data points based on positional relation thereof with a closest one of the virtual grid points so as to obtain information encoded in the encoded point matrix image.

Abstract: A multi-chip system is disclosed for distributing the convolution process. Rather than having multiple convolution chips working in parallel with each chip working on a different portion of the screen, a new design utilizes chips working in series. Each chip is responsible for a different interleaved region of screen space. Each chip performs part of the convolution process for a pixel and sends a partial result on to the next chip. The final chip completes the convolution and stores the filtered pixel. An alternate design interconnects chips in groups. The chips within a group operate in series, whereas the groups may operate in parallel.

Abstract: A method for generating a first plurality of output data values and the matrix factors used to generate an approximation to an image processing transform is disclosed. The first plurality of output data values are generated by transforming a plurality of input data values using a computer and applying a modified transform stored in a modified transformation matrix to the plurality of input data values. The plurality of input data values are stored in a generated matrix, and at least one data value in this matrix is rearranged using a permutation operation and modified by applying a linear combination of the unmodified values to the at least one data value. The modified transform is an approximation to a known transform stored in a transformation matrix that is used to generate a second plurality of output data values, the first plurality of output values approximating the second plurality of output data values.

Abstract: A system and process for reconstructing optimal texture maps from multiple views of a scene is described. In essence, this reconstruction is based on the optimal synthesis of textures from multiple sources. This is generally accomplished using basic image processing theory to derive the correct weights for blending the multiple views. Namely, the steps of reconstructing, warping, prefiltering, and resampling are followed in order to warp reference textures to a desired location, and to compute spatially-variant weights for optimal blending. These weights take into consideration the anisotropy in the texture projection and changes in sampling frequency due to foreshortening. The weights are combined and the computation of the optimal texture is treated as a restoration problem, which involves solving a linear system of equations.

Abstract: Computation of sprite position and size in JSR-184 with revised modelview matrix made with column vector lengths of original modelview matrix.

Abstract: Linear chromaticity conversion is used to perform color reproduction of a liquid crystal display (LCD) compatible with a cathode ray tube (CRT). An inputted signal is subjected to processing similar to processing used in the CRT display. A light source chromaticity conversion processing portion carries out a ? correction to the signal in a ? operation portion by using ?1=?crt of the same nonlinear characteristics as the CRT, and performs an operation of a chromaticity conversion matrix in a matrix operation portion. An LCD inverse ? correction portion uses ?2 establishing ?_lcd=?lcd/?2=1 to perform an inverse ? correction to the inputted signal. An LCD ? characteristic operation portion performs a ? correction using ? characteristics of the LCD to the signal inputted from the LCD inverse ? correction portion, outputs a picture signal, and causes an image to be displayed on the LCD.

Abstract: A matrix reordering method performs reordering of elements of a coefficient matrix created based on coefficients of linear simultaneous equations whose solutions are to be produced by parallel processing of processors of a computer in accordance with Gaussian elimination. Herein, degrees corresponding to numbers of non-zero elements are calculated with respect to all pivots included in the coefficient matrix. Then, a first pivot whose degree is under a threshold (mindeg+?) is selected from among the pivots of the coefficient matrix, while a second pivot whose critical path length is minimum is also selected from among the pivots of the coefficient matrix. Replacement of elements is performed between the first pivot and second pivot to complete reordering with respect to the first pivot. In addition, non-zero elements, which are newly produced by the Gaussian elimination of the first pivot, are added to the coefficient matrix.

Abstract: A projected iterative descent method is used to resolve LCPs related to rigid body dynamics, such that animation of the rigid body dynamics on a display system occur in real-time.

Abstract: In an information processing apparatus for conducting an affine transformation representative of ( x ? y ? z ? ) = A ? ( x y z ) + ( t 1 t 2 t 3 ) , ? a ? ? matrix A ? = ( a 11 ? a 12 ? a 13 ? a 21 ? a 22 ? a 23 ? a 31 ? a 32 ? a 33 ? ) = ? ? ? A = ( ? ? ? a 11 ? ? ? a 12 ? ? ? a 13 ? ? ? a 21 ? ? ? a 22 ? ? ? a 23 ? ? ? a 31 ? ? ? a 32 ? ? ? a 33 ) obtained by multiplying a matrix A for the affine transformation by ?(?0) is stored in a memory section in advance.

Abstract: Feature attributes are extracted from an observation space to create feature vectors for each class to be identified. A linear transformation matrix is used to reduce the dimension of the feature vectors. A numerical optimization algorithm maximizes a geometric criterion function in order to calculate the linear transformation matrix, where it exploits the geometry of the class contours of constant density. Next, a classifier based on the feature vectors in a lower dimension is generated and a class is determined for the data represented.

Abstract: A system and process for reconstructing optimal texture maps from multiple views of a scene is described. In essence, this reconstruction is based on the optimal synthesis of textures from multiple sources. This is generally accomplished using basic image processing theory to derive the correct weights for blending the multiple views. Namely, the steps of reconstructing, warping, prefiltering, and resampling are followed in order to warp reference textures to a desired location, and to compute spatially-variant weights for optimal blending. These weights take into consideration the anisotropy in the texture projection and changes in sampling frequency due to foreshortening. The weights are combined and the computation of the optimal texture is treated as a restoration problem, which involves solving a linear system of equations.

Abstract: In an information processing apparatus for conducting an affine transformation representative of ( x ? y ? z ? ) = A ? ( x y z ) + ( t 1 t 2 t 3 ) , a matrix A ? = ( a 11 ? a 12 ? a 13 ? a 21 ? a 22 ? a 23 ? a 31 ? a 32 ? a 33 ? ) = ? ? ? ? A = ( ? ? ? ? a 11 ? ? ? ? a 12 ? ? ? ? a 13 ? ? ? ? a 21 ? ? ? ? a 22 ? ? ? ? a 23 ? ? ? ? a 31 ? ? ? ? a 32 ? ? ? ? a 33 ) obtained by multiplying a matrix A for the affine transformation by ?(?0) is stored in a memory section in advance.

Abstract: A matrix data processor is implemented wherein data elements are stored in physical registers and mapped to logical registers. After being stored in the logical registers, the data elements are then treated as matrix elements. By using a series of variable matrix parameters to define the size and location of the various matrix source and destination elements, as well as the operation(s) to be performed on the matrices, the performance of digital signal processing operations can be significantly enhanced.

Abstract: Color space conversion from a first image definition scheme to a second image definition scheme is realized by utilizing only one step of matrix multiplication and by determining whether determined RGB values are in a valid RGB region and, if not, generating a first modification factor to bring the RGB vector onto or in close proximity to the boundary of the valid RGB region. Then, the first modification factor is employed to modify in a prescribed manner the converted chroma values. In a specific embodiment of the invention, only a single matrix multiplication is employed and the otherwise additional required multiplication and/or division steps are realized by additions and/or subtractions and by employing a prescribed iterative process to bring the RGB values into or close to the valid RGB color space region. The converted chroma values are also modified by associated second modification factors also generated in the iteration process.

Abstract: An image display system, image processing method, and program that make it possible to reproduce the colors of an image more rapidly in accordance with the user's preferences. The image display system includes: a color gamut calculation section that calculates a target color gamut based on a target profile within a target profile storage section that was selected by the user, and also calculates a displayable color gamut based on a projector profile within a projector profile storage section and environmental information from a colored-light sensor that detects the visual environment; a matrix generation section that generates a conversion matrix according to the relationship between the target color gamut and the displayable color gamut; and a matrix converter section that uses the thus-generated conversion matrix to convert image information; whereby image information is converted and image is displayed.

Abstract: A technique for expressing an elastic body using computer graphics. The elastic body is expressed by transforming coordinates of shape specific points which specify the shape of an object using a transformation matrix. Each element of the transformation matrix is expressed by a function having time as a variable which converges to a corresponding element of a matrix that represents the motion of the object when the object is assumed to be a rigid body. By substituting a predetermined time into this function, a value of each element of the transformation matrix is determined. The shape of the object is determined based on the coordinate values of the shape specific points after coordinate transformation.

Abstract: In a specific embodiment, a system for providing video includes a system bus, which in one embodiment is an Advanced Graphics Port (AGP) busy. The system bus is connected to a data bridge, which is connected to a second and third AGP bus. Each of the AGP busses are connected to graphics processors. The bridge routes data requests from one graphics processor to the second graphics processor without accessing the system AGP bus based upon a memory mapping information stored in a routing table or a register set. In another aspect of the present invention, the bridge responds to initialization requests using attributes that may vary depending on the specific mode of operation. Another aspect of the present invention allows for conversion between various AGP protocol portions.

Abstract: Color space conversion from a first image definition scheme to a second image definition scheme is realized by utilizing only one step of matrix multiplication and by determining whether determined RGB values are in a valid RGB region and, if not, generating a first modification factor to bring the RGB vector onto or in close proximity to the boundary of the valid RGB region. Then, the first modification factor is employed to modify in a prescribed manner the converted chroma values. In a specific embodiment of the invention, only a single matrix multiplication is employed and the otherwise additional required multiplication and/or division steps are realized by additions and/or subtractions and by employing a prescribed iterative process to bring the RGB values into or close to the valid RGB color space region. The converted chroma values are also modified by associated second modification factors also generated in the iteration process.

Abstract: A system and method for converting bitmapped data, for example, weather data or thermal imaging data, to polygons is disclosed. The conversion of the data into polygons creates smaller data files. The invention is adaptive in that it allows for a variable degree of fidelity of the polygons. Matrix data is obtained. A color value is obtained. The color value is a variable used in the creation of the polygons. A list of cells to check is determined based on the color value. The list of cells to check is examined in order to determine a boundary list. The boundary list is then examined to determine vertices. The determination of the vertices is based on a prescribed maximum distance. When drawn, the ordered list of vertices create polygons which depict the cell data. The data files which include the vertices for the polygons are much smaller than the corresponding cell data files.

Abstract: A configurable vertex blending circuit that allows both morphing and skinning operations to be supported in dedicated hardware is presented. Such a configurable vertex blending circuit includes a matrix array that is used for storing the matrices associated with the various portions of the vertex blending operations. Vertex data that is received is stored in an input vertex buffer that includes multiple position buffers such that the multiple positions associated with morphing operations can be stored. Similarly, the single position typically associated with skinning operations can be stored in one of the position buffers. The input vertex buffer further stores blending weights associated with the various component operations that are included in the overall vertex blending operation. An arithmetic unit, which is configured and controlled by a transform controller, performs the calculations required for each of a plurality of component operations included in the overall vertex blending operation.