| bibtype |
J -
Journal Article
|
| ARLID |
0393155 |
| utime |
20240103202640.2 |
| mtime |
20130625235959.9 |
| WOS |
000318997700008 |
| DOI |
10.1016/j.diin.2013.02.007 |
| title
(primary) (eng) |
Efficient image duplicated region detection model using sequential block clustering |
| specification |
| page_count |
11 s. |
| media_type |
P |
|
| serial |
| ARLID |
cav_un_epca*0311548 |
| ISSN |
1742-2876 |
| title
|
Digital Investigation |
| volume_id |
10 |
| volume |
1 (2013) |
| page_num |
73-84 |
| publisher |
|
|
| keyword |
Image forensic |
| keyword |
Copy–paste forgery |
| keyword |
Local block matching |
| author
(primary) |
| ARLID |
cav_un_auth*0291942 |
| name1 |
Sekeh |
| name2 |
M. A. |
| country |
MY |
|
| author
|
| ARLID |
cav_un_auth*0291943 |
| name1 |
Maarof |
| name2 |
M. A. |
| country |
MY |
|
| author
|
| ARLID |
cav_un_auth*0291944 |
| name1 |
Rohani |
| name2 |
M. F. |
| country |
MY |
|
| author
|
| ARLID |
cav_un_auth*0206076 |
| name1 |
Mahdian |
| name2 |
Babak |
| full_dept (cz) |
Zpracování obrazové informace |
| full_dept |
Department of Image Processing |
| department (cz) |
ZOI |
| department |
ZOI |
| institution |
UTIA-B |
| full_dept |
Department of Image Processing |
| fullinstit |
Ústav teorie informace a automatizace AV ČR, v. v. i. |
|
| source |
|
| cas_special |
| abstract
(eng) |
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. |
| reportyear |
2014 |
| RIV |
IN |
| num_of_auth |
4 |
| inst_support |
RVO:67985556 |
| permalink |
http://hdl.handle.net/11104/0221986 |
| mrcbT16-e |
COMPUTERSCIENCEINFORMATIONSYSTEMS|COMPUTERSCIENCEINTERDISCIPLINARYAPPLICATIONS |
| mrcbT16-f |
1.171 |
| mrcbT16-g |
0.205 |
| mrcbT16-h |
4.III |
| mrcbT16-i |
0.00059 |
| mrcbT16-j |
0.218 |
| mrcbT16-k |
300 |
| mrcbT16-l |
39 |
| mrcbT16-s |
0.536 |
| mrcbT16-z |
ScienceCitationIndexExpanded |
| mrcbT16-4 |
Q1 |
| mrcbT16-B |
16.01 |
| mrcbT16-C |
37.489 |
| mrcbT16-D |
Q4 |
| mrcbT16-E |
Q3 |
| arlyear |
2013 |
| mrcbU34 |
000318997700008 WOS |
| mrcbU63 |
cav_un_epca*0311548 Digital Investigation 1742-2876 1873-202X Roč. 10 č. 1 2013 73 84 Elsevier |
|