【图像融合】curvelet变换图像融合（评价指标）【含Matlab源码 781期】

最新推荐文章于 2024-08-29 13:39:24 发布

Matlab武动乾坤

最新推荐文章于 2024-08-29 13:39:24 发布

阅读量1k

点赞数 22

分类专栏： Matlab图像处理（进阶版）文章标签： matlab

本文链接：https://blog.csdn.net/KeepingMatlab/article/details/136033748

版权

Matlab图像处理（进阶版）专栏收录该内容

920 篇文章 24 订阅

订阅专栏

✅博主简介：热爱科研的Matlab仿真开发者，修心和技术同步精进，Matlab项目合作可私信。
🍎个人主页：海神之光
🏆代码获取方式：
海神之光Matlab王者学习之路—代码获取方式
⛳️座右铭：行百里者，半于九十。

⛄一、简介

1 Curvelet变换理论
Curvelet变换[2]是Candes和Donoho等人于1999年提出的,其表达对象直接为多尺度边缘。可见,Curvelet变换以边缘为基本表示元素,具有完备性,能更好地反映图像的特征。另外,Curvelet变换是各向异性的,具有很强的方向性,能为图像处理提供更多的信息。

在连续变换的定义中频率窗Uj将频域均匀地分成了角度不同的环形,这种分割并不适合笛卡儿坐标系,因此采用同中心的方块区域Uj来替代。离散Curvelet频率空间分布图如图1所示。
在这里插入图片描述
图1 离散Curvelet频率空间分布图
定义笛卡儿坐标系下的局部窗为:

2 基于Curvelet变换的图像融合算法
边缘细节信息在Curvelet域中对应的系数绝对值较大,据此采用非线性变换函数[3]对Curvelet系数进行变换,即单阈值函数,增强图像的细节高频信息,但是,在增强细节的同时,可能会导致图像的噪声也得到了放大。

⛄二、部分源代码

function x = ifdct_wrapping(C, is_real, M, N)

% ifdct_wrapping.m - Inverse Fast Discrete Curvelet Transform via wedge wrapping - Version 1.0
% This is in fact the adjoint, also the pseudo-inverse
%
% Inputs
% C Cell array containing curvelet coefficients (see
% description in fdct_wrapping.m)
% is_real As used in fdct_wrapping.m
% M, N Size of the image to be recovered (not necessary if finest
% = 2)
%
% Outputs
% x M-by-N matrix
%
% See also fdct_wrapping.m
%
% By Laurent Demanet, 2004

% Initialization
nbscales = length©;
nbangles_coarse = length(C{2});
nbangles = [1, nbangles_coarse .* 2.^(ceil((nbscales-(nbscales👎2))/2))];
if length(C{end}) == 1, finest = 2; else finest = 1; end;
if finest == 2, nbangles(nbscales) = 1; end;
if nargin < 2, is_real = 0; end;
if nargin < 4,
if finest == 1, error(‘Syntax: IFCT_wrapping(C,M,N) where the matrix to be recovered is M-by-N’); end;
[N1,N2] = size(C{end}{1});
else
N1 = M;
N2 = N;
end;

M1 = N1/3;
M2 = N2/3;

if finest == 1;

bigN1 = 2*floor(2*M1)+1;
bigN2 = 2*floor(2*M2)+1;
X = zeros(bigN1,bigN2);

% Initialization: preparing the lowpass filter at finest scale
window_length_1 = floor(2*M1) - floor(M1) - 1 - (mod(N1,3)==0);
window_length_2 = floor(2*M2) - floor(M2) - 1 - (mod(N2,3)==0);
coord_1 = 0:(1/window_length_1):1;
coord_2 = 0:(1/window_length_2):1;
[wl_1,wr_1] = fdct_wrapping_window(coord_1);
[wl_2,wr_2] = fdct_wrapping_window(coord_2);
lowpass_1 = [wl_1, ones(1,2*floor(M1)+1), wr_1];
if mod(N1,3)==0, lowpass_1 = [0, lowpass_1, 0]; end;
lowpass_2 = [wl_2, ones(1,2*floor(M2)+1), wr_2];
if mod(N2,3)==0, lowpass_2 = [0, lowpass_2, 0]; end;
lowpass = lowpass_1'*lowpass_2;

