Depth-first iterative-deepening: an optimal admissible tree search
Artificial Intelligence
Solving jigsaw puzzles by computer
Annals of Operations Research
Iterative-deepening-A: an optimal admissible tree search
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 2
Angle Detection on Digital Curves
IEEE Transactions on Computers
| Hi-index | 0.00 |
In the field of archaeology, reconstruction of earthenware imposes a heavy task on archaeologists. In order to reduce their task, we have developed a system, which can automatically reconstruct earthenware from given potsherds. The system is required to detect a pair of segments to join from potsherds correctly, by evaluation of salient values for shape of its contours. In existent method, the salient values are calculated with fixed precision. The calculation, thereby, makes the system computationally very expensive, when the number of potsherds increases. In this paper, we introduce search control, iterative deepening, into joint detection, and propose JDID (Joint Detection with Iterative Deepening), which can efficiently detect a pair of segments to join by dynamically changing its precision of salient value calculation; depending upon complexity of shape of potsherds. We have also implemented an earthenware reconstruction system and performed drastic speedup of the reconstruction.