Abstract. We consider the problem of representing, in a compressed format, a bitvector S of m bits with n 1s, supporting the following operations, where b ∈ {0, 1}:
Roberto Grossi, Alessio Orlandi, Rajeev Raman, S. ...
This paper proposes a new spatial scalable and low-complexity videocompressionalgorithmbasedonmultiplicationfreethree-dimensional discrete pseudo-cosine transform (3-D DPCT). Pract...
Interactive navigation in image-based scenes requires random access to the compressed reference image data. When using state of the art block-based hybrid video coding techniques,...
A multiplier-less low complexity reversible integer Karhunen-Lo?ve transform (Low-RKLT) is proposed based on multi-lifting. Conventional methods based on KLT suffer from high comp...
— An image sensor with focal plane based hardware acceleration of video compression is presented. The 90×90 pixel CMOS image sensor provides in-pixel processing of intensity cha...
Yu M. Chi, Ralph Etienne-Cummings, Gert Cauwenberg...