scales = nbscales:-1:2;

else

M1 = M1/2;
M2 = M2/2;

bigN1 = 2*floor(2*M1)+1;
bigN2 = 2*floor(2*M2)+1;
X = zeros(bigN1,bigN2);

window_length_1 = floor(2*M1) - floor(M1) - 1;
window_length_2 = floor(2*M2) - floor(M2) - 1;
coord_1 = 0:(1/window_length_1):1;
coord_2 = 0:(1/window_length_2):1;
[wl_1,wr_1] = fdct_wrapping_window(coord_1);
[wl_2,wr_2] = fdct_wrapping_window(coord_2);
lowpass_1 = [wl_1, ones(1,2*floor(M1)+1), wr_1];
lowpass_2 = [wl_2, ones(1,2*floor(M2)+1), wr_2];
lowpass = lowpass_1'*lowpass_2;
hipass_finest = sqrt(1 - lowpass.^2);

scales = (nbscales-1):-1:2;

end;

% Loop: pyramidal reconstruction

Xj_topleft_1 = 1;
Xj_topleft_2 = 1;
for j = scales,

M1 = M1/2;
M2 = M2/2;
window_length_1 = floor(2*M1) - floor(M1) - 1;
window_length_2 = floor(2*M2) - floor(M2) - 1;
coord_1 = 0:(1/window_length_1):1;
coord_2 = 0:(1/window_length_2):1;
[wl_1,wr_1] = fdct_wrapping_window(coord_1);
[wl_2,wr_2] = fdct_wrapping_window(coord_2);
lowpass_1 = [wl_1, ones(1,2*floor(M1)+1), wr_1];
lowpass_2 = [wl_2, ones(1,2*floor(M2)+1), wr_2];
lowpass_next = lowpass_1'*lowpass_2;
hipass = sqrt(1 - lowpass_next.^2);
Xj = zeros(2*floor(4*M1)+1,2*floor(4*M2)+1);

