A New QIM-Based Watermarking Method Robust to Gain Attack

<div class="floats-full-page floats-full-page-figure"><h2>Figure 6</h2><div class="floats-full-page-caption"><table>Plots of criteria values toward guessed length of embedding interval: (a) criterion <svg height="12.3115pt" id="M334" style="vertical-align:-3.31355pt" version="1.1" viewbox="-0.0498162 -8.99795 14.2498 12.3115" width="14.2498pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.0135,0,0,-0.0135,0,0)"><path d="M645 631C614 643 545 666 457 666C215 666 23 519 23 283C23 90 158 -16 337 -16C412 -16 489 2 522 10C543 39 590 127 606 167L580 181C519 89 459 18 348 18C201 18 122 136 122 287C122 464 244 632 435 632C544 632 602 595 608 472L639 475C643 526 645 581 645 631Z" id="g113-68"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="668" vert-adv-y="668"></glyph.data></g><g transform="matrix(.0095,0,0,-0.0095,8.982,3.264)"><path d="M389 0V32C297 38 291 46 291 118V635C234 613 175 595 109 583V556L161 554C203 552 207 547 207 497V118C207 46 201 38 110 32V0H389Z" id="g50-50"></path><glyph.data ascent="3443" descent="-2856" horiz-adv-x="487" vert-adv-y="487"></glyph.data></g></svg>; (b) criterion <svg height="12.3115pt" id="M335" style="vertical-align:-3.31355pt" version="1.1" viewbox="-0.0498162 -8.99795 14.2498 12.3115" width="14.2498pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.0135,0,0,-0.0135,0,0)"><path d="M645 631C614 643 545 666 457 666C215 666 23 519 23 283C23 90 158 -16 337 -16C412 -16 489 2 522 10C543 39 590 127 606 167L580 181C519 89 459 18 348 18C201 18 122 136 122 287C122 464 244 632 435 632C544 632 602 595 608 472L639 475C643 526 645 581 645 631Z" id="g113-68"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="668" vert-adv-y="668"></glyph.data></g><g transform="matrix(.0095,0,0,-0.0095,8.982,3.264)"><path d="M414 144C384 79 371 75 317 75H135L276 221C367 316 408 376 408 465C408 570 327 635 237 635C179 635 131 609 100 575L42 494L67 471C94 510 138 565 205 565C277 565 321 517 321 435C321 348 258 270 195 195C146 137 88 81 33 26V0H411C423 44 433 88 446 135L414 144Z" id="g50-51"></path><glyph.data ascent="3443" descent="-2856" horiz-adv-x="487" vert-adv-y="487"></glyph.data></g></svg>.</table></div><div class="floats-full-page-content"><table class="table-group" width="800px"><tr class="fig-image" id="a"><td><img alt="910808.fig.006a" src="https://static-01.hindawi.com/articles/ijdmb/volume-2014/910808/figures/910808.fig.006a.jpg" /></td></tr><tr class="fig-caption"><td align="center"><table><tr><td><b>(a) </b></td></tr></table></td></tr><tr class="fig-image" id="b"><td><img alt="910808.fig.006b" src="https://static-01.hindawi.com/articles/ijdmb/volume-2014/910808/figures/910808.fig.006b.jpg" /></td></tr><tr class="fig-caption"><td align="center"><table><tr><td><b>(b) </b></td></tr></table></td></tr></table></div></div>

Figure 6 | A New QIM-Based Watermarking Method Robust to Gain Attack

title

Figure 6: A New QIM-Based Watermarking Method Robust to Gain Attack

description

Figure 6

About this journal

<p><em>International Journal of Digital Multimedia Broadcasting</em> provides a forum for engineers and researchers whose interests are in digital multimedia broadcasting to share recent developments and challenges in order to design new and improved systems.</p>


Journal profile

Meet the editorial board

<p><em>International Journal of Digital Multimedia Broadcasting</em> maintains an Editorial Board of practicing researchers from around the world, to ensure manuscripts are handled by editors who are experts in the field of study.</p>


Editor spotlight

Submit your proposal

Do you think there is an emerging area of research that really needs to be highlighted? Or an existing research area that has been overlooked or would benefit from deeper investigation? Raise the profile of a research area by leading a Special Issue.