Exploiting sparsity for real time video labelling
Until recently, inference on fully connected graphs of pixel labels for scene understanding has been computationally expensive, so fast methods have focussed on neighbour connections and unary computation. However, with efficient CRF methods for inference on fully connected graphs, the opportunity exists for exploring other approaches. In this paper, we present a fast approach that calculates unary labels sparsely and relies on inference on fully connected graphs for label propagation. This...[Show more]
|Collections||ANU Research Publications|
|Source:||Proceedings of the IEEE International Conference on Computer Vision|
|01_Horne_Exploiting_sparsity_for_real_2013.pdf||474.07 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.