Perceptual Fairness in Image Restoration

Authors: guy  ohayon
michael  elad
tomer  michaeli
Venue: NeurIPS_cc_2024_Conference
Published: 2024-05-04 08:17:29

Abstract: Fairness in image restoration tasks is the desire to treat different sub-groups of images equally well. Existing definitions of fairness in image restoration are highly restrictive. They consider a reconstruction to be a correct outcome for a group (e.g., women) *only* if it falls within the group's set of ground truth images (e.g., natural images of women); otherwise, it is considered *entirely* incorrect. Consequently, such definitions are prone to controversy, as errors in image restoration can manifest in various ways. In this work we offer an alternative approach towards fairness in image restoration, by considering the *Group Perceptual Index* (GPI), which we define as the statistical distance between the distribution of the group's ground truth images and the distribution of their reconstructions. We assess the fairness of an algorithm by comparing the GPI of different groups, and say that it achieves perfect *Perceptual Fairness* (PF) if the GPIs of all groups are identical. We motivate and theoretically study our new notion of fairness, draw its connection to previous ones, and demonstrate its utility on state-of-the-art face image restoration algorithms.

Main paper: 
 introduction: 
 Tremendous efforts have been dedicated to understanding, formalizing, and mitigating fairness issues in various tasks, including classification [17, 22, 29, 81, 94, 95] , regression [2, 7, 8, 12, 43, 65] , clustering [4-6, 13, 70, 73] , recommendation [25, 26, 46, 52, 92] , and generative modeling [15, 24, 44, 66, 74, 75, 96] . Fairness definitions remain largely controversial, yet broadly speaking, they typically advocate for independence (or conditional independence) between sensitive attributes (ethnicity, gender, etc.) and the predictions of an algorithm. In classification tasks, for instance, the input data carries sensitive attributes, which are often required to be statistically independent of the predictions (e.g., deciding whether to grant a loan should not be influenced by the applicant's gender). Similarly, in text-to-image generation, fairness often advocates for statistical independence between the sensitive attributes of the generated images and the text instruction used [24] . For instance, the prompt "An image of a firefighter" should result in images featuring people of various genders, ethnicities, etc.While fairness is commonly associated with the desire to eliminate the dependencies between sensitive attributes and the predictions, fairness in image restoration tasks (e.g., denoising, super-resolution) has a fundamentally different meaning. In image restoration, both the input and the output carry sensitive attributes, and the goal is to preserve the attributes of different groups equally well [34] . But what exactly constitutes such a preservation of sensitive attributes? Let us denote by x, y, and x the unobserved source image, its degraded version (e.g., noisy, blurry), and the reconstruction of x The distribution of all reconstructions is denoted by p X , and p X|A (•|a) is the distribution of the reconstructions associated with attribute value a. The Group Perceptual Index (GPI) of the group associated with a is defined as the statistical distance between p X|A (•|a) and p X|A (•|a), and good PF is achieved when the GPIs of all groups are (roughly) similar. For example, X1 achieves good PF since the GPIs of both a = 0 and a = 1 are roughly equal, while X3 achieves poor PF since the GPI of a = 0 is worse (larger) than that of a = 1. See Section 2 for more details.from y, respectively. Additionally, let X a denote the set of images x carrying the sensitive attributes a. Jalal et al. [34] deem the reconstruction of any x ∈ X a as correct only if x ∈ X a . This allows practitioners to evaluate fairness in an intuitive way, by classifying the reconstructed images produced for different groups. For instance, regarding x, y, and x as realizations of random vectors X, Y , and X, respectively, Representation Demographic Parity (RDP) states that P( X ∈ X a |X ∈ X a ) should be the same for all a, and Proportional Representation (PR) states that P( X ∈ X a ) = P(X ∈ X a ) should hold for every a. However, the idea that a reconstructed image x can either be an entirely correct output (x ∈ X a ) or an entirely incorrect output (x / ∈ X a ) is highly limiting, as errors in image restoration can manifest in many different ways. Indeed, what if one algorithm always produces blank images given inputs from a specific group, and another algorithm produces images that are "almost" in X a for such inputs (e.g., each output is only close to some image in X a )? Should both algorithms be considered equally (and completely) erroneous for that group? Furthermore, quantities of the form P( X ∈ X a |•) completely neglect the distribution of the images within X a . For example, assuming the groups are women and non-women, an algorithm that always outputs the same image of a woman when the source image is a woman, but produces diverse non-women images when the source is not a woman, still satisfies RDP. Does this algorithm truly treat women fairly?To address these controversies, we propose to examine how the restoration method affects the distribution of each group of interest (e.g., the distribution of images of women or non-women). Specifically, we define the Group Perceptual Index (GPI) to be the statistical distance (e.g., Wasserstein) between the distribution of the group's ground truth images and the distribution of their reconstructions. We then associate Perceptual Fairness (PF) with the degree to which the GPIs of the different groups are close to one another. In other words, the PF of an algorithm corresponds to the parity among the GPIs of the groups of interest (see Figure 1 for intuition). The rationale behind using such an index is two-fold. First, it solves the aforementioned controversies. For example, an algorithm that always outputs the same image of a woman when the source image is a woman, and diverse non-women images otherwise, would achieve poor GPI for women and good GPI for non-women, thus resulting in poor PF. Second, the GPI reflects the ability of humans to distinguish between samples of a group's ground truth images and samples of the reconstructions obtained from the degraded images of that group [10] . Thus, achieving good PF (i.e., parity in the GPIs) suggests that this ability is the same for all groups. This paper is structured as follows. In Section 2 we formulate the image restoration task and present the mathematical notations necessary for this paper. This includes a review of prior fairness definitions in image restoration, alongside our proposed definition. We also discuss why PF can be considered as a generalization of RDP. In Section 3 we present our theoretical findings. For instance, we prove that [34] or PF (our proposed notion of fairness). Both RDP and PF assess how well an algorithm treats different fairness groups. Specifically, RDP evaluates the parity in the GP of different groups (higher GP is better), and PF evaluates the parity in the GPI of different groups (lower GPI is better). The results show that the groups old&Asian and old&non-Asian attain similar treatment according to RDP (similar GP scores that are roughly zero), while the latter group attains better treatment according to PF. In Section 4 and Appendix G.7, we show why this outcome of PF is the desired one.achieving perfect GPI for all groups simultaneously is not feasible when the degradation is sufficiently severe. We also establish an interesting (and perhaps counter-intuitive) relationship between the GPI of different groups for algorithms attaining a perfect Perceptual Index (PI) [10] , and show that PF and the PI are often at odds with each other. In Section 4 we demonstrate the practical advantages of PF over RDP. In particular, we show that PF detects bias in cases where RDP fails to do so. Lastly, in Section 5 we discuss the limitations of this work and propose ideas for the future. 
problem formulation and preliminaries: 
 We adopt the Bayesian perspective of inverse problems, where an image x is regarded as a realization of a random vector X with probability density function p X . Consequently, an input y is a realization of a random vector Y (e.g., a noisy version of X), which is related to X via the conditional probability density function p Y |X . The task of an estimator X (in this paper, an image restoration algorithm) is to estimate X only from Y , such that X → Y → X is a Markov chain (X and X are statistically independent given Y ). Given an input y, the estimator X generates outputs according to the conditional density p X|Y (•|y).A common way to evaluate the quality of images produced by an image restoration algorithm is to assess the ability of humans to distinguish between samples of ground truth images and samples of the algorithm's outputs. This is typically done by conducting experiments where human observers vote on whether the generated images are real or fake [18, 20, 28, 32, 33, 72, 101, 102] . Importantly, this ability can be quantified by the Perceptual Index [10] , which is the statistical distance between the distribution of the source images and the distribution of the reconstructed ones,EQUATIONwhere d(•, •) is some divergence between distributions (Kullback-Leibler divergence, total variation distance, Wassersterin distance, etc.).Jalal et al. [34] introduced three pioneering notions of fairness for image restoration algorithms: Representation Demographic Parity (RDP), Proportional Representation (PR), and Conditional Proportional Representation (CPR). Formally, given a collection of sets of images {X ai } k i=1 , where a i is a vector of sensitive attributes and each X ai represents the group carrying the sensitive attributes a i , these notions are defined by RDP: P( X ∈ X ai |X ∈ X ai ) = P( X ∈ X aj |X ∈ X aj ) for every i, j;(2)EQUATIONEQUATIONWhile such definitions are intuitive and practically appealing, they have several limitations. First, any reconstruction that falls even "slightly off" the set X ai is considered an entirely wrong outcome for its corresponding group. In other words, reconstructions with minor errors are treated the same as completely wrong ones. Second, these definitions neglect the distribution of the groups' images.Consequently, an algorithm can satisfy RDP, PR, CPR, etc., while treating some groups much worse than others in terms of the statistics of the reconstructed images. For instance, consider dogs and cats as the two fairness groups. Let X dogs and X cats be the sets of images of dogs and cats, respectively, and let x dog ∈ X dogs be a particular image of a dog. Furthermore, suppose that the species can be perfectly identified from any degraded measurement, i.e.,EQUATIONfor every y. Now, suppose that X always produces the image x dog from any degraded dog image, while generating diverse, high-quality cat images from any degraded cat image. Namely, for every y, we haveEQUATIONEQUATIONEQUATIONAlthough this algorithm satisfies RDP (Equation ( 6)) and CPR (Equations ( 7) and ( 8)), which entails PR [34] , it is clearly useless for dogs. Should such an algorithm really be deemed as fair, then?To address such controversies, we propose to represent each group by the distribution of their images, and measure the representation error of a group by the extent to which an algorithm "preserves" such a distribution. This requires a more general formulation of fairness groups, which is provided next.We denote by A (a random vector) the sensitive attributes of the degraded measurement Y , so that p Y |A (•|a) is the distribution of degraded images associated with the attributes A = a (e.g., the distribution of noisy women images). Consequently, the distribution of the ground truth images that possess the sensitive attributes a is given by p X|A (•|a), and the distribution of their reconstructions is given by p X|A (•|a). Moreover, we assume that A → Y → X forms a Markov chain, implying that knowing A does not affect the reconstructions when Y is given. This assumption is not limiting, since image restoration algorithms are mostly designed to estimate X solely from Y , without taking the sensitive attributes as an additional input. See Figure 1 for an illustrative example of the proposed formulation.Note that such a formulation is quite general, as it does not make any assumptions regarding the nature of the image distributions, whether they have overlapping supports or not, etc. Our formulation also generalizes the previous notion of fairness groups, which considers only the support of p X|A (•|a) for every a. Indeed, one can think of X a = supp p X|A (•|a) as the set of images corresponding to some group, and of {X a } a∈supp p A as the collection of all sets. Furthermore, notice that A can also be the degraded measurement itself, i.e. A = Y . In this case, p X|A (•|a) = p X|Y (•|a) is the posterior distribution of ground truth images given the measurement a, and p X|A (•|a) = p X|Y (•|a) is the distribution of the reconstructions of the measurement a. Namely, our mathematical formulation is adaptive to the granularity of fairness groups considered.We define the fairness of an image restoration algorithm as its ability to equally preserve the distribution p X|A (•|a) across all possible values of a. Formally, we measure the extent to which an algorithm X preserves this distribution by the Group Perceptual Index, defined asEQUATIONwhere d(•, •) is some divergence between distributions. Then, we say that X achieves perfect Perceptual Fairness with respect to d,EQUATIONfor every a 1 , a 2 ∈ supp p A (see Figure 1 to gain intuition). In practice, algorithms may rarely achieve exactly perfect PF d , while the GPI d of different groups may still be roughly equal. In such cases, we say that X achieves good PF d . In contrast, if there exists at least one group that attains far worse GPI d than some other group, we say that X achieves poor/bad PF d . Importantly, note that achieving good PF d does not necessarily indicate good PI d and/or good GPI d values.In addition to the PI d defined in (1) , the performance of image restoration algorithms is often measured via the following complementary measures [45, 71] : (1) Precision, which is the probability that a sample from p X falls within the support of p X , P( X ∈ supp p X ), and (2) Recall, which is the probability that a sample from p X falls within the support of p X , P(X ∈ supp p X ). Achieving low precision implies that the reconstructed images may not always appear as valid samples from p X . Thus, precision reflects the perceptual quality of the reconstructed images. Achieving low recall implies that some portions of the support of p X may never be generated as outputs by X. Hence, recall reflects the perceptual variation of the reconstructed images.Since here we are interested in the perceptual quality and the perceptual variation of a group's reconstructions, let us define the Group Precision and the Group Recall by GP(a)EQUATIONGR(a)EQUATIONwhere X a = supp p X|A (•|a) and Xa = supp p X|A (•|a). Hence, when adopting our formulation of fairness groups, satisfying RDP simply means that the GP values of all groups are the same. However, as hinted in previous sections, two groups with similar GP values may still differ significantly in their GR. From the following theorem, we conclude that attaining perfect PF dTV , where d TV (p, q) = 1 2 |p(x)q(x)|dx is the total variation distance between distributions, guarantees that both the GP and the GR of all groups have a common lower bound. This implies that PF dTV can be considered as a generalization of RDP. Theorem 1. The Group Precision and Group Recall of any restoration method satisfy GP(a) ≥ 1 -GPI dTV (a), (13) GR(a) ≥ 1 -GPI dTV (a), (14 ) for all a ∈ supp p A .Although using d TV (•, •) provides a straightforward relationship between PF dTV and RDP, other types of divergences may not necessarily indicate GP and GR so explicitly. The perceptual quality & variation of a group's reconstructions may be defined in many different ways [71] , and the GPI implicitly entangles these two desired properties.The mathematical notations and fairness definitions are summarized in Appendix A. To further develop our understanding of PF, the next section presents several introductory theorems. 
theoretical results: 
 Image restoration algorithms can generally be categorized into three groups: (1) Algorithms targeting the best possible average distortion (e.g., good PSNR) [3, 21, 47, 48, 83, 85, [97] [98] [99] [100] , (2) algorithms that strive to achieve good average distortion but prioritize attaining best PI [1, 19, 27, 47, 61, 80, 83-85, 88, 89, 93, 100, 104] , and (3) algorithms attempting to sample from the posterior distribution p X|Y of the given task at hand [16, 40-42, 51, 58, 76, 86, 91] . In Appendix B, we demonstrate on a simple toy example that all these types of algorithms may achieve poor PF, implying that perfect PF is not a property that can be obtained trivially. Namely, even when using common reconstruction algorithms such as the Minimum Mean-Squared-Error (MMSE) estimator or the posterior sampler, one group may attain far worse GPI than another group. It is therefore tempting to ask in which scenarios there exists an algorithm capable of achieving perfect GPI for all groups simultaneously. As stated in the following theorem, this desired property is unattainable when the degradation is sufficiently severe.EQUATIONfor both i = 1, 2, where X ai = supp p X|A (•|a i ) and Y ai = supp p Y |A (•|a i ).Then, GPI d (a 1 ) and GPI d (a 2 ) cannot both be equal to zero.In words, Theorem 2 states that when the degraded images of different groups are "more overlapping" than their ground truth images, at least one group must have sub-optimal GPI. Importantly, note that perfect GPI can always be achieved for some group corresponding to A = a individually, by ignoring the input and sampling from p X|A (•|a). Hence, Theorem 2 implies that, for sufficiently severe degradations, one may attempt to approach zero GPI for all groups simultaneously, until the GPI of one group hinders that of another one. But what about algorithms that just attain perfect overall PI? Can such algorithms also attain perfect PF? As stated in the following theorem, it turns out that these two desired properties (perfect PI and perfect PF) are often incompatible.Theorem 3. Suppose that A takes discrete values, X attains perfect PI d (p X = p X ), and ∃a, a m ∈ supp p A such that GPI d (a) > 0 and P(A = a m ) > 0.5. Then, X cannot achieve perfect PF dTV .In words, when there exists a majority group in the data distribution, Theorem 3 states that an algorithm with perfect PI, whose GPI is not perfect even for only one group, cannot achieve perfect PF dTV . This intriguing outcome results from the following convenient relationship between the GPIs of different groups for algorithms with perfect PI.Theorem 4. Suppose that A takes discrete values andEQUATION)for every a with P(A = a) > 0.This theorem is, perhaps, counter-intuitive. Indeed, for algorithms with perfect PI, improving the GPI dTV of one group can only improve the GPI dTV of other groups, and this is true even if the groups do not overlap 1 . While this may seem contradictory to Theorem 2, note that such a relationship holds until the algorithm can no longer attain perfect PI. The example in Appendix B demonstrates this theorem. 
experiments: 
 We demonstrate the superiority of PF over RDP in detecting fairness bias in face image superresolution. Our analysis considers various aspects, including different types of degradations, and fairness evaluations across four groups categorized by ethnicity and age. First, we show that RDP incorrectly attributes fairness in a simple scenario where fairness is clearly violated. In contrast, PF successfully detects the bias. Second, we showcase a scenario where PF uncovers potential malicious intent. Specifically, it can detect bias injected into the system via adversarial attacks, a situation again missed by RDP.In the following sections we assess the fairness of leading face image restoration methods through the lens of PF and RDP. Such methods are often trained and evaluated on high-quality, aligned face image datasets like CelebA-HQ [36] and FFHQ [37] , which lack ground truth labels for sensitive attributes such as ethnicity. Moreover, these datasets are prone to inherent biases, e.g., they contain very few images for certain demographic groups [31, 35, 69] , and it is unclear whether images from different groups have similar levels of image quality and variation (prior work suggests that they might not [11] ). To address these limitations, we leverage an image-to-image translation model that takes a text instruction as additional input. This model allows us to generate four synthetic fairness groups with high-quality, aligned face images. Specifically, we translate each image x from the CelebA-HQ [36] test partition into four different images representing Asian/non-Asian and young/old individuals2 . We use a unique text instruction for each translation. For example, the text instruction "120 years old human, Asian, natural image, sharp, DSLR" translates x into an image of an old&Asian individual. Finally, we include each resulting image in its corresponding group data only if all translations are successful according to the FairFace combined age & ethnicity classifier [35] . This involves classifying the ethnicity and age of the translated images and ensuring that old individuals are categorized as 70+ years old, young individuals are categorized as any other age group, Asian individuals are classified as either Southeast or East Asian, and non-Asian individuals are classified as belonging to any other ethnicity group. See Appendix G.1 for more details and for the visualization of the results.Disclaimer. Importantly, we note that the generated synthetic data sets may impose offensive biases and stereotypes. We use such data sets solely to investigate the fairness of image restoration methods and verify the practical utility of our work. We do not intend to discriminate against any identity group or cultures in any way.We consider several image super-resolution tasks using the average-pooling down-sampling operator with scale factors s ∈ {4, 8, 16, 32}, and statistically independent additive white Gaussian noise of standard deviation σ N ∈ {0, 0.1, 0.25}. In Appendix I we also conduct experiments on image denoising and deblurring. The algorithms DDNM + [86] , DDRM [42] , DPS [16] , and PiGDM [76] are evaluated on all scale factors, and GFPGAN [84] , VQFR [27] , GPEN [93] , DiffBIR [49] , Code-Former [104] , RestoreFormer++ [89] , and RestoreFormer [88] are evaluated only on the ×4 and ×8 scale factors (these algorithms produce completely wrong outputs for the other scale factors). To assess the PF of each algorithm, we compute the GPI KID of each group using the Kernel Inception Distance (KID) [9] and the features extracted from the last pooling layer of the FairFace combined age & ethnicity classifier [35] . In Appendix G.4 we utilize the Fréchet Inception Distance (FID) [30] instead of KID, and in Appendix G.5 we assess other types of group metrics such as PSNR. Additionally, we provide in Appendix G.6 an ablation study of alternative feature extractors. To assess RDP, we use the same FairFace classifier to compute the GP of each group. As done in [34] , we approximate the GP of each group by the classification hit rate, which is the ratio between the number of the group's reconstructions that are classified as belonging to the group and the total number of the group's inputs. Qualitative and quantitative results for s = 32, σ N = 0.0 are presented in Figure 2 . Quantitative results for all values of s and σ N = 0.0 are shown in Figure 3 . Complementary details and results are provided in Appendix G.Figure 3 shows that the group young&non-Asian receives the best overall treatment in terms of both GP and GPI KID . This result is not surprising, since the training data sets of the evaluated algorithms (e.g., FFHQ) are known to be biased towards young and white demographics [50, 63] . However, while most algorithms appear to treat the groups old&Asian and old&non-Asian quite similarly in terms of GP, the GPI KID indicates a clear disadvantage for the former group. Indeed, by examining ethnicity and age separately using the FairFace classifier, we show in Appendix G.7 that, according to RDP, the group old&non-Asian exhibits better preservation of the ethnicity attribute compared to the group old&Asian, while the age attribute remains equally preserved for both groups. This highlights that RDP is strongly dependent on the granularity of the fairness groups (as suggested in [34] ), since slightly altering the groups' partitioning may completely obscure the fact that an algorithm treats certain attributes more favorably than others. However, as our results show, this issue is alleviated when adopting GPI KID instead of GP. Namely, the ethnicity bias is still detected by comparing the GPI KID of different groups, even though the fairness groups are partitioned based on age and ethnicity combined.In Section 2.2.1 we discussed the limitations of fairness definitions such as RDP. For instance, an algorithm might satisfy RDP by always generating the same output for degraded images of a particular group, even if it produces perfect results for another. However, such an extreme scenario is not common in practice. Indeed, real-world imaging systems often involve degradations that are not too severe, and well-trained algorithms perform impressively well when applied to different groups (see, e.g., Figure 4b ). So what practical advantage does PF have over RDP in such circumstances? Here, we demonstrate that a malicious user can manipulate the facial features (e.g., wrinkles) of a group's reconstructions without violating fairness according to RDP, but violating fairness according to PF.In particular, we consider only the ethnicity sensitive attribute by taking the young&Asian group as Asian, and the young&non-Asian group as non-Asian. Then, we use the RestoreFormer++ method, which roughly satisfies RDP with respect to these groups (see Figure 4a , where GP is evaluated by classifying ethnicity alone), and perform adversarial attacks on the inputs of each group to manipulate the outputs such that they are classified as belonging to the 70+ age category. The fact that the GP of each group is quite large implies that the malicious user can classify ethnicity quite accurately from the degraded images, and then manipulate the inputs only for the group it wishes to harm (we skip such a classification step and simply attack all of the group's inputs). Such attacks are anticipated to succeed due to the perception-robustness tradeoff [59, 60] . Complementary details of this experiment are provided in Appendix H.In Figure 4 , we present both quantitative and qualitative results demonstrating that the attacks on the non-Asian group are not detected by RDP. However, we clearly observe that these attacks are successfully identified by the GPI KID of each group. This again highlights that PF is less sensitive to the choice (partitioning) of fairness groups compared to RDP. Specifically, age must be considered as a sensitive attribute to detect such a bias via RDP. Yet, even then, the malicious user may still inject other types of biases. Conversely, PF does not suffer from this limitation, as any attempt to manipulate the distribution of a group's reconstructions would be reflected in the group's GPI. 
discussion: 
 Different demographic groups can utilize an image restoration algorithm, and fairness in this context asserts whether the algorithm "treats" all groups equally well. In this paper, we introduce the notion of Perceptual Fairness (PF) to assess whether such a desired property is upheld. We delve into the theoretical foundation of PF, demonstrate its practical utility, and discuss its superiority over existing fairness definitions. Still, our work is not without limitations. First, while PF alleviates the strong dependence of RDP on the choice of fairness groups [34] (as demonstrated in Section 4), it still cannot guarantee fairness for any arbitrary group partitioning simultaneously (a property referred to as obliviousness in [34] ). Second, our current theorems are preliminary, requiring further research to fully understand the nature of PF. For example, the severity of the tradeoff between the GPI scores of different groups (Theorem 2) and that of the tradeoff between PF and PI (Theorem 3) remain unclear. Third, we do not address the nature of optimal estimators that achieve good or perfect PF. What is their best possible distortion (e.g., MSE) and best possible PI? Fourth, on the practical side, we show in Appendix G.6 that effectively evaluating PF using metrics such as KID necessitates utilizing image features extracted from a classifier dedicated to handling the considered sensitive attributes (e.g., an age and ethnicity classifier). However, this is not a disadvantage compared to previous fairness notions (RDP, CPR and PR), which also require such a classifier. Lastly, while the proposed GPI may be suitable for evaluating fairness in general-content natural images, we considered only human face images due to their societal implications, namely since fairness issues are particularly critical when dealing with such images. For example, if a general-content image restoration algorithm performs better on images with complex structures than on images of clear skies, this discrepancy is unlikely to be problematic for practitioners, as long as the algorithm attains good performance overall. Moreover, previous works [34] evaluated fairness with respect to non-human subjects (e.g., dogs and cats), but these studies provide limited insights into human-related fairness issues, which often arise due to subtle differences between images (e.g., wrinkles). Expanding our method to other datasets remains an avenue for future work.Meaning / Formal definition Group Precision (GP(a) or GP)P( X ∈ X a |A = a) Group Recall (GR(a) or GR) P(X ∈ Xa |A = a) Representation Demographic Parity (RDP) ∀a 1 , a 2 : GP(a 1 ) = GP(a 2 ) Proportional Representation (PR) ∀a : P(X ∈ X a ) = P( X ∈ X a ) Conditional Proportional Representation (CPR) ∀a, y : P(X ∈ X a |Y = y) = P( X ∈ X a |Y = y) Perceptual Fairness (PF d or PF) ∀a 1 , a 2 : GPI d (a 1 ) = GPI d (a 2 )Table 1 : Summary of mathematical notations and fairness definitions used in this paper.We summarize in Table 1 the mathematical notations and fairness definitions used in this paper.The following toy signal restoration example demonstrates that common estimators (e.g., the stochastic estimator which samples from the posterior distribution p X|Y ) do not trivially achieve perfect PF.-1 1 3x The GPI d TV and GPIW 1 of each group (associated with a = 1 or a = 0). The dotted lines PF d TV or PFW 1 correspond to the points where perfect PF d TV or perfect PFW 1 is achieved, respectively. It is clear that all three estimators achieve sub-optimal PF d TV and sub-optimal PFW 1 . See Appendix B for more details.0 1 a = 1Example 1. Suppose that X, N ∼ N (0, 1) are statistically independent random variables, and let Y = X + N . In this case, it is known that XMSE = 1 2 Y is the estimator that attains the lowest possible Mean-Squared-Error (MSE), XPosterior = 1 2 Y + W where W ∼ N (0, 1 2 ) is statistically independent of X and Y , is the estimator that samples from the posterior distribution p X|Y , andXMSE+PI = 1 √ 2 Yis the estimator that attains the lowest possible MSE among all estimators that satisfy p X = p X (perfect PI d ) [10, 23] . Now, consider the "sensitive attribute" A = 1 X≥1 . All of these commonly used estimators produce much better (lower) GPI dTV and GPI W1 for the group associated with A = 0, which, in this case, is a majority satisfying P(A = 0) ≈ 0.8413 (see Figure 5 ).The density p X|A (x|a) is obtained using the closed form solution of a truncated normal distribution,EQUATIONEQUATIONwhere ϕ(x) is a normal density and Φ(x) is its cumulative distribution,EQUATIONEQUATIONand p X|A (x|1) = 0 and p X|A (x|0) = 0 for every x ≥ 1 and x ≤ 1, respectively. The densities p XMSE|A (•|a), p XMSE+PQ|A (•|a) and p XPosterior|A (•|a) are obtained by feeding these algorithms with the degraded measurements corresponding to X ≥ 1 (for a = 1) and to X < 1 (for a = 0), separately. This is achieved by generating samples x ∼ p X and y ∼ p Y |X (•|x), and then partitioning these samples into two sets of measurements based on the value of x. We then perform Kernel Density Estimation (KDE) [64] on the reconstructions of each group to obtain their density, using the function seaborn.kdeplot [90] with the arguments bw_adjust=2, common_norm=False, gridsize=200. The number of samples used to compute the KDE is set to 200,000 for both a = 1 and a = 0.The value of GPI dTV (a) for a given algorithm X is defined by the total variation distanceEQUATIONTo compute this integral, we use the function scipy.integrate.quad [82] with parameters (a=-1000, b=1000, limit=500, points=[1.0]). At each point x, the integrandEQUATIONis evaluated using the closed form solution of p X|A (•|a) and the pre-computed KDE density of each p X|A (•|a).The value of GPI W1 (a) for a given algorithm X is the Wasserstein 1-distance between p X|A (•|a) and p X|A (•|a). To approximate this distance, we utilize the function scipy.stats.wasserstein_distance with the previously obtained 200,000 samples from p X|A (•|a) and 200,000 samples from p X|A (•|a).Theorem 1. The Group Precision and Group Recall of any restoration method satisfyEQUATIONEQUATIONfor all a ∈ supp p A .Proof Thus, GP(a) = P( X ∈ X a |A = a) (25) EQUATIONEQUATION= 1 -GPI dTV (a).(33) By replacing the roles of p X|A (x|a) and p X|A (x|a), the result GR(a) ≥ 1 -GPI dTV (a) can be derived with identical steps using the same mathematical arguments.Theorem 2. Suppose that ∃a 1 , a 2 ∈ supp p A such thatEQUATION) for both i = 1, 2, where X ai = supp p X|A (•|a i ) and Y ai = supp p Y |A (•|a i ). Then, GPI d (a 1 ) and GPI d (a 2 ) cannot both be equal to zero.Proof. Suppose by contradiction that p X|A (•|a i ) = p X|A (•|a i ) for both i = 1, 2. Thus,EQUATIONEQUATIONEQUATIONEQUATIONEQUATIONEQUATIONEQUATIONwhere Equation ( 39) holds from the assumption that A and X are statistically independent given Y , and from the fact that p Y |A (y|a i ) = 0 for every y / ∈ Y ai . We will show that P( X ∈ X ai |Y = y) = 1 for almost every y ∈ Y ai . Indeed, if this does not hold, then for some T i ⊆ Y ai with P(Y ∈ T i |A = a i ) > 0 we have P( X ∈ X ai |Y = y) < 1 for every y ∈ T i . Thus,EQUATIONEQUATIONEQUATIONEQUATIONwhich is not possible. So, P( X ∈ X ai |Y = y) = 1 for almost every y ∈ Y ai . Now, from basic rules of probability theory, we haveEQUATIONwhere the first and last terms on the right hand side cancel out (from the definition of X a1 , they are both equal to 1). Thus, we haveEQUATIONand finally,EQUATIONEQUATIONEQUATIONEQUATIONwhere Equation ( 51) follows from the contradictory assumption that p X|A (•|a i ) = p X|A (•|a i ), Equation ( 52) follows from the same steps that led to Equation ( 41), and Equation ( 54) follows from our previous finding that P( X ∈ X ai |Y = y) = 1 for every y ∈ Y ai (we have y ∈ Y a1 ∩Y a2 in the integrand, so y ∈ Y a2 ). However, it is given that P(X ∈ X a1 ∩ X a2 |A = a 1 ) < P(Y ∈ Y a1 ∩ Y a2 |A = a 1 ), so we have established a contradiction.Theorem 3. Suppose that A takes discrete values, X attains perfect PI d (p X = p X ), and ∃a, a m ∈ supp p A such that GPI d (a) > 0 and P(A = a m ) > 0.5. Then, X cannot achieve perfect PF dTV .Proof. Suppose that GPI dTV (a m ) = 0. From the assumptions, there exists a ̸ = a m such that GPI d (a) > 0, so GPI dTV (a) > 0. This means that PF dTV is not perfect.Otherwise, suppose that GPI dTV (a m ) > 0. Thus, from Theorem 4 we haveEQUATIONwhere Equation ( 57) holds since 1-P(A=am) P(A=am) < 1, and Equation ( 58) holds by defining a * = arg maxEQUATIONThus, we have found two groups a m and a * such that GPI dTV (a m ) < GPI dTV (a * ), so PF dTV cannot be perfect.Theorem 4. Suppose that A takes discrete values and X attains perfect PI d (p X = p X ). Then,EQUATION)for every a with P(A = a) > 0.Proof. For every a, let us denote P a = P(A = a). Suppose that X attains perfect perceptual index, so p X = p X . From the marginalization of probability density functions, it holds thatEQUATIONEQUATIONand since p X = p X we haveEQUATION)Let a be some group with P a > 0. By rearranging Equation ( 62) we getEQUATIONTaking the absolute value on both sides, we haveEQUATIONEQUATIONwhere Equation ( 65) follows from the triangle inequality. Thus, it holds thatEQUATION)This concludes the proof.All the CelebA-HQ images we use are of size 512 × 512. The image-to-image translation model we utilize, stabilityai/stable-diffusion-xl-refiner-1.0, is sourced from Hugging Face [77] and boasts over 1,200,000 downloads (at the time writing this paper). This model integrates SDXL [67] with SDEdit [53] . For all groups, we adjust the hyperparameters strength and guidance_scale from their default settings, with strength set to 0.4. When translating a CelebA-HQ image x into a group image using its specified text instruction (see Visual results of all algorithms (the reconstructions of each fairness group) for s ∈ {4, 8, 16, 32} and σ N ∈ {0, 0.1} are provided in Figures 21 to 28 .Figure 3 presents quantitative results with all scaling factors, and without adding white Gaussian noise (σ N = 0). Here, in Figures 6 and 7 we report the results with σ N ∈ {0.1, 0.25}. We observe similar trends and conclusions as in Figure 3 (please refer to Section 4.2 for more details).We report in Figures 8 to 10 the GPI FID of each group, where FID is the Fréchet Inception Distance [30] . These results show trends similar to those observed in Figure 3 . Namely, using the statistical distance FID instead of KID does not alter the trends and conclusions of the results.We report, compare and analyze additional group performance metrics.GP NN and GR NN We approximate the GP and GR of each group using [45] , a method which evaluates the precision and recall between two distributions in their feature space. We denote the results by GP NN and GR NN , respectively. Note that this approach to approximate GP differs from our previous experiments, where we use the classification hit rate (Figures 3, 6 and 7 ). Similarly to the experiments where we compute GPI KID (Section 4.2) and GPI FID (Appendix G.4), GP NN and GR NN are computed by extracting image features using the last average pooling layer of the FairFace combined age & ethnicity classifier [35] .GPSNR and GLPIPS For each group we compute the Peak Signal-to-Noise Ratio (PSNR) and the Learned Perceptual Image Patch Similarly (LPIPS) [103] 3 , where these metrics are evaluated by feeding the restoration algorithm only with the group's inputs and with respect to the group's ground truth images. Formally, we define the Group PSNR (GPSNR) and the Group LPIPS (GLPIPS) asEQUATIONEQUATIONwhere the expectation is taken over the joint distribution of a group's ground truth images and their reconstructions, p X, X|A (•, •|a).The results for all noise levels σ N ∈ {0.0, 0.1, 0.25} are provided in Figures 8 to 10. First, note that both the GPSNR and the GLPIPS metrics are unreliable indicators of bias. For example, the metrics GP, GP NN GPI KID , and GPI FID all indicate that the group young&non-Asian receives better treatment than the group young&Asian (e.g., the GP of the former group is clearly higher than that of the latter group across all noise levels and scaling factors). However, both groups exhibit roughly similar GPSNR and GLPIPS scores. This highlights why assessing the fairness of image restoration algorithms solely based on GPSNR, GLPIPS or similar metrics (MSE, SSIM [87] , etc.) might not be sufficient. This result regarding GPSNR is not surprising, as it is well known that such a metric often does not correlate with perceived image quality [10] . Regarding GLPIPS, it might be more effective to use image features extracted by a classifier trained to identify the sensitive attributes in question. We leave exploring this option for future work. Second, the GP NN values in Figures 8 to 10 are almost identical to the GP scores reported in Figures 3, 6 and 7 . This suggests that approximating the true GP either through the classification hit rate (as in Figures 3, 6 and 7 ) or via [45] (as done in this section), are consistent. Third, the GR NN scores suggest potential unfairness in the perceptual variation across different groups. For example, when s = 16, σ N = 0, we observe that all algorithms consistently produce higher GR NN scores for the young&non-Asian group compared to the young&Asian group.We employ the dinov2-vit-g-14 [62] , clip-vit-l-14 [68] , and inception-v3-compat [78] feature extractors via torch-fidelity [57] to compute the GPI KID for each fairness group (previously, we used the image features extracted from the FairFace classifier's final average pooling layer).The results are presented in Figures 11 to 13 .The outcomes from both the dinov2-vit-g-14 and clip-vit-l-14 feature extractors generally align with those of the FairFace image classifier, though the biases exposed by these extractors are less pronounced. Put differently, computing GPI KID with either of these general-purpose feature extractors leads to a smaller disparity in the GPI KID of the different fairness groups. Moreover, the inception-v3-compat image feature extractor yields inconsistent results, suggesting that the old&Asian group receives more favorable treatment compared to the old&non-Asian group (contrary to the biases indicated by the other feature extractors). The following section strengthens our argument that this behavior of inception-v3-compat is undesirable. Overall, relying on such general-purpose image feature extractors seems unsatisfactory for the purpose of uncovering nuanced biases in face image restoration methods.In Section 4.2 we reveal a significant discrepancy between PF and RDP regarding whether the groups old&Asian and old&non-Asian are treated equally. Specifically, both groups achieve similar GP, while the GPI KID of the latter group (old&non-Asian) is notably better (lower) than that of the former group (old&Asian). In other words, GPI KID indicates that the old&non-Asian group enjoys a better preservation of ethnicity.Let us support our claim in Section 4.2 that this outcome of PF is the desired one, by showing that RDP may obscure the fact that some sensitive attributes are treated better than others. Indeed, as shown in Figure 14 , the ethnicity of the old&non-Asian group is better preserved than that of the old&Asian group, while Figure 15 confirms that the age of these two groups is equally preserved.While RDP fails to uncover this ethnicity bias when the fairness groups are determined based on both age and ethnicity, PF clearly reveals it.All algorithms are evaluated using the official codes and checkpoints provided by their authors. We use the torch-fidelity package [57] (GitHub commit a61422f) to compute the KID [9] , FID [30] , precision and recall [45] . The GPSNR and the GLPIPS are computed using the piq package [38, 39] (version 0.8.0 in pip).Finally, note that some of the evaluated algorithms generate output images of size 256 × 256 (e.g., DDNM), while others produce images of size 512 × 512 (e.g., RestoreFormer). Consequently, for fair quantitative evaluations, we resize the outputs of the latter algorithms, along with the ground truth images, to 256 × 256. To clarify, the super-resolution scaling factors are calculated based on the 256 × 256 image size. For instance, when s = 4, the resolution of the input images is 64 × 64.The degradation we apply consists of three consecutive steps: (1) Average pooling down-sampling with a scale factor of s = 4, (2) additive white Gaussian noise with a standard deviation of σ N = 0.1, and then (3) JPEG compression with a quality factor of 50. We attack each degraded image using a tweaked version of the I-FGSM basic attack [14] with α = 6/255 and T = 200. In particular, instead of using the L 2 loss in I-FGSM like in [14] , we forward each attacked output through a classifier that predicts the age category of the output face image [56] , and then maximize the log-probability of the oldest age group category. In other words, we forward each degraded image through RestoreFormer++ and then feed the result to the age classifier. We then use the I-FGSM update rule to maximize the soft-max probability of the oldest age category (this adversarial attack technique was employed in [60] ).We conduct additional experiments on image denoising and deblurring to further demonstrate the utility of the proposed notion of perceptual fairness. Specifically, for image denoising we use additive white Gaussian noise with standard deviation σ N = 0.5, and for image deblurring we use a Gaussian blur kernel of size k = 5 and σ = 10, and add to the blurred image a white Gaussian noise of standard deviation σ N ∈ {0.1, 0.25, 0.5}. Since these degradations are not handled well by the GAN-based methods, we only compare DPS, DDNM + , DDRM, and PiGDM.Quantitative results are reported in Figure 16 , and visual comparisons are provided in Figures 29 to 32. As in the super-resolution experiments, PF is able to expose bias (which is also visually clear) when RDP fails to do so, and not vice versa.All our experiments are conducted on a NVIDIA RTX A6000 GPU. Using the dinov2-vit-g-14 feature extractor [62] via torch-fidelity [57] to compute the GPIKID of each group. This general-purpose feature extractor network is somewhat able to detect bias between the old&Asian and old&non-Asian (as detected before by extracting features from the FairFace image classifier). However, the bias is significantly less pronounced in this case. Using the clip-vit-l-14 feature extractor [68] via torch-fidelity [57] to compute the GPIKID of each group. Even this general purpose feature extractor network is somewhat able to detect some bias between the old&Asian and old&non-Asian (as detected before by extracting features from the FairFace image classifier). However, the bias is significantly less pronounced in this case. [78] via torch-fidelity [57] to compute the GPIKID of each group. These results of inception-v3-compat hint that the old&Asian group in some cases receive better treatment than the old&non-Asian group, while all the other feature extractors suggest the opposite bias. This outcome inception-v3-compat is also inconsistent with the experiments in Appendix G.7, which demonstrate that the old&non-Asian group is the one receiving the better treatment. Here, the groups old&Asian and young&Asian are each considered as Asian, and the groups old&non-Asian and young&non-Asian are each considered as non-Asian. For clarity, we still specify in each bar plot the corresponding age of each group, but the classifier operates solely on ethnicity (i.e., the GP is approximated with respect to ethnicity alone). As we claim in Section 4.2, the ethnicity of the old&non-Asian group is clearly preserved better than that of the old&Asian group. Figure 16 : Experiments similar to Figure 3 , but on the image denoising and deblurring tasks described in Appendix I. We observe similar trends in these tasks as well. Namely, as in the super-resolution tasks, PF exposes a clear bias when RDP does not (but not vice versa). • The answer NA means that the paper does not include experiments.• The authors should answer "Yes" if the results are accompanied by error bars, confidence intervals, or statistical significance tests, at least for the experiments that support the main claims of the paper. • The factors of variability that the error bars are capturing should be clearly stated (for example, train/test split, initialization, random drawing of some parameter, or overall run with given experimental conditions). • The method for calculating the error bars should be explained (closed form formula, call to a library function, bootstrap, etc.) • The assumptions made should be given (e.g., Normally distributed errors). • It should be clear whether the error bar is the standard deviation or the standard error of the mean. • It is OK to report 1-sigma error bars, but one should state it. The authors should preferably report a 2-sigma error bar than state that they have a 96% CI, if the hypothesis of Normality of errors is not verified. • For asymmetric distributions, the authors should be careful not to show in tables or figures symmetric error bars that would yield results that are out of range (e.g. negative error rates). • If error bars are reported in tables or plots, The authors should explain in the text how they were calculated and reference the corresponding figures or tables in the text. 
