A new decoder for the optimum recovery of nonadditive watermarks

Watermark detection, i.e., the detection of an invisible signal hidden within an image for copyright protection or data authentication, has classically been tackled by means of correlation-based techniques. Nevertheless, when watermark embedding does not obey an additive rule, or when the features t...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on image processing Vol. 10; no. 5; pp. 755 - 766
Main Authors Barni, M., Bartolini, F., De Rosa, A., Piva, A.
Format Journal Article
LanguageEnglish
Published New York, NY IEEE 01.05.2001
Institute of Electrical and Electronics Engineers
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Online AccessGet full text
ISSN1057-7149
1941-0042
DOI10.1109/83.918568

Cover

Abstract Watermark detection, i.e., the detection of an invisible signal hidden within an image for copyright protection or data authentication, has classically been tackled by means of correlation-based techniques. Nevertheless, when watermark embedding does not obey an additive rule, or when the features the watermark is superimposed on do not follow a Gaussian pdf, correlation-based decoding is not the optimum choice. A new decoding algorithm is presented here which is optimum for nonadditive watermarks embedded in the magnitude of a set of full-frame DFT coefficients of the host image. By relying on statistical decision theory, the structure of the optimum is derived according to the Neyman-Pearson criterion, thus permitting to minimize the missed detection probability subject to a given false detection rate. The validity of the optimum decoder has been tested thoroughly to assess the improvement it permits to achieve from a robustness perspective. The results we obtained confirm the superiority of the novel algorithm with respect to classical correlation-based decoding.
AbstractList Watermark detection, i.e., the detection of an invisible signal hidden within an image for copyright protection or data authentication, has classically been tackled by means of correlation-based techniques. Nevertheless, when watermark embedding does not obey an additive rule, or when the features the watermark is superimposed on do not follow a Gaussian pdf, correlation-based decoding is not the optimum choice. A new decoding algorithm is presented here which is optimum for nonadditive watermarks embedded in the magnitude of a set of full-frame DFT coefficients of the host image. By relying on statistical decision theory, the structure of the optimum is derived according to the Neyman-Pearson criterion, thus permitting to minimize the missed detection probability subject to a given false detection rate. The validity of the optimum decoder has been tested thoroughly to assess the improvement it permits to achieve from a robustness perspective. The results we obtained confirm the superiority of the novel algorithm with respect to classical correlation-based decoding.
Watermark detection, i.e., the detection of an invisible signal hidden within an image for copyright protection or data authentication, has classically been tackled by means of correlation-based techniques. Nevertheless, when watermark embedding does not obey an additive rule, or when the features the watermark is superimposed on do not follow a Gaussian pdf, correlation-based decoding is not the optimum choice. A new decoding algorithm is presented here which is optimum for nonadditive watermarks embedded in the magnitude of a set of full-frame DFT coefficients of the host image. By relying on statistical decision theory, the structure of the optimum is derived according to the Neyman-Pearson criterion, thus permitting to minimize the missed detection probability subject to a given false detection rate. The validity of the optimum decoder has been tested thoroughly to assess the improvement it permits to achieve from a robustness perspective. The results we obtained confirm the superiority of the novel algorithm with respect to classical correlation-based decoding
By relying on statistical decision theory, the structure of the optimum is derived according to the Neyman-Pearson criterion, thus permitting to minimize the missed detection probability subject to a given false detection rate.
Watermark detection, i.e., the detection of an invisible signal hidden within an image for copyright protection or data authentication, has classically been tackled by means of correlation-based techniques. Nevertheless, when watermark embedding does not obey an additive rule, or when the features the watermark is superimposed on do not follow a Gaussian pdf, correlation-based decoding is not the optimum choice. A new decoding algorithm is presented here which is optimum for nonadditive watermarks embedded in the magnitude of a set of full-frame DFT coefficients of the host image. By relying on statistical decision theory, the structure of the optimum decoder is derived according to the Neyman-Pearson criterion, thus permitting to minimize the missed detection probability subject to a given false detection rate. The validity of the optimum decoder has been tested thoroughly to assess the improvement it permits to achieve from a robustness perspective. The results we obtained confirm the superiority of the novel algorithm with respect to classical correlation-based decoding.
Watermark detection, i.e., the detection of an invisible signal hidden within an image for copyright protection or data authentication, has classically been tackled by means of correlation-based techniques. Nevertheless, when watermark embedding does not obey an additive rule, or when the features the watermark is superimposed on do not follow a Gaussian pdf, correlation-based decoding is not the optimum choice. A new decoding algorithm is presented here which is optimum for nonadditive watermarks embedded in the magnitude of a set of full-frame DFT coefficients of the host image. By relying on statistical decision theory, the structure of the optimum is derived according to the Neyman-Pearson criterion, thus permitting to minimize the missed detection probability subject to a given false detection rate. The validity of the optimum decoder has been tested thoroughly to assess the improvement it permits to achieve from a robustness perspective. The results we obtained confirm the superiority of the novel algorithm with respect to classical correlation-based decoding.Watermark detection, i.e., the detection of an invisible signal hidden within an image for copyright protection or data authentication, has classically been tackled by means of correlation-based techniques. Nevertheless, when watermark embedding does not obey an additive rule, or when the features the watermark is superimposed on do not follow a Gaussian pdf, correlation-based decoding is not the optimum choice. A new decoding algorithm is presented here which is optimum for nonadditive watermarks embedded in the magnitude of a set of full-frame DFT coefficients of the host image. By relying on statistical decision theory, the structure of the optimum is derived according to the Neyman-Pearson criterion, thus permitting to minimize the missed detection probability subject to a given false detection rate. The validity of the optimum decoder has been tested thoroughly to assess the improvement it permits to achieve from a robustness perspective. The results we obtained confirm the superiority of the novel algorithm with respect to classical correlation-based decoding.
Author De Rosa, A.
Bartolini, F.
Barni, M.
Piva, A.
Author_xml – sequence: 1
  givenname: M.
  surname: Barni
  fullname: Barni, M.
  organization: Dept. of Inf. Eng., Siena Univ., Italy
