package cn.edu.jxau.image;
import java.awt.Color;
import java.awt.image.BufferedImage;
import java.awt.image.ColorModel;
/**
* 图像的放大与缩小
* @author xiaoxu
*
*/
public class AmplificatingShrinking {
/**
* 双线性插值法图像的放大
* @param srcPath
* @param distPath
* @param formatName
* @param k1
* @param k2
*/
public static void bilinearityInterpolation(String srcPath, String distPath,
String formatName, float k1, float k2) {
BufferedImage img = ImageDigital.readImg(srcPath);
BufferedImage imgOut = bilinearityInterpolation(img, k1, k2);
ImageDigital.writeImg(imgOut, formatName, distPath);
}
/**
* 双线性插值法图像的放大
*
* @param img
* 要缩小的图像对象
* @param k1
* 要缩小的列比列
* @param k2
* 要缩小的行比列
* @return 返回处理后的图像对象
*/
public static BufferedImage bilinearityInterpolation(BufferedImage img, float k1, float k2) {
if (k1 < 1 || k2 < 1) {// 如果k1 <1 || k2<1则是图片缩小,不是放大
System.err
.println("this is shrink image funcation, please set k1<=1 and k2<=1!");
return null;
}
float ii = 1 / k1; // 采样的行间距
float jj = (1 / k2); // 采样的列间距
int dd = (int) (ii * jj);
// int m=0 , n=0;
int imgType = img.getType();
int w = img.getWidth(); // 原图片的宽
int h = img.getHeight(); // 原图片的宽
int m = Math.round(k1 * w); // 放大后图片的宽
int n = Math.round(k2 * h); // 放大后图片的宽
int[] pix = new int[w * h];
pix = img.getRGB(0, 0, w, h, pix, 0, w);
/*
* System.out.println(w + " * " + h); System.out.println(m + " * " + n);
*/
int[] newpix = new int[m * n];
for (int j = 0; j < h - 1; j++) {
for (int i = 0; i < w - 1; i++) {
int x0 = Math.round(i * k1);
int y0 = Math.round(j * k2);
int x1, y1;
if (i == w - 2) {
x1 = m - 1;
} else {
x1 = Math.round((i + 1) * k1);
}
if (j == h - 2) {
y1 = n - 1;
} else {
y1 = Math.round((j + 1) * k2);
}
int d1 = x1 - x0;
int d2 = y1 - y0;
if (0 == newpix[y0 * m + x0]) {
newpix[y0 * m + x0] = pix[j * w + i];
}
if (0 == newpix[y0 * m + x1]) {
if (i == w - 2) {
newpix[y0 * m + x1] = pix[j * w + w - 1];
} else {
newpix[y0 * m + x1] = pix[j * w + i + 1];
}
}
if (0 == newpix[y1 * m + x0]) {
if (j == h - 2) {
newpix[y1 * m + x0] = pix[(h - 1) * w + i];
} else {
newpix[y1 * m + x0] = pix[(j + 1) * w + i];
}
}
if (0 == newpix[y1 * m + x1]) {
if (i == w - 2 && j == h - 2) {
newpix[y1 * m + x1] = pix[(h - 1) * w + w - 1];
} else {
newpix[y1 * m + x1] = pix[(j + 1) * w + i + 1];
}
}
int r, g, b;
float c;
ColorModel cm = ColorModel.getRGBdefault();
for (int l = 0; l < d2; l++) {
for (int k = 0; k < d1; k++) {
if (0 == l) {
// f(x,0) = f(0,0) + c1*(f(1,0)-f(0,0))
if (j < h - 1 && newpix[y0 * m + x0 + k] == 0) {
c = (float) k / d1;
r = cm.getRed(newpix[y0 * m + x0])
+ (int) (c * (cm.getRed(newpix[y0 * m
+ x1]) - cm.getRed(newpix[y0
* m + x0])));// newpix[(y0+l)*m
// + k]
g = cm.getGreen(newpix[y0 * m + x0])
+ (int) (c * (cm.getGreen(newpix[y0 * m
+ x1]) - cm.getGreen(newpix[y0
* m + x0])));
b = cm.getBlue(newpix[y0 * m + x0])
+ (int) (c * (cm.getBlue(newpix[y0 * m
+ x1]) - cm.getBlue(newpix[y0
* m + x0])));
newpix[y0 * m + x0 + k] = new Color(r, g, b)
.getRGB();
}
if (j + 1 < h && newpix[y1 * m + x0 + k] == 0) {
c = (float) k / d1;
r = cm.getRed(newpix[y1 * m + x0])
+ (int) (c * (cm.getRed(newpix[y1 * m
+ x1]) - cm.getRed(newpix[y1
* m + x0])));
g = cm.getGreen(newpix[y1 * m + x0])
+ (int) (c * (cm.getGreen(newpix[y1 * m
+ x1]) - cm.getGreen(newpix[y1
* m + x0])));
b = cm.getBlue(newpix[y1 * m + x0])
+ (int) (c * (cm.getBlue(newpix[y1 * m
+ x1]) - cm.getBlue(newpix[y1
* m + x0])));
newpix[y1 * m + x0 + k] = new Color(r, g, b)
.getRGB();
}
// System.out.println(c);
} else {
// f(x,y) = f(x,0) + c2*f(f(x,1)-f(x,0))
c = (float) l / d2;
r = cm.getRed(newpix[y0 * m + x0 + k])
+ (int) (c * (cm.getRed(newpix[y1 * m + x0
+ k]) - cm.getRed(newpix[y0 * m
+ x0 + k])));
g = cm.getGreen(newpix[y0 * m + x0 + k])
+ (int) (c * (cm.getGreen(newpix[y1 * m
+ x0 + k]) - cm.getGreen(newpix[y0
* m + x0 + k])));
b = cm.getBlue(newpix[y0 * m + x0 + k])
+ (int) (c * (cm.getBlue(newpix[y1 * m + x0
+ k]) - cm.getBlue(newpix[y0 * m
+ x0 + k])));
newpix[(y0 + l) * m + x0 + k] = new Color(r, g, b)
.getRGB();
// System.out.println((int)(c*(cm.getRed(newpix[y1*m
// + x0+k]) - cm.getRed(newpix[y0*m + x0+k]))));
}
}
if (i == w - 2 || l == d2 - 1) { // 最后一列的计算
// f(1,y) = f(1,0) + c2*f(f(1,1)-f(1,0))
c = (float) l / d2;
r = cm.getRed(newpix[y0 * m + x1])
+ (int) (c * (cm.getRed(newpix[y1 * m + x1]) - cm
.getRed(newpix[y0 * m + x1])));
g = cm.getGreen(newpix[y0 * m + x1])
+ (int) (c * (cm.getGreen(newpix[y1 * m + x1]) - cm
.getGreen(newpix[y0 * m + x1])));
b = cm.getBlue(newpix[y0 * m + x1])
+ (int) (c * (cm.getBlue(newpix[y1 * m + x1]) - cm
.getBlue(newpix[y0 * m + x1])));
newpix[(y0 + l) * m + x1] = new Color(r, g, b).getRGB();
}
}
}
}
/*
* for(int j=0; j<50; j++){ for(int i=0; i<50; i++) {
* System.out.print(new Color(newpix[j*m + i]).getRed() + "\t"); }
* System.out.println(); }
*/
BufferedImage imgOut = new BufferedImage(m, n, imgType);
imgOut.setRGB(0, 0, m, n, newpix, 0, m);
return imgOut;
}
/**
* 双立方插值
*
* @param srcPath
* 原图像的路径
* @param destPath
* 目标图像的路径
* @param formatName
* 图像文件格式
* @param k1
* 图像的宽放大比例
* @param k2
* 图像的高放大比例
*/
/*public static void biCubicInterpolationScale(String srcPath,
String destPath, String formatName, float k1, float k2) {
BufferedImage img = ImageDigital.readImg(srcPath);
int w = img.getWidth();
int h = img.getHeight();
int destW = Math.round(w * k1);
int destH = Math.round(h * k2);
int pix[] = new int[w * h];
int type = img.getType();
img.getRGB(0, 0, w, h, pix, 0, w);
int[] newpix = BiCubicInterpolationScale.imgScale(pix, w, h, destW,
destH);
BufferedImage imgOut = new BufferedImage(destW, destH, type);
imgOut.setRGB(0, 0, destW, destH, newpix, 0, destW);
ImageDigital.writeImg(imgOut, formatName, destPath);
}*/
/**
* 等间隔采样的图像放大(缩小)
*
* @param img
* 要放大(缩小)的图像对象
* @param k1
* 要放大(缩小)的列比列
* @param k2
* 要放大(缩小)的行比列
* @return 返回处理后的图像对象
*/
public static BufferedImage flex(BufferedImage img, float k1, float k2) {
float ii = 1 / k1; // 采样的行间距
float jj = 1 / k2; // 采样的列间距
// int m=0 , n=0;
int imgType = img.getType();
int w = img.getWidth();
int h = img.getHeight();
int m = (int) (k1 * w);
int n = (int) (k2 * h);
int[] pix = new int[w * h];
pix = img.getRGB(0, 0, w, h, pix, 0, w);
System.out.println(w + " * " + h);
System.out.println(m + " * " + n);
int[] newpix = new int[m * n];
for (int j = 0; j < n; j++) {
for (int i = 0; i < m; i++) {
newpix[j
图片搜索(java实现)
4星 · 超过85%的资源 需积分: 50 96 浏览量
2012-11-25
08:48:27
上传
评论 21
收藏 231KB RAR 举报
luoweifu
- 粉丝: 7210
- 资源: 18
最新资源
- mmqrcode1714153659780.png
- Screenshot_2024-04-27-06-08-58-486_com.baidu.xin.aiqicha.jpg
- 基于Javaweb+Tomcat+MySQL的大学生公寓管理系统+sql文件.zip
- 实训作业基于javaweb的订单管理系统源码+数据库+实训报告.zip
- 多机调度问题贪心算法基于最小堆和贪心算法求解多机调度问题.zip
- 基于同态加密技术的匿名电子投票系统源码.zip
- Pyqt5项目框架-PyQt项目开发实践
- 基于C通过MQTT的智能农业大棚管理系统(本科毕业设计)
- python+CNN的网络入侵检测算法源码.zip
- js 实现记住密码功能 js.cookie.min.js
资源上传下载、课程学习等过程中有任何疑问或建议,欢迎提出宝贵意见哦~我们会及时处理!
点击此处反馈
- 1
- 2
- 3
- 4
- 5
- 6
前往页