Quad-tree partitioned compressed sensing for depth map coding

We consider a variable block size compressed sensing (CS) framework for high efficiency depth map coding. In this context, quad-tree decomposition is performed on a depth image to differentiate irregular uniform and edge areas prior to CS acquisition. To exploit temporal correlation and enhance coding efficiency, such quad-tree based CS acquisition is further extended to inter-frame encoding, where block partitioning is performed independently on the I frame and each of the subsequent residual frames. At the decoder, pixel domain total-variation minimization is performed for high quality depth map reconstruction. Experiments presented herein illustrate and support these developments.