matlab自编腐蚀算法，区域增长

2024-09-02 06:20
文章标签 算法 matlab 区域 增长 腐蚀 自编

本文主要是介绍matlab自编腐蚀算法，区域增长，希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！

1 自实现腐蚀操作


temp1 = ImgMask;
se = strel('disk',4);
temp1 = imerode(temp1, se);
imtool(temp1)temp2 = temp2.*label;
temp2 = ImgMask;
my_strel = double(se.Neighborhood);
R = floor(size(my_strel,1)/2);
label = zeros(imgSize,imgSize);
for i = R+1:imgSize - Rfor j = R+1:imgSize - RsubImg = temp2(i-R:i+R,j-R:j+R);if isequal(subImg.* my_strel,my_strel)label(i,j) = 1;endend
end
temp2 = temp2.*label;

2 自实现二值图区域增长，完成分割任务

多次循环，实现任何大小的分割任务

WINDOW_SIZE_Standard = 240;   %最大膨胀窗口的大小
threshhold_Standard = 0.3;  %区域增长的判定条件，每次新增长像素>待判定像素的 30%
[output,WINDOW_ARRAY_fn,WINDOW_SIZE,seed_x,seed_y] = RegionGrowingStepInitial(tempMaskimg,imgSize,WINDOW_SIZE_Standard,threshhold_Standard);WINDOW_SIZE_Standard = 40; threshhold_Standard = 0.4;
[output,WINDOW_SIZE] = RegionGrowingStep2(tempMaskimg,output,WINDOW_SIZE_Standard,WINDOW_SIZE,threshhold_Standard,imgSize);WINDOW_SIZE_Standard = 20;  threshhold_Standard = 0.4;
[output,WINDOW_SIZE] = RegionGrowingStep2(tempMaskimg,output,WINDOW_SIZE_Standard,WINDOW_SIZE,threshhold_Standard,imgSize);WINDOW_SIZE_Standard = 20;  threshhold_Standard = 0.4;
[output,WINDOW_SIZE] = RegionGrowingStep2(tempMaskimg,output,WINDOW_SIZE_Standard,WINDOW_SIZE,threshhold_Standard,imgSize);

