Computer Science and Artificial Intelligence Lab (CSAIL): Recent submissions

Now showing items 1181-1200 of 2625

  • Sequential Optimal Recovery: A Paradigm for Active Learning 

    Unknown author (1995-05-12)
    In most classical frameworks for learning from examples, it is assumed that examples are randomly drawn and presented to the learner. In this paper, we consider the possibility of a more active learner who is allowed ...

  • Fast Object Recognition in Noisy Images Using Simulated Annealing 

    Unknown author (1995-01-25)
    A fast simulated annealing algorithm is developed for automatic object recognition. The normalized correlation coefficient is used as a measure of the match between a hypothesized object and an image. Templates are ...

  • A Dynamical Systems Model for Language Change 

    Unknown author (1995-12-01)
    Formalizing linguists' intuitions of language change as a dynamical system, we quantify the time course of language change including sudden vs. gradual changes in languages. We apply the computer model to the historical ...

  • Verb Classes and Alternations in Bangla, German, English, and Korean 

    Unknown author (1996-05-06)
    In this report, we investigate the relationship between the semantic and syntactic properties of verbs. Our work is based on the English Verb Classes and Alternations of (Levin, 1993). We explore how these classes are ...

  • The Logical Problem of Language Change 

    Unknown author (1995-12-01)
    This paper considers the problem of language change. Linguists must explain not only how languages are learned but also how and why they have evolved along certain trajectories and not others. While the language ...

  • On Convergence Properties of the EM Algorithm for Gaussian Mixtures 

    Unknown author (1995-04-21)
    "Expectation-Maximization'' (EM) algorithm and gradient-based approaches for maximum likelihood learning of finite Gaussian mixtures. We show that the EM step in parameter space is obtained from the gradient via a ...

  • View-Based Strategies for 3D Object Recognition 

    Unknown author (1995-04-21)
    A persistent issue of debate in the area of 3D object recognition concerns the nature of the experientially acquired object models in the primate visual system. One prominent proposal in this regard has expounded the ...

  • Example Based Learning for View-Based Human Face Detection 

    Unknown author (1995-01-24)
    We present an example-based learning approach for locating vertical frontal views of human faces in complex scenes. The technique models the distribution of human face patterns by means of a few view-based "face'' and ...

  • Active Learning with Statistical Models 

    Unknown author (1995-03-21)
    For many types of learners one can compute the statistically 'optimal' way to select data. We review how these techniques have been used with feedforward neural networks. We then show how the same principles may be ...

  • The Unsupervised Acquisition of a Lexicon from Continuous Speech 

    Unknown author (1996-01-18)
    We present an unsupervised learning algorithm that acquires a natural-language lexicon from raw speech. The algorithm is based on the optimal encoding of symbol sequences in an MDL framework, and uses a hierarchical ...

  • Vector-Based Integration of Local and Long-Range Information in Visual Cortex 

    Unknown author (1996-01-18)
    Integration of inputs by cortical neurons provides the basis for the complex information processing performed in the cerebral cortex. Here, we propose a new analytic framework for understanding integration within ...

  • Fast Learning by Bounding Likelihoods in Sigmoid Type Belief Networks 

    Unknown author (1996-02-09)
    Sigmoid type belief networks, a class of probabilistic neural networks, provide a natural framework for compactly representing probabilistic information in a variety of unsupervised and supervised learning problems. ...

  • Factorial Hidden Markov Models 

    Unknown author (1996-02-09)
    We present a framework for learning in hidden Markov models with distributed state representations. Within this framework, we derive a learning algorithm based on the Expectation--Maximization (EM) procedure for maximum ...

  • Model-Based Matching of Line Drawings by Linear Combinations of Prototypes 

    Unknown author (1996-01-18)
    We describe a technique for finding pixelwise correspondences between two images by using models of objects of the same class to guide the search. The object models are 'learned' from example images (also called ...

  • Neural Networks 

    Unknown author (1996-03-13)
    We present an overview of current research on artificial neural networks, emphasizing a statistical perspective. We view neural networks as parameterized graphs that make probabilistic assumptions about data, and view ...

  • Probabilistic Independence Networks for Hidden Markov Probability Models 

    Unknown author (1996-03-13)
    Graphical techniques for modeling the dependencies of randomvariables have been explored in a variety of different areas includingstatistics, statistical physics, artificial intelligence, speech recognition, image ...

  • Learning Linear, Sparse, Factorial Codes 

    Unknown author (1996-12-01)
    In previous work (Olshausen & Field 1996), an algorithm was described for learning linear sparse codes which, when trained on natural images, produces a set of basis functions that are spatially localized, oriented, ...

  • Model-Based Matching by Linear Combinations of Prototypes 

    Unknown author (1996-12-01)
    We describe a method for modeling object classes (such as faces) using 2D example images and an algorithm for matching a model to a novel image. The object class models are "learned'' from example images that we call ...

  • Image Based Rendering Using Algebraic Techniques 

    Unknown author (1996-11-01)
    This paper presents an image-based rendering system using algebraic relations between different views of an object. The system uses pictures of an object taken from known positions. Given three such images it can ...

  • Model Selection in Summary Evaluation 

    Unknown author (2002-12-01)
    A difficulty in the design of automated text summarization algorithms is in the objective evaluation. Viewing summarization as a tradeoff between length and information content, we introduce a technique based on ...