Results 1  10
of
2,039
Detection and Tracking of Point Features
 International Journal of Computer Vision
, 1991
"... The factorization method described in this series of reports requires an algorithm to track the motion of features in an image stream. Given the small interframe displacement made possible by the factorization approach, the best tracking method turns out to be the one proposed by Lucas and Kanade i ..."
Abstract

Cited by 629 (2 self)
 Add to MetaCart
algorithm, and expresses how well a feature can be tracked. As a result, the criterion is optima...
High confidence visual recognition of persons by a test of statistical independence
 IEEE TRANS. ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
, 1993
"... A method for rapid visual recognition of personal identity is described, based on the failure of a statistical test of independence. The most unique phenotypic feature visible in a person’s face is the detailed texture of each eye’s iris: An estimate of its statistical complexity in a sample of the ..."
Abstract

Cited by 621 (8 self)
 Add to MetaCart
of the human population reveals variation corresponding to several hundred independent degreesoffreedom. Morphogenetic randomness in the texture expressed phenotypically in the iris trabecular meshwork ensures that a test of statistical independence on two coded patterns originating from different eyes
Empirical Bayes Analysis of a Microarray Experiment
 Journal of the American Statistical Association
, 2001
"... Microarrays are a novel technology that facilitates the simultaneous measurement of thousands of gene expression levels. A typical microarray experiment can produce millions of data points, raising serious problems of data reduction, and simultaneous inference. We consider one such experiment in whi ..."
Abstract

Cited by 492 (20 self)
 Add to MetaCart
Microarrays are a novel technology that facilitates the simultaneous measurement of thousands of gene expression levels. A typical microarray experiment can produce millions of data points, raising serious problems of data reduction, and simultaneous inference. We consider one such experiment
An EM Algorithm for WaveletBased Image Restoration
, 2002
"... This paper introduces an expectationmaximization (EM) algorithm for image restoration (deconvolution) based on a penalized likelihood formulated in the wavelet domain. Regularization is achieved by promoting a reconstruction with lowcomplexity, expressed in terms of the wavelet coecients, taking a ..."
Abstract

Cited by 352 (22 self)
 Add to MetaCart
This paper introduces an expectationmaximization (EM) algorithm for image restoration (deconvolution) based on a penalized likelihood formulated in the wavelet domain. Regularization is achieved by promoting a reconstruction with lowcomplexity, expressed in terms of the wavelet coecients, taking
Joint TxRx beamforming design for multicarrier MIMO channels: a unified framework for convex optimization
 IEEE TRANS. SIGNAL PROCESSING
, 2003
"... This paper addresses the joint design of transmit and receive beamforming or linear processing (commonly termed linear precoding at the transmitter and equalization at the receiver) for multicarrier multipleinput multipleoutput (MIMO) channels under a variety of design criteria. Instead of consid ..."
Abstract

Cited by 297 (19 self)
 Add to MetaCart
of considering each design criterion in a separate way, we generalize the existing results by developing a unified framework based on considering two families of objective functions that embrace most reasonable criteria to design a communication system: Schurconcave and Schurconvex functions. Once the optimal
A Hierarchical Unsupervised Growing Neural Network for Clustering Gene Expression Patterns
, 2001
"... Motivation: We describe a new approach to the analysis of gene expression data coming from DNA array experiments, using an unsupervised neural network. DNA array technologies allow monitoring thousands of genes rapidly and efficiently. One of the interests of these studies is the search for correlat ..."
Abstract

Cited by 200 (20 self)
 Add to MetaCart
of this criterion, a statistical support for the definition of clusters is proposed. In addition, obtaining average gene expression patterns is a builtin feature of the algorithm. Different neurons defining the different hierarchical levels represent the averages of the gene expression patterns contained
Shape and motion from image streams: a factorization method  2. point features in 3d motion.
, 1991
"... Abstract The factorization method described in this series of reports requires an algorithm to track the motion of features in an image stream. Given the small interframe displacement made possible by the factorization approach, the best tracking method turns out to be the one proposed by Lucas an ..."
Abstract

Cited by 219 (13 self)
 Add to MetaCart
of the tracking algorithm, and expresses how well a feature can be tracked. As a result, the criterion is optimal by construction. We show by experiment that the performance of both the selection and the tracking algorithm are adequate for our factorization method, and we address the issue of how to detect
A theory of the storage and retrieval of item and associative information
 Psychological Review
, 1982
"... A theory for the storage and retrieval of item and associative information is presented. In the theory, items or events are represented as random vectors. Convolution is used as the storage operation, and correlation is used as the retrieval operation. A distributedmemory system is assumed; all inf ..."
Abstract

Cited by 215 (5 self)
 Add to MetaCart
information is stored in a common memory vector. The theory applies to both recognition and recall and covers both accuracy and latency. Noise in the decision stage necessitates a twocriterion decision system, and over time the criteria converge until a decision is reached. Performance is predicted from
Jacobi Angles For Simultaneous Diagonalization.
 SIAM J. Mat. Anal. Appl
, 1996
"... . Simultaneous diagonalization of several matrices can be implemented by a Jacobilike technique. This note gives the required Jacobi angles in close form. Key words. Simultaneous diagonalization, Jacobi iterations, eigenvalues, eigenvectors, structured eigenvalue problem. AMS subject classificati ..."
Abstract

Cited by 192 (3 self)
 Add to MetaCart
identification problem [2] (see [3] for a later paper in English). The simultaneous diagonalization algorithm described in these papers is an extension of the Jacobi technique: a joint diagonality criterion is iteratively optimized under plane rotations. The purpose of this note is to complement [1] by giving a
A numerical criterion for very ample line bundles
"... Let X be a projective algebraic manifold of dimension n and let L be an ample line bundle over X. We give a numerical criterion ensuring that the adjoint bundle KX + L is very ample. The sufficient conditions are expressed in terms of lower bounds for the intersection numbers L p ·Y over subvarieti ..."
Abstract

Cited by 69 (17 self)
 Add to MetaCart
Let X be a projective algebraic manifold of dimension n and let L be an ample line bundle over X. We give a numerical criterion ensuring that the adjoint bundle KX + L is very ample. The sufficient conditions are expressed in terms of lower bounds for the intersection numbers L p ·Y over
Results 1  10
of
2,039