Speeding-up Graphical Model Optimization via a Coarse-to-fine Cascade of Pruning Classifiers

2014/09/15 by Conejo, B., Komodakis, N., Leprince, S. +1
#Computer Vision and Pattern Recognition (cs.CV) #FOS: Computer and information sciences

paper · doi:10.48550/arxiv.1409.4205

Abstract

We propose a general and versatile framework that significantly speeds-up graphical model optimization while maintaining an excellent solution accuracy. The proposed approach relies on a multi-scale pruning scheme that is able to progressively reduce the solution space by use of a novel strategy based on a coarse-to-fine cascade of learnt classifiers. We thoroughly experiment with classic computer vision related MRF problems, where our framework constantly yields a significant time speed-up (with respect to the most efficient inference methods) and obtains a more accurate solution than directly optimizing the MRF.

Related

• Budget-Aware Pruning: Handling Multiple Domains with Less Parameters
• Preserving Deep Representations In One-Shot Pruning: A Hessian-Free Second-Order Optimization Framework
• FGP: Feature-Gradient-Prune for Efficient Convolutional Layer Pruning
• MDP: Multidimensional Vision Model Pruning with Latency Constraint
• OSSCAR: One-Shot Structured Pruning in Vision and Language Models with Combinatorial Optimization