Exploring heuristic and optimum branching algorithms for image phylogeny

Autor(es)

Dias, Zanoni ^[1] ; Goldenstein, Siome ^[1] ; Rocha, Anderson ^[1]

Afiliação do(s) autor(es)

^[1] Univ Estadual Campinas, Inst Comp, BR-13083970 Campinas, SP - Brazil

• Tipo de documento: Artigo Científico
• Fonte: JOURNAL OF VISUAL COMMUNICATION AND IMAGE REPRESENTATION; v. 24, n. 7, p. 1124-1134, OCT 2013.
• Citações Web of Science: 20

Resumo

Currently, multimedia objects can be easily created, stored, (re)-transmitted, and edited for good or bad. In this sense, there has been an increasing interest in finding the structure of temporal evolution within a set of documents and how documents are related to one another overtime. This process, also known in the literature as Multimedia Phylogeny, aims at finding the phylogeny tree(s) that best explains the creation process of a set of near-duplicate documents (e.g., images/videos) and their ancestry relationships. Solutions to this problem have direct applications in forensics, security, copyright enforcement, news tracking services and other areas. In this paper, we explore one heuristic and one optimum branching algorithm for reconstructing the evolutionary tree associated with a set of image documents. This can be useful for aiding experts to track the source of child pornography image broadcasting or the chain of image distribution in time, for instance. We compare the algorithms with the state-of-the-art solution considering 350,000 test cases and discuss advantages and disadvantages of each one in a real scenario. (C) 2013 Elsevier Inc. All rights reserved. (AU)

• Processo FAPESP: 10/05647-4 - Computação forense e criminalística de documentos: coleta, organização, classificação e análise de evidências
• Beneficiário: Anderson de Rezende Rocha
• Linha de fomento: Auxílio à Pesquisa - Apoio a Jovens Pesquisadores