Login Paper Search My Schedule Paper Index Help

My ICIP 2021 Schedule

Note: Your custom schedule will not be saved unless you create a new account or login to an existing account.
  1. Create a login based on your email (takes less than one minute)
  2. Perform 'Paper Search'
  3. Select papers that you desire to save in your personalized schedule
  4. Click on 'My Schedule' to see the current list of selected papers
  5. Click on 'Printable Version' to create a separate window suitable for printing (the header and menu will appear, but will not actually print)

Paper Detail

Paper IDCOM-3.6
Paper Title Lossy Event Compression based on Image-derived Quad Trees and Poisson Disk Sampling
Authors Srutarshi Banerjee, Zihao W. Wang, Henry H. Chopp, Oliver Cossairt, Aggelos K. Katsaggelos, Northwestern University, United States
SessionCOM-3: Image and Video Communications
LocationArea H
Session Time:Tuesday, 21 September, 13:30 - 15:00
Presentation Time:Tuesday, 21 September, 13:30 - 15:00
Presentation Poster
Topic Image and Video Communications: Lossy coding of images & video
IEEE Xplore Open Preview  Click here to view in IEEE Xplore
Abstract Event cameras have provided new opportunities for tackling visual tasks under challenging scenarios over conventional RGB cameras. However, not much focus has been given on event compression algorithms. The main challenge for compressing events is its unique asynchronous form. 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 algorithm achieves greater than 6x higher compression compared to the state of the art.