% Loop: angles
l = 0;
nbquadrants = 2 + 2*(~is_real);
nbangles_perquad = nbangles(j)/4;
for quadrant = 1:nbquadrants
    
    M_horiz = M2 * (mod(quadrant,2)==1) + M1 * (mod(quadrant,2)==0);
    M_vert = M1 * (mod(quadrant,2)==1) + M2 * (mod(quadrant,2)==0);
    if mod(nbangles_perquad,2),
        wedge_ticks_left = round((0:(1/(2*nbangles_perquad)):.5)*2*floor(4*M_horiz) + 1);
        wedge_ticks_right = 2*floor(4*M_horiz) + 2 - wedge_ticks_left;
        wedge_ticks = [wedge_ticks_left, wedge_ticks_right(end:-1:1)];
    else
        wedge_ticks_left = round((0:(1/(2*nbangles_perquad)):.5)*2*floor(4*M_horiz) + 1);
        wedge_ticks_right = 2*floor(4*M_horiz) + 2 - wedge_ticks_left;
        wedge_ticks = [wedge_ticks_left, wedge_ticks_right((end-1):-1:1)];
    end;
    wedge_endpoints = wedge_ticks(2:2:(end-1));         % integers
    wedge_midpoints = (wedge_endpoints(1:(end-1)) + wedge_endpoints(2:end))/2;
    
    % Left corner wedge
    
    l = l+1;
    first_wedge_endpoint_vert = round(2*floor(4*M_vert)/(2*nbangles_perquad) + 1);
    length_corner_wedge = floor(4*M_vert) - floor(M_vert) + ceil(first_wedge_endpoint_vert/4);
    Y_corner = 1:length_corner_wedge;
    [XX,YY] = meshgrid(1:(2*floor(4*M_horiz)+1),Y_corner);
    width_wedge = wedge_endpoints(2) + wedge_endpoints(1) - 1;
    slope_wedge = (floor(4*M_horiz) + 1 - wedge_endpoints(1))/floor(4*M_vert);
    left_line = round(2 - wedge_endpoints(1) + slope_wedge*(Y_corner - 1));
    [wrapped_XX, wrapped_YY] = deal(zeros(length_corner_wedge,width_wedge));
    first_row = floor(4*M_vert)+2-ceil((length_corner_wedge+1)/2)+...
        mod(length_corner_wedge+1,2)*(quadrant-2 == mod(quadrant-2,2));
    first_col = floor(4*M_horiz)+2-ceil((width_wedge+1)/2)+...
        mod(width_wedge+1,2)*(quadrant-3 == mod(quadrant-3,2));
    
    for row = Y_corner
        cols = left_line(row) + mod((0:(width_wedge-1))-(left_line(row)-first_col),width_wedge);
        new_row = 1 + mod(row - first_row, length_corner_wedge);
        admissible_cols = round(1/2*(cols+1+abs(cols-1)));
        wrapped_XX(new_row,:) = XX(row,admissible_cols);
        wrapped_YY(new_row,:) = YY(row,admissible_cols);
    end;

    slope_wedge_right = (floor(4*M_horiz)+1 - wedge_midpoints(1))/floor(4*M_vert);
    mid_line_right = wedge_midpoints(1) + slope_wedge_right*(wrapped_YY - 1);
                                                        % not integers
                                                        % in general
    coord_right = 1/2 + floor(4*M_vert)/(wedge_endpoints(2) - wedge_endpoints(1)) * ...
        (wrapped_XX - mid_line_right)./(floor(4*M_vert)+1 - wrapped_YY);
    C2 = 1/(1/(2*(floor(4*M_horiz))/(wedge_endpoints(1) - 1) - 1) + 1/(2*(floor(4*M_vert))/(first_wedge_endpoint_vert - 1) - 1));
    C1 = C2 / (2*(floor(4*M_vert))/(first_wedge_endpoint_vert - 1) - 1);
    wrapped_XX((wrapped_XX - 1)/floor(4*M_horiz) + (wrapped_YY-1)/floor(4*M_vert) == 2) = ...
        wrapped_XX((wrapped_XX - 1)/floor(4*M_horiz) + (wrapped_YY-1)/floor(4*M_vert) == 2) + 1;
    coord_corner = C1 + C2 * ((wrapped_XX - 1)/(floor(4*M_horiz)) - (wrapped_YY - 1)/(floor(4*M_vert))) ./ ...
        (2-((wrapped_XX - 1)/(floor(4*M_horiz)) + (wrapped_YY - 1)/(floor(4*M_vert))));
    wl_left = fdct_wrapping_window(coord_corner);
    [wl_right,wr_right] = fdct_wrapping_window(coord_right);
    switch is_real
     case 0
      wrapped_data = fftshift(fft2(ifftshift(C{j}{l})))/sqrt(prod(size(C{j}{l})));
      wrapped_data = rot90(wrapped_data,(quadrant-1));
     case 1
      x = C{j}{l} + sqrt(-1)*C{j}{l+nbangles(j)/2};
      wrapped_data = fftshift(fft2(ifftshift(x)))/sqrt(prod(size(x)))/sqrt(2);
      wrapped_data = rot90(wrapped_data,(quadrant-1));
    end;
    wrapped_data = wrapped_data .* (wl_left .* wr_right);

    % Unwrapping data
    for row = Y_corner
        cols = left_line(row) + mod((0:(width_wedge-1))-(left_line(row)-first_col),width_wedge);
        admissible_cols = round(1/2*(cols+1+abs(cols-1)));
        new_row = 1 + mod(row - first_row, length_corner_wedge);
        Xj(row,admissible_cols) = Xj(row,admissible_cols) + wrapped_data(new_row,:);
                            % We use the following property: in an assignment
                            % A(B) = C where B and C are vectors, if
                            % some value x repeats in B, then the
                            % last occurrence of x is the one
                            % corresponding to the eventual assignment.
    end;

    % Regular wedges
    length_wedge = floor(4*M_vert) - floor(M_vert);
    Y = 1:length_wedge;
    first_row = floor(4*M_vert)+2-ceil((length_wedge+1)/2)+...
        mod(length_wedge+1,2)*(quadrant-2 == mod(quadrant-2,2));
    for subl = 2:(nbangles_perquad-1);
        l = l+1;
        width_wedge = wedge_endpoints(subl+1) - wedge_endpoints(subl-1) + 1;
        slope_wedge = ((floor(4*M_horiz)+1) - wedge_endpoints(subl))/floor(4*M_vert);
        left_line = round(wedge_endpoints(subl-1) + slope_wedge*(Y - 1));
        [wrapped_XX, wrapped_YY] = deal(zeros(length_wedge,width_wedge));
        first_col = floor(4*M_horiz)+2-ceil((width_wedge+1)/2)+...
            mod(width_wedge+1,2)*(quadrant-3 == mod(quadrant-3,2));
        for row = Y
            cols = left_line(row) + mod((0:(width_wedge-1))-(left_line(row)-first_col),width_wedge);
            new_row = 1 + mod(row - first_row, length_wedge);
            wrapped_XX(new_row,:) = XX(row,cols);
            wrapped_YY(new_row,:) = YY(row,cols);
        end;
        slope_wedge_left = ((floor(4*M_horiz)+1) - wedge_midpoints(subl-1))/floor(4*M_vert);
        mid_line_left = wedge_midpoints(subl-1) + slope_wedge_left*(wrapped_YY - 1);
        coord_left = 1/2 + floor(4*M_vert)/(wedge_endpoints(subl) - wedge_endpoints(subl-1)) * ...
            (wrapped_XX - mid_line_left)./(floor(4*M_vert)+1 - wrapped_YY);
        slope_wedge_right = ((floor(4*M_horiz)+1) - wedge_midpoints(subl))/floor(4*M_vert);
        mid_line_right = wedge_midpoints(subl) + slope_wedge_right*(wrapped_YY - 1);
        coord_right = 1/2 + floor(4*M_vert)/(wedge_endpoints(subl+1) - wedge_endpoints(subl)) * ...
            (wrapped_XX - mid_line_right)./(floor(4*M_vert)+1 - wrapped_YY);
        wl_left = fdct_wrapping_window(coord_left);
        [wl_right,wr_right] = fdct_wrapping_window(coord_right);
        switch is_real
         case 0
          wrapped_data = fftshift(fft2(ifftshift(C{j}{l})))/sqrt(prod(size(C{j}{l})));
          wrapped_data = rot90(wrapped_data,(quadrant-1));
         case 1
          x = C{j}{l} + sqrt(-1)*C{j}{l+nbangles(j)/2};
          wrapped_data = fftshift(fft2(ifftshift(x)))/sqrt(prod(size(x)))/sqrt(2);
          wrapped_data = rot90(wrapped_data,(quadrant-1));
        end;
        wrapped_data = wrapped_data .* (wl_left .* wr_right);
        
        % Unwrapping data
        for row = Y
            cols = left_line(row) + mod((0:(width_wedge-1))-(left_line(row)-first_col),width_wedge);
            new_row = 1 + mod(row - first_row, length_wedge);
            Xj(row,cols) = Xj(row,cols) + wrapped_data(new_row,:);
        end;

    end;    % for subl
    
    % Right corner wedge
    l = l+1;
    width_wedge = 4*floor(4*M_horiz) + 3 - wedge_endpoints(end) - wedge_endpoints(end-1);
    slope_wedge = ((floor(4*M_horiz)+1) - wedge_endpoints(end))/floor(4*M_vert);
    left_line = round(wedge_endpoints(end-1) + slope_wedge*(Y_corner - 1));
    [wrapped_XX, wrapped_YY] = deal(zeros(length_corner_wedge,width_wedge));
    first_row = floor(4*M_vert)+2-ceil((length_corner_wedge+1)/2)+...
        mod(length_corner_wedge+1,2)*(quadrant-2 == mod(quadrant-2,2));
    first_col = floor(4*M_horiz)+2-ceil((width_wedge+1)/2)+...
        mod(width_wedge+1,2)*(quadrant-3 == mod(quadrant-3,2));
        function y= xinxishang(x)

