Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Electrical Engineering and Systems Science > Image and Video Processing

arXiv:1912.11145 (eess)
[Submitted on 23 Dec 2019]

Title:Reducing Storage in Large-Scale Photo Sharing Services using Recompression

Authors:Xing Xu, Zahaib Akhtar, Wyatt Lloyd, Antonio Ortega, Ramesh Govindan
View PDF
Abstract:The popularity of photo sharing services has increased dramatically in recent years. Increases in users, quantity of photos, and quality/resolution of photos combined with the user expectation that photos are reliably stored indefinitely creates a growing burden on the storage backend of these services. We identify a new opportunity for storage savings with application-specific compression for photo sharing services: photo recompression.
We explore new photo storage management techniques that are fast so they do not adversely affect photo download latency, are complementary to existing distributed erasure coding techniques, can efficiently be converted to the standard JPEG user devices expect, and significantly increase compression. We implement our photo recompression techniques in two novel codecs, ROMP and L-ROMP. ROMP is a lossless JPEG recompression codec that compresses typical photos 15% over standard JPEG. L-ROMP is a lossy JPEG recompression codec that distorts photos in a perceptually un-noticeable way and typically achieves 28% compression over standard JPEG. We estimate the benefits of our approach on Facebook's photo stack and find that our approaches can reduce the photo storage by 0.3-0.9x the logical size of the stored photos, and offer additional, collateral benefits to the photo caching stack, including 5-11% fewer requests to the backend storage, 15-31% reduction in wide-area bandwidth, and 16% reduction in external bandwidth.
Subjects: Image and Video Processing (eess.IV); Multimedia (cs.MM)
Cite as: arXiv:1912.11145 [eess.IV]
  (or arXiv:1912.11145v1 [eess.IV] for this version)
  https://doi.org/10.48550/arXiv.1912.11145

Submission history

From: Xing Xu [view email]
[v1] Mon, 23 Dec 2019 23:39:51 UTC (1,393 KB)
Full-text links:

Access Paper:

  • View PDF
  • TeX Source
  • Other Formats
view license
Current browse context:
eess.IV
< prev   |   next >
new | recent | 2019-12
Change to browse by:
cs
cs.MM
eess

References & Citations

export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)