?? spiht2.h
字號:
#define NULL 0
#include "stdlib.h"
#include "iostream.h"
struct WLT_NODE
{
short i;
short j;
WLT_NODE* next;
};
int SnD(short** a,int i,int j,short height,short width)
{
int s=0;
int l=1;
while(((i<<l)<height)&&((j<<l)<width))
{
for(int k=(i<<l);k<(i<<l)+(1<<l);k++)
{
for(int m=(j<<l);m<(j<<l)+(1<<l);m++)
{
if(a[k][m]){s=1;break;}
}
if(s)break;
}
l++;
}
return s;
}
int SnT(short** a,int i,int j,short height,short width)
{
int s=0;
int l=0;
while(((i<<l)<height)&&((j<<l)<width))
{
for(int k=(i<<l);k<(i<<l)+(1<<l);k++)
{
for(int m=(j<<l);m<(j<<l)+(1<<l);m++)
{
if(a[k][m]){s=1;break;}
}
if(s)break;
}
l++;
}
return s;
}
int SnL(short** a,int i,int j,short height,short width)
{
int s=0;
int l=2;
while(((i<<l)<height)&&((j<<l)<width))
{
for(int k=(i<<l);k<(i<<l)+(1<<l);k++)
{
for(int m=(j<<l);m<(j<<l)+(1<<l);m++)
{
if(a[k][m]){s=1;break;}
}
if(s)break;
}
l++;
}
return s;
}
int SnO(short** a,int i,int j,short height,short width)
{
if(a[i][j])return 1;
else return 0;
}
int IsLEmpty(short** a,int i,int j,short height,short width)
{
return ((i<<2)>=height)||((j<<2)>=width);
}
int IsTreeEmpty(short** a,int i,int j,short height,short width)
{
return ((i>=height)||(j>=width));
}
void SPIHT_encoder(short** b,short height,short width,short scale,char* c0,long* len,short TN)
{
WLT_NODE *lis;
WLT_NODE *lis_nail;
WLT_NODE* lish;
short* c=new short [height*width*20];
long kc=0;
short ht=(height>>scale);
short wh=(width>>scale);
short** a=new short* [height];
for(short k=0;k<height;k++)
{
a[k]=new short [width];
}
///////////////////////////////////////////////init
while(TN>=0)
{
lis=new WLT_NODE;
lis->next=NULL;
lis_nail=lis;
lish=lis;
for(short m=0;m<height;m++)
for(short n=0;n<width;n++)
{
if(b[m][n]>=0)a[m][n]=(abs(b[m][n])>>TN)&0x01;
else a[m][n]=-((abs(b[m][n])>>TN)&0x01);
}
for(int l=0;l<3;l++)
{
for(int i=0;i<ht;i++)
for(int j=0;j<wh;j++)
{
if(l==0)
{
WLT_NODE* nd=new WLT_NODE;
nd->i=i;
nd->j=wh+j;
nd->next=NULL;
lis_nail->next=nd;
lis_nail=lis_nail->next;
}
else if(l==1)
{
WLT_NODE* nd=new WLT_NODE;
nd->i=ht+i;
nd->j=j;
nd->next=NULL;
lis_nail->next=nd;
lis_nail=lis_nail->next;
}
else
{
WLT_NODE* nd=new WLT_NODE;
nd->i=ht+i;
nd->j=wh+j;
nd->next=NULL;
lis_nail->next=nd;
lis_nail=lis_nail->next;
}
}
}
//////////////////////////////////1
for(int i=0;i<2*ht;i++)
{
for(int j=0;j<2*wh;j++)
{
short ca=a[i][j];
c[kc]=abs(ca);
kc++;
if(ca)
{
if(ca==-1)c[kc]=1;
else c[kc]=0;
kc++;
}
}
}
//////////////////////////////////2
lis=lis->next;
while(lis)
{
int SD=SnD(a,lis->i,lis->j,height,width);
c[kc]=SD;
kc++;
if(SD)
{
////////////////////////////1
int SO=SnO(a,lis->i*2,lis->j*2,height,width);
c[kc]=SO;
kc++;
if(SO)
{
if(a[lis->i*2][lis->j*2]<0)c[kc]=1;
else c[kc]=0;
kc++;
}
SO=SnO(a,lis->i*2,1+lis->j*2,height,width);
c[kc]=SO;
kc++;
if(SO)
{
if(a[lis->i*2][1+lis->j*2]<0)c[kc]=1;
else c[kc]=0;
kc++;
}
SO=SnO(a,1+lis->i*2,lis->j*2,height,width);
c[kc]=SO;
kc++;
if(SO)
{
if(a[1+lis->i*2][lis->j*2]<0)c[kc]=1;
else c[kc]=0;
kc++;
}
SO=SnO(a,1+lis->i*2,1+lis->j*2,height,width);
c[kc]=SO;
kc++;
if(SO)
{
if(a[1+lis->i*2][1+lis->j*2]<0)c[kc]=1;
else c[kc]=0;
kc++;
}
////////////////////////////////
if(IsLEmpty(a,lis->i,lis->j,height,width)==0)
{
int SL=SnL(a,lis->i,lis->j,height,width);
c[kc]=SL;
kc++;
if(SL)
{
lis_nail->next=new WLT_NODE;
lis_nail->next->i=lis->i*2;
lis_nail->next->j=lis->j*2;
lis_nail->next->next=NULL;
lis_nail=lis_nail->next;
lis_nail->next=new WLT_NODE;
lis_nail->next->i=lis->i*2;
lis_nail->next->j=1+lis->j*2;
lis_nail->next->next=NULL;
lis_nail=lis_nail->next;
lis_nail->next=new WLT_NODE;
lis_nail->next->i=1+lis->i*2;
lis_nail->next->j=lis->j*2;
lis_nail->next->next=NULL;
lis_nail=lis_nail->next;
lis_nail->next=new WLT_NODE;
lis_nail->next->i=1+lis->i*2;
lis_nail->next->j=1+lis->j*2;
lis_nail->next->next=NULL;
lis_nail=lis_nail->next;
}
}
}
lis=lis->next;
}
*len=kc;
while(lish)
{
WLT_NODE* p=lish;
lish=lish->next;
delete p;
}
TN--;
}
for(k=0;k<height;k++)
{
delete a[k];
}
for(long lc=0;lc<kc;lc++)
{
long ki=lc>>3;
short kr=lc%8;
c0[ki]=c0[ki]+(c[lc]<<kr);
}
delete a;
delete c;
}
void SPIHT_decoder(short** a,short height,short width,short scale,char* c0,long len,short TN)
{
WLT_NODE *lis;
WLT_NODE *lis_nail;
WLT_NODE* lish;
short* c=new short [len];
for(long lc=0;lc<len;lc++)
{
long ki=lc>>3;
short kr=lc%8;
c[lc]=(c0[ki]>>kr)&1;
}
long kc=0;
short ht=(height>>scale);
short wh=(width>>scale);
for(int m=0;m<height;m++)
for(int n=0;n<width;n++)
{
a[m][n]=0;
}
///////////////////////////////////////////////init
while(TN>=0)
{
lis=new WLT_NODE;
lis->next=NULL;
lis_nail=lis;
lish=lis;
for(int l=0;l<3;l++)
{
for(int i=0;i<ht;i++)
for(int j=0;j<wh;j++)
{
if(l==0)
{
WLT_NODE* nd=new WLT_NODE;
nd->i=i;
nd->j=wh+j;
nd->next=NULL;
lis_nail->next=nd;
lis_nail=lis_nail->next;
}
else if(l==1)
{
WLT_NODE* nd=new WLT_NODE;
nd->i=ht+i;
nd->j=j;
nd->next=NULL;
lis_nail->next=nd;
lis_nail=lis_nail->next;
}
else
{
WLT_NODE* nd=new WLT_NODE;
nd->i=ht+i;
nd->j=wh+j;
nd->next=NULL;
lis_nail->next=nd;
lis_nail=lis_nail->next;
}
}
}
//////////////////////////////////1
for(int i=0;i<2*ht;i++)
{
for(int j=0;j<2*wh;j++)
{
short ca=c[kc];
kc++;
if(kc>=len)break;
if(ca)
{
if(c[kc])a[i][j]-=(1<<TN);
else a[i][j]+=(1<<TN);
kc++;
if(kc>=len)break;
}
}
if(kc>=len)break;
}
//////////////////////////////////2
lis=lis->next;
while(lis)
{
short SnD=c[kc];
kc++;
if(kc>=len)break;
if(SnD)
{
////////////////////////////1
short SnO=c[kc];
kc++;
if(kc>=len)break;
if(SnO)
{
if(c[kc]==1)a[lis->i*2][lis->j*2]-=(1<<TN);
else a[lis->i*2][lis->j*2]+=(1<<TN);
kc++;
}
SnO=c[kc];
kc++;
if(kc>=len)break;
if(SnO)
{
if(c[kc]==1)a[lis->i*2][1+lis->j*2]-=(1<<TN);
else a[lis->i*2][1+lis->j*2]+=(1<<TN);
kc++;
if(kc>=len)break;
}
SnO=c[kc];
kc++;
if(kc>=len)break;
if(SnO)
{
if(c[kc]==1)a[1+lis->i*2][lis->j*2]-=(1<<TN);
else a[1+lis->i*2][lis->j*2]+=(1<<TN);
kc++;
if(kc>=len)break;
}
SnO=c[kc];
kc++;
if(kc>=len)break;
if(SnO)
{
if(c[kc]==1)a[1+lis->i*2][1+lis->j*2]-=(1<<TN);
else a[1+lis->i*2][1+lis->j*2]+=(1<<TN);
kc++;
if(kc>=len)break;
}
////////////////////////////////
if(IsLEmpty(a,lis->i,lis->j,height,width)==0)
{
short SnL=c[kc];
kc++;
if(kc>=len)break;
if(SnL)
{
lis_nail->next=new WLT_NODE;
lis_nail->next->i=lis->i*2;
lis_nail->next->j=lis->j*2;
lis_nail->next->next=NULL;
lis_nail=lis_nail->next;
lis_nail->next=new WLT_NODE;
lis_nail->next->i=lis->i*2;
lis_nail->next->j=1+lis->j*2;
lis_nail->next->next=NULL;
lis_nail=lis_nail->next;
lis_nail->next=new WLT_NODE;
lis_nail->next->i=1+lis->i*2;
lis_nail->next->j=lis->j*2;
lis_nail->next->next=NULL;
lis_nail=lis_nail->next;
lis_nail->next=new WLT_NODE;
lis_nail->next->i=1+lis->i*2;
lis_nail->next->j=1+lis->j*2;
lis_nail->next->next=NULL;
lis_nail=lis_nail->next;
}
}
}
lis=lis->next;
}
while(lish)
{
WLT_NODE* p=lish;
lish=lish->next;
delete p;
}
TN--;
if(kc>=len)break;
}
delete c;
}
void EZW_encoder(short** b,short height,short width,short scale,char* c0,long* len,short TN)
{
WLT_NODE *lis;
WLT_NODE *lis_nail;
WLT_NODE* lish;
short* c=new short [height*width*25];
long kc=0;
short ht=(height>>scale);
short wh=(width>>scale);
short** a=new short* [height];
for(short k=0;k<height;k++)
{
a[k]=new short [width];
}
///////////////////////////////////////////////init
while(TN>=0)
{
lis=new WLT_NODE;
lis->next=NULL;
lis_nail=lis;
lish=lis;
for(short m=0;m<height;m++)
for(short n=0;n<width;n++)
{
if(b[m][n]>=0)a[m][n]=(abs(b[m][n])>>TN)&0x01;
else a[m][n]=-((abs(b[m][n])>>TN)&0x01);
}
for(int mh=0;mh<ht;mh++)
{
for(int nw=0;nw<wh;nw++)
{
short ca=a[mh][nw];
c[kc]=abs(ca);
kc++;
if(ca)
{
if(ca==-1)c[kc]=1;
else c[kc]=0;
kc++;
}
}
}
for(int l=0;l<3;l++)
{
for(int i=0;i<ht;i++)
for(int j=0;j<wh;j++)
{
if(l==0)
{
WLT_NODE* nd=new WLT_NODE;
nd->i=i;
nd->j=wh+j;
nd->next=NULL;
lis_nail->next=nd;
lis_nail=lis_nail->next;
}
else if(l==1)
{
WLT_NODE* nd=new WLT_NODE;
nd->i=ht+i;
nd->j=j;
nd->next=NULL;
lis_nail->next=nd;
lis_nail=lis_nail->next;
}
else
{
WLT_NODE* nd=new WLT_NODE;
nd->i=ht+i;
nd->j=wh+j;
nd->next=NULL;
lis_nail->next=nd;
lis_nail=lis_nail->next;
}
}
}
//////////////////////////////////1
//////////////////////////////////2
lis=lis->next;
while(lis)
{
int ST=SnT(a,lis->i,lis->j,height,width);
c[kc]=ST;
kc++;
if(ST)
{
////////////////////////////1
int SO=SnO(a,lis->i,lis->j,height,width);
c[kc]=SO;
kc++;
if(SO)
{
if(a[lis->i][lis->j]<0)c[kc]=1;
else c[kc]=0;
kc++;
}
////////////////////////////////
if(IsTreeEmpty(a,lis->i*2,lis->j*2,height,width)==0)
{
lis_nail->next=new WLT_NODE;
lis_nail->next->i=lis->i*2;
lis_nail->next->j=lis->j*2;
lis_nail->next->next=NULL;
lis_nail=lis_nail->next;
lis_nail->next=new WLT_NODE;
lis_nail->next->i=lis->i*2;
lis_nail->next->j=1+lis->j*2;
lis_nail->next->next=NULL;
lis_nail=lis_nail->next;
lis_nail->next=new WLT_NODE;
lis_nail->next->i=1+lis->i*2;
lis_nail->next->j=lis->j*2;
lis_nail->next->next=NULL;
lis_nail=lis_nail->next;
lis_nail->next=new WLT_NODE;
lis_nail->next->i=1+lis->i*2;
lis_nail->next->j=1+lis->j*2;
lis_nail->next->next=NULL;
lis_nail=lis_nail->next;
}
}
lis=lis->next;
}
*len=kc;
while(lish)
{
WLT_NODE* p=lish;
lish=lish->next;
delete p;
}
TN--;
}
for(k=0;k<height;k++)
{
delete a[k];
}
for(long lc=0;lc<kc;lc++)
{
long ki=lc>>3;
short kr=lc%8;
c0[ki]=c0[ki]+(c[lc]<<kr);
}
delete a;
delete c;
}
void EZW_decoder(short** a,short height,short width,short scale,char* c0,long len,short TN)
{
WLT_NODE *lis;
WLT_NODE *lis_nail;
WLT_NODE* lish;
short* c=new short [len];
for(long lc=0;lc<len;lc++)
{
long ki=lc>>3;
short kr=lc%8;
c[lc]=(c0[ki]>>kr)&1;
}
long kc=0;
short ht=(height>>scale);
short wh=(width>>scale);
for(int m=0;m<height;m++)
for(int n=0;n<width;n++)
{
a[m][n]=0;
}
///////////////////////////////////////////////init
while(TN>=0)
{
lis=new WLT_NODE;
lis->next=NULL;
lis_nail=lis;
lish=lis;
for(int mh=0;mh<ht;mh++)
{
for(int nw=0;nw<wh;nw++)
{
short ca=c[kc];
kc++;
if(kc>=len)break;
if(ca)
{
if(c[kc])a[mh][nw]-=(1<<TN);
else a[mh][nw]+=(1<<TN);
kc++;
if(kc>=len)break;
}
}
if(kc>=len)break;
}
for(int l=0;l<3;l++)
{
for(int i=0;i<ht;i++)
for(int j=0;j<wh;j++)
{
if(l==0)
{
WLT_NODE* nd=new WLT_NODE;
nd->i=i;
nd->j=wh+j;
nd->next=NULL;
lis_nail->next=nd;
lis_nail=lis_nail->next;
}
else if(l==1)
{
WLT_NODE* nd=new WLT_NODE;
nd->i=ht+i;
nd->j=j;
nd->next=NULL;
lis_nail->next=nd;
lis_nail=lis_nail->next;
}
else
{
WLT_NODE* nd=new WLT_NODE;
nd->i=ht+i;
nd->j=wh+j;
nd->next=NULL;
lis_nail->next=nd;
lis_nail=lis_nail->next;
}
}
}
//////////////////////////////////1
//////////////////////////////////2
lis=lis->next;
while(lis)
{
short ST=c[kc];
kc++;
if(kc>=len)break;
if(ST)
{
////////////////////////////1
short SnO=c[kc];
kc++;
if(kc>=len)break;
if(SnO)
{
if(c[kc]==1)a[lis->i][lis->j]-=(1<<TN);
else a[lis->i][lis->j]+=(1<<TN);
kc++;
}
////////////////////////////////
if(IsTreeEmpty(a,2*lis->i,2*lis->j,height,width)==0)
{
lis_nail->next=new WLT_NODE;
lis_nail->next->i=lis->i*2;
lis_nail->next->j=lis->j*2;
lis_nail->next->next=NULL;
lis_nail=lis_nail->next;
lis_nail->next=new WLT_NODE;
lis_nail->next->i=lis->i*2;
lis_nail->next->j=1+lis->j*2;
lis_nail->next->next=NULL;
lis_nail=lis_nail->next;
lis_nail->next=new WLT_NODE;
lis_nail->next->i=1+lis->i*2;
lis_nail->next->j=lis->j*2;
lis_nail->next->next=NULL;
lis_nail=lis_nail->next;
lis_nail->next=new WLT_NODE;
lis_nail->next->i=1+lis->i*2;
lis_nail->next->j=1+lis->j*2;
lis_nail->next->next=NULL;
lis_nail=lis_nail->next;
}
}
lis=lis->next;
}
while(lish)
{
WLT_NODE* p=lish;
lish=lish->next;
delete p;
}
TN--;
if(kc>=len)break;
}
delete c;
}?? 快捷鍵說明
復制代碼
Ctrl + C
搜索代碼
Ctrl + F
全屏模式
F11
切換主題
Ctrl + Shift + D
顯示快捷鍵
?
增大字號
Ctrl + =
減小字號
Ctrl + -