Efficient image duplicated region detection model using sequential block clustering

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985556%3A_____%2F13%3A00393155" target="_blank" >RIV/67985556:_____/13:00393155 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.1016/j.diin.2013.02.007" target="_blank" >http://dx.doi.org/10.1016/j.diin.2013.02.007</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1016/j.diin.2013.02.007" target="_blank" >10.1016/j.diin.2013.02.007</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Efficient image duplicated region detection model using sequential block clustering

Popis výsledku v původním jazyce

Apart from robustness and accuracy of copy?paste image forgery detection, time complexity also plays an important role to evaluate the performance of the system. In this paper, the focus point is to improve time complexity of the block-matching algorithm. Hence, a coarse-to-fine approach is applied to propose an enhanced duplicated region detection model by using sequential block clustering. Clustering minimizes the search space in block matching. This significantly improves time complexity as it eliminates several extra block-comparing operations. We determine time complexity function of the proposed algorithm to measure the performance. The experimental results and mathematical analysis demonstrate that our proposed algorithm has more improvement intime complexity when the block size is small.

Název v anglickém jazyce

Efficient image duplicated region detection model using sequential block clustering

Popis výsledku anglicky

Apart from robustness and accuracy of copy?paste image forgery detection, time complexity also plays an important role to evaluate the performance of the system. In this paper, the focus point is to improve time complexity of the block-matching algorithm. Hence, a coarse-to-fine approach is applied to propose an enhanced duplicated region detection model by using sequential block clustering. Clustering minimizes the search space in block matching. This significantly improves time complexity as it eliminates several extra block-comparing operations. We determine time complexity function of the proposed algorithm to measure the performance. The experimental results and mathematical analysis demonstrate that our proposed algorithm has more improvement intime complexity when the block size is small.

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

—

Návaznosti

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2013

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

Digital Investigation

ISSN

1742-2876

e-ISSN

—

Svazek periodika

10

Číslo periodika v rámci svazku

1

Stát vydavatele periodika

NL - Nizozemsko

Počet stran výsledku

11

Strana od-do

73-84

Kód UT WoS článku

000318997700008

EID výsledku v databázi Scopus

—