Computer Vision Systems

Volume 5815 of the series Lecture Notes in Computer Science pp 295-304

White-Box Evaluation of Computer Vision Algorithms through Explicit Decision-Making

  • Richard ZanibbiAffiliated withDept. Computer Science, Rochester Institute of Technology
  • , Dorothea BlosteinAffiliated withSchool of Computing, Queen’s University, Kingston
  • , James R. CordyAffiliated withSchool of Computing, Queen’s University, Kingston

* Final gross prices may vary according to local VAT.

Get Access


Traditionally computer vision and pattern recognition algorithms are evaluated by measuring differences between final interpretations and ground truth. These black-box evaluations ignore intermediate results, making it difficult to use intermediate results in diagnosing errors and optimization. We propose “opening the box,” representing vision algorithms as sequences of decision points where recognition results are selected from a set of alternatives. For this purpose, we present a domain-specific language for pattern recognition tasks, the Recognition Strategy Language (RSL). At run-time, an RSL interpreter records a complete history of decisions made during recognition, as it applies them to a set of interpretations maintained for the algorithm. Decision histories provide a rich new source of information: recognition errors may be traced back to the specific decisions that caused them, and intermediate interpretations may be recovered and displayed. This additional information also permits new evaluation metrics that include false negatives (correct hypotheses that the algorithm generates and later rejects), such as the percentage of ground truth hypotheses generated (historical recall), and the percentage of generated hypotheses that are correct(historical precision). We illustrate the approach through an analysis of cell detection in two published table recognition algorithms.


Performance Evaluation Document Recognition Table Recognition Scripting Languages Domain-Specific Languages