– sequence: 2
  givenname: F.
  surname: Bartolini
  fullname: Bartolini, F.
– sequence: 3
  givenname: A.
  surname: De Rosa
  fullname: De Rosa, A.
– sequence: 4
  givenname: A.
  surname: Piva
  fullname: Piva, A.
BackLink http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=957993$$DView record in Pascal Francis
https://www.ncbi.nlm.nih.gov/pubmed/18249665$$D View this record in MEDLINE/PubMed
BookMark eNqN0strFjEQAPAgFfvQg1cPsihUPGyb9-NmKfUBBS96XvIlE0zd3Xwm2Zb-96bsp4Ui6ikh-c0Mmcwh2pvTDAg9J_iEEGxONTsxRAupH6EDYjjpMeZ0r-2xUL0i3Oyjw1KuMCZcEPkE7RNNuZFSHKB3Z90MN50HlzzkLqTc1W_QpW2N0zJ1uZ1fQ77tUuhaUet9rPEauhtbIU82fy9P0eNgxwLPdusR-vr-4sv5x_7y84dP52eXvWsla68CeKK9hECV2uBAHffCay00DYFozo1oyUWghAJVQMBshA3WOWoFI96yI_RmzbvN6ccCpQ5TLA7G0c6QljIYwqUQirB_SsUYZ43rJo__Kqnmkv0XlFoxY0SDrx7Aq7TkuTVm0C0ZlYKZhl7u0LKZwA_bHFsrb4dfv9LA6x2wxdkxZDu7WH47I5Qxd-98uyqXUykZwn0iPNzNxaDZsM5Fs6cPrIvV1pjmmm0c_xjxYo2IAHBfer38CRm7v00
CODEN IIPRE4
CitedBy_id crossref_primary_10_1007_s11554_019_00937_z
crossref_primary_10_1109_TIP_2009_2038774
crossref_primary_10_1007_s11042_014_1948_8
crossref_primary_10_1109_TASL_2009_2019259
crossref_primary_10_4028_www_scientific_net_AMM_263_266_2058
crossref_primary_10_1007_s00034_015_0007_7
crossref_primary_10_1016_j_sigpro_2010_02_013
crossref_primary_10_1109_TCSVT_2006_888837
crossref_primary_10_1109_TIP_2006_888345
crossref_primary_10_1016_j_hlpt_2013_05_005
crossref_primary_10_1049_ip_vis_20041240
crossref_primary_10_1109_TIT_2010_2046223
crossref_primary_10_1109_TSP_2004_839925
crossref_primary_10_1109_TCSVT_2009_2020255
crossref_primary_10_1007_s11042_018_5635_z
crossref_primary_10_1109_TIP_2004_837516
crossref_primary_10_1007_s00034_021_01678_w
crossref_primary_10_1109_TIP_2014_2339633
crossref_primary_10_1007_s00034_024_02852_6
crossref_primary_10_1007_s11042_014_1904_7
crossref_primary_10_1007_s00034_015_0124_3
crossref_primary_10_1007_s10044_024_01274_z
crossref_primary_10_1016_j_sigpro_2007_07_012
crossref_primary_10_1109_TIFS_2006_890309
crossref_primary_10_1155_2008_492942
crossref_primary_10_1016_j_image_2015_07_014
crossref_primary_10_1007_s11042_012_1282_y
crossref_primary_10_1016_j_asoc_2013_04_008
crossref_primary_10_1016_j_jisa_2022_103312
crossref_primary_10_1016_j_jvcir_2023_103779
crossref_primary_10_1016_j_image_2020_115972
crossref_primary_10_1109_TCSVT_2006_885716
crossref_primary_10_1049_iet_ipr_2015_0128
crossref_primary_10_1016_j_jvcir_2019_05_012
crossref_primary_10_1109_TSP_2003_809370
crossref_primary_10_1109_TSP_2003_809371
crossref_primary_10_1016_j_patcog_2008_01_007
crossref_primary_10_1109_TIFS_2007_908226
crossref_primary_10_1109_TIP_2003_810586
crossref_primary_10_1016_j_sigpro_2004_05_017
crossref_primary_10_1016_j_jisa_2015_07_002
crossref_primary_10_1078_1434_8411_54100185
crossref_primary_10_1049_ip_ifs_20055118
crossref_primary_10_1109_TMM_2009_2012922
crossref_primary_10_1142_S0219477511000612
crossref_primary_10_3233_JIFS_189703
crossref_primary_10_3724_SP_J_1146_2006_01701
crossref_primary_10_1016_j_dsp_2014_09_003
crossref_primary_10_1016_j_jvcir_2024_104339
crossref_primary_10_1016_j_dsp_2013_01_012
crossref_primary_10_1109_TSP_2003_809376
crossref_primary_10_1109_TSP_2003_809374
crossref_primary_10_1109_TIP_2009_2021313
crossref_primary_10_1016_j_displa_2024_102637
crossref_primary_10_1016_j_ins_2019_06_059
crossref_primary_10_1016_j_ins_2020_05_034
crossref_primary_10_1016_j_sigpro_2011_09_029
crossref_primary_10_1109_TIP_2010_2042646
crossref_primary_10_1186_1687_6180_2012_88
crossref_primary_10_1007_s11042_016_3975_0
crossref_primary_10_1109_TIP_2004_834660
crossref_primary_10_1109_TIP_2010_2079551
crossref_primary_10_1109_MSP_2004_1276109
crossref_primary_10_1109_TIFS_2011_2146250
crossref_primary_10_1016_j_eswa_2014_10_015
crossref_primary_10_1109_TCSVT_2016_2607299
crossref_primary_10_1109_TVCG_2007_1050
crossref_primary_10_1007_BF02831910
crossref_primary_10_1016_j_image_2018_06_015
crossref_primary_10_1007_s11042_015_3115_2
crossref_primary_10_1109_TCI_2018_2794065
crossref_primary_10_1109_TIFS_2006_873652
crossref_primary_10_1109_LSP_2005_843776
crossref_primary_10_1117_1_1426383
crossref_primary_10_1155_2008_918601
crossref_primary_10_1049_iet_ipr_2012_0345
crossref_primary_10_1109_TIFS_2007_902663
crossref_primary_10_1016_j_optcom_2008_04_065
crossref_primary_10_1117_1_1496787
crossref_primary_10_1080_19393555_2021_1919250
crossref_primary_10_1109_TIP_2009_2038637
Cites_doi 10.1109/5.687830
10.1007/3-540-61996-8_42
10.1117/12.344693
10.1109/ICIP.1997.647970
10.1109/ICIP.1997.647968
10.1109/ICIP.1997.647967
10.1109/83.650120
10.1117/12.344689
10.1117/12.330369
10.1109/ICIP.1998.723523
10.1016/S0165-1684(98)00015-2
10.1109/ICIP.1997.647971
10.1109/ICIP.1997.631957
10.1109/MMCS.1999.779264
10.1117/12.274502
10.1016/S0165-1684(98)00013-9
10.1364/JOSA.70.001458
10.1109/ICIP.1996.560421
10.1049/ip-vis:19960711
10.1109/76.728421
ContentType Journal Article
Copyright 2001 INIST-CNRS
Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2001
Copyright_xml – notice: 2001 INIST-CNRS
– notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2001
DBID RIA
RIE
AAYXX
CITATION
IQODW
NPM
7SC
7SP
8FD
JQ2
L7M
L~C
L~D
7X8
F28
FR3
DOI 10.1109/83.918568
DatabaseName IEEE All-Society Periodicals Package (ASPP) 1998–Present
IEEE Electronic Library (IEL)
CrossRef
Pascal-Francis
PubMed
Computer and Information Systems Abstracts
Electronics & Communications Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
MEDLINE - Academic
ANTE: Abstracts in New Technology & Engineering
Engineering Research Database
DatabaseTitle CrossRef
PubMed
Technology Research Database
Computer and Information Systems Abstracts – Academic
Electronics & Communications Abstracts
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts Professional
MEDLINE - Academic
Engineering Research Database
ANTE: Abstracts in New Technology & Engineering
DatabaseTitleList PubMed
Technology Research Database

