Effective and Fast Near Duplicate Detection via Signature-Based Compression Metrics

<div>Runtime with different pruning configurations as a function of <svg height="6.1673pt" id="M259" style="vertical-align:-0.2063904pt" version="1.1" viewbox="-0.0498162 -5.96091 6.40217 6.1673" width="6.40217pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,0)"><path d="M471 456L444 459C426 433 414 430 388 430C324 430 270 434 216 434C103 434 51 374 23 338L43 317C96 366 146 380 221 375L154 109C149 86 147 68 147 52C147 4 168 -12 197 -12C240 -12 291 25 334 71L320 96C295 75 268 58 252 58C238 58 227 79 238 138C251 211 272 296 292 372C310 372 332 368 350 368C391 368 421 369 434 371C444 388 455 413 471 456Z" id="g113-241"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="483" vert-adv-y="483"></glyph.data></g></svg>.</div>

Mathematical Problems in Engineering

fig5

Figure 5

Figure 5: Effective and Fast Near Duplicate Detection via Signature-Based Compression Metrics 