Results 1 - 10 of 18,112

Features of similarity.

by Amos Tversky - Psychological Review , 1977
"... Similarity plays a fundamental role in theories of knowledge and behavior. It serves as an organizing principle by which individuals classify objects, form concepts, and make generalizations. Indeed, the concept of similarity is ubiquitous in psychological theory. It underlies the accounts of stimu ..."
Abstract - Cited by 1455 (2 self) - Add to MetaCart
and metric assumptions are open to question. It has been argued by many authors that dimensional representations are appropriate for certain stimuli (e.g., colors, tones) but not for others. It seems more appropriate to represent faces, countries, or personalities in terms of many qualitative features than

Approximate Riemann Solvers, Parameter Vectors, and Difference Schemes

by P. L. Roe - J. COMP. PHYS , 1981
"... Several numerical schemes for the solution of hyperbolic conservation laws are based on exploiting the information obtained by considering a sequence of Riemann problems. It is argued that in existing schemes much of this information is degraded, and that only certain features of the exact solution ..."
Abstract - Cited by 1010 (2 self) - Add to MetaCart
Several numerical schemes for the solution of hyperbolic conservation laws are based on exploiting the information obtained by considering a sequence of Riemann problems. It is argued that in existing schemes much of this information is degraded, and that only certain features of the exact solution

View-Based and Modular Eigenspaces for Face Recognition

by Alex Pentland, Baback Moghaddam, Thad Starner - IEEE INTERNATIONAL CONFERENCE ON COMPUTER VISION & PATTERN RECOGNITION , 1994
"... In this work we describe experiments with eigenfaces for recognition and interactive search in a large-scale face database. Accurate visual recognition is demonstrated using a database of o(10^3) faces. The problem of recognition under general viewing orientation is also explained. A view-based mul ..."
Abstract - Cited by 781 (15 self) - Add to MetaCart
-based multiple-observer eigenspace technique is proposed for use in face recognition under variable pose. In addition, a modular eigenspace description technique is used which incorporates salient features such as the eyes, nose, mouth, in a eigenfeature layer. This modular representation yields higher

VisualSEEk: a fully automated content-based image query system

by John R. Smith, Shih-fu Chang , 1996
"... We describe a highly functional prototype system for searching by visual features in an image database. The VisualSEEk system is novel in that the user forms the queries by diagramming spatial arrangements of color regions. The system finds the images that contain the most similar arrangements of ..."
Abstract - Cited by 762 (31 self) - Add to MetaCart
We describe a highly functional prototype system for searching by visual features in an image database. The VisualSEEk system is novel in that the user forms the queries by diagramming spatial arrangements of color regions. The system finds the images that contain the most similar arrangements

PCA-SIFT: A more distinctive representation for local image descriptors

by Yan Ke, Rahul Sukthankar , 2004
"... Stable local feature detection and representation is a fundamental component of many image registration and object recognition algorithms. Mikolajczyk and Schmid [14] recently evaluated a variety of approaches and identified the SIFT [11] algorithm as being the most resistant to common image deforma ..."
Abstract - Cited by 591 (6 self) - Add to MetaCart
deformations. This paper examines (and improves upon) the local image descriptor used by SIFT. Like SIFT, our descriptors encode the salient aspects of the image gradient in the feature point's neighborhood; however, instead of using SIFT's smoothed weighted histograms, we apply Principal Components

Content-based image retrieval at the end of the early years

by Arnold W. M. Smeulders, Marcel Worring, Simone Santini, Amarnath Gupta, Ramesh Jain - IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE , 2000
"... The paper presents a review of 200 references in content-based image retrieval. The paper starts with discussing the working conditions of content-based retrieval: patterns of use, types of pictures, the role of semantics, and the sensory gap. Subsequent sections discuss computational steps for imag ..."
Abstract - Cited by 1618 (24 self) - Add to MetaCart
for image retrieval systems. Step one of the review is image processing for retrieval sorted by color, texture, and local geometry. Features for retrieval are discussed next, sorted by: accumulative and global features, salient points, object and shape features, signs, and structural combinations thereof

Comprehending Monads

by Philip Wadler - Mathematical Structures in Computer Science , 1992
"... Category theorists invented monads in the 1960's to concisely express certain aspects of universal algebra. Functional programmers invented list comprehensions in the 1970's to concisely express certain programs involving lists. This paper shows how list comprehensions may be generalised t ..."
Abstract - Cited by 521 (18 self) - Add to MetaCart
Category theorists invented monads in the 1960's to concisely express certain aspects of universal algebra. Functional programmers invented list comprehensions in the 1970's to concisely express certain programs involving lists. This paper shows how list comprehensions may be generalised

The Laplacian Pyramid as a Compact Image Code

by Peter J. Burt , Edward H. Adelson , 1983
"... We describe a technique for image encoding in which local operators of many scales but identical shape serve as the basis functions. The representation differs from established techniques in that the code elements are localized in spatial frequency as well as in space. Pixel-to-pixel correlations a ..."
Abstract - Cited by 1388 (12 self) - Add to MetaCart
, the code tends to enhance salient image features. A further advantage of the present code is that it is well suited for many image analysis tasks as well as for image compression. Fast algorithms are described for coding and decoding. A

Comparison of Multiobjective Evolutionary Algorithms: Empirical Results

by Eckart Zitzler, Lothar Thiele, Kalyanmoy Deb , 2000
"... In this paper, we provide a systematic comparison of various evolutionary approaches to multiobjective optimization using six carefully chosen test functions. Each test function involves a particular feature that is known to cause difficulty in the evolutionary optimization process, mainly in conver ..."
Abstract - Cited by 628 (41 self) - Add to MetaCart
in converging to the Pareto-optimal front (e.g., multimodality and deception). By investigating these different problem features separately, it is possible to predict the kind of problems to which a certain technique is or is not well suited. However, in contrast to what was suspected beforehand

Robust face recognition via sparse representation

by John Wright, Allen Y. Yang, Arvind Ganesh, S. Shankar Sastry, Yi Ma - IEEE TRANS. PATTERN ANALYSIS AND MACHINE INTELLIGENCE , 2008
"... We consider the problem of automatically recognizing human faces from frontal views with varying expression and illumination, as well as occlusion and disguise. We cast the recognition problem as one of classifying among multiple linear regression models, and argue that new theory from sparse signa ..."
Abstract - Cited by 936 (40 self) - Add to MetaCart
is correctly computed. Unconventional features such as downsampled images and random projections perform just as well as conventional features such as Eigenfaces and Laplacianfaces, as long as the dimension of the feature space surpasses certain threshold, predicted by the theory of sparse representation
Results 1 - 10 of 18,112