Lookahead search for lossy context-based adaptive entropy coding
We motivate the need for lookahead search in a context-based entropy coder. An efficient algorithm based on modeling of the context coder as a finite state machine is presented. A key contribution of this paper is the use of the per survivor processing (PSP) principle to enable a lookahead search in scenarios where adaptive entropy coding is used. Our results show that lookahead searches based on PSP result in performance improvements over traditional schemes.