function [output,WINDOW_SIZE] = RegionGrowingStep2(tempMaskimg,output,WINDOW_SIZE_Standard,WINDOW_SIZE,threshhold_Standard,imgSize)
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%3.选取多个种子点，限定增长窗口，区域增长
%Select multiple seed points, limit the growth window, and expand the region
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%  
%%%%%%%%%% 3.1.存储多个种子点P0 = tempMaskimg;% %     [posx,posy] = find (WINDOW_ARRAY_fn==1);
% %     seedArray_x = [];
% %     seedArray_y = [];
% %     for i = seed_x - floor(WINDOW_SIZE/2):floor(WINDOW_SIZE/10-1):seed_x + floor(WINDOW_SIZE/2)
% %         for j = seed_y - floor(WINDOW_SIZE/2):floor(WINDOW_SIZE/10-1):seed_y + floor(WINDOW_SIZE/2)
% %             seedArray_x(end+1) = i;
% %             seedArray_y(end+1) = j;
% %         end
% %     endoutput(output > 0) = 1;edges = edge(output, 'Canny');[posx,posy] =  find(edges ~= 0);seedArray_x = [];seedArray_y = [];for i = 1:23:size(posx,1)seedArray_x(end+1) = posx(i);seedArray_y(end+1) = posy(i);end
%     figure(1);plot(seedArray_x,seedArray_y,'*');
%     figure(2);plot(posx,posy,'*');%%%%%%%%%% 3.2 指定滑动窗大小，%%%%%%%%%占比0.4以上，增长fprintf("************** seed point length= %d \n",size(seedArray_x,2));for kk = 1:size(seedArray_x,2)WINDOW_SIZE = 3;WINDOW_ARRAY_fn = zeros(imgSize,imgSize);seed_x = seedArray_x(kk);seed_y = seedArray_y(kk);for i = seed_x - floor(WINDOW_SIZE/2):1:seed_x + floor(WINDOW_SIZE/2)for j = seed_y - floor(WINDOW_SIZE/2):1:seed_y + floor(WINDOW_SIZE/2)WINDOW_ARRAY_fn(i,j) = 1;endendWINDOW_ARRAY_fn(seed_x,seed_y) = 0;threshhold = threshhold_Standard;
%         while threshhold >= 0.4  && WINDOW_SIZE < 50while threshhold >= threshhold_Standard  && WINDOW_SIZE < WINDOW_SIZE_StandardTOTAL = WINDOW_SIZE*2 + (WINDOW_SIZE - 2)*2;result = P0.*WINDOW_ARRAY_fn;  %imtool(result)[posx,posy] = find (result==1);SATISFIED_pixel = length(posx);   threshhold = SATISFIED_pixel/TOTAL;%%%%%%% old windowWINDOW_ARRAY_fn = zeros(imgSize,imgSize);for i = seed_x - floor(WINDOW_SIZE/2):1:seed_x + floor(WINDOW_SIZE/2)for j = seed_y - floor(WINDOW_SIZE/2):1:seed_y + floor(WINDOW_SIZE/2)WINDOW_ARRAY_fn(i,j) = 1;endend%%%%% new windowWINDOW_SIZE = WINDOW_SIZE+ 2;WINDOW_ARRAY_fn0 = zeros(imgSize,imgSize);for i = seed_x - floor(WINDOW_SIZE/2):1:seed_x + floor(WINDOW_SIZE/2)for j = seed_y - floor(WINDOW_SIZE/2):1:seed_y + floor(WINDOW_SIZE/2)WINDOW_ARRAY_fn0(i,j) = 1;endendWINDOW_ARRAY_fn0(WINDOW_ARRAY_fn == 1) = 0;WINDOW_ARRAY_fn0(seed_x,seed_y) = 0;WINDOW_ARRAY_fn = WINDOW_ARRAY_fn0;%        fprintf("WINDOW_SIZE = %d \n",WINDOW_SIZE);endWINDOW_ARRAY_out = zeros(imgSize,imgSize);for i = seed_x - floor(WINDOW_SIZE/2):1:seed_x + floor(WINDOW_SIZE/2)for j = seed_y - floor(WINDOW_SIZE/2):1:seed_y + floor(WINDOW_SIZE/2)WINDOW_ARRAY_out(i,j) = 1;endendoutput = output + WINDOW_ARRAY_out;%     imtool(output);
% %         fprintf("************** kk = %d \n",kk);
% %         fprintf("WINDOW_SIZE = %d \n",WINDOW_SIZE);endfprintf("************** finish \n");
end
function [output,WINDOW_ARRAY_fn,WINDOW_SIZE,seed_x,seed_y] = RegionGrowingStepInitial(tempMaskimg,imgSize,WINDOW_SIZE_Standard,threshhold_Standard)%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 1.在图像的中心区域的一定范围内，选取一个像素值不为0的种子点%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% R_seed = 30;seed_x = 0;seed_y = 0;for i = floor(imgSize/2 - R_seed/2):1:floor(imgSize/2 + R_seed/2)for j = floor(imgSize/2 - R_seed/2):1:floor(imgSize/2 + R_seed/2)if(tempMaskimg(i,j) ==1)seed_x = i;seed_y = j;break;endendend%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 2.区域增长%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%  %%%%%  初始化P0 = tempMaskimg;WINDOW_SIZE = 3; WINDOW_ARRAY_fn = zeros(imgSize,imgSize);for i = seed_x - floor(WINDOW_SIZE/2):1:seed_x + floor(WINDOW_SIZE/2)for j = seed_y - floor(WINDOW_SIZE/2):1:seed_y + floor(WINDOW_SIZE/2)WINDOW_ARRAY_fn(i,j) = 1;endendWINDOW_ARRAY_fn(seed_x,seed_y) = 0;threshhold = threshhold_Standard;%%%%%%%%%%%%  获得初始连通区域
%     while threshhold >= 0.3 && WINDOW_SIZE < 240while threshhold >= threshhold_Standard  && WINDOW_SIZE < WINDOW_SIZE_StandardTOTAL = WINDOW_SIZE*2 + (WINDOW_SIZE - 2)*2;result = P0.*WINDOW_ARRAY_fn;  %imtool(result)[posx,posy] = find (result==1);SATISFIED_pixel = length(posx);   threshhold = SATISFIED_pixel/TOTAL;%%%%%%% old windowWINDOW_ARRAY_fn = zeros(imgSize,imgSize);for i = seed_x - floor(WINDOW_SIZE/2):1:seed_x + floor(WINDOW_SIZE/2)for j = seed_y - floor(WINDOW_SIZE/2):1:seed_y + floor(WINDOW_SIZE/2)WINDOW_ARRAY_fn(i,j) = 1;endend%%%%% new windowWINDOW_SIZE = WINDOW_SIZE+ 2;WINDOW_ARRAY_fn0 = zeros(imgSize,imgSize);for i = seed_x - floor(WINDOW_SIZE/2):1:seed_x + floor(WINDOW_SIZE/2)for j = seed_y - floor(WINDOW_SIZE/2):1:seed_y + floor(WINDOW_SIZE/2)WINDOW_ARRAY_fn0(i,j) = 1;endendWINDOW_ARRAY_fn0(WINDOW_ARRAY_fn == 1) = 0;WINDOW_ARRAY_fn0(seed_x,seed_y) = 0;WINDOW_ARRAY_fn = WINDOW_ARRAY_fn0;%        fprintf("WINDOW_SIZE = %d \n",WINDOW_SIZE);endWINDOW_ARRAY_out = zeros(imgSize,imgSize);for i = seed_x - floor(WINDOW_SIZE/2):1:seed_x + floor(WINDOW_SIZE/2)for j = seed_y - floor(WINDOW_SIZE/2):1:seed_y + floor(WINDOW_SIZE/2)WINDOW_ARRAY_out(i,j) = 1;endendoutput = WINDOW_ARRAY_out;
end

