Data-Efficient Sequence-Based Visual Place Recognition with Highly Compressed JPEG Images

• URL: http://arxiv.org/abs/2302.13314v1
• Date: Sun, 26 Feb 2023 13:13:51 GMT
• Title: Data-Efficient Sequence-Based Visual Place Recognition with Highly Compressed JPEG Images
• Authors: Mihnea-Alexandru Tomita, Bruno Ferrarini, Michael Milford, Klaus McDonald-Maier, Shoaib Ehsan
• Abstract summary: Visual Place Recognition (VPR) is a fundamental task that allows a robotic platform to successfully localise itself in the environment. JPEG is an image compression standard that can employ high compression ratios to facilitate lower data transmission for VPR applications. When applying high levels of JPEG compression, both the image clarity and size are drastically reduced.
• Score: 17.847661026367767
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Visual Place Recognition (VPR) is a fundamental task that allows a robotic platform to successfully localise itself in the environment. For decentralised VPR applications where the visual data has to be transmitted between several agents, the communication channel may restrict the localisation process when limited bandwidth is available. JPEG is an image compression standard that can employ high compression ratios to facilitate lower data transmission for VPR applications. However, when applying high levels of JPEG compression, both the image clarity and size are drastically reduced. In this paper, we incorporate sequence-based filtering in a number of well-established, learnt and non-learnt VPR techniques to overcome the performance loss resulted from introducing high levels of JPEG compression. The sequence length that enables 100% place matching performance is reported and an analysis of the amount of data required for each VPR technique to perform the transfer on the entire spectrum of JPEG compression is provided. Moreover, the time required by each VPR technique to perform place matching is investigated, on both uniformly and non-uniformly JPEG compressed data. The results show that it is beneficial to use a highly compressed JPEG dataset with an increased sequence length, as similar levels of VPR performance are reported at a significantly reduced bandwidth. The results presented in this paper also emphasize that there is a trade-off between the amount of data transferred and the total time required to perform VPR. Our experiments also suggest that is often favourable to compress the query images to the same quality of the map, as more efficient place matching can be performed. The experiments are conducted on several VPR datasets, under mild to extreme JPEG compression.

Related papers

• ODDN: Addressing Unpaired Data Challenges in Open-World Deepfake Detection on Online Social Networks [51.03118447290247]
  We propose the open-world deepfake detection network (ODDN), which comprises open-world data aggregation (ODA) and compression-discard gradient correction (CGC) ODA effectively aggregates correlations between compressed and raw samples through both fine-grained and coarse-grained analyses. CGC incorporates a compression-discard gradient correction to further enhance performance across diverse compression methods in online social networks (OSNs)
  arXiv  Detail & Related papers  (2024-10-24T12:32:22Z)
• Learned Image Compression for HE-stained Histopathological Images via Stain Deconvolution [33.69980388844034]
  In this paper, we show that the commonly used JPEG algorithm is not best suited for further compression. We propose Stain Quantized Latent Compression, a novel DL based histopathology data compression approach. We show that our approach yields superior performance in a classification downstream task, compared to traditional approaches like JPEG.
  arXiv  Detail & Related papers  (2024-06-18T13:47:17Z)
• PatchSVD: A Non-uniform SVD-based Image Compression Algorithm [20.856903918492154]
  We propose a novel region-based lossy image compression technique, called PatchSVD, based on the Singular Value Decomposition (SVD) algorithm. We show through experiments that PatchSVD outperforms SVD-based image compression with respect to three popular image compression metrics.
  arXiv  Detail & Related papers  (2024-06-07T17:57:40Z)
• UniCompress: Enhancing Multi-Data Medical Image Compression with Knowledge Distillation [59.3877309501938]
  Implicit Neural Representation (INR) networks have shown remarkable versatility due to their flexible compression ratios. We introduce a codebook containing frequency domain information as a prior input to the INR network. This enhances the representational power of INR and provides distinctive conditioning for different image blocks.
  arXiv  Detail & Related papers  (2024-05-27T05:52:13Z)
• Hyperspectral Image Compression Using Sampling and Implicit Neural Representations [2.3931689873603603]
  Hyperspectral images record the electromagnetic spectrum for a pixel in the image of a scene. With the decreasing cost of capturing these images, there is a need to develop efficient techniques for storing, transmitting, and analyzing hyperspectral images. This paper develops a method for hyperspectral image compression using implicit neural representations.
  arXiv  Detail & Related papers  (2023-12-04T01:10:04Z)
• Learned Lossless Compression for JPEG via Frequency-Domain Prediction [50.20577108662153]
  We propose a novel framework for learned lossless compression of JPEG images. To enable learning in the frequency domain, DCT coefficients are partitioned into groups to utilize implicit local redundancy. An autoencoder-like architecture is designed based on the weight-shared blocks to realize entropy modeling of grouped DCT coefficients.
  arXiv  Detail & Related papers  (2023-03-05T13:15:28Z)
• Data Efficient Visual Place Recognition Using Extremely JPEG-Compressed Images [17.847661026367767]
  This paper studies the effects of JPEG compression on the performance of Visual Place Recognition techniques. We show that by introducing compression, the VPR performance is drastically reduced, especially in the higher spectrum of compression. We present a fine-tuned CNN which is optimized for JPEG compressed data and show that it performs more consistently with the image transformations detected in extremely compressed JPEG images.
  arXiv  Detail & Related papers  (2022-09-17T14:46:28Z)
• Perceptual Quality Assessment for Fine-Grained Compressed Images [38.615746092795625]
  We propose a full-reference image quality assessment (FR-IQA) method for compressed images of fine-grained levels. The proposed method is validated on the fine-grained compression image quality assessment (FGIQA) database.
  arXiv  Detail & Related papers  (2022-06-08T12:56:45Z)
• Analyzing and Mitigating JPEG Compression Defects in Deep Learning [69.04777875711646]
  We present a unified study of the effects of JPEG compression on a range of common tasks and datasets. We show that there is a significant penalty on common performance metrics for high compression.
  arXiv  Detail & Related papers  (2020-11-17T20:32:57Z)
• Learning to Improve Image Compression without Changing the Standard Decoder [100.32492297717056]
  We propose learning to improve the encoding performance with the standard decoder. Specifically, a frequency-domain pre-editing method is proposed to optimize the distribution of DCT coefficients. We do not modify the JPEG decoder and therefore our approach is applicable when viewing images with the widely used standard JPEG decoder.
  arXiv  Detail & Related papers  (2020-09-27T19:24:42Z)
• Discernible Image Compression [124.08063151879173]
  This paper aims to produce compressed images by pursuing both appearance and perceptual consistency. Based on the encoder-decoder framework, we propose using a pre-trained CNN to extract features of the original and compressed images. Experiments on benchmarks demonstrate that images compressed by using the proposed method can also be well recognized by subsequent visual recognition and detection models.
  arXiv  Detail & Related papers  (2020-02-17T07:35:08Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.