High Capacity Reversible Data Hiding with Optimal Bit Allocation

High Capacity Reversible Data Hiding with Optimal Bit Allocation | Research Square window.SnipcartSettings = { analytics: { enabled: false } }; (function() { var accessVector = localStorage.getItem('access_vector') || ''; window.dataLayer = window.dataLayer || []; if (accessVector) { window.dataLayer.push({ user: { profile: { profileInfo: { snid: accessVector } } } }); } })(); (function(w,d,s,l,i){w[l]=w[l]||[];w[l].push({'gtm.start':new Date().getTime(),event:'gtm.js'});var f=d.getElementsByTagName(s)[0],j=d.createElement(s),dl=l!='dataLayer'?'&l='+l:'';j.async=true;j.src='https://www.googletagmanager.com/gtm.js?id='+i+dl;f.parentNode.insertBefore(j,f);})(window,document,'script','dataLayer','GTM-K279D39R'); Browse Preprints In Review Journals COVID-19 Preprints AJE Video Bytes Research Tools Research Promotion AJE Professional Editing AJE Rubriq About Preprint Platform In Review Editorial Policies Our Team Advisory Board Help Center Sign In Submit a Preprint Cite Share Download PDF Research Article High Capacity Reversible Data Hiding with Optimal Bit Allocation Davide Cavagnino, Alessandro Druetto, Marco Grangetto, Maurizio Lucenteforte This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-3003958/v1 This work is licensed under a CC BY 4.0 License Status: Posted Version 1 posted You are reading this latest preprint version Abstract This paper extends and improves the performance of a digital reversible watermarking algorithm presented in a previous work. The considered algorithm exploits the property of image histograms of some kinds of medical images which present many contiguous 0-runs, i.e., a comb structure in the gray level frequencies. The previous work suggested to perform some gray level histogram shifting according to a local optimization technique. In this paper we apply combinatorial optimization techniques to entire blocks of contiguous 0-runs, improving the payload capacity of the reversible data hiding method. Authentication Data Hiding Watermarking Zero-Run Encoding Full Text Cite Share Download PDF Status: Posted Version 1 posted You are reading this latest preprint version Research Square lets you share your work early, gain feedback from the community, and start making changes to your manuscript prior to peer review in a journal. As a division of Research Square Company, we’re committed to making research communication faster, fairer, and more useful. We do this by developing innovative software and high quality services for the global research community. Our growing team is made up of researchers and industry professionals working together to solve the most critical problems facing scientific publishing. Also discoverable on Platform About Our Team In Review Editorial Policies Advisory Board Help Center Resources Author Services Accessibility API Access RSS feed Manage Cookie Preferences © Research Square 2026 | ISSN 2693-5015 (online) Privacy Policy Terms of Service Do Not Sell My Personal Information {"props":{"pageProps":{"initialData":{"identity":"rs-3003958","acceptedTermsAndConditions":true,"allowDirectSubmit":true,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":210657166,"identity":"9f141375-28e4-411d-a67e-297339adc5ca","order_by":0,"name":"Davide Cavagnino","email":"","orcid":"","institution":"Universita degli Studi di Torino Dipartimento di Informatica","correspondingAuthor":false,"submittingAuthor":false,"prefix":"","firstName":"Davide","middleName":"","lastName":"Cavagnino","suffix":""},{"id":210657167,"identity":"c2a7aca5-74b5-457c-ba3d-ad76d33576d4","order_by":1,"name":"Alessandro Druetto","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAABDklEQVRIie3RsUoDMRjA8ZRAsnwla8rR8xUigUJR9FVahE4KnYSClEjguhTnG3yOut7xQV1ad6mDInQ/hHJD0d5ZOEQudXXIf0gy5EcSQojP9x/j+6lhikHu1zQhRJWzg9BfRAJhvYIUhjpMDYHyCPcxwlLM8puX9sPENFaj6HR8zqebYDjchoSLpI5IZIMA5mt9v0hodxkNJMByFsRKaefFEDqUMOzHssdatxFKkFezAJTqGwc5QvGR5Z8V+SrI5fogUQhENqOKJCVhB8kxsk7QvEMdQ2q75umiNV3M9QkorRmlqo6Ej/Y9yzfYjrlNn831meAT+7aCbRgKkb7Wv7/q+2t+xP7Y7/P5fD53O5VOUwCjt3Z1AAAAAElFTkSuQmCC","orcid":"https://orcid.org/0000-0002-8605-0193","institution":"Universita degli Studi di Torino Dipartimento di Informatica","correspondingAuthor":true,"submittingAuthor":false,"prefix":"","firstName":"Alessandro","middleName":"","lastName":"Druetto","suffix":""},{"id":210657168,"identity":"d62c0996-2e1d-4e08-8321-38138451b222","order_by":2,"name":"Marco Grangetto","email":"","orcid":"","institution":"Universita degli Studi di Torino Dipartimento di Informatica","correspondingAuthor":false,"submittingAuthor":false,"prefix":"","firstName":"Marco","middleName":"","lastName":"Grangetto","suffix":""},{"id":210657169,"identity":"eb90752d-bc06-4025-bfa2-209a19795498","order_by":3,"name":"Maurizio Lucenteforte","email":"","orcid":"","institution":"Universita degli Studi di Torino Dipartimento di Informatica","correspondingAuthor":false,"submittingAuthor":false,"prefix":"","firstName":"Maurizio","middleName":"","lastName":"Lucenteforte","suffix":""}],"badges":[],"createdAt":"2023-05-31 08:46:50","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-3003958/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-3003958/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":40907185,"identity":"c69768ad-5ba9-477e-9a6c-6675aa8a7c88","added_by":"auto","created_at":"2023-08-01 20:13:13","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":1331940,"visible":true,"origin":"","legend":"","description":"","filename":"manuscript.pdf","url":"https://assets-eu.researchsquare.com/files/rs-3003958/v1_covered_24b022ea-8e9c-4c8b-8283-961a256816f1.pdf"}],"financialInterests":"","formattedTitle":"High Capacity Reversible Data Hiding with Optimal Bit Allocation","fulltext":[],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":false,"hideJournal":true,"highlight":"","institution":"","isAcceptedByJournal":false,"isAuthorSuppliedPdf":true,"isDeskRejected":"","isHiddenFromSearch":false,"isInQc":false,"isInWorkflow":false,"isPdf":true,"isPdfUpToDate":true,"isWithdrawnOrRetracted":false,"journal":{"display":true,"email":"[email protected]","identity":"researchsquare","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":true,"externalIdentity":"","sideBox":"","snPcode":"","submissionUrl":"/submission","title":"Research Square","twitterHandle":"researchsquare","acdcEnabled":true,"dfaEnabled":false,"editorialSystem":"","reportingPortfolio":"","inReviewEnabled":false,"inReviewRevisionsEnabled":true},"keywords":"Authentication, Data Hiding, Watermarking, Zero-Run Encoding","lastPublishedDoi":"10.21203/rs.3.rs-3003958/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-3003958/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"\u003cp\u003eThis paper extends and improves the performance of a digital reversible watermarking algorithm presented in a previous work. The considered algorithm exploits the property of image histograms of some kinds of medical images which present many contiguous 0-runs, i.e., a comb structure in the gray level frequencies. The previous work suggested to perform some gray level histogram shifting according to a local optimization technique. In this paper we apply combinatorial optimization techniques to entire blocks of contiguous 0-runs, improving the payload capacity of the reversible data hiding method.\u003c/p\u003e","manuscriptTitle":"High Capacity Reversible Data Hiding with Optimal Bit Allocation","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2023-06-20 21:57:48","doi":"10.21203/rs.3.rs-3003958/v1","editorialEvents":[{"type":"communityComments","content":0}],"status":"published","journal":{"display":true,"email":"[email protected]","identity":"researchsquare","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":true,"externalIdentity":"","sideBox":"","snPcode":"","submissionUrl":"/submission","title":"Research Square","twitterHandle":"researchsquare","acdcEnabled":true,"dfaEnabled":false,"editorialSystem":"","reportingPortfolio":"","inReviewEnabled":false,"inReviewRevisionsEnabled":true}}],"origin":"","ownerIdentity":"f9e07ab6-93d1-450c-be0e-66e59ab85c6d","owner":[],"postedDate":"June 20th, 2023","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"posted","subjectAreas":[],"tags":[],"updatedAt":"2023-08-01T20:04:57+00:00","versionOfRecord":[],"versionCreatedAt":"2023-06-20 21:57:48","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-3003958","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-3003958","identity":"rs-3003958","version":["v1"]},"buildId":"7rjqhiLT3MXkJMwkYKINL","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}