Non-manifold curve reconstruction based on l1 minimization

被引:0
作者
机构
[1] Department of Computer Science and Technology, Beihang University
来源
Luo, P. (areslp@cse.buaa.edu.cn) | 1917年 / Science Press卷 / 36期
关键词
Compressive sensing; Curve reconstruction; l[!sub]1[!/sub] minimization; Non-manifold curve;
D O I
10.3724/SP.J.1016.2013.01917
中图分类号
学科分类号
摘要
Curve reconstruction from unorganized points is widely used in various fields such as computer vision, reverse engineering and medical image processing, among which non-manifold curve reconstruction is a difficult problem. In this paper, an l1 norm minimization method is proposed for non-manifold curve reconstruction based on compressive sensing theory. First, we give the sparse representation of the points' normals and locations, and restore them via l1 norm optimization. Then, the restored normals and positions are used to calculate the bilateral weights and build a minimum spanning tree on them. Finally, post-processing is performed to manage the open and close states of the curves. Experiments show that the algorithm is robust to noise and can handle complex family of curves which contains open/closed curves, manifold/non-manifold curves and curves with sharp features.
引用
收藏
页码:1917 / 1928
页数:11
相关论文
共 37 条
  • [1] Boissonnat J., Geometric structures for three-dimensional shape representation, ACM Transactions on Graphics (TOG), 3, 4, pp. 266-286, (1984)
  • [2] Edelsbrunner H., Kirkpatrick D., Seidel R., On the shape of a set of points in the plane, IEEE Transactions on Information Theory, 29, 4, pp. 551-559, (2002)
  • [3] Amenta N., Bern M., Eppstein D., The crust and the beta-skeleton: Combinatorial curve reconstruction, Graphical Models and Image Processing, 60, 2, pp. 125-135, (1998)
  • [4] Kirkpatrick D., Radke J., A framework for computational morphology, Computational Geometry, 85, pp. 217-248, (1985)
  • [5] Veltkamp R., The gamma-neighborhood graph, Computational Geometry, 1, 4, pp. 227-246, (1992)
  • [6] Attali D., r-regular shape reconstruction from unorganized points, Computational Geometry, 10, 4, pp. 239-247, (1998)
  • [7] Dey T.K., Wenger R., Fast reconstruction of curves with sharp corners, International Journal of Computational Geometry & Applications, 12, 5, pp. 353-400, (2002)
  • [8] Nguyen T.A., Zeng Y., Vicur: A human-vision-based algorithm for curve reconstruction, Robotics and Computer-Integrated Manufacturing, 24, 6, pp. 824-834, (2008)
  • [9] Ouyang D.S., Feng H.Y., Reconstruction of 2D polygonal curves and 3D triangular surfaces via clustering of delaunay circles/spheres, Computer-Aided Design, 43, 8, pp. 839-847, (2011)
  • [10] Hoppe H., Derose T., Duchamp T., Et al., Surface reconstruction from unorganized points, Proceedings of the ACM SIGGRAPH, pp. 71-78, (1992)