Rank-smoothed Pairwise Learning In Perceptual Quality Assessment
원문 초록
Conducting pairwise comparisons is a widely used approach in curating human perceptual preference data. Typically raters are instructed to make their choices according to a specific set of rules that address certain dimensions of image quality and aesthetics. The outcome of this process is a dataset of sampled image pairs with their associated empirical preference probabilities. Training a model on these pairwise preferences is a common deep learning approach. However, optimizing by gradient descent through mini-batch learning means that the "global" ranking of the images is not explicitly taken into account. In other words, each step of the gradient descent relies only on a limited number of pairwise comparisons. In this work, we demonstrate that regularizing the pairwise empirical probabilities with aggregated rankwise probabilities leads to a more reliable training loss. We show that training a deep image quality assessment model with our rank-smoothed loss consistently improves the accuracy of predicting human preferences.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Text-Visual Semantic Constrained AI-Generated Image Quality Assessment
MS-IQA: A Multi-Scale Feature Fusion Network for PET/CT Image Quality Assessment
3DGS-IEval-15K: A Large-scale Image Quality Evaluation Database for 3D Gaussian-Splatting
DGIQA: Depth-guided Feature Attention and Refinement for Generalizable Image Quality Assessment
Taylor expansion-based Kolmogorov-Arnold network for blind image quality assessment
MMP-2K: A Benchmark Multi-Labeled Macro Photography Image Quality Assessment Database
토론
이 논문과 연결된 포럼 글이 아직 없습니다.