Motion compensation for block-based lossless video coding using lattice-based binning

A block-based lossless video coding scheme using the notion of binning has been proposed in. To further improve the compression and reduce the complexity, in this paper we investigate the impact of two sub-optimal motion search algorithms on the performance of this lattice-based scheme. While one of the algorithm tries avoiding motion vectors, the other tries to reduce complexity. Our experimental results have demonstrated that the loss due to sub-optimal motion search outweighs the gain when motion vectors are avoided. However, experimental results have shown that there is negligible performance loss when low-complexity sub-optimal three step search is used.