Skip to content
conftrace_
2013 CVPR CVPR 2013

Probabilistic Label Trees for Efficient Large Scale Image Classification

Large-scale recognition problems with thousands of classes pose a particular challenge because applying the classifier requires more computation as the number of classes grows. The label tree model integrates classification with the traversal of the tree so that complexity grows logarithmically. In this paper, we show how the parameters of the label tree can be found using maximum likelihood estimation. This new probabilistic learning technique produces a label tree with significantly improved recognition accuracy.

🚀 Conference Pioneer - CVPR 2013
🐣 Hot Topic Early Bird - maximum likelihood estimation

More from CVPR 2013

All CVPR 2013 papers →