Context-based surface completion

Abstract

Figure 1: Completing a hole in a point-based model. In the darker colored region we removed sample points to demonstrate the surface completion technique. In the middle right the region is filled with a smooth patch conforming with the densely sampled areas, and the result of our context-based surface completion is on the right. AbstractSampling complex, real-world geometry with range scanning devices almost always yields imperfect surface samplings. These "holes" in the surface are commonly filled with a smooth patch that conforms with the boundary. We introduce a context-based method: the characteristics of the given surface are analyzed, and the hole is iteratively filled by copying patches from valid regions of the given surface. In particular, the method needs to determine best matching patches, and then, fit imported patches by aligning them with the surrounding surface. The completion process works top down, where details refine intermediate coarser approximations. To align an imported patch with the existing surface, we apply a rigid transformation followed by an iterative closest point procedure with nonrigid transformations. The surface is essentially treated as a point set, and local implicit approximations aid in measuring the similarity between two point set patches. We demonstrate the method at several point-sampled surfaces, where the holes either result from imperfect sampling during range scanning or manual removal.

Disocclusion of 3d Lidar Point Clouds Using Range Images

“…Disocclusion of a scene has only been scarcely investigated for 3D point clouds (Sharf et al, 2004, Park et al, 2005, Becker et al, 2009. These methods mostly work on complete point clouds rather than LiDAR point clouds.…”

Filling holes in meshes using a mechanical model to simulate the curvature variation minimization

“…In fact, most of these approaches do not use enough geometric information available on the surrounding mesh. This is not true for the context-based surface completion algorithm of [29] where the inner mesh is defined according to shapes that can be very far from the hole. But their process may lead to very unexpected results.…”

Efficient texture synthesis using strict Wang Tiles

“…We use the graph cut technique, which was originally used [16] to find a minimum cut-ting path and has since been extended to other applications in image and geometry processing, especially in texturing and video synthesis [16,2,27,28], foreground removal [29], image blending [30] and geometric processing [31,32]. The schematic diagram in Figure 7 shows a region of overlap between two image patches A and B.…”