这篇关于matlab自编腐蚀算法，区域增长的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！


http://www.chinasem.cn/article/1129240。

相关文章

不懂推荐算法也能设计推荐系统

不懂推荐算法也能设计推荐系统

本文以商业化应用推荐为例，告诉我们不懂推荐算法的产品，也能从产品侧出发， 设计出一款不错的推荐系统。 相信很多新手产品，看到算法二字，多是懵圈的。 什么排序算法、最短路径等都是相对传统的算法（注：传统是指科班出身的产品都会接触过）。但对于推荐算法，多数产品对着网上搜到的资源，都会无从下手。特别当某些推荐算法 和 “AI”扯上关系后，更是加大了理解的难度。 但，不了解推荐算法，就无法做推荐系
阅读更多...
康拓展开（hash算法中会用到）

康拓展开（hash算法中会用到）

康拓展开是一个全排列到一个自然数的双射（也就是某个全排列与某个自然数一一对应） 公式： X=a[n]*(n-1)!+a[n-1]*(n-2)!+...+a[i]*(i-1)!+...+a[1]*0! 其中,a[i]为整数,并且0<=a[i]<i,1<=i<=n。（a[i]在不同应用中的含义不同）； 典型应用： 计算当前排列在所有由小到大全排列中的顺序，也就是说求当前排列是第
阅读更多...
csu 1446 Problem J Modified LCS （扩展欧几里得算法的简单应用）

csu 1446 Problem J Modified LCS （扩展欧几里得算法的简单应用）

这是一道扩展欧几里得算法的简单应用题，这题是在湖南多校训练赛中队友ac的一道题，在比赛之后请教了队友，然后自己把它a掉 这也是自己独自做扩展欧几里得算法的题目 题意：把题意转变下就变成了：求d1*x - d2*y = f2 - f1的解,很明显用exgcd来解 下面介绍一下exgcd的一些知识点：求ax + by = c的解 一、首先求ax + by = gcd(a,b)的解 这个
阅读更多...
综合安防管理平台LntonAIServer视频监控汇聚抖动检测算法优势

