Root Delta Image (RDI): A Low-Complexity Lossy Still-Image Format with Scanline Root-Delta Prediction

preprint OA: closed
Full text JSON View at publisher

Abstract

Abstract Modern image codecs achieve impressive compression ratios, but their bitstreams and decoding pipelines have grown complex enough that implementing and hardening a decoder is often more challenging than the image-processing task that motivated the decoder in the first place.This work presents Root Delta Image (RDI) , a compact, intentionally low-complexity lossy raster format designed around (i) a reversible integer color decorrelation transform (YCoCg), (ii) per-scanline prediction with a constrained 4-bit root-delta quantizer, (iii) optional 2\((\times)\)2 chroma subsampling, and (iv) a file layout consisting of a fixed-size header plus exactly one \texttt{zlib}/DEFLATE-compressed payload.RDI trades compression efficiency for analyzability: the format has explicit size bounds and deterministic decode procedures that are expressible with bounded loops, integer arithmetic, and a single call to a commodity DEFLATE implementation.We summarize the format specification, describe a reference implementation, and evaluate two practical nibble-packed modes on natural images.Across the Kodak image suite and two TestImages.org subsets, RDI achieves perceptual similarity comparable to baseline JPEG at common quality settings while typically requiring higher bitrates; at the same time, it yields substantial size reductions compared to lossless PNG.We position RDI among predictive and transform-based codecs and highlight properties that are particularly relevant to embedded and security-sensitive deployments: compact decoding logic, predictable memory use, and a validation-first bitstream structure.
Full text 10,929 characters · extracted from preprint-html · click to expand
Root Delta Image (RDI): A Low-Complexity Lossy Still-Image Format with Scanline Root-Delta Prediction | 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 Root Delta Image (RDI): A Low-Complexity Lossy Still-Image Format with Scanline Root-Delta Prediction Anar Bastanov, Vecdi Emre Levent This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-8705345/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 Modern image codecs achieve impressive compression ratios, but their bitstreams and decoding pipelines have grown complex enough that implementing and hardening a decoder is often more challenging than the image-processing task that motivated the decoder in the first place.This work presents Root Delta Image (RDI) , a compact, intentionally low-complexity lossy raster format designed around (i) a reversible integer color decorrelation transform (YCoCg), (ii) per-scanline prediction with a constrained 4-bit root-delta quantizer, (iii) optional 2 \((\times)\) 2 chroma subsampling, and (iv) a file layout consisting of a fixed-size header plus exactly one \texttt{zlib}/DEFLATE-compressed payload.RDI trades compression efficiency for analyzability: the format has explicit size bounds and deterministic decode procedures that are expressible with bounded loops, integer arithmetic, and a single call to a commodity DEFLATE implementation.We summarize the format specification, describe a reference implementation, and evaluate two practical nibble-packed modes on natural images.Across the Kodak image suite and two TestImages.org subsets, RDI achieves perceptual similarity comparable to baseline JPEG at common quality settings while typically requiring higher bitrates; at the same time, it yields substantial size reductions compared to lossless PNG.We position RDI among predictive and transform-based codecs and highlight properties that are particularly relevant to embedded and security-sensitive deployments: compact decoding logic, predictable memory use, and a validation-first bitstream structure. Image compression low-complexity codec predictive coding delta coding YCoCg DEFLATE secure parsing embedded systems Full Text Additional Declarations No competing interests reported. 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-8705345","acceptedTermsAndConditions":true,"allowDirectSubmit":true,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":581619346,"identity":"dbf97d73-33b9-49f5-950d-cdb562d41ec2","order_by":0,"name":"Anar Bastanov","email":"","orcid":"","institution":"Baku Higher Oil School","correspondingAuthor":false,"prefix":"","firstName":"Anar","middleName":"","lastName":"Bastanov","suffix":""},{"id":581619347,"identity":"e8c0193c-8ae3-4b1f-9022-18aa2002e948","order_by":1,"name":"Vecdi Emre Levent","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAA7ElEQVRIie3OoWvDQBTH8RcCFxM4N14I5G94ELmy/CsJB1cTEZm6qtUMalu6f2KuYiLHwVTqAzGJqZpI3VybFAY1SyIn7it+d+YDD8Bk+rdl97Wa1Xp44zmEhrFtOv2SYiZhOIvwp1PbAC2Srb/9ytVRA3dSsi+ffxPvsAwJSCb7d80qVWrw3r4JivPISbVkCKRDqgSrL68aqEp7MnJZVEvnB+gaRj3JVE+iKUK+ZP0WAaFgMBDCCYK1tDEmEWAlQlTl0sXynBXlCOEHaXVd/uLyXdJ26vgc8I34aPIRci9++LvDTAGTyWQyTXQDWkhSGWkpsE8AAAAASUVORK5CYII=","orcid":"","institution":"Fenerbahçe University","correspondingAuthor":true,"prefix":"","firstName":"Vecdi","middleName":"Emre","lastName":"Levent","suffix":""}],"badges":[],"createdAt":"2026-01-27 03:38:19","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-8705345/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-8705345/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":106960584,"identity":"4c17454a-88bf-41ba-a5e1-bcdccd30e286","added_by":"auto","created_at":"2026-04-15 09:21:51","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":668079,"visible":true,"origin":"","legend":"","description":"","filename":"rdispringersubmissionpackage.pdf","url":"https://assets-eu.researchsquare.com/files/rs-8705345/v1_covered_891bac10-59de-4350-b00a-b29a38da90b5.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"Root Delta Image (RDI): A Low-Complexity Lossy Still-Image Format with Scanline Root-Delta Prediction","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":"Image compression, low-complexity codec, predictive coding, delta coding, YCoCg, DEFLATE, secure parsing, embedded systems","lastPublishedDoi":"10.21203/rs.3.rs-8705345/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-8705345/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"\u003cp\u003eModern image codecs achieve impressive compression ratios, but their bitstreams and decoding pipelines have grown complex enough that implementing and \u003cem\u003ehardening\u003c/em\u003e a decoder is often more challenging than the image-processing task that motivated the decoder in the first place.This work presents \u003cem\u003eRoot Delta Image (RDI)\u003c/em\u003e, a compact, intentionally low-complexity \u003cem\u003elossy\u003c/em\u003e raster format designed around (i) a reversible integer color decorrelation transform (YCoCg), (ii) per-scanline prediction with a constrained 4-bit \u003cem\u003eroot-delta\u003c/em\u003e quantizer, (iii) optional 2\u003cspan class=\"InlineEquation\"\u003e\u003cspan class=\"mathinline\"\u003e\\((\\times)\\)\u003c/span\u003e\u003c/span\u003e2 chroma subsampling, and (iv) a file layout consisting of a fixed-size header plus exactly one \\texttt{zlib}/DEFLATE-compressed payload.RDI trades compression efficiency for analyzability: the format has explicit size bounds and deterministic decode procedures that are expressible with bounded loops, integer arithmetic, and a single call to a commodity DEFLATE implementation.We summarize the format specification, describe a reference implementation, and evaluate two practical nibble-packed modes on natural images.Across the Kodak image suite and two TestImages.org subsets, RDI achieves perceptual similarity comparable to baseline JPEG at common quality settings while typically requiring higher bitrates; at the same time, it yields substantial size reductions compared to lossless PNG.We position RDI among predictive and transform-based codecs and highlight properties that are particularly relevant to embedded and security-sensitive deployments: compact decoding logic, predictable memory use, and a validation-first bitstream structure.\u003c/p\u003e","manuscriptTitle":"Root Delta Image (RDI): A Low-Complexity Lossy Still-Image Format with Scanline Root-Delta Prediction","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2026-01-30 18:14:36","doi":"10.21203/rs.3.rs-8705345/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":"e26ac8fe-e4cd-4641-8f0a-3fcda9d55539","owner":[],"postedDate":"January 30th, 2026","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"posted","subjectAreas":[],"tags":[],"updatedAt":"2026-04-12T20:08:59+00:00","versionOfRecord":[],"versionCreatedAt":"2026-01-30 18:14:36","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-8705345","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-8705345","identity":"rs-8705345","version":["v1"]},"buildId":"XKTyCvWXoU3ODBz1xrDgd","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}

Text is read by the "Ask this paper" AI Q&A widget below. Extraction quality varies by source — PMC NXML preserves structure cleanly, OA-HTML may include some navigation residue, and OA-PDF can have broken hyphenation. The publisher copy (via DOI) is the canonical version.

My notes (saved in your browser only)

Ask this paper AI returns verbatim quotes from the full text · source: preprint-html

Answers must be backed by verbatim quotes from this paper's full text. Hallucinated quotes are dropped automatically; if no verbatim passage answers the question, we say so. How this works

Citation neighborhood (no data yet)

We don't have any in-corpus citations linked to this paper yet. This is a recent paper (2026) — citers typically take a year or two to land, and the OpenAlex reference graph may still be filling in.

Source provenance

europepmc
last seen: 2026-05-20T01:45:00.602351+00:00