Inspection Planning for Optimized Coverage of Geometrically Complex Surfaces

Mohammadikaji, Mahsa; Bergmann, Stephan; Irgenfried, Stephan; Beyerer, Jürgen; Dachsbacher, Carsten; Wörn, Heinz

doi:10.1109/metroi4.2018.8428313

Cited by 6 publications

(6 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Choosing the best viewpoint candidates that, when used in conjunction, provide full coverage of the object, is equivalent to the mathematical set cover problem. 6,28 The set cover problem in the context of view planning states that the goal is to find the best subset from a set of given viewpoints, which provides the highest coverage of an object while maintaining low cardinality. This problem is often solved using a greedy algorithm, as it was identified to be the best polynomial time approximation to the problem and there is no method that systematically outperforms it.…”

Section: Viewpoint Selectionmentioning

confidence: 99%

“…This problem is often solved using a greedy algorithm, as it was identified to be the best polynomial time approximation to the problem and there is no method that systematically outperforms it. 26,28,29 Englot and Hover use both the greedy algorithm and a linear programming relaxation algorithm independently for set cover solving due to their effectiveness and good approximation results. They note that the computational effort for using the linear programming relaxation method is more expensive than that of the greedy algorithm.…”

Section: Viewpoint Selectionmentioning

confidence: 99%

“…Choosing the best viewpoint candidates that, when used in conjunction, provide full coverage of the object, is equivalent to the mathematical set cover problem. 6,28…”

Section: State Of the Artmentioning

confidence: 99%

See 2 more Smart Citations

Model based view planning for the robot-guided automation of optical 3D digitization based on a variable mesh resolution processing approach

Geiger

Sauerbier

Montavon

et al. 2022

Proceedings of the Institution of Mechanical Engineers, Part B:

View full text Add to dashboard Cite

The digital 3D representation of manufactured parts plays a crucial role in the quality assurance of small, individualized lot sizes. Machine vision systems, such as optical 3D scanners, guided by an industrial robotic arm, allow for a contactless full digital reconstruction of surface geometries. In order to digitize the whole geometry, it is necessary to acquire 3D scans from multiple viewpoints with respect to the part, which in combination cover the entire surface. With efficiency in mind, this results in an optimization problem between a high surface area coverage and low measurement effort, referred to as the view planning problem. In the presented work, two popular viewpoint candidate generation methods are implemented: Firstly, a surface-based random sampling method, which generates viewpoints within a solution space, in which visibility of a given model surface can be expected. Secondly, a view sphere viewpoint generation approach, which is independent of the object geometry but avoids clustering by generating evenly spaced viewpoints on a sphere around the centre of the object. Using an adjustable remeshing procedure, a multi-stage approach is implemented by generating multiple meshes with different resolutions. Through this, the benefits of working on a coarse mesh, such as fast viewpoint candidate evaluation and selection, are combined with the level of detail of a fine mesh. It is found that it is possible to considerably reduce the mesh resolution while maintaining a reasonably high surface area coverage on a reference model. Applying the proposed procedure to the view planning for a state-of-the-art 3D fringe light projection scanner with highly sophisticated scanning capabilities, it is demonstrated that the view sphere approach is more suitable for this use-case due to the large measurement volumes of the 3D scanner. The frequently used random sampling approach requires an excessively higher computational effort to achieve similar results in comparison.

show abstract

Section: Viewpoint Selectionmentioning

confidence: 99%

Section: Viewpoint Selectionmentioning

confidence: 99%

See 1 more Smart Citation

Model based view planning for the robot-guided automation of optical 3D digitization based on a variable mesh resolution processing approach

Geiger

Sauerbier

Montavon

et al. 2022

Proceedings of the Institution of Mechanical Engineers, Part B:

View full text Add to dashboard Cite

show abstract

“…So far it has been observed from an optimization point of view, researching various approaches to deal with the complexity of the planning problem. [5], [6], [10], [17], [18] focused onto finding a single optimal solution on how to inspect an object, given its 3D model. In simple terms, how should the acquisition system be designed, relative to the object, in order to inspect it completely.…”

Section: Related Workmentioning

confidence: 99%

“…[5], [6], [17] and [18] offered approaches to determine viable camera placement. However, by providing both camera and illumination placement, Mohammadikaji et al [10] were the only ones to succeeded in producing an inspection plan containing all primary variables. Their method, however, comes with a restriction of high computational cost and is hard to generalize to a wide variety of objects.…”

Section: Related Workmentioning

confidence: 99%

Surface Inspection Planning Using 3D Visualization

Gospodnetić¹,

Rauhut²,

Hagen³

2020

Preprint

View full text Add to dashboard Cite

State of the art surface inspection planning requires an expert approach with a lot of trial and error. Because of the lack of available aiding tools, an engineer building inspection systems must rely heavily on his or her experience. In this work we proposed an interactive 3D visualization tool to help an engineer determine good viewpoints. It can be used both as a standalone tool for manual viewpoint placement or as an interface to the inspection planning algorithms giving the engineer a possibility to evaluate and modify automatically generated plans.

show abstract