Zobrazují se záznamy 106-110 z 110

    • WaldBoost – Learning for Time Constrained Sequential Detection 

      Autor: Šochman, Jan; Matas, Jiří
      (IEEE, 2005-06)
      In many computer vision classification problems, both the error and time characterizes the quality of a decision. We show that such problems can be formalized in the framework of sequential decision-making. If the false ...
    • Wald’s Sequential Analysis for Time-constrained Vision Problems 

      Autor: Matas, Jiří; Šochman, Jan
      (IEEE, 2007-04)
      In detection and matching problems in computer vision, both classification errors and time to decision characterize the quality of an algorithmic solution. We show how to formalize such problems in the framework of sequential ...
    • Wearable face recognition aid 

      Autor: Iordanoglou, C.; Jonsson, K.; Kittler, J.; Matas, J.
      (IEEE, 2000)
      The feasibility of realising a low cost wearable face recognition aid based on a robust correlation algorithm is investigated. The aim of the study is to determine the limiting spatial and grey level resolution of the probe ...
    • What Is Decreased by the Max-sum Arc Consistency Algorithm? 

      Autor: Werner, Tomáš
      (ACM, 2007)
      Inference tasks in Markov random fields (MRFs) are closely related to the constraint satisfaction problem (CSP) and its soft generalizations. In particular, MAP inference in MRF is equivalent to the weighted (maxsum) CSP. ...
    • Zero-Temperature Limit of a Convergent Algorithm to Minimize the Bethe Free Energy 

      Autor: Werner, Tomáš
      (Center for Machine Perception, Department of Cybernetics, Faculty of Electrical Engineering, Czech Technical University, 2011-12)
      After the discovery that xed points of loopy belief propagation coincide with stationary points of the Bethe free energy, several researchers proposed provably convergent algorithms to directly minimize the Bethe free ...