Technology Research Database
Computer and Information Systems Abstracts
Computer and Information Systems Abstracts
MEDLINE - Academic
Database_xml – sequence: 1
  dbid: NPM
  name: PubMed
  url: https://proxy.k.utb.cz/login?url=http://www.ncbi.nlm.nih.gov/entrez/query.fcgi?db=PubMed
  sourceTypes: Index Database
– sequence: 2
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Applied Sciences
Engineering
EISSN 1941-0042
EndPage 766
ExternalDocumentID 2431695181
18249665
957993
10_1109_83_918568
918568
Genre Journal Article
GroupedDBID ---
-~X
.DC
0R~
29I
4.4
53G
5GY
5VS
6IK
97E
AAJGR
AARMG
AASAJ
AAWTH
ABAZT
ABFSI
ABQJQ
ABVLG
ACGFO
ACGFS
ACIWK
AENEX
AETIX
AGQYO
AGSQL
AHBIQ
AI.
AIBXA
AKJIK
AKQYR
ALLEH
ALMA_UNASSIGNED_HOLDINGS
ASUFR
ATWAV
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CS3
DU5
E.L
EBS
EJD
F5P
HZ~
H~9
ICLAB
IFIPE
IFJZH
IPLJI
JAVBF
LAI
M43
MS~
O9-
OCL
P2P
RIA
RIE
RNS
TAE
TN5
VH1
AAYOK
AAYXX
CITATION
RIG
IQODW
NPM
7SC
7SP
8FD
JQ2
L7M
L~C
L~D
7X8
F28
FR3
ID FETCH-LOGICAL-c516t-7fed18d6ef277b0f2c4d5d88582ff184495add5f212e27e1e9b5afacc2a531da3
IEDL.DBID RIE
ISSN 1057-7149
IngestDate Thu Sep 04 19:35:37 EDT 2025
Fri Sep 05 08:53:00 EDT 2025
Fri Sep 05 08:27:50 EDT 2025
Fri Sep 05 03:45:36 EDT 2025
Fri Jul 25 12:25:38 EDT 2025
Thu Apr 03 06:58:26 EDT 2025
Mon Jul 21 09:09:58 EDT 2025
Thu Apr 24 23:11:23 EDT 2025
Tue Jul 01 05:13:05 EDT 2025
Tue Aug 26 21:00:32 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 5
Keywords Neyman Pearson detection
Image processing
Information protection
Digital signature
Statistical decision
Decoding
Optimal detection
Signal detection
Correlation method
Language English
License https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html
CC BY 4.0
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c516t-7fed18d6ef277b0f2c4d5d88582ff184495add5f212e27e1e9b5afacc2a531da3
Notes ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
content type line 23
ObjectType-Article-1
ObjectType-Feature-2
PMID 18249665
PQID 884626539
PQPubID 23500
PageCount 12
ParticipantIDs pubmed_primary_18249665
proquest_miscellaneous_733439148
proquest_miscellaneous_914655713
pascalfrancis_primary_957993
crossref_primary_10_1109_83_918568
proquest_miscellaneous_28463148
proquest_journals_884626539
proquest_miscellaneous_26873995
crossref_citationtrail_10_1109_83_918568
ieee_primary_918568
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate 2001-05-01
PublicationDateYYYYMMDD 2001-05-01
PublicationDate_xml – month: 05
  year: 2001
  text: 2001-05-01
  day: 01
