基于邻接表的分水岭变换快速区域合并算法.pdf

2008 11 November 200 8 34 11 Journa l o f Be ijing Un iv ers ity o f A eronautics and A stronautics V ol 34 N o11 李苏祺 张广军 ( , 10019 1) : 针对图像分水岭变换存在的过分割问题, 提出了一种快速区域 并算法 该 算法先对梯度图像进行L ee滤波以降低分水岭变换的过分割程度, 在传统分水岭变换初步分 割的基础上, 利用区域邻接图( RAG, R eg ion A djacency Graph ) 的邻接表数据结构描述过分割 区域之间的关系, 采用分级阈值 并的方式完成区域 并, 以降低 并计算的复杂度 并过 程中, 将基于区域相对边界强度和边界长度的相似度度量准则与传统的区域灰度均值差异度 准则相结 , 构成新的区域可 并度综 评价函数, 以保证区域 并准确可靠 实验结果表明, 与传统的分水岭变换区域 并算法相比, 该算法有效地提高了区域 并的准确性, 并大幅提升 了运算速度 : 图像分割; 分水岭; 过分割; 区域 并; 区域邻接图 : TP 391 41 : A : ( 2008) Fast reg ion me rg ing a lgo rithm fo rw ate rshed transfo rm based on ad jacency list L i Suqi Zh ang Gu angjun ( School of Instrum en t Science and O p toelectron ics Engineering, B eijing U n ivers ity of A eronau tics and A stronaut ics, Beij ing 100 19 1, Ch in a) Abstract: A fast reg ion m erging algo rithm w as proposed to so lve the oversegm en tation prob lem produ ced by the w atershed tran sform for mi age segm entation F irstly, the grad ient mi age w as preprocessed w ith Lee filter to reduce the oversegm entat ion in itially Then the reg ion ad jacency graph ( RAG ) w ith its adjacency list o f da ta structure w as used to represent the mi age partition s after the in itial partit ion ing w ith the c lassica l w atershed tran sform On the basis o f the adjacency lists the reg ion m erg ing process fo llow ed a wt ostep thresho ld m erg ing strategy in order to reduce the com putat ion com plex ity A hybrid reg ion d issmi ilarity function w as presented to m easure the degree of smi