区域生长法的编程实现程序员数字图像处理第一步.docxVIP

数字图像处理的书数不胜数。相关的方法，从直方图、卷积到小波、机器学习方面的方法也举不胜举。OpenCV库给我们提供了一整套图像存储、显示方法外，也集成了很多很多的图像、视频处理算法以及机器学习算法，以函数的形式提供给我们使用。然而在初学阶段，我们往往过分依赖于OpenCV中的那些库函数。虽说OpenCV集成了很多高效算法，然而，毕竟不是无所不包。OpenCV中基础的算法有时会缺失，有时用起来不是很得心应手。区域生长算法就是一例。区域生长法，思路很简单：将一个图像中的一点作为种子，此种子会沿8邻域/4邻域进行扩展，扩展具有一定限制（即差值不能过大，当然你可以引入梯度这个概念，甚至二维偏导数……），求出种子生长的最终结果。把示例程序的几张结果发过来，何谓区域生长法，大家一看便知。区域生长法对于较为均衡的背景中提取目标物而言，效果较为理想。与阈值法、边缘检测法孰优孰劣，俺笔力及精力有限，不进行比较了。单从工程角度，区域生长法是统计闭合图形个数的基础。这里自己写了一下这个程序的演示代码，只负责将背景同生长不上去的区域分开：[cpp]?view plaincopy#define?INIT?0????#define?SEED?-1????#define?CONT?-2????#define?INVAL?-3??????int?color_templ[5*6*3]??=?{??????0,0,0,??????40,40,40,???80,80,80,???120,120,120,160,160,160,????200,200,200,??????76,0,13,????113,52,0,???127,91,0,???188,114,0,??203,140,68,?????236,211,190,??????0,0,121,????93,0,158,???91,20,237,??255,61,255,?170,110,240,????200,161,245,??????38,88,0,????77,118,46,??66,130,98,??112,182,46,?118,197,124,????174,221,178,??????19,57,96,???10,98,163,??0,160,171,??0,242,255,??59,245,255,?????139,247,255??};????class?g_point????{????public:????????g_point();????????g_point(int?x_i,?int?y_i);????????g_point(int?x_i,?int?y_i,?int?lbl_i);????public:????????int?x;????????int?y;????????int?lbl;??????//标签????};??????g_point::g_point(int?x_i,?int?y_i)????{????????x?=?x_i;????????y?=?y_i;????????lbl?=?SEED;????}??????g_point::g_point()????{????????x?=?0;????????y?=?0;????????lbl?=?INIT;????}??????g_point::g_point(int?x_i,?int?y_i,?int?lbl_i)????{????????x?=?x_i;????????y?=?y_i;????????lbl?=?lbl_i;????}??????void?regionGrowth(IplImage*?img,?int*?p_mat,?int?x_g,?int?y_g,?int?threshold_g)????{????????//常用变量：????????int?x;????????int?y;????????int?gradient?=?0;????????????//设置前次边缘点????????std::listclass?g_point?cont_pts_pre;????????std::listclass?g_point?*?pcont_pts_pre?=?cont_pts_pre;??????????//设置边缘点????????std::listclass?g_point?cont_pts;????????std::listclass?g_point?*?pcont_pts?=?cont_pts;??????????//种子点+边缘点?=?下次的种子点????????//上次的边缘点?=?前次边缘点（用于下次减少点数)?????????cont_pts_pre.push_back(class?g_poin