Noise Robust Surface Reconstruction by Combining PU and Graph-cut
| dc.contributor.author | Nagai, Yukie | en_US |
| dc.contributor.author | Ohtake, Yutaka | en_US |
| dc.contributor.author | Suzuki, Hiromasa | en_US |
| dc.contributor.editor | P. Alliez and M. Magnor | en_US |
| dc.date.accessioned | 2015-07-09T11:07:39Z | |
| dc.date.available | 2015-07-09T11:07:39Z | |
| dc.date.issued | 2009 | en_US |
| dc.description.abstract | We present a novel method of reconstructing surfaces from 3D scattered points by combining Partition of Unity (PU) and a Graph-cut approach. PU is a local approximation technique, meaning that the surfaces obtained have high accuracy but are sensitive to noise. Graph-cut, on the other hand, is a global algorithm that is robust to noise but produces low-accuracy results because it is a discrete binary operation. Our algorithm combines these two methods to achieve robust, high accuracy surface reconstruction. First, a PU implicit function is constructed by covering a space containing a point cloud with spherical supports of linear polynomials. Graph-cut is then performed to separate the covered domain into inside and outside areas of the object to be reconstructed. Finally, we extract the zero-level of PU using the marching tetrahedra approach. | en_US |
| dc.description.sectionheaders | Geometry and Images | en_US |
| dc.description.seriesinformation | Eurographics 2009 - Short Papers | en_US |
| dc.identifier.doi | 10.2312/egs.20091052 | en_US |
| dc.identifier.pages | 73-76 | en_US |
| dc.identifier.uri | https://doi.org/10.2312/egs.20091052 | en_US |
| dc.publisher | The Eurographics Association | en_US |
| dc.title | Noise Robust Surface Reconstruction by Combining PU and Graph-cut | en_US |
Files
Original bundle
1 - 1 of 1