Reversible data hiding method for multi-histogram point selection based on improved crisscross optimization algorithm
Traditional prediction error expansion (PEE)-based reversible data hiding (RDH) schemes focus on generating a sharp prediction error histogram (PEH) in order to increase embedding performance, but they neglect the influence of local complexity on embedding performance. When the PEH is partitioned in...
Gespeichert in:
| Veröffentlicht in: | Information sciences Jg. 549; S. 13 - 33 |
|---|---|
| Hauptverfasser: | , , , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Elsevier Inc
01.03.2021
|
| Schlagworte: | |
| ISSN: | 0020-0255, 1872-6291 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | Traditional prediction error expansion (PEE)-based reversible data hiding (RDH) schemes focus on generating a sharp prediction error histogram (PEH) in order to increase embedding performance, but they neglect the influence of local complexity on embedding performance. When the PEH is partitioned into multiple sub-histograms by means of the local complexity, the embedding performance can be increased by excluding the embedding of data in the sub-histograms located in the texture regions. However, multiple sub-histograms also cause a problem about how to identify the optimal embedding points that can achieve the best visual quality for a given payload. Violent iteration is often used in RDH schemes to traverse all possible values of the embedding points in order to identify the optimal points. Therefore, we conclude that violent iteration is a very time-consuming method and that it leads to unacceptable computational complexity. The traditional multiple sub-histogram methods usually reduce the solution space (i.e., all possible combinations of the embedding points) to decrease the computational complexity. However, the solution that is obtained from the aforementioned methods may significantly deviate from the global optimal solution. Instead of shrinking the solution space by abandoning most solutions, we improve the crisscross optimization algorithm in order to search for the optimal solution in the global solution space. In this paper, the K-means clustering algorithm is used to classify all prediction errors into multiple categories according to the local complexity. Each category would generate a PEH. Subsequently, the problem of selecting the embedding points of multiple sub-histograms is transformed into a typical and multi-choice knapsack problem. The improved crisscross optimization algorithm is used to determine the approximate optimal solution. The experimental results showed that our scheme provided effective performance. |
|---|---|
| AbstractList | Traditional prediction error expansion (PEE)-based reversible data hiding (RDH) schemes focus on generating a sharp prediction error histogram (PEH) in order to increase embedding performance, but they neglect the influence of local complexity on embedding performance. When the PEH is partitioned into multiple sub-histograms by means of the local complexity, the embedding performance can be increased by excluding the embedding of data in the sub-histograms located in the texture regions. However, multiple sub-histograms also cause a problem about how to identify the optimal embedding points that can achieve the best visual quality for a given payload. Violent iteration is often used in RDH schemes to traverse all possible values of the embedding points in order to identify the optimal points. Therefore, we conclude that violent iteration is a very time-consuming method and that it leads to unacceptable computational complexity. The traditional multiple sub-histogram methods usually reduce the solution space (i.e., all possible combinations of the embedding points) to decrease the computational complexity. However, the solution that is obtained from the aforementioned methods may significantly deviate from the global optimal solution. Instead of shrinking the solution space by abandoning most solutions, we improve the crisscross optimization algorithm in order to search for the optimal solution in the global solution space. In this paper, the K-means clustering algorithm is used to classify all prediction errors into multiple categories according to the local complexity. Each category would generate a PEH. Subsequently, the problem of selecting the embedding points of multiple sub-histograms is transformed into a typical and multi-choice knapsack problem. The improved crisscross optimization algorithm is used to determine the approximate optimal solution. The experimental results showed that our scheme provided effective performance. |
| Author | Weng, Shaowei Ou, Bo Tan, Wenlong Pan, Jeng-Shyang |
| Author_xml | – sequence: 1 givenname: Shaowei surname: Weng fullname: Weng, Shaowei email: wswweiwei@126.com, wengsw@fjut.edu.cn organization: School of Information Engineering, Guangdong University of Technology, PR China – sequence: 2 givenname: Wenlong surname: Tan fullname: Tan, Wenlong organization: School of Information Engineering, Guangdong University of Technology, PR China – sequence: 3 givenname: Bo surname: Ou fullname: Ou, Bo email: oubo@hnu.edu.cn organization: College of Computer Science and Electronic Engineering, Hunan University, Changsha 410082, PR China – sequence: 4 givenname: Jeng-Shyang surname: Pan fullname: Pan, Jeng-Shyang email: jspan@cc.kuas.edu.tw organization: Fujian Provincial Key Laboratory of Big Data Mining and Applications, Fujian University of Technology, Fujian 350118, PR China |
| BookMark | eNp9kM9KAzEQh4NUsK0-gLe8wK5Jtslu8CTFfyAIouclTWbbKbubJUkL-vRuW08eepqZJN_wyzcjk973QMgtZzlnXN1tc-xjLpg4zDlTxQWZ8qoUmRKaT8iUjTcZE1JekVmMW8bYolRqSnYfsIcQcdUCdSYZukGH_Zp2kDbe0cYH2u3ahNkGY_LrYDo6eOwTjdCCTeh7ujIRHB0b7Ibg92NvA8Zog4-R-iFhhz_m-NK0ax8wbbprctmYNsLNX52Tr6fHz-VL9vb-_Lp8eMus0GXKAIyRWmnTVLISmlkrS2f4QmnpdFkZqfhKL4RRBZdlYaWComHSVQ1zlRZgizkpT3uPYQI0tcV0zJKCwbbmrD7Yq7f1aK8-2DscjfZGkv8jh4CdCd9nmfsTA-OX9gihjhaht-AwjK5q5_EM_QvUi415 |
| CitedBy_id | crossref_primary_10_3390_fi17080378 crossref_primary_10_1109_TDSC_2022_3232484 crossref_primary_10_3390_e25040653 crossref_primary_10_1093_comjnl_bxab203 crossref_primary_10_1007_s10044_022_01096_x crossref_primary_10_3389_fenrg_2023_1103038 crossref_primary_10_3390_app13095696 crossref_primary_10_1016_j_eswa_2022_118426 crossref_primary_10_1016_j_jvcir_2022_103732 crossref_primary_10_1007_s11071_025_11279_w crossref_primary_10_1016_j_apenergy_2023_120884 crossref_primary_10_1155_2021_5511806 crossref_primary_10_1007_s11042_023_14867_3 crossref_primary_10_1016_j_jisa_2023_103697 crossref_primary_10_1109_TCSVT_2021_3055612 crossref_primary_10_1016_j_eswa_2024_123844 crossref_primary_10_1016_j_bspc_2024_106424 crossref_primary_10_1016_j_jvcir_2022_103487 crossref_primary_10_1007_s11042_022_13136_z crossref_primary_10_1016_j_jksuci_2024_102149 crossref_primary_10_1145_3645105 crossref_primary_10_1016_j_ins_2022_08_002 crossref_primary_10_1016_j_bspc_2023_105021 crossref_primary_10_1109_TMM_2023_3241541 crossref_primary_10_1155_2022_7192697 crossref_primary_10_1109_TCSVT_2021_3125711 crossref_primary_10_1016_j_knosys_2021_107583 crossref_primary_10_1155_2022_6997190 crossref_primary_10_1088_1742_6596_1982_1_012071 crossref_primary_10_1016_j_jvcir_2022_103637 crossref_primary_10_1016_j_ins_2021_10_050 crossref_primary_10_1016_j_sigpro_2023_109299 crossref_primary_10_1093_comjnl_bxad082 crossref_primary_10_1016_j_ins_2023_119264 crossref_primary_10_1016_j_jisa_2025_104042 crossref_primary_10_3390_sym16010045 crossref_primary_10_1016_j_ins_2021_09_019 crossref_primary_10_1016_j_ins_2024_121514 crossref_primary_10_1007_s11760_025_04475_z crossref_primary_10_1109_TDSC_2024_3355165 crossref_primary_10_3390_electronics12071645 crossref_primary_10_1016_j_jisa_2025_104007 crossref_primary_10_1007_s10489_022_03323_8 crossref_primary_10_1007_s42235_022_00298_7 crossref_primary_10_1016_j_ins_2022_07_071 crossref_primary_10_1109_LSP_2024_3447215 crossref_primary_10_1007_s11042_024_20106_0 crossref_primary_10_1016_j_sigpro_2022_108833 crossref_primary_10_1016_j_ins_2021_12_092 crossref_primary_10_1016_j_jvcir_2021_103405 crossref_primary_10_1088_2631_8695_adad39 crossref_primary_10_1016_j_displa_2023_102526 crossref_primary_10_1155_2022_4858806 crossref_primary_10_1109_LSP_2023_3313444 crossref_primary_10_1109_TMM_2023_3342700 crossref_primary_10_1016_j_jisa_2022_103180 |
| Cites_doi | 10.1587/elex.5.870 10.1016/j.ins.2014.03.030 10.1109/ISCAS.2004.1329201 10.1109/TIFS.2015.2444354 10.1016/j.sigpro.2013.01.020 10.1016/j.sigpro.2012.07.025 10.1109/TIP.2004.828418 10.1109/TCSVT.2009.2020257 10.1109/ACCESS.2016.2573308 10.1016/j.sigpro.2012.05.034 10.1016/j.ins.2016.05.030 10.1016/j.jvcir.2016.03.011 10.1109/TCSVT.2006.881857 10.1016/j.ins.2019.03.032 10.1109/TIP.2005.859373 10.1016/j.optcom.2012.10.081 10.1109/MMUL.2011.41 10.1016/j.dsp.2013.11.002 10.1109/TCSVT.2003.815962 10.1109/LSP.2010.2095498 10.1109/LSP.2010.2046930 10.1109/TIP.2006.891046 10.1109/TIP.2015.2395724 10.1016/j.sigpro.2011.06.006 10.1109/TCSVT.2009.2017409 10.1016/j.jss.2012.09.041 10.1016/j.sigpro.2019.02.013 |
| ContentType | Journal Article |
| Copyright | 2020 Elsevier Inc. |
| Copyright_xml | – notice: 2020 Elsevier Inc. |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.ins.2020.10.063 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Library & Information Science |
| EISSN | 1872-6291 |
| EndPage | 33 |
| ExternalDocumentID | 10_1016_j_ins_2020_10_063 S0020025520310689 |
| GroupedDBID | --K --M --Z -~X .DC .~1 0R~ 1B1 1OL 1RT 1~. 1~5 29I 4.4 457 4G. 5GY 5VS 7-5 71M 8P~ 9JN 9JO AAAKF AAAKG AABNK AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AARIN AAXUO AAYFN ABAOU ABBOA ABEFU ABFNM ABJNI ABMAC ABTAH ABUCO ABXDB ABYKQ ACAZW ACDAQ ACGFS ACNNM ACRLP ACZNC ADBBV ADEZE ADGUI ADJOM ADMUD ADTZH AEBSH AECPX AEKER AENEX AFFNX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHJVU AHZHX AIALX AIEXJ AIGVJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD APLSM ARUGR ASPBG AVWKF AXJTR AZFZN BJAXD BKOJK BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HAMUX HLZ HVGLF HZ~ H~9 IHE J1W JJJVA KOM LG9 LY1 M41 MHUIS MO0 MS~ N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. Q38 R2- RIG ROL RPZ SBC SDF SDG SDP SDS SES SEW SPC SPCBC SSB SSD SST SSV SSW SSZ T5K TN5 TWZ UHS WH7 WUQ XPP YYP ZMT ZY4 ~02 ~G- 77I 9DU AATTM AAXKI AAYWO AAYXX ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO ADVLN AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD |
| ID | FETCH-LOGICAL-c297t-eeaa5969af858290cc57da14695d978a561b942a631573c56e3f05d8f0d892ec3 |
| ISICitedReferencesCount | 63 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000605761300002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0020-0255 |
| IngestDate | Tue Nov 18 22:42:15 EST 2025 Sat Nov 29 07:26:34 EST 2025 Fri Feb 23 02:49:11 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Improved crisscross optimization algorithm Reversible data hiding Multiple prediction error histograms K-means clustering algorithm Multi-choice knapsack problem |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c297t-eeaa5969af858290cc57da14695d978a561b942a631573c56e3f05d8f0d892ec3 |
| PageCount | 21 |
| ParticipantIDs | crossref_citationtrail_10_1016_j_ins_2020_10_063 crossref_primary_10_1016_j_ins_2020_10_063 elsevier_sciencedirect_doi_10_1016_j_ins_2020_10_063 |
| PublicationCentury | 2000 |
| PublicationDate | March 2021 2021-03-00 |
| PublicationDateYYYYMMDD | 2021-03-01 |
| PublicationDate_xml | – month: 03 year: 2021 text: March 2021 |
| PublicationDecade | 2020 |
| PublicationTitle | Information sciences |
| PublicationYear | 2021 |
| Publisher | Elsevier Inc |
| Publisher_xml | – name: Elsevier Inc |
| References | Peng, Li, Yang (b0090) 2012; 92 A.A. Abdulla, Exploiting similarities between secret and cover images for improved embedding efficiency and security in digital steganography, Doctoral thesis, University of Buckingham, 2015. Wang, Mao, Chen, Ni, Shi (b0145) 2019; 159 Li, Zhang, Xie (b0065) 2019; 48 Li, Li, Yang (b0070) 2013; 93 Thodi, Rodrłguez (b0135) 2004 Ou, Li, Wang (b0085) 2016; 38 Celik, Sharma, Tekalp, Saber (b0020) 2005; 12 Weng, Shi, Hong, Yao (b0175) 2019; 489 Weng, Pan, Gao (b0165) 2012; 3 Kamstra, Heijmans (b0060) 2005; 14 Weng, Pan, Li (b0170) 2016; 369 Wang, Li, Yang (b0155) 2010 Peng, Zhao, Zhang, Long, Pan (b0100) 2020; 81 Hong, Chen, Chen (b0045) 2015; 308 Shi, Li, Zhang, Wu, Ma (b0115) 2016; 4 Li, Zhang, Gui, Yang (b0080) 2015; 10 Tai, Yeh, Chang (b0125) 2009; 19 Peng, Li, Yang (b0095) 2014; 25 Tian (b0140) 2003; 13 Fridrich, Goljan, Du (b0035) 2002; 2002 Zou, Shi, Ni, Su (b0190) 2006; 16 Wu, Huang (b0180) 2012; 92 Sachnev, Kim, Nam, Suresh, Shi (b0110) 2009; 19 Wang, Li, Yang, Guo (b0160) 2010; 17 Hong, Chen, Wu (b0040) 2013; 291 Jung, Ha, Ko (b0055) 2011; 18 Alattar (b0015) 2004; 13 Li, Li, Li, Yang (b0075) 2013; 93 Ioan-Catalin, Dinu (b0050) 2015; 24 Rosiyadi, Horng, Fan, Wang, Khan, Pan (b0105) 2012; 19 Y. Q. Shi, Z. Ni, D. Zou, C. Liang, G. Xuan, Lossless data hiding: Fundamentals, algorithms and applications, in: Proceedings of IEEE International Symposium on Circuits and Systems, 2004, pp. II:33–36. Fallahpour (b0025) 2008; 5 Wang, Ni, Zhang, Shi (b0150) 2017; 47 USC-SIPI image database. http://sipi.usc.edu/database. J. Fridrich, M. Goljan, R. Du, Invertible authentication, in: SPIE Proceedings of Security and Watermarking of multimedia Content, vol. 3971, San Jose, 2001, pp. 197–208. Thodi, Rodrłguez (b0130) 2007; 16 Yang, Chunga, Mark Liaob, Yu (b0185) 2012; 86 Tian (10.1016/j.ins.2020.10.063_b0140) 2003; 13 Ioan-Catalin (10.1016/j.ins.2020.10.063_b0050) 2015; 24 Sachnev (10.1016/j.ins.2020.10.063_b0110) 2009; 19 Yang (10.1016/j.ins.2020.10.063_b0185) 2012; 86 Weng (10.1016/j.ins.2020.10.063_b0165) 2012; 3 Ou (10.1016/j.ins.2020.10.063_b0085) 2016; 38 Li (10.1016/j.ins.2020.10.063_b0080) 2015; 10 Weng (10.1016/j.ins.2020.10.063_b0175) 2019; 489 10.1016/j.ins.2020.10.063_b0005 Thodi (10.1016/j.ins.2020.10.063_b0135) 2004 Fallahpour (10.1016/j.ins.2020.10.063_b0025) 2008; 5 Wang (10.1016/j.ins.2020.10.063_b0155) 2010 10.1016/j.ins.2020.10.063_b0120 Kamstra (10.1016/j.ins.2020.10.063_b0060) 2005; 14 Li (10.1016/j.ins.2020.10.063_b0075) 2013; 93 Wu (10.1016/j.ins.2020.10.063_b0180) 2012; 92 Alattar (10.1016/j.ins.2020.10.063_b0015) 2004; 13 Hong (10.1016/j.ins.2020.10.063_b0045) 2015; 308 Li (10.1016/j.ins.2020.10.063_b0070) 2013; 93 Shi (10.1016/j.ins.2020.10.063_b0115) 2016; 4 Peng (10.1016/j.ins.2020.10.063_b0100) 2020; 81 Jung (10.1016/j.ins.2020.10.063_b0055) 2011; 18 Peng (10.1016/j.ins.2020.10.063_b0090) 2012; 92 Thodi (10.1016/j.ins.2020.10.063_b0130) 2007; 16 Fridrich (10.1016/j.ins.2020.10.063_b0035) 2002; 2002 Hong (10.1016/j.ins.2020.10.063_b0040) 2013; 291 Rosiyadi (10.1016/j.ins.2020.10.063_b0105) 2012; 19 Wang (10.1016/j.ins.2020.10.063_b0150) 2017; 47 Li (10.1016/j.ins.2020.10.063_b0065) 2019; 48 Tai (10.1016/j.ins.2020.10.063_b0125) 2009; 19 Weng (10.1016/j.ins.2020.10.063_b0170) 2016; 369 Celik (10.1016/j.ins.2020.10.063_b0020) 2005; 12 Wang (10.1016/j.ins.2020.10.063_b0145) 2019; 159 10.1016/j.ins.2020.10.063_b0010 10.1016/j.ins.2020.10.063_b0030 Peng (10.1016/j.ins.2020.10.063_b0095) 2014; 25 Wang (10.1016/j.ins.2020.10.063_b0160) 2010; 17 Zou (10.1016/j.ins.2020.10.063_b0190) 2006; 16 |
| References_xml | – volume: 19 start-page: 62 year: 2012 end-page: 73 ident: b0105 article-title: An efficient copyright protection scheme for e-government document images publication-title: IEEE Trans. Multimedia – volume: 5 start-page: 870 year: 2008 end-page: 876 ident: b0025 article-title: Reversible image data hiding based on gradient adjusted prediction publication-title: IEICE Electron Express – volume: 3 start-page: 320 year: 2012 end-page: 326 ident: b0165 article-title: Reversible watermark combining pre-processing operation and histogram shifting publication-title: J. Inf. Hid. Multimedia Signal Process. – volume: 369 start-page: 144 year: 2016 end-page: 159 ident: b0170 article-title: Reversible data hiding based on an adaptive pixel-embedding strategy and two-layer embedding publication-title: Inf. Sci. – volume: 17 start-page: 567 year: 2010 end-page: 570 ident: b0160 article-title: Efficient generalized integer transform for reversible watermarking publication-title: IEEE Signal Process. Lett. – volume: 92 start-page: 3000 year: 2012 end-page: 3009 ident: b0180 article-title: Reversible image watermarking on prediction errors by efficient histogram modification publication-title: Signal Process. – volume: 25 start-page: 255 year: 2014 end-page: 265 ident: b0095 article-title: Improved pvo-based reversible data hiding publication-title: Digit. Signal Process. – volume: 93 start-page: 2748 year: 2013 end-page: 2758 ident: b0070 article-title: Reversible data hiding scheme for color image based on prediction-error expansion and cross-channel correlation publication-title: Signal Process. – volume: 47 start-page: 315 year: 2017 ident: b0150 article-title: Rate and distortion optimization for reversible data hiding using multiple histogram shifting publication-title: IEEE Trans. Cybern. – volume: 14 start-page: 2082 year: 2005 end-page: 2090 ident: b0060 article-title: Reversible data embedding into images using wavelet technique and sorting publication-title: IEEE Trans. Image Process. – volume: 81 year: 2020 ident: b0100 article-title: Reversible data hiding based on rsbemd coding and adaptive multi-segment left and right histogram shifting publication-title: Signal Process.-Image Commun. – reference: USC-SIPI image database. http://sipi.usc.edu/database. – reference: J. Fridrich, M. Goljan, R. Du, Invertible authentication, in: SPIE Proceedings of Security and Watermarking of multimedia Content, vol. 3971, San Jose, 2001, pp. 197–208. – volume: 4 start-page: 3210 year: 2016 end-page: 3237 ident: b0115 article-title: Reversible data hiding: advances in the past two decades publication-title: IEEE Access – volume: 18 start-page: 95 year: 2011 end-page: 98 ident: b0055 article-title: A new histogram modification based reversible data hiding algorithm considering the human visual system publication-title: IEEE Signal Process. Lett. – volume: 10 start-page: 2016 year: 2015 end-page: 2027 ident: b0080 article-title: Efficient reversible data hiding based on multiple histograms modification publication-title: IEEE Trans. Inf. Forensic Secur. – volume: 92 start-page: 54 year: 2012 end-page: 62 ident: b0090 article-title: Adaptive reversible data hiding scheme based on integer transform publication-title: Signal Process. – volume: 19 start-page: 906 year: 2009 end-page: 910 ident: b0125 article-title: Reversible data hiding based on histogram modification of pixel differences publication-title: IEEE Trans. Circuits Syst. Video Technol. – reference: A.A. Abdulla, Exploiting similarities between secret and cover images for improved embedding efficiency and security in digital steganography, Doctoral thesis, University of Buckingham, 2015. – volume: 291 start-page: 87 year: 2013 end-page: 97 ident: b0040 article-title: An improved human visual system based reversible data hiding method using adaptive histogram modification publication-title: Opt. Commun. – volume: 24 start-page: 1244 year: 2015 end-page: 1246 ident: b0050 article-title: On local prediction based reversible watermarking publication-title: IEEE Trans. Image Process. – volume: 2002 start-page: 185 year: 2002 end-page: 196 ident: b0035 article-title: Lossless data embedding-new paradigm in digital watermarking publication-title: EURASIP J. Appl. Signal Process. – volume: 13 start-page: 1147 year: 2004 end-page: 1156 ident: b0015 article-title: Reversible watermark using the difference expansion of a generalized integer transform publication-title: IEEE Trans. Image Process. – volume: 48 start-page: 1 year: 2019 end-page: 9 ident: b0065 article-title: When an attacker meets a cipher-image in 2018: A year in review publication-title: J. Inf. Secur. Appl. – volume: 13 start-page: 890 year: 2003 end-page: 896 ident: b0140 article-title: Reversible data embedding using a difference expansion publication-title: IEEE Trans. Circuits Syst. Video Technol. – volume: 489 start-page: 136 year: 2019 end-page: 154 ident: b0175 article-title: Dynamic improved pixel ordering reversible data hiding publication-title: Inf. Sci. – volume: 308 start-page: 140 year: 2015 end-page: 154 ident: b0045 article-title: Reversible data hiding using delaunay triangulation and selective embedment publication-title: Inf. Sci. – start-page: 217 year: 2010 end-page: 220 ident: b0155 article-title: High capacity reversible image watermarking based on integer transform publication-title: Proceedings of ICIP – volume: 38 start-page: 328 year: 2016 end-page: 339 ident: b0085 article-title: Improved pvo-based reversible data hiding: A new implementation based on multiple histograms modification publication-title: J. Visual Commun. Image Represent. – volume: 19 start-page: 989 year: 2009 end-page: 999 ident: b0110 article-title: Reversible watermarking algorithm using sorting and prediction publication-title: IEEE Trans. Circuits Syst. Video Technol. – reference: Y. Q. Shi, Z. Ni, D. Zou, C. Liang, G. Xuan, Lossless data hiding: Fundamentals, algorithms and applications, in: Proceedings of IEEE International Symposium on Circuits and Systems, 2004, pp. II:33–36. – volume: 16 start-page: 1294 year: 2006 end-page: 1300 ident: b0190 article-title: A semi-fragile lossless digital watermarking scheme based on integer wavelet transform publication-title: IEEE Trans. Circuits Syst. Video Technol. – start-page: 1549 year: 2004 end-page: 1552 ident: b0135 article-title: Prediction-error based reversible watermarking publication-title: Proceedings of IEEE ICIP, vol. 3 – volume: 93 start-page: 198 year: 2013 end-page: 205 ident: b0075 article-title: High-fidelity reversible data hiding scheme based on pixel-value-ordering and prediction-error expansion publication-title: Signal Process. – volume: 86 start-page: 567 year: 2012 end-page: 580 ident: b0185 article-title: Efficient reversible data hiding algorithm based on gradient-based edge direction prediction publication-title: J. Syst. Softw. – volume: 12 start-page: 157 year: 2005 end-page: 160 ident: b0020 article-title: Lossless generalized-lsb data embedding publication-title: IEEE Trans. Image Process. – volume: 16 start-page: 721 year: 2007 end-page: 730 ident: b0130 article-title: Expansion embedding techniques for reversible watermarking publication-title: IEEE Trans. Image Process. – volume: 159 start-page: 193 year: 2019 end-page: 203 ident: b0145 article-title: Multiple histograms based reversible data hiding by using fcm clustering publication-title: Signal Process. – volume: 5 start-page: 870 issue: 20 year: 2008 ident: 10.1016/j.ins.2020.10.063_b0025 article-title: Reversible image data hiding based on gradient adjusted prediction publication-title: IEICE Electron Express doi: 10.1587/elex.5.870 – start-page: 1549 year: 2004 ident: 10.1016/j.ins.2020.10.063_b0135 article-title: Prediction-error based reversible watermarking – volume: 308 start-page: 140 year: 2015 ident: 10.1016/j.ins.2020.10.063_b0045 article-title: Reversible data hiding using delaunay triangulation and selective embedment publication-title: Inf. Sci. doi: 10.1016/j.ins.2014.03.030 – volume: 48 start-page: 1 year: 2019 ident: 10.1016/j.ins.2020.10.063_b0065 article-title: When an attacker meets a cipher-image in 2018: A year in review publication-title: J. Inf. Secur. Appl. – ident: 10.1016/j.ins.2020.10.063_b0120 doi: 10.1109/ISCAS.2004.1329201 – volume: 10 start-page: 2016 issue: 9 year: 2015 ident: 10.1016/j.ins.2020.10.063_b0080 article-title: Efficient reversible data hiding based on multiple histograms modification publication-title: IEEE Trans. Inf. Forensic Secur. doi: 10.1109/TIFS.2015.2444354 – volume: 93 start-page: 2748 issue: 9 year: 2013 ident: 10.1016/j.ins.2020.10.063_b0070 article-title: Reversible data hiding scheme for color image based on prediction-error expansion and cross-channel correlation publication-title: Signal Process. doi: 10.1016/j.sigpro.2013.01.020 – ident: 10.1016/j.ins.2020.10.063_b0010 – volume: 93 start-page: 198 issue: 1 year: 2013 ident: 10.1016/j.ins.2020.10.063_b0075 article-title: High-fidelity reversible data hiding scheme based on pixel-value-ordering and prediction-error expansion publication-title: Signal Process. doi: 10.1016/j.sigpro.2012.07.025 – volume: 13 start-page: 1147 issue: 8 year: 2004 ident: 10.1016/j.ins.2020.10.063_b0015 article-title: Reversible watermark using the difference expansion of a generalized integer transform publication-title: IEEE Trans. Image Process. doi: 10.1109/TIP.2004.828418 – volume: 19 start-page: 989 issue: 7 year: 2009 ident: 10.1016/j.ins.2020.10.063_b0110 article-title: Reversible watermarking algorithm using sorting and prediction publication-title: IEEE Trans. Circuits Syst. Video Technol. doi: 10.1109/TCSVT.2009.2020257 – volume: 4 start-page: 3210 year: 2016 ident: 10.1016/j.ins.2020.10.063_b0115 article-title: Reversible data hiding: advances in the past two decades publication-title: IEEE Access doi: 10.1109/ACCESS.2016.2573308 – volume: 92 start-page: 3000 issue: 12 year: 2012 ident: 10.1016/j.ins.2020.10.063_b0180 article-title: Reversible image watermarking on prediction errors by efficient histogram modification publication-title: Signal Process. doi: 10.1016/j.sigpro.2012.05.034 – volume: 2002 start-page: 185 year: 2002 ident: 10.1016/j.ins.2020.10.063_b0035 article-title: Lossless data embedding-new paradigm in digital watermarking publication-title: EURASIP J. Appl. Signal Process. – volume: 369 start-page: 144 year: 2016 ident: 10.1016/j.ins.2020.10.063_b0170 article-title: Reversible data hiding based on an adaptive pixel-embedding strategy and two-layer embedding publication-title: Inf. Sci. doi: 10.1016/j.ins.2016.05.030 – volume: 38 start-page: 328 year: 2016 ident: 10.1016/j.ins.2020.10.063_b0085 article-title: Improved pvo-based reversible data hiding: A new implementation based on multiple histograms modification publication-title: J. Visual Commun. Image Represent. doi: 10.1016/j.jvcir.2016.03.011 – volume: 16 start-page: 1294 issue: 10 year: 2006 ident: 10.1016/j.ins.2020.10.063_b0190 article-title: A semi-fragile lossless digital watermarking scheme based on integer wavelet transform publication-title: IEEE Trans. Circuits Syst. Video Technol. doi: 10.1109/TCSVT.2006.881857 – volume: 489 start-page: 136 year: 2019 ident: 10.1016/j.ins.2020.10.063_b0175 article-title: Dynamic improved pixel ordering reversible data hiding publication-title: Inf. Sci. doi: 10.1016/j.ins.2019.03.032 – volume: 14 start-page: 2082 issue: 12 year: 2005 ident: 10.1016/j.ins.2020.10.063_b0060 article-title: Reversible data embedding into images using wavelet technique and sorting publication-title: IEEE Trans. Image Process. doi: 10.1109/TIP.2005.859373 – volume: 291 start-page: 87 year: 2013 ident: 10.1016/j.ins.2020.10.063_b0040 article-title: An improved human visual system based reversible data hiding method using adaptive histogram modification publication-title: Opt. Commun. doi: 10.1016/j.optcom.2012.10.081 – volume: 19 start-page: 62 issue: 3 year: 2012 ident: 10.1016/j.ins.2020.10.063_b0105 article-title: An efficient copyright protection scheme for e-government document images publication-title: IEEE Trans. Multimedia doi: 10.1109/MMUL.2011.41 – volume: 25 start-page: 255 year: 2014 ident: 10.1016/j.ins.2020.10.063_b0095 article-title: Improved pvo-based reversible data hiding publication-title: Digit. Signal Process. doi: 10.1016/j.dsp.2013.11.002 – volume: 13 start-page: 890 issue: 8 year: 2003 ident: 10.1016/j.ins.2020.10.063_b0140 article-title: Reversible data embedding using a difference expansion publication-title: IEEE Trans. Circuits Syst. Video Technol. doi: 10.1109/TCSVT.2003.815962 – volume: 12 start-page: 157 issue: 2 year: 2005 ident: 10.1016/j.ins.2020.10.063_b0020 article-title: Lossless generalized-lsb data embedding publication-title: IEEE Trans. Image Process. – ident: 10.1016/j.ins.2020.10.063_b0005 – volume: 3 start-page: 320 issue: 4 year: 2012 ident: 10.1016/j.ins.2020.10.063_b0165 article-title: Reversible watermark combining pre-processing operation and histogram shifting publication-title: J. Inf. Hid. Multimedia Signal Process. – volume: 18 start-page: 95 issue: 2 year: 2011 ident: 10.1016/j.ins.2020.10.063_b0055 article-title: A new histogram modification based reversible data hiding algorithm considering the human visual system publication-title: IEEE Signal Process. Lett. doi: 10.1109/LSP.2010.2095498 – start-page: 217 year: 2010 ident: 10.1016/j.ins.2020.10.063_b0155 article-title: High capacity reversible image watermarking based on integer transform – volume: 17 start-page: 567 issue: 6 year: 2010 ident: 10.1016/j.ins.2020.10.063_b0160 article-title: Efficient generalized integer transform for reversible watermarking publication-title: IEEE Signal Process. Lett. doi: 10.1109/LSP.2010.2046930 – volume: 16 start-page: 721 issue: 3 year: 2007 ident: 10.1016/j.ins.2020.10.063_b0130 article-title: Expansion embedding techniques for reversible watermarking publication-title: IEEE Trans. Image Process. doi: 10.1109/TIP.2006.891046 – ident: 10.1016/j.ins.2020.10.063_b0030 – volume: 24 start-page: 1244 issue: 4 year: 2015 ident: 10.1016/j.ins.2020.10.063_b0050 article-title: On local prediction based reversible watermarking publication-title: IEEE Trans. Image Process. doi: 10.1109/TIP.2015.2395724 – volume: 81 issue: 2 year: 2020 ident: 10.1016/j.ins.2020.10.063_b0100 article-title: Reversible data hiding based on rsbemd coding and adaptive multi-segment left and right histogram shifting publication-title: Signal Process.-Image Commun. – volume: 47 start-page: 315 issue: 2 year: 2017 ident: 10.1016/j.ins.2020.10.063_b0150 article-title: Rate and distortion optimization for reversible data hiding using multiple histogram shifting publication-title: IEEE Trans. Cybern. – volume: 92 start-page: 54 issue: 1 year: 2012 ident: 10.1016/j.ins.2020.10.063_b0090 article-title: Adaptive reversible data hiding scheme based on integer transform publication-title: Signal Process. doi: 10.1016/j.sigpro.2011.06.006 – volume: 19 start-page: 906 issue: 6 year: 2009 ident: 10.1016/j.ins.2020.10.063_b0125 article-title: Reversible data hiding based on histogram modification of pixel differences publication-title: IEEE Trans. Circuits Syst. Video Technol. doi: 10.1109/TCSVT.2009.2017409 – volume: 86 start-page: 567 issue: 2 year: 2012 ident: 10.1016/j.ins.2020.10.063_b0185 article-title: Efficient reversible data hiding algorithm based on gradient-based edge direction prediction publication-title: J. Syst. Softw. doi: 10.1016/j.jss.2012.09.041 – volume: 159 start-page: 193 year: 2019 ident: 10.1016/j.ins.2020.10.063_b0145 article-title: Multiple histograms based reversible data hiding by using fcm clustering publication-title: Signal Process. doi: 10.1016/j.sigpro.2019.02.013 |
| SSID | ssj0004766 |
| Score | 2.555012 |
| Snippet | Traditional prediction error expansion (PEE)-based reversible data hiding (RDH) schemes focus on generating a sharp prediction error histogram (PEH) in order... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 13 |
| SubjectTerms | Improved crisscross optimization algorithm K-means clustering algorithm Multi-choice knapsack problem Multiple prediction error histograms Reversible data hiding |
| Title | Reversible data hiding method for multi-histogram point selection based on improved crisscross optimization algorithm |
| URI | https://dx.doi.org/10.1016/j.ins.2020.10.063 |
| Volume | 549 |
| WOSCitedRecordID | wos000605761300002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1872-6291 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0004766 issn: 0020-0255 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lb9QwELaWlgMcEBRQCxT5gDiwMkqdOLaPFSoCDhWCIvYWOY7TTbVNVrvZUn4K_5bxI4-WhwCJS2R57WSV-TIznidCz0rBc1pSRWSsE5LQxAAfjEtiUkNLk2ph0tw1m-DHx2I2k-8nk29dLszFgte1uLyUy_9KapgDYtvU2b8gd39TmIAxEB2uQHa4_hHhPxgXaeEyolSrpvPK5a34VtEuqtAFERJXadjGZk2XTVW307XriGPRYCVbYb0IlbM4wBhYy3rtBOq0AR5zHpI3p2px2qyqdn4-1nFDhpNbEARsr7h_NsE8PVfNF1MNdgPH_ODXRRNEqTX8bhz6msHNVYeAnFPycf5VhZXBZkFHQVvekNYl01yJ9bSaK7FHHC-aPD8WnJKU-oZeHcNmvshpYLk-lTUIb19U4wex4C0UZ3CWsRXaqZ15GQXGerXatnVeu3MWtTVTUyFvoG3KmQSGuX349mj2bki65d4R3v3rzmXuggevPejnSs9IkTm5i-6EEwg-9Mi5hyam3kG3R3Upd9B-yGbBz_GImDjIgftoM2AMW4xhjzHsMYZhB76GMewwhnuMYYcxDIMOY3jAGB5jDPcYe4A-vT46efWGhP4dRFPJW2KMUkymUpWCWX-91owXCkSzZIXkQoHqnsuEqjQ-YDzWLDVxGbFClFEhJDU6foi26qY2uwjzguag2Ee80GUC-lQexUomImUlPzC5yPdQ1L3gTIfi9rbHyiLrohjPMqBJZmlip4Ame-hFv2XpK7v8bnHSUS0LX45XOTOA2K-3Pfq3bY_RreGreYK22tXG7KOb-qKt1qunAYjfAbCguDE |
| linkProvider | Elsevier |
| 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=Reversible+data+hiding+method+for+multi-histogram+point+selection+based+on+improved+crisscross+optimization+algorithm&rft.jtitle=Information+sciences&rft.au=Weng%2C+Shaowei&rft.au=Tan%2C+Wenlong&rft.au=Ou%2C+Bo&rft.au=Pan%2C+Jeng-Shyang&rft.date=2021-03-01&rft.pub=Elsevier+Inc&rft.issn=0020-0255&rft.eissn=1872-6291&rft.volume=549&rft.spage=13&rft.epage=33&rft_id=info:doi/10.1016%2Fj.ins.2020.10.063&rft.externalDocID=S0020025520310689 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0020-0255&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0020-0255&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0020-0255&client=summon |