Papers by Keyword: Hole Filling

Abstract: Filling holes in binary images is often required during medical image processing and analysis. However, traditional hole filling algorithms for medical images expose some disadvantages such as possible edge degradations and relatively low efficiency. To overcome such limits, a hole filling algorithm for binary cell images based on largest connected region extraction is proposed in this paper. Since there are less pixels for foreground areas in usual binary cell images, the holes in the binary images can be simply filled by extracting & filling the largest connected region in correspondent negative images together with a following OR operation between the obtained result image and the original binary image. Such an algorithm based on largest connected region extraction nearly has no effect on edge information of the ROI(region of interested) with high accuracy and efficiency. The final experiments show its validity and advantage over the traditional morphology methods for hole filling in binary cell images. Thus the presented method is of a considerable reference value for binary image processing.

Abstract: Aiming at filling the holes which were generated from uncompleted point cloud data in reverse engineering, a new hole filling algorithm in space is presented. Firstly, the holes boundary was identified and pretreated, and the hole boundary feature datum was established and the boundary was projected on it to form a projection polygon. Secondly, the smallest angle of the projection polygon was found out to determine the corresponding boundary point as the mesh growing point. The original hole was covered by the new meshes covering and then filling algorithm was completed. Finally, the neighborhood points of hole boundary vertex were selected as the sampling points for the least squares fitting adjustment of new filled vertices position, which aims at the preparation hole filled result. Examples are given to prove that the method has good accuracy and stability of the hole filling.

Abstract: In this paper, a novel hole-filling algorithm for triangular meshes is proposed. Firstly, the hole is triangulated into a set of new triangles using modified principle of minimum angle. Then the initial patching mesh is refined according to the density of vertices on boundary edges. Finally, the patching mesh is optimized via the bilateral filter to recover missed features. Experimental results demonstrate that the proposed algorithm fills complex holes robustly, and preserves geometric features to a certain extent as well.

Abstract: The existence of holes in vehicle object makes it difficult to extract the feature. existing hole-filling method are capable of filling holes on small and smooth regions of a object, for large holes whit complex boundaries or in curved region in vehicle object, they may not obtain the satisfactory results. For resolving this problem, a novel hole-filling algorithm based on horizontal scan line was proposed to fill arbitrary holes in vehicle object obtained from vehicle image. Experiments show that the algorithm has good performance and efficiency, and in the filling processing, the feature of the area and perimeter of an object can be obtained at the same time.

Abstract: An efficient mesh model repair method is proposed in this paper, which can repair the holes with boundary continuity. It is mainly composed of the following steps: Firstly, the hole boundary is triangulated to generate the initial surface patch, of which the edges are distributed along the boundary averagely similar to an curtain covering at a window. Secondly, the initial surface patch is refined, and the interior edges are relaxed while refining to get a Delaunay-like refinement surface patch, which approximates the density of the surrounding mesh. Finally, the refinement surface patch is reshaped based on the minimization of the surface energy solved by the order discrete Euler-Lagrange equation in order to realize the continuity repair. The proposed method is proved to be efficient and robust by experiments of different kinds of boundary conditions.