Meitei Coding for Subband Image Compression
Yumnam Kirani Singh
SRF, CVPR Unit
Indian Statistical Institute
203-B. T. Road
Kolkata-108, India
Phone: 033-2578-1832
Email:
kiranisingh@hotmail.com

Figure-1: 2-Dimensional Meitei Tree (2-MT)

Figure-2: Spatial 2-MT
Number of Levels:
![]()
Node Identification:
Middle Node
, Left Node ![]()
Right Node
, Where
.
Number of pixels associated with a node:
for any level ![]()
2-MT Generation
For level-1,
![]()
For any ![]()
![]()
![]()
![]()
where
and
a submatrix of the matrix
having rows
to
and columns
to
.
And for ![]()
; ![]()
![]()
where
.
Algorithm for generation of LIS of type-0
Let
be the image matrix of size
, to be coded.
Find
; LIS=[ ];
For j=2 to L
;
If j < L

Append T to LIS
Else

Append T to LIS
End if.
End for.

Spatial 2-MT of an Image (15×18)

Typical Spatial Tree in SPIHT (16×16)

Spatial 2-MT of an Image (17×18)