PublicationDecade 2000
PublicationPlace New York, NY
PublicationPlace_xml – name: New York, NY
– name: United States
– name: New York
PublicationTitle IEEE transactions on image processing
PublicationTitleAbbrev TIP
PublicationTitleAlternate IEEE Trans Image Process
PublicationYear 2001
Publisher IEEE
Institute of Electrical and Electronics Engineers
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher_xml – name: IEEE
– name: Institute of Electrical and Electronics Engineers
– name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
References ref13
ref15
Piva (ref28)
ref14
ref30
ref11
ref10
ref2
ref1
Langelaar (ref5)
ref17
ref16
ref19
Papoulis (ref25) 1991
Proakis (ref18) 1989
Bender (ref4); 2420
Piva (ref31)
ref23
ref20
ref22
ref21
Koch (ref12)
Scharf (ref24) 1991
Piva (ref3)
ref29
ref8
ref7
Kolmogorov (ref26) 1975
ref9
Di Franco (ref27) 1980
ref6
References_xml – ident: ref1
  doi: 10.1109/5.687830
– ident: ref7
  doi: 10.1007/3-540-61996-8_42
– ident: ref17
  doi: 10.1117/12.344693
– volume-title: Proc. SPIE Electronic Imaging’97
  ident: ref5
  article-title: La-beling methods for copy protection of images
