计算机辅助设计与图形学学报
計算機輔助設計與圖形學學報
계산궤보조설계여도형학학보
Journal of Computer-Aided Design & Computer Graphics
2015年
10期
1865-1873
,共9页
胡大盟%黄伟国%杨剑宇%朱忠奎
鬍大盟%黃偉國%楊劍宇%硃忠奎
호대맹%황위국%양검우%주충규
离散曲线演化%轮廓变形%动态规划%形状匹配
離散麯線縯化%輪廓變形%動態規劃%形狀匹配
리산곡선연화%륜곽변형%동태규화%형상필배
discrete curve evolution%contour deformation%dynamic programming%shape matching
为了在形状匹配的过程中提高形状特征对边界噪声和图像变形的鲁棒性,同时兼顾形状匹配算法的检索精度和运算效率,提出一种基于离散曲线演化的形状匹配算法。首先利用改进的离散曲线演化算法对形状轮廓进行特征提取,获得具有重要视觉部件的轮廓;然后计算该轮廓的形状上下文特征描述符;最后利用动态规划算法计算形状上下文特征描述符的相似度。通过在MPEG-7, Kimia以及Swedish Leaf形状数据库上的实验结果表明,该算法对变形目标具有良好的鲁棒性,且提高了运算效率和匹配精度。此外,改进的离散曲线演化算法可与不同形状描述子融合形成新的形状匹配算法。
為瞭在形狀匹配的過程中提高形狀特徵對邊界譟聲和圖像變形的魯棒性,同時兼顧形狀匹配算法的檢索精度和運算效率,提齣一種基于離散麯線縯化的形狀匹配算法。首先利用改進的離散麯線縯化算法對形狀輪廓進行特徵提取,穫得具有重要視覺部件的輪廓;然後計算該輪廓的形狀上下文特徵描述符;最後利用動態規劃算法計算形狀上下文特徵描述符的相似度。通過在MPEG-7, Kimia以及Swedish Leaf形狀數據庫上的實驗結果錶明,該算法對變形目標具有良好的魯棒性,且提高瞭運算效率和匹配精度。此外,改進的離散麯線縯化算法可與不同形狀描述子融閤形成新的形狀匹配算法。
위료재형상필배적과정중제고형상특정대변계조성화도상변형적로봉성,동시겸고형상필배산법적검색정도화운산효솔,제출일충기우리산곡선연화적형상필배산법。수선이용개진적리산곡선연화산법대형상륜곽진행특정제취,획득구유중요시각부건적륜곽;연후계산해륜곽적형상상하문특정묘술부;최후이용동태규화산법계산형상상하문특정묘술부적상사도。통과재MPEG-7, Kimia이급Swedish Leaf형상수거고상적실험결과표명,해산법대변형목표구유량호적로봉성,차제고료운산효솔화필배정도。차외,개진적리산곡선연화산법가여불동형상묘술자융합형성신적형상필배산법。
To solve the problem of contour noise and deformation in shape matching, a new shape matching algorithm combining N-DCE, SC and DP for retrieval accuracy and computational efficiency, is proposed based on discrete curve evolution(DCE). This algorithm includes 3 steps: the object contour evolved adap-tively by N-DCE and contour information including important visual parts extracted; the costing feature de-scriptor computed by Shape Contexts; shape distance similarity measured by DP algorithm based on SC costing descriptor. The experimental results of MPEG-7, Kimia and Swedish Leaf shape database indicate that this algorithm is robust to the contour deformation, and the computational efficiency and the retrieval accuracy are all essentially improved. It is worth mentioning that the modified discrete curve evolution al-gorithm can be fused with different shape descriptors to form a new shape matching algorithm.