Computer graphics processing and selective visual display system – Computer graphics processing – Animation
Reexamination Certificate
2001-06-15
2002-11-26
Zimmerman, Mark (Department: 2671)
Computer graphics processing and selective visual display system
Computer graphics processing
Animation
C345S475000, C345S646000
Reexamination Certificate
active
06486881
ABSTRACT:
BACKGROUND OF THE INVENTION
In computer graphics the shape of a displayed object can be approximated by a set of geometric primitives such as polygons or curvilinear elements such as polynomials, splines, or NURBS (Non-Uniform Rational B-Splines. These geometric primitives can be described in terms their position in a predetermined set of spatial coordinates using two or three-dimensional coordinates of their vertices or end points and additional data may also be used such as derivatives or normals.
A rigid body is one in which the vertices used to describe the object do not undergo a displacement relative to a body centered coordinate system, where the origin of the body centered coordinate system may be the center of mass of the object. In contrast, a deformable object is one in which the vertices used to describe the object undergo deformation relative to the body centered coordinate system.
In a dynamic animation of an object the new coordinate positions of a rigid body can be found in terms of translations and rotations of the object. These calculations can be directly calculated using matrix multiplication in which a rotation-translation matrix is multiplied by a vertices-data matrix that stores the coordinate positions of the vertices of the object. However, a dynamic animation of a deformable object involves not only the translation and rotation of the vertices of the object, but also the relative displacement of each the vertices with respect to the body centered coordinate system. The relative displacement is difficult to calculate and therefore, it would require the specification of each of the vertices for each image in the animation. Storing the data necessary to define each of the vertices in space for each image in the animation could require a very large amount of storage area. In some instances, the animation that includes a deformable object may be transmitted in real time over a data network, such as the internet, as streamed video. In this instance the amount of data to stream over the network includes the coordinates of the vertices defining an object in each frame. Data streaming this data would require a very high bandwidth connection to allow the large amount of data to be transmitted at a data rate sufficient to establish the proper images.
Therefore what is needed in the art is an apparatus and method to allow the data corresponding to the vertices of a deformable object to be efficiently stored or transmitted.
BRIEF SUMMARY OF THE INVENTION
A method and apparatus are disclosed for analyzing a three-dimensional (3D) object and reducing the amount of data necessary to accurately reproduce the image. In particular, an 3D object is analyzed and a set of vertices is selected and formed into a vertices-data matrix A. This matrix A is analyzed using a singular value decomposition (SVD) technique that forms the matrices U, W, and V, wherein A=UWV
T
. In addition, the singular values in the matrix W associated with the vertices-data-matrix A are determined. These singular values can be truncated or filtered and the dimensions of the vertices-data-matrix A can be reduced thereby. In a data streaming application having a source and a destination, a constant product of VW
T
is formed and provided to the destination. The source then forms row vectors U
i
of the matrix U, from the row vectors of the reduced dimension matrix A, according to U
i
=A
i
VW−
1
. The destination receives row vectors of U and reconstructs the 3D object according to A=UWV
T
.
REFERENCES:
patent: 5818463 (1998-10-01), Tao et al.
patent: 5970173 (1999-10-01), Lee et al.
patent: 6072496 (2000-06-01), Guenter et al.
Chan, Tony. An Improved Algorithm for Computing the Singuylar Value Decomposition. ACM Transactions on Mathematical Software, vol. 8, No. 1, Mar. 1982, pp. 72-83.*
Bascle, B. et al. Separability of pose and expression in facial tracking and animation. Computer Visioon. 1998. 6thInternatona Conference. 4-7 Jan. 1998. pp. 323-328.*
Klema, V., et al., The Singular Value Decomposition: Its Composition and Some Applications. IEEE Transaction on Automatic Control. Apr. 1980, Vol. AC-25. No. 2. pp. 164-178.
Bascle, B. et al., Separability of pose and expression in facial tracking and animation. Computer vision, Sixth International Conference. Jan. 4-7, 1998 pp. 323-328, esp. Section 3, pp. 325-327.
Bullivant David
Charette Paul
Hunter Peter J.
LaFontaine Serge
Nielsen Poul F.
Lifef/x Networks, Inc.
Stevenson Philip H.
Zimmerman Mark
LandOfFree
Basis functions of three-dimensional models for compression,... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Basis functions of three-dimensional models for compression,..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Basis functions of three-dimensional models for compression,... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2968912