@article{Srutarshi2020,
abstract = {With several advantages over conventional RGB cameras, event cameras have provided new opportunities for tackling visual tasks under challenging scenarios with fast motion, high dynamic range, and/or power constraint. Yet unlike image/video compression, the performance of event compression algorithm is far from satisfying and practical. The main challenge for compressing events is the unique event data form, i.e., a stream of asynchronously fired event tuples each encoding the 2D spatial location, timestamp, and polarity (denoting an increase or decrease in brightness). Since events only encode temporal variations, they lack spatial structure which is crucial for compression. To address this problem, we propose a novel event compression algorithm based on a quad tree (QT) segmentation map derived from the adjacent intensity images. The QT informs 2D spatial priority within the 3D space-time volume. In the event encoding step, events are first aggregated over time to form polarity-based event histograms. The histograms are then variably sampled via Poisson Disk Sampling prioritized by the QT based segmentation map. Next, differential encoding and run length encoding are employed for encoding the spatial and polarity information of the sampled events, respectively, followed by Huffman encoding to produce the final encoded events. Our Poisson Disk Sampling based Lossy Event Compression (PDS-LEC) algorithm performs rate-distortion based optimal allocation. On average, our algorithm achieves greater than 6x compression compared to the state of the art.},
archivePrefix = {arXiv},
arxivId = {2005.00974},
author = {Banerjee, Srutarshi and Wang, Zihao W. and Chopp, Henry H. and Cossairt, Oliver and Katsaggelos, Aggelos},
eprint = {2005.00974},
journal = {arXiv},
keywords = {Event cameras,Event-based vision,Image and video compression},
month = {may},
title = {{Lossy Event Compression based on Image-derived Quad Trees and Poisson Disk Sampling}},
url = {http://arxiv.org/abs/2005.00974},
year = {2020}
}

{"_id":"eyAvvMDmwesJRn527","bibbaseid":"banerjee-wang-chopp-cossairt-katsaggelos-lossyeventcompressionbasedonimagederivedquadtreesandpoissondisksampling-2020","author_short":["Banerjee, S.","Wang, Z. W.","Chopp, H. H.","Cossairt, O.","Katsaggelos, A."],"bibdata":{"bibtype":"article","type":"article","abstract":"With several advantages over conventional RGB cameras, event cameras have provided new opportunities for tackling visual tasks under challenging scenarios with fast motion, high dynamic range, and/or power constraint. Yet unlike image/video compression, the performance of event compression algorithm is far from satisfying and practical. The main challenge for compressing events is the unique event data form, i.e., a stream of asynchronously fired event tuples each encoding the 2D spatial location, timestamp, and polarity (denoting an increase or decrease in brightness). Since events only encode temporal variations, they lack spatial structure which is crucial for compression. To address this problem, we propose a novel event compression algorithm based on a quad tree (QT) segmentation map derived from the adjacent intensity images. The QT informs 2D spatial priority within the 3D space-time volume. In the event encoding step, events are first aggregated over time to form polarity-based event histograms. The histograms are then variably sampled via Poisson Disk Sampling prioritized by the QT based segmentation map. Next, differential encoding and run length encoding are employed for encoding the spatial and polarity information of the sampled events, respectively, followed by Huffman encoding to produce the final encoded events. Our Poisson Disk Sampling based Lossy Event Compression (PDS-LEC) algorithm performs rate-distortion based optimal allocation. On average, our algorithm achieves greater than 6x compression compared to the state of the art.","archiveprefix":"arXiv","arxivid":"2005.00974","author":[{"propositions":[],"lastnames":["Banerjee"],"firstnames":["Srutarshi"],"suffixes":[]},{"propositions":[],"lastnames":["Wang"],"firstnames":["Zihao","W."],"suffixes":[]},{"propositions":[],"lastnames":["Chopp"],"firstnames":["Henry","H."],"suffixes":[]},{"propositions":[],"lastnames":["Cossairt"],"firstnames":["Oliver"],"suffixes":[]},{"propositions":[],"lastnames":["Katsaggelos"],"firstnames":["Aggelos"],"suffixes":[]}],"eprint":"2005.00974","journal":"arXiv","keywords":"Event cameras,Event-based vision,Image and video compression","month":"may","title":"Lossy Event Compression based on Image-derived Quad Trees and Poisson Disk Sampling","url":"http://arxiv.org/abs/2005.00974","year":"2020","bibtex":"@article{Srutarshi2020,\nabstract = {With several advantages over conventional RGB cameras, event cameras have provided new opportunities for tackling visual tasks under challenging scenarios with fast motion, high dynamic range, and/or power constraint. Yet unlike image/video compression, the performance of event compression algorithm is far from satisfying and practical. The main challenge for compressing events is the unique event data form, i.e., a stream of asynchronously fired event tuples each encoding the 2D spatial location, timestamp, and polarity (denoting an increase or decrease in brightness). Since events only encode temporal variations, they lack spatial structure which is crucial for compression. To address this problem, we propose a novel event compression algorithm based on a quad tree (QT) segmentation map derived from the adjacent intensity images. The QT informs 2D spatial priority within the 3D space-time volume. In the event encoding step, events are first aggregated over time to form polarity-based event histograms. The histograms are then variably sampled via Poisson Disk Sampling prioritized by the QT based segmentation map. Next, differential encoding and run length encoding are employed for encoding the spatial and polarity information of the sampled events, respectively, followed by Huffman encoding to produce the final encoded events. Our Poisson Disk Sampling based Lossy Event Compression (PDS-LEC) algorithm performs rate-distortion based optimal allocation. On average, our algorithm achieves greater than 6x compression compared to the state of the art.},\narchivePrefix = {arXiv},\narxivId = {2005.00974},\nauthor = {Banerjee, Srutarshi and Wang, Zihao W. and Chopp, Henry H. and Cossairt, Oliver and Katsaggelos, Aggelos},\neprint = {2005.00974},\njournal = {arXiv},\nkeywords = {Event cameras,Event-based vision,Image and video compression},\nmonth = {may},\ntitle = {{Lossy Event Compression based on Image-derived Quad Trees and Poisson Disk Sampling}},\nurl = {http://arxiv.org/abs/2005.00974},\nyear = {2020}\n}\n","author_short":["Banerjee, S.","Wang, Z. W.","Chopp, H. H.","Cossairt, O.","Katsaggelos, A."],"key":"Srutarshi2020","id":"Srutarshi2020","bibbaseid":"banerjee-wang-chopp-cossairt-katsaggelos-lossyeventcompressionbasedonimagederivedquadtreesandpoissondisksampling-2020","role":"author","urls":{"Paper":"http://arxiv.org/abs/2005.00974"},"keyword":["Event cameras","Event-based vision","Image and video compression"],"metadata":{"authorlinks":{}}},"bibtype":"article","biburl":"https://sites.northwestern.edu/ivpl/files/2023/06/IVPL_Updated_publications-1.bib","dataSources":["E6Bth2QB5BYjBMZE7","nbnEjsN7MJhurAK9x","PNQZj6FjzoxxJk4Yi","7FpDWDGJ4KgpDiGfB","bod9ms4MQJHuJgPpp","QR9t5P2cLdJuzhfzK","D8k2SxfC5dKNRFgro","7Dwzbxq93HWrJEhT6","qhF8zxmGcJfvtdeAg","fvDEHD49E2ZRwE3fb","H7crv8NWhZup4d4by","DHqokWsryttGh7pJE","vRJd4wNg9HpoZSMHD","sYxQ6pxFgA59JRhxi","w2WahSbYrbcCKBDsC","XasdXLL99y5rygCmq","3gkSihZQRfAD2KBo3","t5XMbyZbtPBo4wBGS","bEpHM2CtrwW2qE8FP","teJzFLHexaz5AQW5z"],"keywords":["event cameras","event-based vision","image and video compression"],"search_terms":["lossy","event","compression","based","image","derived","quad","trees","poisson","disk","sampling","banerjee","wang","chopp","cossairt","katsaggelos"],"title":"Lossy Event Compression based on Image-derived Quad Trees and Poisson Disk Sampling","year":2020}