{"title":"CADeTT:事件摄像机帧的上下文自适应深度二叉树无损压缩","authors":"Ionut Schiopu;Radu Ciprian Bilcu","doi":"10.1109/LSP.2024.3493801","DOIUrl":null,"url":null,"abstract":"The letter proposes an efficient context-adaptive lossless compression method for encoding event frame sequences. A first contribution proposes the use of a deep-ternary-tree of the current pixel position context as the context-tree model selector. The arithmetic codec encodes each trinary symbol using the probability distribution of the associated context-tree-leaf model. Another contribution proposes a novel context design based on several frames, where the context order controls the codec's complexity. Another contribution proposes a model search procedure to replace the context-tree prune-and-encode strategy by searching for the closest “mature” context model between lower-order context-tree models. The experimental evaluation shows that the proposed method provides an improved coding performance of 34.34% and a smaller runtime of up to \n<inline-formula><tex-math>$5.18\\times$</tex-math></inline-formula>\n compared with state-of-the-art lossless image codec FLIF and, respectively, 6.95% and \n<inline-formula><tex-math>$14.42\\times$</tex-math></inline-formula>\n compared with our prior work.","PeriodicalId":13154,"journal":{"name":"IEEE Signal Processing Letters","volume":"31 ","pages":"3149-3153"},"PeriodicalIF":3.2000,"publicationDate":"2024-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"CADeTT: Context-Adaptive Deep-Trinary-Tree Lossless Compression of Event Camera Frames\",\"authors\":\"Ionut Schiopu;Radu Ciprian Bilcu\",\"doi\":\"10.1109/LSP.2024.3493801\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The letter proposes an efficient context-adaptive lossless compression method for encoding event frame sequences. A first contribution proposes the use of a deep-ternary-tree of the current pixel position context as the context-tree model selector. The arithmetic codec encodes each trinary symbol using the probability distribution of the associated context-tree-leaf model. Another contribution proposes a novel context design based on several frames, where the context order controls the codec's complexity. Another contribution proposes a model search procedure to replace the context-tree prune-and-encode strategy by searching for the closest “mature” context model between lower-order context-tree models. The experimental evaluation shows that the proposed method provides an improved coding performance of 34.34% and a smaller runtime of up to \\n<inline-formula><tex-math>$5.18\\\\times$</tex-math></inline-formula>\\n compared with state-of-the-art lossless image codec FLIF and, respectively, 6.95% and \\n<inline-formula><tex-math>$14.42\\\\times$</tex-math></inline-formula>\\n compared with our prior work.\",\"PeriodicalId\":13154,\"journal\":{\"name\":\"IEEE Signal Processing Letters\",\"volume\":\"31 \",\"pages\":\"3149-3153\"},\"PeriodicalIF\":3.2000,\"publicationDate\":\"2024-11-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Signal Processing Letters\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10747109/\",\"RegionNum\":2,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"ENGINEERING, ELECTRICAL & ELECTRONIC\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Signal Processing Letters","FirstCategoryId":"5","ListUrlMain":"https://ieeexplore.ieee.org/document/10747109/","RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
CADeTT: Context-Adaptive Deep-Trinary-Tree Lossless Compression of Event Camera Frames
The letter proposes an efficient context-adaptive lossless compression method for encoding event frame sequences. A first contribution proposes the use of a deep-ternary-tree of the current pixel position context as the context-tree model selector. The arithmetic codec encodes each trinary symbol using the probability distribution of the associated context-tree-leaf model. Another contribution proposes a novel context design based on several frames, where the context order controls the codec's complexity. Another contribution proposes a model search procedure to replace the context-tree prune-and-encode strategy by searching for the closest “mature” context model between lower-order context-tree models. The experimental evaluation shows that the proposed method provides an improved coding performance of 34.34% and a smaller runtime of up to
$5.18\times$
compared with state-of-the-art lossless image codec FLIF and, respectively, 6.95% and
$14.42\times$
compared with our prior work.
期刊介绍:
The IEEE Signal Processing Letters is a monthly, archival publication designed to provide rapid dissemination of original, cutting-edge ideas and timely, significant contributions in signal, image, speech, language and audio processing. Papers published in the Letters can be presented within one year of their appearance in signal processing conferences such as ICASSP, GlobalSIP and ICIP, and also in several workshop organized by the Signal Processing Society.