Stationary Features and Folded Hierarchies for Efficient Object Detection
Description
Most discriminative techniques for detecting instances from object categories in still images consist of looping over a partition of a pose space with dedicated binary classifiers. This strategy is inefficient for a complex pose, i.e., for fine-grained descriptions: i) fragmenting the training data, which is inevitable in dealing with high in-class variation, severely reduces accuracy; ii) the computational cost at high pose resolution is prohibitive due to visiting a massive pose partition.
To overcome data-fragmentation I will discuss a novel framework centered on pose-indexed, stationary features, which allows for efficient, one-shot learning of pose-specific classifiers. Such features assign a response to a pair consisting of an image and a pose, and are designed so that the probability distribution of the response is constant if an object is actually present. To avoid expensive scene processing, the classifiers are arranged in a hierarchy based on nested partitions of the pose, which allows for efficient search. The hierarchy is then "folded" for training: all the classifiers at each level are derived from one base predictor learned from all the data. The hierarchy is "unfolded" for testing: parsing a scene amounts to examining increasingly finer object descriptions only when there is sufficient evidence for coarser ones. I will illustrate these ideas by detecting and localizing cats in highly cluttered greyscale scenes. This is joint work with Francois Fleuret.
| Slides | |
| 0:00 | STATIONARY FEATURES AND FOLDED HIERARCHIES FOR EFFICIENT CAT DETECTION |
| 3:35 | - DETECTION |
| 4:22 | - DETECTION (CONT.) |
| 6:18 | HIERARCHY OF CLASSIFIERS - 1 |
| 8:59 | HIERARCHY OF CLASSIFIERS - 2 |
| 9:47 | - RELATED WORK - 1 |
| 9:47 | - RELATED WORK - 2 |
| 10:06 | - POSE SPACE - 1 |
| 10:08 | - POSE SPACE - 2 |
| 10:52 | - POSE SPACE - 3 |
| 10:58 | - POSE SPACE - 4 |
| 11:21 | - POSE SPACE - 5 |
| 11:24 | - POSE SPACE (CONT.) - 1 |
| 11:38 | - POSE SPACE (CONT.) - 2 |
| 12:18 | - POSE SPACE (CONT.) - 3 |
| 12:48 | - FRAGMENTATION - 1 |
| 13:12 | - FRAGMENTATION - 2 |
| 13:27 | - FRAGMENTATION - 3 |
| 13:48 | - AGGREGATION - 1 |
| 14:04 | - FRAGMENTATION - 4 |
| 14:25 | - AGGREGATION - 1 |
| 14:26 | - AGGREGATION - 2 |
| 14:44 | - AGGREGATION - 2 |
| 14:48 | - AGGREGATION - 3 |
| 15:32 | - AGGREGATION - 4 |
| 15:34 | - AGGREGATION (CONT.) - 1 |
| 16:02 | - AGGREGATION (CONT.) - 2 |
| 16:25 | - AGGREGATION (CONT.) - 3 |
| 16:26 | - AGGREGATION (CONT.) - 4 |
| 16:46 | - AGGREGATION (CONT.) - 5 |
| 16:59 | - AGGREGATION (CONT.) - 6 |
| 17:19 | - AGGREGATION (CONT.) - 7 |
| 17:25 | - INTRODUCTION - 1 |
| 17:42 | - INTRODUCTION - 2 |
| 18:07 | - DEFINITION - 1 |
| 18:32 | - DEFINITION - 2 |
| 19:32 | - TOY EXAMPLE, 1D SIGNAL - 1 |
| 19:35 | - DEFINITION - 2 |
| 19:58 | - DEFINITION (CONT.) |
| 20:12 | - TOY EXAMPLE, 1D SIGNAL - 1 |
| 20:22 | - TOY EXAMPLE, 1D SIGNAL - 2 |
| 20:38 | - TOY EXAMPLE, 1D SIGNAL - 3 |
| 20:46 | - TOY EXAMPLE, 1D SIGNAL - 4 |
| 21:07 | - TOY EXAMPLE, 1D SIGNAL - 5 |
| 21:22 | - TRAINING - 1 |
| 21:25 | - TRAINING - 2 |
| 22:01 | - TRAINING - 3 |
| 22:31 | - EDGE DETECTORS - 1 |
| 22:36 | - EDGE DETECTORS - 2 |
| 23:37 | - EDGE DETECTORS (CONT.) - 1 |
| 23:41 | - EDGE DETECTORS (CONT.) - 2 |
| 23:44 | - EDGE DETECTORS (CONT.) - 3 |
| 23:46 | - BASE FEATURES - 1 |
| 23:59 | - BASE FEATURES - 2 |
| 24:17 | - BASE FEATURES - 3 |
| 24:36 | - BASE FEATURES - 4 |
| 25:14 | - STATIONARY FEATURES - 1 |
| 25:18 | - STATIONARY FEATURES - 2 |
| 25:38 | - STATIONARY FEATURES - 3 |
| 26:16 | - CLASSIFIER - 1 |
| 26:23 | - CLASSIFIER - 2 |
| 26:23 | - CLASSIFIER - 3 |
| 26:24 | - CLASSIFIER - 4 |
| 26:37 | - SUMMARY - 1 |
| 27:00 | - SUMMARY - 2 |
| 27:25 | - SUMMARY - 3 |
| 27:55 | - SUMMARY - 4 |
| 27:57 | - SUMMARY - 5 |
| 28:07 | - SUMMARY - 6 |
| 28:33 | - SUMMARY - 7 |
| 28:58 | - SUMMARY (CONT.) |
| 29:42 | - STRATEGY |
| 31:12 | - ERROR CRITERION |
| 31:25 | - STRATEGY - Questions |
| 31:58 | - ERROR CRITERION |
| 32:54 | - ERROR RATES (CONT.) |
| 33:02 | - ERROR RATES |
| 33:50 | - ERROR RATES (CONT.) |
| 34:40 | - RESULTS (PICKED AT RANDOM) |
| 35:20 | - RESULTS (SELECTED FALSE ALARMS) |
| 35:30 | - RESULTS (PICKED AT RANDOM, CONT.) |
| 35:51 | - RESULTS (SELECTED FALSE ALARMS) |
| 36:03 | - SELECTED STATIONARY FEATURES |
| 37:01 | CONCLUSION - 1 |
| 37:04 | CONCLUSION - 2 |
| 37:15 | CONCLUSION - 3 |
| 37:21 | CONCLUSION - 4 |
| 37:22 | CONCLUSION - 5 |
| 37:23 | CONCLUSION - 6 |
| 37:24 | CONCLUSION - 7 |
| 37:31 | CONCLUSION - 8 |
| 37:32 | CONCLUSION - 9 |
| 37:33 | CONCLUSION - 10 |
| 38:05 | - Questions |
Lecture rating
| People found this lecture: | ||
| Worth seeing | ||
| because it is: | ||
| Valuable and informative | ||
| Well presented | ||
| Easily understandable | ||
| Acceptably recorded | ||
| You need to login to cast your vote. | ||
Report a problem or upload files
If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Link this page
Would you like to put a link to this lecture on your homepage?Go ahead! Copy the HTML snippet !




