Now showing items 673-692 of 2626

    • The Early Detection of Motion Boundaries 

      Spoerri, Anselm (1990-05-01)
      This thesis shows how to detect boundaries on the basis of motion information alone. The detection is performed in two stages: (i) the local estimation of motion discontinuities and of the visual flowsfield; (ii) the ...
    • Early Processing of Visual Information 

      Marr, D. (1975-12-01)
      The article describes a symbolic approach to visual information processing, and sets out four principles that appear to govern the design of complex symbolic information processing systems. A computational theory of ...
    • Early Sketch Processing with Application in HMM Based Sketch Recognition 

      Sezgin, Tevfik Metin; Davis, Randall (2004-07-28)
      Freehand sketching is a natural and crucial part of everyday humaninteraction, yet is almost totally unsupported by current user interfaces. With the increasing availability of tablet notebooks and pen based PDAs, sketchbased ...
    • Eclat: Automatic Generation and Classification of Test Inputs 

      Pacheo, Carlos; Ernst, Michael D. (2004-10-14)
      This paper describes a technique that helps a test engineerselect, from a large set of randomly generated testinputs, a small subset likely to reveal faults in the softwareunder test. The technique takes a program or ...
    • Edge and Mean Based Image Compression 

      Desai, Ujjaval Y.; Mizuki, Marcelo M.; Masaki, Ichiro; Horn, Berthold K.P. (1996-11-01)
      In this paper, we present a static image compression algorithm for very low bit rate applications. The algorithm reduces spatial redundancy present in images by extracting and encoding edge and mean information. Since ...
    • Edge Detection 

      Hildreth, Ellen C. (1985-09-01)
      The goal of vision is to recover physical properties of objects in a scene, such as the location of object boundaries and the structure, color, and texture of object surfaces, from the two-dimensional image that is ...
    • The Effect of Indexing on the Complexity of Object Recognition 

      Grimson, W. Eric L. (1990-04-01)
      Many current recognition systems use constrained search to locate objects in cluttered environments. Previous formal analysis has shown that the expected amount of search is quadratic in the number of model and data features, ...
    • The Effect of Transmission Design on Force-Controlled Manipulator Performance 

      Townsend, William T. (William Thomas) (1988-04-01)
      Previous research in force control has focused on the choice of appropriate servo implementation without corresponding regard to the choice of mechanical hardware. This report analyzes the effect of mechanical properties ...
    • Efficiency of Equivalence Algorithms 

      Fischer, Michael J. (1972-04-01)
      This paper was first presented at the Symposium on Complexity of Computer Computations, IBM Thomas J. Watson Research Center, Yorktown Heights, New York, on March 22, 1972. The equivalence problem is to determine the ...
    • Efficient Cache Coherence on Manycore Optical Networks 

      Psota, James; Agarwal, Anant; Miller, Jason; Beckmann, Nathan; Kurian, George (2010-02-11)
      Ever since industry has turned to parallelism instead of frequency scaling to improve processor performance, multicore processors have continued to scale to larger and larger numbers of cores. Some believe that multicores ...
    • An Efficient Correspondence Based Algorithm for 2D and 3D Model Based Recognition 

      Breuel, Thomas M. (1990-10-01)
      A polynomial time algorithm (pruned correspondence search, PCS) with good average case performance for solving a wide class of geometric maximal matching problems, including the problem of recognizing 3D objects from ...
    • An Efficient Fill Estimation Algorithm for Sparse Matrices and Tensors in Blocked Formats 

      Ahrens, Peter; Schiefer, Nicholas; Xu, Helen (2017-06-09)
      Tensors, linear-algebraic extensions of matrices in arbitrary dimensions, have numerous applications in computer science and computational science. Many tensors are sparse, containing more than 90% zero entries. Efficient ...
    • Efficient Image Matching with Distributions of Local Invariant Features 

      Grauman, Kristen; Darrell, Trevor (2004-11-22)
      Sets of local features that are invariant to common image transformations are an effective representation to use when comparing images; current methods typically judge feature sets' similarity via a voting scheme (which ...
    • An Efficient Learning Procedure for Deep Boltzmann Machines 

      Salakhutdinov, Ruslan; Hinton, Geoffrey (2010-08-04)
      We present a new learning algorithm for Boltzmann Machines that contain many layers of hidden variables. Data-dependent statistics are estimated using a variational approximation that tends to focus on a single mode, and ...
    • Efficient Marginal Likelihood Optimization in Blind Deconvolution 

      Levin, Anat; Weiss, Yair; Durand, Fredo; Freeman, William T. (2011-04-04)
      In blind deconvolution one aims to estimate from an input blurred image y a sharp image x and an unknown blur kernel k. Recent research shows that a key to success is to consider the overall shape of the posterior distribution ...
    • Efficient Motion Planning Algorithm for Stochastic Dynamic Systems with Constraints on Probability of Failure 

      Ono, Masahiro; Williams, Brian C. (2008-03-06)
      When controlling dynamic systems such as mobile robots in uncertain environments, there is a trade off between risk and reward. For example, a race car can turn a corner faster by taking a more challenging path. This paper ...
    • Efficient Object Recognition and Image Retrieval for Large-Scale Applications 

      Lee, John J. (2008-05-06)
      Algorithms for recognition and retrieval tasks generally call for both speed and accuracy. When scaling up to very large applications, however, we encounter additional significant requirements: adaptability and scalability. ...
    • Efficient POMDP Forward Search by Predicting the Posterior Belief Distribution 

      Roy, Nicholas; He, Ruijie (2009-09-23)
      Online, forward-search techniques have demonstrated promising results for solving problems in partially observable environments. These techniques depend on the ability to efficiently search and evaluate the set of beliefs ...
    • Efficient Specification-Assisted Error Localization and Correction 

      Demsky, Brian; Cadar, Cristian; Roy, Daniel; Rinard, Martin (2003-11-13)
      We present a new error localization tool, Archie, that accepts aspecification of key data structure consistency constraints, then generatesan algorithm that checks if the data structures satisfy theconstraints. We also ...
    • Efficient, Verifiable Binary Sandboxing for a CISC Architecture 

      McCamant, Stephen; Morrisett, Greg (2005-05-02)
      Executing untrusted code while preserving security requiresenforcement of memory and control-flow safety policies:untrusted code must be prevented from modifying memory orexecuting code except as explicitly allowed. ...