Class / Patent application number | Description | Number of patent applications / Date published |
708401000 | Multidimensional | 12 |
20080256158 | MATCHING MOVEMENT BEHAVIOR IN MOTION GRAPHICS - Computer-implemented methods and media bearing instructions for matching movements of objects are described. In one example, the method can include determining a position of a first point in a first coordinate system, converting the position of the first point from the first coordinate system to a second coordinate system, performing a transformation on a second point in the second coordinate system, wherein the second point is initialized to a starting position in the second coordinate system, determining an ending position of the second point in the second coordinate system based on the transformation, converting the ending position of the second point in the second coordinate system to the first coordinate system, and associating the ending position of the second point in the first coordinate system to the first point in the first coordinate system, wherein the associating causes a transformation of the first point to match the transformation performed on the second point. | 10-16-2008 |
20090240755 | METHOD OF PROVIDING SPACE FILLING PATTERNS - Methods of generating Hilbert space-filling indexes using simple bit-wise transformation are described herein. One method is based on a linear-based transformation uses bit-wise AND and XOR operations on a simple input index counter. In another method, the regular structure of the transform matrix was then used to obtain a Gray-based transform at a reduced complexity. Due to the simple and regular structure of the transformation, an efficient hardware implementation of generating indexes (addresses) along the Hilbert curve results. | 09-24-2009 |
20100017450 | ARCHITECTURE FOR VECTOR MEMORY ARRAY TRANSPOSITION USING A BLOCK TRANSPOSITION ACCELERATOR - A system and method for vector memory array transposition. The system includes a vector memory, a block transposition accelerator, and an address controller. The vector memory stores a vector memory array. The block transposition accelerator reads a vector of a block of data within the vector memory array. The block transposition accelerator also writes a transposition of the vector of the block of data to the vector memory. The address controller determines a vector access order, and the block transposition accelerator accesses the vector of the block of data within the vector memory array according to the vector access order. | 01-21-2010 |
20100017451 | Binary Number Multiplying Method and Circuit - A multiplier and a method multiply, using an array of adders, two binary numbers X and Y defining a matrix [E | 01-21-2010 |
20100191791 | METHOD AND APPARATUS FOR EVALUATION OF MULTI-DIMENSIONAL DISCRETE FOURIER TRANSFORMS - A device and method for evaluating multidimensional discrete Fourier transforms (DFT) by eliminating transpose operations by transforming every dimension concurrently. At least one computing node is enabled to evaluate a DFT of one of a multidimensional input data set and a subgroup of the input data set, wherein the subgroup comprises groupings of elements taken from a plurality of selected dimensions of the input data set for subsequent multidimensional DFT operations. | 07-29-2010 |
20100198900 | METHODS OF MULTIVARIATE DATA CLUSTER SEPARATION AND VISUALIZATION - A method separates multivariate data points in lower dimensional space, where each data point has been classified into one of a plurality of data clusters including at least a first data cluster and a second data cluster. The method includes the step of acquiring an ND-to-3D transformation matrix for transforming the plurality of multivariate data points to a plurality of three-dimensional data points. The method preferably includes the sub-step of performing a center of mass (COM) separation of the clusters to acquire a COM transformation matrix, where the COM transformation matrix is the ND-to-3D transformation matrix. The method also includes the step of performing a receiver-operator characteristic curve (ROC) separation to acquire an ROC transformation matrix for transforming the plurality of three-dimensional data points to a plurality of data points in a dimension lower than 3D and preferably a re-optimized COM transformation matrix. | 08-05-2010 |
20110055306 | OPTIMAL PADDING FOR THE TWO-DIMENSIONAL FAST FOURIER TRANSFORM - Padding or adding data to a data signal can increase the speed with which a signal processor can process the data. Methods are provided herein that can accurately predict the optimal pad size of a two dimensional array of data, which can be used to increase the processing speed of a signal processor by optimizing run-time for a two-dimensional (2-D) fast Fourier transform (FFT) operation. | 03-03-2011 |
20110078224 | Nonlinear Dimensionality Reduction of Spectrograms - Embodiments of the invention disclose a system and a method for reducing a dimensionality of a spectrogram matrix. The method constructs an intermediate time basis matrix and an intermediate frequency basis matrix and applies iteratively a non-negative matrix factorization (NMF) to the intermediate time basis matrix and the intermediate frequency basis matrix until a termination condition is reached, wherein the NMF is subject to a constraint on a an independence regularization term, wherein the constraint is in a form of a gradient of the term. | 03-31-2011 |
20120078989 | Signal Processors and Methods for Estimating Transformations Between Signals with Least Squares - Signal processing devices and methods estimate transforms between signals using a least squares technique. From a seed set of transform candidates, a direct least squares method applies a seed transform candidate to a reference signal and then measures correlation between the transformed reference signal and a suspect signal. For each candidate, update coordinates of reference signal features are identified in the suspect signal and provided as input to a least squares method to compute an update to the transform candidate. The method iterates so long as the update of the transform provides a better correlation. At the end of the process, the method identifies a transform or set of top transforms based on a further analysis of correlation, as well as other results. | 03-29-2012 |
20130013659 | METHOD FOR STREAMING SVD COMPUTATION FIELD OF INVENTION - The present disclosure is directed to techniques for efficient streaming SVD computation. In an embodiment, streaming SVD can be applied for streamed data and/or for streamed processing of data. In another embodiment, the streamed data can include time series data, data in motion, and data at rest, wherein the data at rest can include data from a database or a file and read in an ordered manner. More particularly, the disclosure is directed to an efficient and faster method of computation of streaming SVD for data sets such that errors including reconstruction error and loss of orthogonality are error bounded. The method avoids SVD re-computation of already computed data sets and ensures updates to the SVD model by incorporating only the changes introduced by the new entrant data sets. | 01-10-2013 |
20140025719 | ASYNCHRONOUS DISTRIBUTED COMPUTING BASED SYSTEM - An embodiment of the invention includes asynchronous data calculation and data exchange in a distributed system. Such an embodiment is appropriate for advanced modeling projects and the like. One embodiment includes a distribution of a matrix of data across a distributed computing system. The embodiment combines transform calculations (e.g., Fourier transforms) and data transpositions of the data across the distributed computing system. The embodiment further combines decompositions and transpositions of the data across the distributed computing system. The embodiment thereby concurrently performs data calculations (e.g., transform calculations, decompositions) and data exchange (e.g., message passage interface messaging) to promote distributed computing efficiency. Other embodiments are described herein. | 01-23-2014 |
20140149478 | TRANSFORM DESIGN WITH SCALED AND NON-SCALED INTERFACES - Techniques for efficiently performing full and scaled transforms on data received via full and scaled interfaces, respectively, are described and comprise (1) performing a first transform on a block of first input values to obtain a block of first output values by scaling the block to obtain scaled input values, performing a scaled one-dimensional (1D) transform on each row of the block, and performing a scaled 1D transform on each column of the block; and (2) performing a second transform on a block of second input values to obtain a block of second output values by performing a scaled 1D transform on each row of the block, performing a scaled 1D transform on each column of the block, and scaling the block. | 05-29-2014 |