|
8,494,310
|
Three-dimensional model search method, computer program, and three-dimensional model search system
|
July 23, 2013
|
A novel search method having an advantage over the DSR 472 method the
search accuracy of which is currently said to be the highest level is
proposed. At the feature value computation stage, the two-dimensional
image used in computation of the three-dimensional model feature value
(excluding a contour feature value) is corrected so that the gray scales
of the pixels are emphasized more as the distance from the center of
the two-dimensional image increases.
|
|
7,219,089
|
Data retrieval method, system and program product
|
May 15, 2007
|
A data retrieval system having a database storing data as a vector that
has been digitized based on a keyword. The system has capability of
generating a residual vector from the data to compute a covariance
matrix and an eigenvector of the covariance matrix. The system further
has the capability for generating and storing a set of basic vectors
from the set of the computed eigenvectors, and for reading out the data
and at least one of the eigenvectors from a memory. This is utilized to
compute a contribution of the eigenvector to the data, and for
contracting or enlarging a residual vector to store. The system selects a
keyword to be used for labeling according to a similarity between the
stored basic vector and the data, and a weight on the similarity so as
to store the keyword in a memory.
|
|
7,216,129
|
Information processing using a hierarchy structure of randomized samples
|
May 8, 2007
|
A method is provided for retrieving information from massive databases
(i.e., databases with millions of documents) in real time, that allows
users to control the trade-off between accuracy in retrieved results and
response times. The method may be applied to databases with contents,
i.e., documents which have been modeled with a clearly defined metric
that enables computation of distances between any two documents, so that
pairs of documents which are "closer" with respect to the metric are
more similar than pairs of documents which are "further apart". Our
method can be applied to similarity ranking and/or can be combined
together with other methods to increase the scalability of information
retrieval, detection, ranking, and tracking.
|
|
6,965,898
|
Information retrieval system, an information retrieval
method, a program for executing information retrieval, and a storage
medium wherein a program for executing information retrieval is stored
|
November 15, 2005
|
To provide an information retrieval system, a method for information
retrieval, a program for executing the information retrieval, and a
storage medium comprising the program for executing the information
retrieval The information retrieval system according to the present
invention comprises: means for generating and storing a predetermined
type matrix from said document-attribute matrix, means for generating
said document-attribute submatrix from documents being added to said
database during a specific time period, means for updating said
predetermined type matrix using knowledge with respect to said
document-attribute submatrix and for executing the singular value
decomposition on updated said predetermined type matrix to execute
dimension reduction of all document-attribute matrices stored within
said database, and means for retrieving information with respect to a
user input query using said dimension reduced document-attribute matrix.
|
|
6,920,450
|
Retrieving, detecting and identifying major and outlier clusters in a very large database
|
July 19, 2005
|
The present invention discloses a method, a computer system, a computer
readable medium and a sever. The method of the present invention
comprises steps of; creating said document matrix from said documents
using at least one attribute; creating a scaled residual matrix based on
said document matrix using a predetermined function; executing singular
value decomposition to obtain a basis vector corresponding to the
largest singular value; re-constructing said residual matrix and scaling
dynamically said re-constructed residual matrix to obtain another basis
vector; repeating said singular value decomposition step to said
re-constructing step to create a predetermined set of basis vector; and
executing reduction of said document matrix to perform detection,
retrieval and identification of said documents in said database.
|
|
6,573,899
|
Morphing processing apparatus, method, storage medium, program transmission apparatus, and animation creation apparatus
|
June 3, 2003
|
Morphing is performed without self-intersection in a vector space, for
the outlines for various types and shapes of figures. The morphing is
performed by apparatus containing an outline extractor, for receiving
two target figures for the morphing process and for extracting a set of
outlines for each of the target figures; an outline tree generator and
an outline tree arrangement unit, for retaining one specific outline of
each of the two sets of outlines and for deleting the other outlines; an
outline editor, for performing a smoothing process for the two outlines
for the target figures that are retained by the outline tree
arrangement unit in order to prevent self-intersection during the
morphing process; and a sequence generator and a morphing viewer, for
performing the morphing process in response to the progress made by the
smoothing process performed by the smoothing processor.
|
|
6,314,205
|
Method and apparatus for compressing and transmitting a three-dimensional geometric model
|
November 6, 2001
|
A data compression method for processing topological structures of
various geometric models. A topological transformation is performed for a
three-dimensional (3D) geometric model that is to be compressed, and a
triangle mesh is generated. A conventional triangle mesh compression
method is employed. Associated data required for the performance of a
reverse operation for the topological transformation are prepared. As a
result, topological data for the 3D geometric model is compressed. As
needed, the data for the compressed triangle mesh and associated
operation data are output. Furthermore, a necessary process (e.g., a
compression process) is also performed for geometric data for the 3D
geometric model, and the resultant data are either stored or output. For
the decompression of compressed data, the compressed triangle mesh is
decompressed using the method employed for compression, and a triangle
mesh is generated. The associated data are then employed to perform the
reverse operation for the topological transformation of the triangle
mesh, and the topological data for the original 3D geometric model are
recovered. If the geometric data are also compressed, they are
decompressed and are employed with the topological data to recover the
3D geometric model.
|
|
6,201,881
|
Embedding information in three-dimensional geometric model
|
March 13, 2001
|
Information is embedded in a three-dimensional geometric model in a
visible or invisible state by changing geometric parameters of a
three-dimensional geometric model. The three-dimensional geometric model
comprises polyhedrons, lines, a set of points, or curved surfaces which
are primitives (components) of the model. Each primitive is defined by a
geometric parameter. The geometric shape of a three-dimensional
geometric model is defined by a set of many geometric parameters. The
information is embedded by changing the geometric parameters of a
plurality of primitives constituting a three-dimensional geometric
model.
|
|
6,034,691
|
Rendering method and apparatus
|
March 7, 2000
|
The present invention is directed to a real-time controllable reflection
mapping function which covers all stereoscopic directions of space.
More specifically, the surface of a mirrored object is segmented into a
plurality of polygonal elements (for example, triangles). Then, a
polyhedron, which includes a predetermined point (for example, the
center of the mirrored object) in a three-dimensional space (for
example, a cube) in the interior thereof, is generated and a rendering
process is performed for each surface of the polyhedron with the
predetermined point as a view point. The rendered image is stored.
Thereafter, a reflection vector is calculated between each vertex of the
polygonal elements and a view point used when the entire
three-dimensional space is rendered. Next, the surface of the
polyhedron, in which an intersecting point between the reflection vector
with the predetermined point as a start point and the polyhedron
exists, is obtained. The coordinate in the image, which corresponds to
each vertex of the polygonal elements, is calculated by using the
surface where the intersecting point exists and the reflection vector.
The image is texture-mapped onto the surface of the object by using the
coordinate in the image which corresponds to each vertex of the
polygonal elements. Finally, the result of the texture mapping is
displayed.
|
|
5,936,633
|
Rendering method and apparatus, and method and apparatus for smoothing intensity-value
|
August 10, 1999
|
In order to render a three-dimensional space which has a spotlight
source with a cone angle .theta. at high speed and with better quality,
an object's surface in the three-dimensional space is first meshed into a
plurality of elements. Then, a radiosity from the spotlight source is
calculated for each element which is included inside of the cone angle
.theta. when viewed from the spotlight source. Thereafter, an
intensity-value at each vertex of each element is calculated from the
radiosity calculated for each element. Next, Gouraud shading is
performed by using the intensity-value at each vertex of each element,
and the result is displayed on a display.
|
|
5,049,986
|
Method and apparatus for color image quantization
|
September 17, 1991
|
A high-speed method and an apparatus for color image quantization
utilizing an adaptive sampling technique in which the processing time is
substantially determined by the number of simultaneously displayed
colors to be selected, but is not affected by the number of colors or
the color distribution in the original image. Factors contributing to
improve the speed of color image quantization are that all calculations
necessary for selecting the representative colors can be performed in an
integer operation, and there is no need of distance calculation for
mapping to neighboring representative colors. All that is required as
data are a histogram, a divided color-space management list, and a
division priority management list, so that required storage capacity may
be small. Accordingly the invention can be implemented on a personal
computer.
|