<?xml version="1.0" encoding="utf-8"?>
<?xml-stylesheet type="text/xsl" href="style/detail_T.xsl"?>
<bibitem type="J">   <ARLID>0393155</ARLID> <utime>20240103202640.2</utime><mtime>20130625235959.9</mtime>   <WOS>000318997700008</WOS>  <DOI>10.1016/j.diin.2013.02.007</DOI>           <title language="eng" primary="1">Efficient image duplicated region detection model using sequential block clustering</title>  <specification> <page_count>11 s.</page_count> <media_type>P</media_type> </specification>   <serial><ARLID>cav_un_epca*0311548</ARLID><ISSN>1742-2876</ISSN><title>Digital Investigation</title><part_num/><part_title/><volume_id>10</volume_id><volume>1 (2013)</volume><page_num>73-84</page_num><publisher><place/><name>Elsevier</name><year/></publisher></serial>    <keyword>Image forensic</keyword>   <keyword>Copy–paste forgery</keyword>   <keyword>Local block matching</keyword>    <author primary="1"> <ARLID>cav_un_auth*0291942</ARLID> <name1>Sekeh</name1> <name2>M. A.</name2> <country>MY</country>  </author> <author primary="0"> <ARLID>cav_un_auth*0291943</ARLID> <name1>Maarof</name1> <name2>M. A.</name2> <country>MY</country>  </author> <author primary="0"> <ARLID>cav_un_auth*0291944</ARLID> <name1>Rohani</name1> <name2>M. F.</name2> <country>MY</country>  </author> <author primary="0"> <ARLID>cav_un_auth*0206076</ARLID> <name1>Mahdian</name1> <name2>Babak</name2> <full_dept language="cz">Zpracování obrazové informace</full_dept> <full_dept>Department of Image Processing</full_dept> <department language="cz">ZOI</department> <department>ZOI</department> <institution>UTIA-B</institution> <full_dept>Department of Image Processing</full_dept>  <fullinstit>Ústav teorie informace a automatizace AV ČR, v. v. i.</fullinstit> </author>   <source> <url>http://library.utia.cas.cz/separaty/2013/ZOI/mahdian-efficient image duplicated region detection model using sequential block clustering.pdf</url> </source>        <cas_special>  <abstract language="eng" primary="1">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 in time  complexity when the block size is small.</abstract>     <reportyear>2014</reportyear>  <RIV>IN</RIV>      <num_of_auth>4</num_of_auth>  <inst_support> RVO:67985556 </inst_support>  <permalink>http://hdl.handle.net/11104/0221986</permalink>          <unknown tag="mrcbT16-e">COMPUTERSCIENCEINFORMATIONSYSTEMS|COMPUTERSCIENCEINTERDISCIPLINARYAPPLICATIONS</unknown> <unknown tag="mrcbT16-f">1.171</unknown> <unknown tag="mrcbT16-g">0.205</unknown> <unknown tag="mrcbT16-h">4.III</unknown> <unknown tag="mrcbT16-i">0.00059</unknown> <unknown tag="mrcbT16-j">0.218</unknown> <unknown tag="mrcbT16-k">300</unknown> <unknown tag="mrcbT16-l">39</unknown> <unknown tag="mrcbT16-s">0.536</unknown> <unknown tag="mrcbT16-z">ScienceCitationIndexExpanded</unknown> <unknown tag="mrcbT16-4">Q1</unknown> <unknown tag="mrcbT16-B">16.01</unknown> <unknown tag="mrcbT16-C">37.489</unknown> <unknown tag="mrcbT16-D">Q4</unknown> <unknown tag="mrcbT16-E">Q3</unknown> <arlyear>2013</arlyear>       <unknown tag="mrcbU34"> 000318997700008 WOS </unknown> <unknown tag="mrcbU63"> cav_un_epca*0311548 Digital Investigation 1742-2876 1873-202X Roč. 10 č. 1 2013 73 84 Elsevier </unknown> </cas_special> </bibitem>