Please use this identifier to cite or link to this item:
Type: Artigo de periódico
Title: Exploring heuristic and optimum branching algorithms for image phylogeny
Author: Dias, Z
Goldenstein, S
Rocha, A
Abstract: 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.
Subject: Image phylogeny tree
Image phylogeny
Image dependencies
Image's ancestry relationships
Near-duplicate detection and recognition
Near-duplicates kinship
Oriented prim algorithm
Chu-Liu, Bock and Edmonds algorithm
Country: EUA
Editor: Academic Press Inc Elsevier Science
Citation: Journal Of Visual Communication And Image Representation. Academic Press Inc Elsevier Science, v. 24, n. 7, n. 1124, n. 1134, 2013.
Rights: fechado
Identifier DOI: 10.1016/j.jvcir.2013.07.011
Date Issue: 2013
Appears in Collections:Unicamp - Artigos e Outros Documentos

Files in This Item:
There are no files associated with this item.

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.