experiments compute resources: 
 Question: For each experiment, does the paper provide sufficient information on the computer resources (type of compute workers, memory, time of execution) needed to reproduce the experiments?Answer: [Yes] Justification: In the appendices.Guidelines:• The answer NA means that the paper does not include experiments.• The paper should indicate the type of compute workers CPU or GPU, internal cluster, or cloud provider, including relevant memory and storage. • The paper should provide the amount of compute required for each of the individual experimental runs as well as estimate the total compute. • The paper should disclose whether the full research project required more compute than the experiments reported in the paper (e.g., preliminary or failed experiments that didn't make it into the paper). 
code of ethics: 
 Question: Does the research conducted in the paper conform, in every respect, with the NeurIPS Code of Ethics https://neurips.cc/public/EthicsGuidelines?Justification: The paper conforms with the NeurIPS Code of Ethics in every aspect.Guidelines:• The answer NA means that the authors have not reviewed the NeurIPS Code of Ethics.• If the authors answer No, they should explain the special circumstances that require a deviation from the Code of Ethics. • The authors should make sure to preserve anonymity (e.g., if there is a special consideration due to laws or regulations in their jurisdiction). 
broader impacts: 
 Question: Does the paper discuss both potential positive societal impacts and negative societal impacts of the work performed?Answer: [Yes] Justification: We dedicate Section 6 to discuss the societal impacts of our paper.• Depending on the country in which research is conducted, IRB approval (or equivalent) may be required for any human subjects research. If you obtained IRB approval, you should clearly state this in the paper. • We recognize that the procedures for this may vary significantly between institutions and locations, and we expect authors to adhere to the NeurIPS Code of Ethics and the guidelines for their institution. • For initial submissions, do not include any information that would break anonymity (if applicable), such as the institution conducting the review.Two groups with attributes a1, a2 are overlapping if P(X ∈ Xa 1 ∩ Xa) > 0, where Xa i = supp p X|A (•|ai).We choose to consider these fairness groups since image restoration algorithms are likely biased towards young and white demographics, given the overrepresentation of such groups in common training datasets (e.g., FFHQ, CelebA). Namely, groups of Asian and/or old individuals are typically underrepresented in such datasets.Societal impactDesigning fair and unbiased image restoration algorithms is critical for various AI applications and downstream tasks that rely on them, such as facial recognition, image classification, and image editing. By proposing practically useful and well-justified fairness definitions, we can detect (and mitigate) bias in these tasks, ultimately leading to fairer societal outcomes. This fosters increased trust and adoption of AI technology, contributing to a more equitable and responsible use of AI in society.Future work may investigate the utility of no-reference perceptual quality measures (e.g.,[54,55,79]) to assess fairness in image restoration. 
 
 Appendix:  


Decision: Overall, the reviewers agree that the paper makes a novel and significant contribution by proposing the Group Perceptual Index (GPI) as a measure of fairness in image restoration. The reviewers commend the convincing experiments, logically sound concept, theoretical analysis of GPI's properties, thorough discussion of both the advantages and limitations, and the overall quality of the presentation. 

The main concerns are whether the proposed metric is applicable to general images beyond human faces and the sole validation on the image super-resolution task. The rebuttal addresses the first issue and promises to include additional experiments on image denoising and deblurring in the appendices. It also commits to discussing the potential for future work on additional types of degradations and data modalities to address the latter concern. Additionally, to address the ethics issue, the authors agree to highlight the choice of sensitive attributes in the study. Please take these commitments into account in your revision.

Reviews: review: paper_summary: paper_summary: This paper reveals that the conventional definition of fairness for image restoration is restrictive and often causes controversy. To address this issue, the authors introduce a new approach to measure fairness in image restoration tasks by proposing the Group Perceptual Index (GPI). Specifically, they propose assessing the fairness of an algorithm by comparing the GPI of different groups, where perfect Perceptual Fairness (PF) is achieved if the GPIs of all groups are identical. They theoretically study this notion of fairness and demonstrate its utility on state-of-the-art face image super-resolution algorithms.
strength_weakness: strength_weakness: 1. Group Perceptual Index (GPI) also increases the complexity of the evaluation process of image restoration algorithms, compared with the traditional fairness method, because it involves comparing the distributions of different groups.
2. The experiments use synthetic datasets generated from high-quality, aligned face image datasets like CelebA-HQ. 
3. The paper only evaluate the proposed method on the face dataset and does not provide the results on other kinds of image data.
questions: questions: 1. The paper shows that achieving perfect GPI for all groups is often not feasible, especially under severe degradation conditions.  it leaves an open question of how to balance fairness among different groups in practice best when perfect GPI cannot be achieved.
2. In addition to face synthesis, is the proposed GPI suitable for natural images with complex structures?
3. The application scenes are not clear. How do we apply the proposed GPI to real-world applications?
limitations: limitations: The paper rethinks the fairness in image restoration and proposes a novel method, called Group Perceptual Index (GPI), to measure the fairness for image restoration models. The proposed method can effectively detect subtle and malicious biases enhances the robustness and security of image restoration systems
paper_summary: paper_summary: This study presents a novel method to evaluate fairness in image restoration using the Group Perceptual Index (GPI). GPI quantifies the statistical disparity between a group's original images and their restored versions. Fairness is assessed by comparing GPIs across multiple groups, striving for perfect Perceptual Fairness (PF) where all GPI values are identical. The research provides theoretical insights into this innovative fairness concept, drawing comparisons to existing frameworks, and showcases its practical implementation through advanced face image super-resolution algorithms.
strength_weakness: strength_weakness: 1. The authors introduce a novel method to evaluate the fairness of image restoration. However, it is important to note that this method has been validated exclusively on image super-resolution tasks. Further validation on other types of image restoration tasks would be beneficial to demonstrate its broader applicability and robustness.
2. How can sensitive attributes be detected and acquired? The impact of sensitive attributes deserves an in-depth discussion.
questions: questions: 1. What is the primary difference between fairness evaluation and standard image quality assessment metrics like PSNR and SSIM?
2. How does this method contribute to the design of fair and unbiased image restoration algorithms?
limitations: limitations: Limitations have been thoroughly discussed and adequately addressed.
paper_summary: paper_summary: This work introduces a new method for assessing fairness in image restoration, called the Group Perceptual Index (GPI). This measure quantifies the statistical difference between the distribution of a group's original images and the distribution of their restored versions. The authors illustrate the effectiveness of GPI by applying it to advanced face image super-resolution algorithms.
strength_weakness: strength_weakness: - Usefulness of the method is validated only on the super-resolution solution. Given the fact that the proposed method has potential to impact various image restoration algorithms, it would have been interesting to see how well it does on other image restoration application such as image denoising, deblurring etc.
- It is also not clear what kind of changes to the existing super-resolution methods might result in better fairness handling. Some insights into why certain methods are not good at fairness handling as compared to others might have helped the future works.
questions: questions: Please address my comments under weaknesses
limitations: limitations: Authors has addressed the limitations to a satisfactory extent.
paper_summary: paper_summary: This paper considers fairness issue of image restoration and proposes Group Perceptual Index to measure the distance between restoration distribution and gt distribution. Experimental and theoretical results demonstrate that the superiority the proposed perceptual fairness over previous method.
strength_weakness: strength_weakness: 1. The main results are mainly based face restoration. Can this method be useful for general scenario of image restoration?
2. The paper proposes a measure to detect the fairness issue. But can you suggest some potential solutions to address this problem?
questions: questions: Can the method be extended to measure other fields, like image generation?
limitations: limitations: Yes, the authors discuss limitations carefully.

Comments: title: Response to Rebuttal
After Rebuttal
comment: Considering the feedback from other reviewers and the authors' responses, I retain the original rating of weak accept.
Thank you for your valuable review and constructive suggestion. We definitely agree that it is important to further emphasize the choice of sensitive attributes in our study. Specifically, we will highlight that image restoration algorithms are likely to be biased against older and Asian demographics due to the underrepresentation of these groups in typical training datasets (e.g., FFHQ, CelebA), compared to young and white demographics.
Thank you for your thoughtful and thorough review. We are pleased that you found our acknowledgment of ethical issues in image restoration, our discussion of the limitations of existing fairness measures, our experiments on adversarial bias detection, and our societal impact section to be adequate.
Thanks for all the clarifications made in the rebuttal. Rebuttal has addressed most of my concerns, hence I will upgrade my original score.
Thank you for your responses and comprehensive explanation. Your responses partially resolve my concerns, so I keep my original score unchanged. Overall, I like this paper and appreciate the efforts of the authors on the fairness of image restoration, which is inspiring.
Thanks for the rebuttal. The paper is interesting but also has potential unsolved/undiscussed issues. I insist on my original score.