– ident: ref14
  doi: 10.1109/ICIP.1997.647970
– volume: 2420
  start-page: 164
  volume-title: Proc. SPIE
  ident: ref4
  article-title: Techniques for data hiding
– ident: ref19
  doi: 10.1109/ICIP.1997.647968
– ident: ref29
  doi: 10.1109/ICIP.1997.647967
– ident: ref10
  doi: 10.1109/83.650120
– volume-title: Proc. Int. Conf. Digital Media Electronic Publishing
  ident: ref12
  article-title: Copyright protection for multimedia data
– ident: ref13
  doi: 10.1117/12.344689
– volume-title: Radar Detection.
  year: 1980
  ident: ref27
– start-page: 513
  volume-title: Proc. Eur. Multimedia Microprocessor System Electronic Commerce Conf Exhibition ’98
  ident: ref3
  article-title: Application-driven requirements for digital watermarking technology
– ident: ref23
  doi: 10.1117/12.330369
– ident: ref22
  doi: 10.1109/ICIP.1998.723523
– ident: ref9
  doi: 10.1016/S0165-1684(98)00015-2
– ident: ref15
  doi: 10.1109/ICIP.1997.647971
– volume-title: Introductory Real Analysis.
  year: 1975
  ident: ref26
– ident: ref2
  doi: 10.1109/ICIP.1997.631957
– volume-title: Proc. ACM Workshop Multimedia Se-curity
  ident: ref31
  article-title: Improving DFT watermarking robustness through optimum detection and synchronization
– volume-title: Digital Communications.
  year: 1989
  ident: ref18
– ident: ref30
  doi: 10.1109/MMCS.1999.779264
– ident: ref16
  doi: 10.1117/12.274502
– volume-title: Proc. COST254 Work-shop
  ident: ref28
  article-title: Threshold selection for correlation-based watermark detection
– ident: ref21
  doi: 10.1016/S0165-1684(98)00013-9
– ident: ref20
  doi: 10.1364/JOSA.70.001458
– volume-title: Statistical Signal Processing: Detection, Estimation, and Time Series Analysis.
  year: 1991
  ident: ref24
– ident: ref8
  doi: 10.1109/ICIP.1996.560421
– volume-title: Probability, Random Variables, and Stochastic Pro-cesses.
  year: 1991
  ident: ref25
– ident: ref11
  doi: 10.1049/ip-vis:19960711
– ident: ref6
  doi: 10.1109/76.728421
