DEVELOPMENT OF AN ALGORITHMIC PROCEDURE FOR THE DETECTION OF CONJUGATE FRAGMENTS
The rapid development of Computer Vision has contributed to the widening of the techniques and methods utilized by archaeologists for the digitization and reconstruction of historic objects by automating the matching of fragments, small or large. This paper proposes a novel method for the detection...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Copernicus Publications
2013-07-01
|
| Series: | ISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences |
| Online Access: | http://www.isprs-ann-photogramm-remote-sens-spatial-inf-sci.net/II-5-W1/127/2013/isprsannals-II-5-W1-127-2013.pdf |
| Summary: | The rapid development of Computer Vision has contributed to the widening of the techniques and methods utilized by archaeologists
for the digitization and reconstruction of historic objects by automating the matching of fragments, small or large. This paper
proposes a novel method for the detection of conjugate fragments, based mainly on their geometry. Subsequently the application of
the <i>Fragmatch</i> algorithm is presented, with an extensive analysis of both of its parts; the global and the partial matching of surfaces.
The method proposed is based on the comparison of vectors and surfaces, performed linearly, for simplicity and speed. A series of
simulations have been performed in order to test the limits of the algorithm for the noise and the accuracy of scanning, for the
number of scan points, as well as for the wear of the surfaces and the diversity of shapes. Problems that have been encountered
during the application of these examples are interpreted and ways of dealing with them are being proposed. In addition a practical
application is presented to test the algorithm in real conditions. Finally, the key points of this work are being mentioned, followed by
an analysis of the advantages and disadvantages of the proposed <i>Fragmatch</i> algorithm along with proposals for future work. |
|---|---|
| ISSN: | 2194-9042 2194-9050 |