Fractured Surfaces Matching for Reassembling Broken Solids
A fractured surfaces matching algorithm for reassembling broken solids is proposed. The algorithm first defines point bumpiness based on integral invariants that is robust to noise. Using the bumpiness feature points are picked from fractured surface. Subsequently initial matching point pairs are obtained by comparing multi-scale integral invariants of feature points and outliers are discarded according to surface patches similarity based on compatibility constraint. Finally, a fast and efficient hierarchical greedy algorithm is employed to align the two fractured surfaces and measure if they are matched using surface distance. The algorithm is also suited for matching arbitrary surfaces which contain rich feature points.
fractured surfaces matching integral invariants bumpiness compatibility constraint hierarchical greedy algorithm
Qunhui Li Mingquan Zhou Guohua Geng
School of Information Science and Technology, Northwest University, Xian, China School of Science, College of Information Science and Technology, Beijing Normal University, Beijing, China School of Information Science and Technology, Northwest University, Xian, China
国际会议
杭州
英文
1089-1092
2012-10-28(万方平台首次上网日期,不代表论文的发表时间)