SSID ssj0014516
Score 2.101435
Snippet Watermark detection, i.e., the detection of an invisible signal hidden within an image for copyright protection or data authentication, has classically been...
By relying on statistical decision theory, the structure of the optimum is derived according to the Neyman-Pearson criterion, thus permitting to minimize the...
SourceID proquest
pubmed
pascalfrancis
crossref
ieee
SourceType Aggregation Database
Index Database
Enrichment Source
Publisher
StartPage 755
SubjectTerms Algorithms
Applied sciences
Authentication
Copyright protection
Correlation
Decision theory
Decoders
Decoding
Discrete cosine transforms
Exact sciences and technology
Frequency domain analysis
Image processing
Information, signal and communications theory
Optimization
Pixel
Probability
Robustness
Signal processing
Studies
Telecommunications and information theory
Testing
Watermarking
Title A new decoder for the optimum recovery of nonadditive watermarks
URI https://ieeexplore.ieee.org/document/918568
https://www.ncbi.nlm.nih.gov/pubmed/18249665
https://www.proquest.com/docview/884626539
https://www.proquest.com/docview/26873995
https://www.proquest.com/docview/28463148
https://www.proquest.com/docview/733439148
https://www.proquest.com/docview/914655713
Volume 10
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1Lb9QwEB7RnuBAYXmFFrAQBy7ZJnb8yI0KUVVIcKJSb5Fjjy-lu2izEaK_vmM7u6WorTgliicPP8b-Jp75BuADauG57fvSiKYqm6Bc2QpVlXVjfa8Mape4O799VyenzdczeTbxbKdYGERMzmc4j6dpL98v3Rh_lR22tLgoswM7NMpyqNZ2wyDmm00bm1KXmlD_RCJUV-2hEfN8442lJ-VSiZ6QdqDGCDmLxd0wMy03x3s5jntILIXRy-R8Pq77ubv8h8PxP2vyBB5PsJMd5XHyFB7gYgZ7EwRlk4IPM3j0Fz_hM_h0xAh1M48x8H3FCN8ywotsSdPMxXjBojFNmvCHLQNbEKL3Pjkisd82zfer8-E5nB5_-fH5pJxSLpSOGnBd6oC-Nl5h4Fr3VeCu8dIbIw0PgYxBMqfoYTLQgodcY41tL22wznFLyuyteAG79EJ8BQxrGZrGoe1NG489CbVIM4xRtjbIC_i46Y3OTXzkMS3Gzy7ZJVXbGdHldirg_Vb0VybhuE1oFtt5K7C5enCjh6-LpSZoVsD-psO7SXmHzhAm45Gyt4B321LSuriVYhe4HIeOK6NjUPA9EvQQQbZmAewOCS1EDHu-T4RKlZS6pu98mUfjdf0NGc5Kyde3VnsfHmZnueiZeQC769WIbwg9rfu3SW-uAP4gGOw
linkProvider IEEE
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1LTxRBEK4gHJSD6Ko4gtIxHrzMMq9-zE1CIKsCJ0i4TfpRfQF2zc5OjP56q3tmFzFAPM1munZm-1FdX21XfQXwCWXpCm1MqsoqSysvbFqXIkvzSjsjFEobuTtPz8Tkovp2yS8Hnu2YC4OIMfgMx-FjPMt3M9uFv8r2azIuQj2BDTL7Fe-TtVZHBqHibDza5DKVhPsHGqE8q_dVOe6_esf4xGoqIRZStzQcvq9j8TDQjAbneKvP5G4jT2GIM7kadwsztr__YXH8z768gOcD8GQH_Up5CWs4HcHWAELZoOLtCDb_Yih8BV8OGOFu5jCkvs8ZIVxGiJHNaKO56W5YcKdJF36xmWdTwvTOxVAk9lPHHX9-1b6Gi-Oj88NJOhRdSC0N4CKVHl2unEBfSGkyX9jKcacUV4X35A6SQ0UP455MHhYSc6wN115bW2hSZ6fLN7BOL8S3wDDnvqosaqPqcDUkVCPtMUroXGGRwOflbDR2YCQPhTGum-iZZHWjyqYfpwQ-rkR_9DQc9wmNwjivBJZ3d-_M8G0zlwTOEthZTngzqG_bKEJlRSDtTWBv1Up6Fw5T9BRnXdsUQsmQFvyIBD2kJG8zAfaAhCzLkPj8mAi1Cs5lTr9zu1-Nt_1X5DoLwd_d2-09eDo5Pz1pTr6efd-BZ33oXIjT3IX1xbzD94SlFuZD1KE_yYAcOQ
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+new+decoder+for+the+optimum+recovery+of+nonadditive+watermarks&rft.jtitle=IEEE+transactions+on+image+processing&rft.au=Barni%2C+M&rft.au=Bartolini%2C+F&rft.au=De+Rosa%2C+A&rft.au=Piva%2C+A&rft.date=2001-05-01&rft.issn=1057-7149&rft.volume=10&rft.issue=5&rft_id=info:doi/10.1109%2F83.918568&rft.externalDBID=NO_FULL_TEXT
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1057-7149&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1057-7149&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1057-7149&client=summon