In this paper various techniques for low bit rate video coding are studied and implemented. The selection of an optimal regularshaped pattern set for very low bit-rate video coding, focusing on moving regions has been the objective of much recent research in order to try and improve bit-rate efficiency. An approach to Variable Size Block Matching is also implemented, based on the binary partitioning of blocks. If a particular block does not allow for accurate motion compensation, then it is split into two using the horizontal or vertical line that achieves the maximum reduction in motion compensation error. This method causes partitioning to occur along motion boundaries, thus substantially reducing blocking artifacts. In addition, small blocks are placed in regions of complex motion, while large blocks cover regions of uniform motion. Also the paper is a review of the block matching algorithms used for motion estimation in video compression. It implements and compares 7 different types of block matching algorithms that range from the very basic Exhaustive Search to the recent fast adaptive algorithms like Adaptive Rood Pattern Search.

No abstract

No abstract

No abstract

SPECK has all the desirable properties of embeddedness, progressive transmission, low computational complexity, low dynamic memory requirements, fast decoding/encoding and provides excellent performance. In this paper SPECK algorithm is discussed and implemented.