Java Digital Image Process Algorithm

Builder.com.
cn :2007-08-23IT :IT
JAVA
javams
bmp
// nData[]nB[] nG[] nR[]
public void getBMPImage(String source) throws Exception {
clearNData();
FileInputStream fs = null;
//
try {
fs = new FileInputStream(source);
int bfLen = 14;
byte bf[] = new byte[bfLen];
fs.read(bf, 0, bfLen); // 14BMP
int biLen = 40;
byte bi[] = new byte[biLen];
fs.read(bi, 0, biLen); // 40BMP
//
nWidth = (((int) bi[7] & 0xff) << 24)
| (((int) bi[6] & 0xff) << 16)
| (((int) bi[5] & 0xff) << 8) | (int) bi[4] & 0xff;
//
nHeight = (((int) bi[11] & 0xff) << 24)
| (((int) bi[10] & 0xff) << 16)
//
nBitCount = (((int) bi[15] & 0xff) << 8) | (int) bi[14] & 0xff;
//
int nSizeImage = (((int) bi[23] & 0xff) << 24)
| (((int) bi[22] & 0xff) << 16)
24
xff;
// 24BMP
if (nBitCount == 24){
int nPad = (nSizeImage / nHeight) - nWidth * 3;
nData = new int[nHeight * nWidth];
nB=new int[nHeight * nWidth];
nR=new int[nHeight * nWidth];
nG=new int[nHeight * nWidth];
byte bRGB[] = new byte[(nWidth + nPad) * 3 * nHeight];
fs.read(bRGB, 0, (nWidth + nPad) * 3 * nHeight);
int nIndex = 0;
for (int j = 0; j < nHeight; j++){
for (int i = 0; i < nWidth; i++) {
nData[nWidth * (nHeight - j - 1) + i] = (255 & 0xff) <<
| (((int) bRGB[nIndex + 2] & 0xff) << 16)
| (((int) bRGB[nIndex + 1] & 0xff) << 8)
| (int) bRGB[nIndex] & 0xff;
nB[nWidth * (nHeight - j - 1) + i]=(int) bRGB[nIndex]& 0
nG[nWidth * (nHeight - j - 1) + i]=(int) bRGB[nIndex+1]&
0xff;
nR[nWidth * (nHeight - j - 1) + i]=(int) bRGB[nIndex+2]&
0xff;
nIndex += 3;
}
nIndex += nPad;
//
//
//
Toolkit kit = Toolkit.getDefaultToolkit();

image = kit.createImage(new MemoryImageSource(nWidth, nHeight,
nData, 0, nWidth));
/*
//
FileWriter fw = new FileWriter("C:Documents and SettingsAdminist
ratorMy DocumentsnDataRaw.txt");//
PrintWriter out = new PrintWriter(fw);
for(int j=0;j<nHeight;j++){
for(int i=0;i<nWidth;i++){
out.print((65536*256+nData[nWidth * (nHeight - j - 1) + i])+"_
"
+nR[nWidth * (nHeight - j - 1) + i]+"_"
+nG[nWidth * (nHeight - j - 1) + i]+"_"
+nB[nWidth * (nHeight - j - 1) + i]+" ");
}
out.println("");
}
out.close();
*/
}
}
catch (Exception e) {
e.printStackTrace();
throw new Exception(e);
}
finally {
if (fs != null) {
fs.close();
}
}
// return image;
r g b
public int[] getBrightnessData(int rData[],int gData[],int bData[]){
int brightnessData[]=new int[rData.length];
if(rData.length!=gData.length || rData.length!=bData.length
|| bData.length!=gData.length){
return brightnessData;
}
else {
for(int i=0;i<bData.length;i++){
double temp=0.3*rData[i]+0.59*gData[i]+0.11*bData[i];
brightnessData[i]=(int)(temp)+((temp-(int)(temp))>0.5?1:0);
}
return brightnessData;
}
}

public int [] equilibrateGray(int[] PixelsGray,int width,int height)
{
int gray;
int length=PixelsGray.length;
int FrequenceGray[]=new int[length];
int SumGray[]=new int[256];
int ImageDestination[]=new int[length];
for(int i = 0; i <length ;i++)
{
gray=PixelsGray[i];
FrequenceGray[gray]++;
}
//
SumGray[0]=FrequenceGray[0];
for(int i=1;i<256;i++){
SumGray[i]=SumGray[i-1]+FrequenceGray[i];
}
for(int i=0;i<256;i++) {
SumGray[i]=(int)(SumGray[i]*255/length);
}
for(int i=0;i<height;i++)
{
for(int j=0;j<width;j++)
{
int k=i*width+j;
ImageDestination[k]=0xFF000000 | ((SumGray[PixelsGray[k]]<<
16 ) | (SumGray[PixelsGray[k]]<< 8 ) | SumGray[Pixel
sGray[k]]);
}
}
return ImageDestination;
}
laplace2,
public int[] laplace2DFileter(int []data,int width,int height){
+1]
int filterData[]=new int[data.length];

int min=10000;
int max=-10000;
for(int i=0;i<height;i++){
for(int j=0;j<width;j++){
if(i==0 || i==height-1 || j==0 || j==width-1)
filterData[i*width+j]=data[i*width+j];
else
filterData[i*width+j]=9*data[i*width+j]-data[i*width+j-1]-data[i*width+j
1)*width+j+1]
-data[(i-1)*width+j]-data[(i-1)*width+j-1]-data[(i-data[(i+1)*width+j]-data[(i+1)*width+j-1]-data[(i+
1)*width+j+1];
if(filterData[i*width+j]<min)
min=filterData[i*width+j];
if(filterData[i*width+j]>max)
max=filterData[i*width+j];
}
}
//
System.out.println("max: "+max);
//
System.out.println("min: "+min);
for(int i=0;i<width*height;i++){
filterData[i]=(filterData[i]-min)*255/(max-min);
}
return filterData;
laplace2delt
t){
public int[] laplaceHigh2DFileter(int []data,int width,int height,double del

int min=10000;
int max=-10000;
if(i==0 || i==height-1 || j==0 || j==width-1)
filterData[i*width+j]=(int)((1+delt)*data[i*width+j]);
else
filterData[i*width+j]=(int)((9+delt)*data[i*width+j]-data[i*width+j-1])data[i*width+j+1]
-data[(i-1)*width+j]-data[(i-1)*width+j-1]-data[(i1)*width+j+1]
-data[(i+1)*width+j]-data[(i+1)*width+j-1]-data[(i+
1)*width+j+1];
}
}
}
return filterData;
}
2
// 2niblack's method
/*
T(x,y)=m(x,y) + k*s(x,y)
w(x,y)
T(x,y),m(x,y)s(x,y)k(-2)t(
niblack's method
*/
public int[] localThresholdProcess(int []data,int width,int height,int w,int
h,double coefficients,double gate){
int[] processData=new int[data.length];

for(int i=0;i<data.length;i++){
processData[i]=255;
}
if(data.length!=width*height)
return processData;
int wNum=width/w;
int hNum=height/h;
int delt[]=new int[w*h];
//System.out.println("w; "+w+" h:"+h+" wNum:"+wNum+" hNum:"+hNum);
for(int j=0;j<hNum;j++){
for(int i=0;i<wNum;i++){
//for(int j=0;j<1;j++){
// for(int i=0;i<1;i++){
for(int n=0;n<h;n++)
for(int k=0;k<w;k++){
delt[n*w+k]=data[(j*h+n)*width+i*w+k];
//System.out.print("delt["+(n*w+k)+"]: "+delt[n*w+k]+" ");
}
//System.out.println();
/*
System.out.print("data["+((j*h+n)*width+i*w+k)+"]: "+data[(j*h+n
)*width+i*w+k]+" ");
}
System.out.println();
*/
delt=thresholdProcess(delt,w,h,coefficients,gate);
processData[(j*h+n)*width+i*w+k]=delt[n*w+k];
// System.out.print("delt["+(n*w+k)+"]: "+delt[n*w+k]+" ");
}
//System.out.println();
/*
System.out.print("processData["+((j*h+n)*width+i*w+k)+"]: "+proc
essData[(j*h+n)*width+i*w+k]+" ");
}
System.out.println();
*/
}
}
return processData;
2
public int[] thresholdProcess(int []data,int width,int height,double coeffic
ients,double gate){
int [] processData=new int[data.length];
return
else{
double
double
double
double
processData;
sum=0;
average=0;
variance=0;
threshold;
if( gate!=0){
threshold=gate;
}
else{
sum+=data[i];
}
average=sum/(width*height);
variance+=(data[i]-average)*(data[i]-average);
}
variance=Math.sqrt(variance);
threshold=average-coefficients*variance;
if(data[i]>threshold)
processData[i]=255;
else
processData[i]=0;
}
return processData;
sobel
public int[] verticleEdgeCheck(int []data,int width,int height,int sobelCoef
ficients) throws Exception{
int min=10000;
int max=-10000;
return filterData;
try{
if(i==0 || i==1 || i==height-1 || i==height-2
||j==0 || j==1 || j==width-1 || j==width-2){
}
else{
double average;
//
//average=data[i*width+j]-Math.sqrt(2)*data[i*width+j-1]+Math.sqrt(
2)*data[i*width+j+1]
average=data[i*width+j]-sobelCoefficients*data[i*width+j-1]+sobelCoeff
icients*data[i*width+j+1]
-data[(i-1)*width+j-1]+data[(i-1)*width+j+1]
-data[(i+1)*width+j-1]+data[(i+1)*width+j+1];
filterData[i*width+j]=(int)(average);
}
}
}
}
}
catch (Exception e)
{
}
return filterData;
3*3
public int[] filter(int []data,int width,int height) throws Exception{
int min=10000;
int max=-10000;
return filterData;
try{
+j+1]
if(i==0 || i==1 || i==height-1 || i==height-2
||j==0 || j==1 || j==width-1 || j==width-2){
}
else{
double average;
//
average=(data[i*width+j]+data[i*width+j-1]+data[i*width+j+1]
+data[(i-1)*width+j]+data[(i-1)*width+j-1]+data[(i-1)*width
+j+1])/9;
+data[(i+1)*width+j]+data[(i+1)*width+j-1]+data[(i+1)*width
filterData[i*width+j]=(int)(average);
}
}
}
}
}
catch (Exception e)
{
}
return filterData;

Java Digital Image Process Algorithm

Încărcat de

Informații document

Drepturi de autor

Formate disponibile

Partajați acest document

Partajați sau inserați document

Opțiuni de partajare

Vi se pare util acest document?

Este necorespunzător acest conținut?

Drepturi de autor:

Formate disponibile

Java Digital Image Process Algorithm

Încărcat de

Drepturi de autor:

Formate disponibile

Builder.com.

nG[nWidth * (nHeight - j - 1) + i]=(int) bRGB[nIndex+1]&

nR[nWidth * (nHeight - j - 1) + i]=(int) bRGB[nIndex+2]&

Toolkit kit = Toolkit.getDefaultToolkit();

int filterData[]=new int[data.length];

public int[] laplaceHigh2DFileter(int []data,int width,int height,double del

int filterData[]=new int[data.length];

int[] processData=new int[data.length];

S-ar putea să vă placă și