Abstract
Reassembling unknown broken objects from a large collection of fragments is a common problem in archaeology and other fields. Computer tools have recently been developed, by the authors and by others, which try to help by identifying pairs of fragments with matching outline shapes. Those tools have been successfully tested on small collections of fragments; here we address the question of whether they can be expected to work also for practical instances of the problem (103 to 105 fragments). To that end, we describe here a method to measure the average amount of information contained in the shape of a fracture line of given length. This parameter tells us how many false matches we can expect to find for it among a given set of fragments. In particular, the numbers we obtained for ceramic fragments indicate that fragment outline comparison should give useful results even for large instances of the problem.
Similar content being viewed by others
References
Barequet, G. and Sharir, M. 1997. Partial surface and volume matching in three dimensions. IEEE Trans. on Pattern Analysis and Machine Intelligence, 19(9):929–948.
Barequet, G. and Sharir, M. 1999. Partial surface matching by using directed footprints. Computational Geometry: Theory and Appls., 12:45–62.
Brown, C.A., Charles, P.D., Johnsen, W.A., and Chesters, S. 1993. Fractal analysis of topographic data by the patchwork method. Wear, 161:61–67.
Brown, C.A. and Hoch, P. 1997. Information content in surface metrology for functional correlations. In Proc. of the 12th Annual Meeting of the American Society for Precision Engineering, American Society for Precision Engineering, pp. 118–121.
Burdea, G.C. and Wolfson, H.J. 1989. Solving jigsaw puzzles by a robot. IEEE Trans. on Robotics and Automation, 5(6):752–764.
Kampel, M. and Sablatnig, R. 2003. Profile-based pottery reconstruction. In Proc. of the IEEE/CVPR Workshop on Appls. of Computer Vision in Archaeology (ACVA'03).
Lathi, B.P. 1998. Modern Digital and Analog Communications Systems. Oxford Univ. Press.
Leitão, H.C.G. 1999. Reconstrução Automática de Objetos Fragmentados. PhD thesis, Institute of Computing, University of Campinas, (in Portuguese).
Leitão, H.C.G. and Stolfi, J. 2000, Information contents of fracture lines. In Proc. WSCG '2000 — The 8th International Conference in Central Europe on Computer Graphics, Visualization, and Interactive Digital Media, Univ. of West Bohemia Press, vol. 2, pp. 389–395.
Leitão, H.C.G. and Stolfi, J. 2002. A multiscale method for the reassembly of two-dimensional fragmented objects. IEEE Trans. on Pattern Analysis and Machine Intelligence, 24(9):1239–1251.
Levoy, M. 1999. Scanning the fragments of the Forma Urbis Romae. WWW document at http://www.graphics.Stanford.edu/projects/mich/forma-urbis/forma-urbis.html/.
McBride, J.C. and Kimia, B.B. 2003. Archaeological fragment re-assembly using curve-matching. In Proc. of the IEEE/CVPR Workshop on Appls. of Computer Vision in Archaeology (ACVA'03).
Papaioannou, G. and Karabassi, E.A. 2003. On the automatic assemblage of arbitrary broken solid artefacts. Image & Vision Computing, 21(5):401–412.
Papaioannou, G., Karabassi, E.A., and Theoharis, T. 2002. Reconstruction of three-dimensional objects through matching of their parts. IEEE Trans. on Pattern Analysis and Machine Intelligence, 24(1):114–124.
Taylor, R.I. and Lewis, P.H. 1994. 2D shape signature based on fractal measurements. IEE Proc.—Vision, Image & Signal Processing, 141(6):422–430.
Üçoluk, G. and Toroslu, I.H. 1999. Automatic reconstruction of broken 3-D surface objects. Computers & Graphics, 23(4):573–582.
Wolfson, H.J. 1990. On curve matching. IEEE Trans. on Pattern Analysis and Machine Intelligence, 12(5):483–489.
Wolfson, H.J. and Rigoutsos, I. 1997. Geometric hashing: An overview. IEEE Computational Science and Engineering, 4(4):10–21.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Leitão, H.C.G., Stolfi, J. Measuring the Information Content of Fracture Lines. Int J Comput Vision 65, 163–174 (2005). https://doi.org/10.1007/s11263-005-3226-8
Received:
Revised:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s11263-005-3226-8