You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Hi, Would it be possible to share with us the code for the performance metrics.
Specifically LPIPS used for generated data, as mentioned in the paper "As our own method does not use a training set, we cluster around generated images using K-Medoids [1]."?
The text was updated successfully, but these errors were encountered:
Unfortunately it's been almost 3 years and I don't have access to the machine with the original code.
We just used the clustering metric code from Ojha et al except that we use sklearn's K-Medoids to get the points from which we calculate distances (their code assumes you have a training set to calculate distances to).
Thank you for the prompt reply. No worries, I would then like to clarify the procedure to attain the centroids. Specifically, I have the following questions:
In what latent/pixel space is K-medoids applied on?
Then given that sklearn's K-Medoids works on 2-dim data, is some kind of dimensions reduction applied to the latent/pixel space prior to clustering?
Lastly, if some dimensional reduction was applied, how did you get the "gen-image" pertaining to the centroid for LPIPS measurements?
Hi, Would it be possible to share with us the code for the performance metrics.
Specifically LPIPS used for generated data, as mentioned in the paper "As our own method does not use a training set, we cluster around generated images using K-Medoids [1]."?
The text was updated successfully, but these errors were encountered: