Eigenspace-based surface completeness

Hongchuan Yu; Yipeng Qin; Jian J. Zhang

doi:10.1117/1.JEI.24.2.023037

28 April 2015 Eigenspace-based surface completeness

Hongchuan Yu, Yipeng Qin, Jian J. Zhang

Author Affiliations +

Journal of Electronic Imaging, Vol. 24, Issue 2, 023037 (April 2015). https://doi.org/10.1117/1.JEI.24.2.023037

Abstract

We present a surface completeness algorithm that is capable of denoising, removing outliers, and filling in missing patches on point clouds or surfaces. The main advantages of the proposed algorithm include its ability to remove outliers while preserving the details and ability to recover large missing patches. Additionally, our algorithm is a global method, whereby linear programming results are applied to a global optimization problem. This is advantageous because it yields a sparse solution and avoids local minima. Experiments further demonstrate the effectiveness of our algorithm through applications to point clouds where noise, outliers, and large missing patches exist.

Citation Download Citation

Hongchuan Yu, Yipeng Qin, and Jian J. Zhang "Eigenspace-based surface completeness," Journal of Electronic Imaging 24(2), 023037 (28 April 2015). https://doi.org/10.1117/1.JEI.24.2.023037

Published: 28 April 2015

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available