综合安防管理平台LntonAIServer视频监控汇聚抖动检测算法优势

LntonAIServer视频质量诊断功能中的抖动检测是一个专门针对视频稳定性进行分析的功能。抖动通常是指视频帧之间的不必要运动，这种运动可能是由于摄像机的移动、传输中的错误或编解码问题导致的。抖动检测对于确保视频内容的平滑性和观看体验至关重要。 优势 1. 提高图像质量 - 清晰度提升：减少抖动，提高图像的清晰度和细节表现力，使得监控画面更加真实可信。 - 细节增强：在低光条件下，抖
阅读更多...
【数据结构】——原来排序算法搞懂这些就行，轻松拿捏

【数据结构】——原来排序算法搞懂这些就行，轻松拿捏

前言：快速排序的实现最重要的是找基准值，下面让我们来了解如何实现找基准值 基准值的注释：在快排的过程中，每一次我们要取一个元素作为枢纽值，以这个数字来将序列划分为两部分。 在此我们采用三数取中法，也就是取左端、中间、右端三个数，然后进行排序，将中间数作为枢纽值。 快速排序实现主框架： //快速排序 void QuickSort(int* arr, int left, int rig
阅读更多...
poj 3974 and hdu 3068 最长回文串的O（n）解法(Manacher算法)

poj 3974 and hdu 3068 最长回文串的O（n）解法(Manacher算法)

求一段字符串中的最长回文串。 因为数据量比较大，用原来的O（n^2）会爆。 小白上的O(n^2)解法代码：TLE啦~ #include<stdio.h>#include<string.h>const int Maxn = 1000000;char s[Maxn];int main(){char e[] = {"END"};while(scanf("%s", s) != EO
阅读更多...
秋招最新大模型算法面试，熬夜都要肝完它

秋招最新大模型算法面试，熬夜都要肝完它

💥大家在面试大模型LLM这个板块的时候，不知道面试完会不会复盘、总结，做笔记的习惯，这份大模型算法岗面试八股笔记也帮助不少人拿到过offer ✨对于面试大模型算法工程师会有一定的帮助，都附有完整答案，熬夜也要看完，祝大家一臂之力 这份《大模型算法工程师面试题》已经上传CSDN，还有完整版的大模型 AI 学习资料，朋友们如果需要可以微信扫描下方CSDN官方认证二维码免费领取【保证100%免费
阅读更多...
dp算法练习题【8】

dp算法练习题【8】

不同二叉搜索树 96. 不同的二叉搜索树 给你一个整数 n ，求恰由 n 个节点组成且节点值从 1 到 n 互不相同的 二叉搜索树 有多少种？返回满足题意的二叉搜索树的种数。 示例 1： 输入：n = 3输出：5 示例 2： 输入：n = 1输出：1 class Solution {public int numTrees(int n) {int[] dp = new int
阅读更多...
Codeforces Round #240 (Div. 2) E分治算法探究1

Codeforces Round #240 (Div. 2) E分治算法探究1

Codeforces Round #240 (Div. 2) E  http://codeforces.com/contest/415/problem/E 2^n个数，每次操作将其分成2^q份，对于每一份内部的数进行翻转(逆序)，每次操作完后输出操作后新序列的逆序对数。 图一：  划分子问题。 图二： 分而治之，=>  合并 。 图三： 回溯：
阅读更多...
最大公因数：欧几里得算法

最大公因数：欧几里得算法

简述         求两个数字 m和n 的最大公因数，假设r是m%n的余数，只要n不等于0，就一直执行 m=n，n=r 举例 以18和12为例 m n r18 % 12 = 612 % 6 = 06 0所以最大公因数为：6 代码实现 #include<iostream>using namespace std;/
阅读更多...

Copyright China编程 23002807@qq.com

沪ICP备2023033072号-2