%信息熵
x=uint8(x);
temp=unique(x); %temp就是x中全部不同的元素，例如x=[1,1,3,4,1,5];那么temp=[1;3;4;5]
temp=temp’;
len=length(temp); %求出x矩阵中不同元素的个数
p=zeros(1,len); %p向量用来存储矩阵x中每个不同元素的个数
[m,n]=size(x);
for k=1:len
for i=1:m
for j=1:n
if x(i,j)==temp(1,k)
p(1,k)=p(1,k)+1;
end
end
end
end

⛄三、运行结果

在这里插入图片描述

⛄四、matlab版本及参考文献

1 matlab版本
2014a

2 参考文献
[1]蒋婷婷,周洁静.基于改进Curvelet变换的图像融合算法研究[J].信息化研究. 2020,46(03)

3 备注
简介此部分摘自互联网，仅供参考，若侵权，联系删除

🍅 仿真咨询
1 各类智能优化算法改进及应用
生产调度、经济调度、装配线调度、充电优化、车间调度、发车优化、水库调度、三维装箱、物流选址、货位优化、公交排班优化、充电桩布局优化、车间布局优化、集装箱船配载优化、水泵组合优化、解医疗资源分配优化、设施布局优化、可视域基站和无人机选址优化

2 机器学习和深度学习方面
卷积神经网络（CNN）、LSTM、支持向量机（SVM）、最小二乘支持向量机（LSSVM）、极限学习机（ELM）、核极限学习机（KELM）、BP、RBF、宽度学习、DBN、RF、RBF、DELM、XGBOOST、TCN实现风电预测、光伏预测、电池寿命预测、辐射源识别、交通流预测、负荷预测、股价预测、PM2.5浓度预测、电池健康状态预测、水体光学参数反演、NLOS信号识别、地铁停车精准预测、变压器故障诊断

3 图像处理方面
图像识别、图像分割、图像检测、图像隐藏、图像配准、图像拼接、图像融合、图像增强、图像压缩感知

4 路径规划方面
旅行商问题（TSP）、车辆路径问题（VRP、MVRP、CVRP、VRPTW等）、无人机三维路径规划、无人机协同、无人机编队、机器人路径规划、栅格地图路径规划、多式联运运输问题、车辆协同无人机路径规划、天线线性阵列分布优化、车间布局优化

5 无人机应用方面
无人机路径规划、无人机控制、无人机编队、无人机协同、无人机任务分配

6 无线传感器定位及布局方面
传感器部署优化、通信协议优化、路由优化、目标定位优化、Dv-Hop定位优化、Leach协议优化、WSN覆盖优化、组播优化、RSSI定位优化

7 信号处理方面
信号识别、信号加密、信号去噪、信号增强、雷达信号处理、信号水印嵌入提取、肌电信号、脑电信号、信号配时优化

8 电力系统方面
微电网优化、无功优化、配电网重构、储能配置

9 元胞自动机方面
交通流人群疏散病毒扩散晶体生长

10 雷达方面
卡尔曼滤波跟踪、航迹关联、航迹融合