Related papers: A Hitchhiker's Guide to Structural Similarity

A Hitchhiker's Guide to Structural Similarity

URL: http://arxiv.org/abs/2101.06354v2
Date: Sat, 30 Jan 2021 23:40:28 GMT
Title: A Hitchhiker's Guide to Structural Similarity
Authors: Abhinau K. Venkataramanan and Chengyang Wu and Alan C. Bovik and Ioannis Katsavounidis and Zafar Shahid
Abstract summary: The Structural Similarity (SSIM) Index is a very widely used image/video quality model. We studied and compared the functions and performances of popular and widely used implementations of SSIM. We have arrived at a collection of recommendations on how to use SSIM most effectively.
Score: 40.567747702628076
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Abstract: The Structural Similarity (SSIM) Index is a very widely used image/video quality model that continues to play an important role in the perceptual evaluation of compression algorithms, encoding recipes and numerous other image/video processing algorithms. Several public implementations of the SSIM and Multiscale-SSIM (MS-SSIM) algorithms have been developed, which differ in efficiency and performance. This "bendable ruler" makes the process of quality assessment of encoding algorithms unreliable. To address this situation, we studied and compared the functions and performances of popular and widely used implementations of SSIM, and we also considered a variety of design choices. Based on our studies and experiments, we have arrived at a collection of recommendations on how to use SSIM most effectively, including ways to reduce its computational burden.

Related papers

Development and Application of a Monte Carlo Tree Search Algorithm for Simulating Da Vinci Code Game Strategies [4.255191342050175]
This study explores the efficiency of the Monte Carlo Tree Search (MCTS) algorithm in complex decision environments. The research posits that the inherent branch divergence within the Da Vinci Code board game significantly impedes parallelism when executed on Graphics Processing Units (GPUs) Our comparative analysis reveals a linear improvement in performance with the CPU-based implementation, in stark contrast to the GPU implementation, which exhibits a non-linear enhancement pattern and discernible performance troughs.
arXiv Detail & Related papers (2024-03-15T22:43:37Z)
Federated Conditional Stochastic Optimization [110.513884892319]
Conditional optimization has found in a wide range of machine learning tasks, such as in-variant learning tasks, AUPRC, andAML. This paper proposes algorithms for distributed federated learning.
arXiv Detail & Related papers (2023-10-04T01:47:37Z)
Improved Algorithms for Neural Active Learning [74.89097665112621]
We improve the theoretical and empirical performance of neural-network(NN)-based active learning algorithms for the non-parametric streaming setting. We introduce two regret metrics by minimizing the population loss that are more suitable in active learning than the one used in state-of-the-art (SOTA) related work.
arXiv Detail & Related papers (2022-10-02T05:03:38Z)
DSSIM: a structural similarity index for floating-point data [68.8204255655161]
We propose an alternative to the popular SSIM that can be applied directly to the floating point data, which we refer to as the Data SSIM (DSSIM) While we demonstrate the usefulness of the DSSIM in the context of evaluating differences due to lossy compression on large volumes of simulation data, the DSSIM may prove useful for many other applications involving simulation or image data.
arXiv Detail & Related papers (2022-02-05T19:18:33Z)
A User's Guide to Calibrating Robotics Simulators [54.85241102329546]
This paper proposes a set of benchmarks and a framework for the study of various algorithms aimed to transfer models and policies learnt in simulation to the real world. We conduct experiments on a wide range of well known simulated environments to characterize and offer insights into the performance of different algorithms. Our analysis can be useful for practitioners working in this area and can help make informed choices about the behavior and main properties of sim-to-real algorithms.
arXiv Detail & Related papers (2020-11-17T22:24:26Z)
Fast and stable MAP-Elites in noisy domains using deep grids [1.827510863075184]
Deep-Grid MAP-Elites is a variant of the MAP-Elites algorithm that uses an archive of similar previously encountered solutions to approximate the performance of a solution. We show that this simple approach is significantly more resilient to noise on the behavioural descriptors, while achieving competitive performances in terms of fitness optimisation.
arXiv Detail & Related papers (2020-06-25T08:47:23Z)
Differentiable Adaptive Computation Time for Visual Reasoning [4.7518908453572]
This paper presents a novel attention-based algorithm for achieving adaptive computation called DACT. In particular, we study its application to the widely known MAC architecture. We show that by increasing the maximum number of steps used, we surpass the accuracy of even our best non-adaptive MAC in the CLEVR dataset.
arXiv Detail & Related papers (2020-04-27T13:20:23Z)
Image Matching across Wide Baselines: From Paper to Practice [80.9424750998559]
We introduce a comprehensive benchmark for local features and robust estimation algorithms. Our pipeline's modular structure allows easy integration, configuration, and combination of different methods. We show that with proper settings, classical solutions may still outperform the perceived state of the art.
arXiv Detail & Related papers (2020-03-03T15:20:57Z)
Optimization of Structural Similarity in Mathematical Imaging [0.0]
We introduce a general framework that encompasses a wide range of imaging applications in which the SSIM can be employed as a fidelity measure. We show how the framework can be used to cast some standard as well as original imaging tasks into optimization problems.
arXiv Detail & Related papers (2020-02-07T07:46:31Z)

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