Results 1  10
of
987,243
Image Representation Using 2D Gabor Wavelets
 IEEE Trans. Pattern Analysis and Machine Intelligence
, 1996
"... This paper extends to two dimensions the frame criterion developed by Daubechies for onedimensional wavelets, and it computes the frame bounds for the particular case of 2D Gabor wavelets. Completeness criteria for 2D Gabor image representations are important because of their increasing role in man ..."
Abstract

Cited by 375 (4 self)
 Add to MetaCart
This paper extends to two dimensions the frame criterion developed by Daubechies for onedimensional wavelets, and it computes the frame bounds for the particular case of 2D Gabor wavelets. Completeness criteria for 2D Gabor image representations are important because of their increasing role
Acquiring linear subspaces for face recognition under variable lighting
 IEEE Transactions on Pattern Analysis and Machine Intelligence
, 2005
"... Previous work has demonstrated that the image variation of many objects (human faces in particular) under variable lighting can be effectively modeled by low dimensional linear spaces, even when there are multiple light sources and shadowing. Basis images spanning this space are usually obtained in ..."
Abstract

Cited by 303 (2 self)
 Add to MetaCart
, the resulting subspace is an effective representation for recognition under a wide range of lighting conditions. Since the subspace is generated directly from real images, potentially complex and/or brittle intermediate steps such as 3D reconstruction can be completely avoided; nor is it necessary to acquire
Generalization Of An Inequality By Talagrand, And Links With The Logarithmic Sobolev Inequality
 J. Funct. Anal
, 2000
"... . We show that transport inequalities, similar to the one derived by Talagrand [30] for the Gaussian measure, are implied by logarithmic Sobolev inequalities. Conversely, Talagrand's inequality implies a logarithmic Sobolev inequality if the density of the measure is approximately logconcave, ..."
Abstract

Cited by 243 (12 self)
 Add to MetaCart
. Main results 5 3. Heuristics 11 4. Proof of Theorem 1 18 5. Proof of Theorem 3 24 6. An application of Theorem 1 30 7. Linearizations 31 Appendix A. A nonlinear approximation argument 35 References 36 1. Introduction Let M be a smooth complete Riemannian manifold of dimension n, with the geodesic
Network Centric Warfare: Developing and Leveraging Information Superiority
 Command and Control Research Program (CCRP), US DoD
, 2000
"... the mission of improving DoD’s understanding of the national security implications of the Information Age. Focusing upon improving both the state of the art and the state of the practice of command and control, the CCRP helps DoD take full advantage of the opportunities afforded by emerging technolo ..."
Abstract

Cited by 308 (5 self)
 Add to MetaCart
the mission of improving DoD’s understanding of the national security implications of the Information Age. Focusing upon improving both the state of the art and the state of the practice of command and control, the CCRP helps DoD take full advantage of the opportunities afforded by emerging technologies. The CCRP pursues a broad program of research and analysis in information superiority, information operations, command and control theory, and associated operational concepts that enable us to leverage shared awareness to improve the effectiveness and efficiency of assigned missions. An important aspect of the CCRP program is its ability to serve as a bridge between the operational, technical, analytical, and educational communities. The CCRP provides leadership for the command and control research community by: n n
Training a 3Node Neural Network is NPComplete
, 1992
"... We consider a 2layer, 3node, ninput neural network whose nodes compute linear threshold functions of their inputs. We show that it is NPcomplete to decide whether there exist weights and thresholds for this network so that it produces output consistent with a given set of training examples. We ..."
Abstract

Cited by 225 (3 self)
 Add to MetaCart
We consider a 2layer, 3node, ninput neural network whose nodes compute linear threshold functions of their inputs. We show that it is NPcomplete to decide whether there exist weights and thresholds for this network so that it produces output consistent with a given set of training examples. We
and Linear Inequalities
"... Time and space are sufficiently similar to warrant in certain cases a common representation in AI problemsolving systems. What is represented is often the constraints that hold between objects, and a concern is the overall consistency of a set of such constraints. ..."
Abstract
 Add to MetaCart
Time and space are sufficiently similar to warrant in certain cases a common representation in AI problemsolving systems. What is represented is often the constraints that hold between objects, and a concern is the overall consistency of a set of such constraints.
Attributive concept descriptions with complements
 ARTIFICIAL INTELLIGENCE 48 (1991) 126
, 1991
"... We investigate the consequences of adding unions and complements to attributive concept descriptions employed in terminological knowledge representation languages. It is shown that deciding coherence and subsumption of such descriptions are PSPACEcomplete problems that can be decided with linear sp ..."
Abstract

Cited by 225 (2 self)
 Add to MetaCart
We investigate the consequences of adding unions and complements to attributive concept descriptions employed in terminological knowledge representation languages. It is shown that deciding coherence and subsumption of such descriptions are PSPACEcomplete problems that can be decided with linear
Image SuperResolution via Sparse Representation
"... This paper presents a new approach to singleimage superresolution, based on sparse signal representation. Research on image statistics suggests that image patches can be wellrepresented as a sparse linear combination of elements from an appropriately chosen overcomplete dictionary. Inspired by th ..."
Abstract

Cited by 190 (9 self)
 Add to MetaCart
This paper presents a new approach to singleimage superresolution, based on sparse signal representation. Research on image statistics suggests that image patches can be wellrepresented as a sparse linear combination of elements from an appropriately chosen overcomplete dictionary. Inspired
A Pattern Approach to Interaction Design
, 2000
"... To create successful interactive systems, user interface designers need to cooperate with developers and application domain experts in an interdisciplinary team. These groups, however, usually miss a common terminology to exchange ideas, opinions, and values. This paper presents an approach that use ..."
Abstract

Cited by 253 (13 self)
 Add to MetaCart
To create successful interactive systems, user interface designers need to cooperate with developers and application domain experts in an interdisciplinary team. These groups, however, usually miss a common terminology to exchange ideas, opinions, and values. This paper presents an approach that uses pattern languages to capture this knowledge in software development, HCI, and the application domain. A formal, domainindependent definition of design patterns allows for computer support without sacrificing readability, and pattern use is integrated into the usability engineering lifecycle. As an example, experience from building an awardwinning interactive music exhibit was turned into a pattern language, which was then used to inform followup projects and support HCI education.
On Facets of Knapsack Equality Polytopes
, 1997
"... The 0/1 knapsack equality polytope is, by definition, the convex hull of 0/1 solutions of a single linear equation. A special form of this polytope  where the defining linear equation has nonnegative integer coefficients and the number of variables having coefficient one exceeds the righthandsid ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
handside  is considered. Equality constraints of this form arose in a realworld application of integer programming to a truck dispatching scheduling problem. Families of facet defining inequalities for this polytope are identified, and complete linear inequality representations are obtained for some classes of polytopes.
Results 1  10
of
987,243