Papers
Topics
Authors
Recent
Search
2000 character limit reached

ReShapeBench: Multi-Domain Shape Benchmark

Updated 8 July 2026
  • ReShapeBench is a polysemous benchmark label applied to shape analysis tasks across clinical imaging, optimization, image editing, and 3D human-shape retrieval.
  • Each variant defines its own task, data modality, and evaluation protocol, emphasizing specific aspects of shape variation rather than unified metrics.
  • Its applications include robust statistical shape modeling, conformal-bending transformations for optimization, and shape-preserving image editing with precise geometric evaluations.

ReShapeBench is a recurrent benchmark label applied to several technically distinct research artifacts concerned with shape as the primary object of analysis. In the arXiv literature represented here, the name refers to at least four different constructs: a clinical statistical shape modeling validation framework for anatomy (Goparaju et al., 2020), a conformal-bending test suite for continuous optimization (Liu et al., 2020), a benchmark for shape-aware image editing (Long et al., 11 Aug 2025), and a non-rigid 3D human-shape retrieval benchmark (Pickup et al., 2020). The common thread is not a shared dataset or protocol, but a shared emphasis on how shape variation is represented, transformed, localized, or retrieved under controlled evaluation.

1. Nomenclature and domain-specific uses

The name ReShapeBench is therefore polysemous. Each usage defines its own task, data modality, and evaluation protocol.

Usage Domain Core object of evaluation
Clinical ReShapeBench Statistical shape modeling Anatomical correspondences, morphometrics, lesion screening
Conformal-bending ReShapeBench Continuous optimization Optimizer robustness on bent 2-D landscapes
Image-editing ReShapeBench Generative image editing Large-scale shape transformation with background preservation
Human-shape retrieval ReShapeBench 3D shape retrieval Retrieval of non-rigid human meshes

A common misconception is to treat ReShapeBench as a single benchmark family with interoperable scores. The cited sources do not support that interpretation. Each benchmark is self-contained, and reported metrics are only meaningful within the corresponding task definition and data regime (Goparaju et al., 2020).

2. Clinical statistical shape modeling benchmark

In the clinical SSM setting, ReShapeBench denotes a framework for systematically assessing off-the-shelf statistical shape modeling tools in clinical applications. The benchmark operates on 3D binary segmentations of the LAA, scapula, humerus, and femur. Its preprocessing pipeline consists of hole-filling, isotropic resampling, antialiasing, rigid alignment using center-of-mass plus ANTs, signed-distance-transform conversion, and cropping to a common bounding box. ShapeWorks and Deformetrica use sampled particles on the surfaces, whereas SPHARM-PDM uses meshed surfaces with spherical parameterization (Goparaju et al., 2020).

The benchmark compares three modeling paradigms: ShapeWorks as a groupwise particle-based method, Deformetrica as a groupwise diffeomorphic atlas-based method, and SPHARM-PDM as a pairwise spherical harmonics method. Groupwise correspondence approaches optimize all shapes simultaneously to enforce consistent point-to-point mappings across the cohort. The reported consequence is more compact, reproducible statistical models that respect population variability, whereas pairwise methods register each shape independently to a template and may exhibit axis-swapping or correspondence drift (Goparaju et al., 2020).

Quantitative evaluation is defined through PCA-based model diagnostics over retained modes KK. Compactness is

C(K)=i=1Kλii=1dMλi,C(K)=\frac{\sum_{i=1}^K \lambda_i}{\sum_{i=1}^{dM} \lambda_i},

generalization error is

G(K)=1Nn=1Nznz^n(K)2,z^n(K)=i=1K(uiTzn)ui,G(K)=\frac1N\sum_{n=1}^N \left\|\mathbf z_n-\hat{\mathbf z}_n(K)\right\|^2, \qquad \hat{\mathbf z}_n(K)=\sum_{i=1}^K(\mathbf u_i^T\mathbf z_n)\mathbf u_i,

and specificity is

S(K)=1Jj=1Jminnzj(synth)zn2,zj(synth)N(μ,diag(λ1,,λK)).S(K)=\frac1J\sum_{j=1}^J\min_n \left\|\mathbf z_j^{(\mathrm{synth})}-\mathbf z_n\right\|^2, \qquad \mathbf z_j^{(\mathrm{synth})}\sim\mathcal N(\boldsymbol\mu,\mathrm{diag}(\lambda_1,\dots,\lambda_K)).

Training uses 70% of each dataset, with N80N\approx 80–100 shapes; leave-one-out is used for G(K)G(K) on the training set; and J=10,000J=10{,}000 synthetic draws are used for S(K)S(K) (Goparaju et al., 2020).

Qualitative evaluation complements these metrics. Modes of variation are visualized as μ±3λiui\boldsymbol\mu\pm3\sqrt{\lambda_i}\mathbf u_i to assess clinically meaningful deformations such as LAA ostium size, scapular glenoid dilation, humeral lesion depth, and femoral bump. Clustering is performed by applying K-means to the dMdM-dimensional correspondence coordinates. On the LAA dataset, the elbow method found four clusters matching the “chicken-wing,” “wind-sock,” “cactus,” and “cauliflower” types; ShapeWorks and Deformetrica cluster centers aligned closely with expert-defined means, while SPHARM-PDM did not (Goparaju et al., 2020).

The landmark and measurement validation framework begins by annotating C(K)=i=1Kλii=1dMλi,C(K)=\frac{\sum_{i=1}^K \lambda_i}{\sum_{i=1}^{dM} \lambda_i},0 ground-truth landmarks on the mean shape C(K)=i=1Kλii=1dMλi,C(K)=\frac{\sum_{i=1}^K \lambda_i}{\sum_{i=1}^{dM} \lambda_i},1. For each test subject, correspondences are obtained via the pretrained model: ShapeWorks uses TPS warp from the mean, Deformetrica uses atlas deformation, and SPHARM-PDM uses fixed mapping. Mean landmarks are then transferred to subject space using thin-plate spline or Procrustes. The landmark error is

C(K)=i=1Kλii=1dMλi,C(K)=\frac{\sum_{i=1}^K \lambda_i}{\sum_{i=1}^{dM} \lambda_i},2

Paired two-sided t-tests and equivalence tests at C(K)=i=1Kλii=1dMλi,C(K)=\frac{\sum_{i=1}^K \lambda_i}{\sum_{i=1}^{dM} \lambda_i},3 are used to assess whether C(K)=i=1Kλii=1dMλi,C(K)=\frac{\sum_{i=1}^K \lambda_i}{\sum_{i=1}^{dM} \lambda_i},4 falls below clinically acceptable bounds, with power C(K)=i=1Kλii=1dMλi,C(K)=\frac{\sum_{i=1}^K \lambda_i}{\sum_{i=1}^{dM} \lambda_i},5 (Goparaju et al., 2020).

The lesion screening method projects a pathological shape C(K)=i=1Kλii=1dMλi,C(K)=\frac{\sum_{i=1}^K \lambda_i}{\sum_{i=1}^{dM} \lambda_i},6 onto a control PCA subspace while allowing sparse localized offsets along surface normals:

C(K)=i=1Kλii=1dMλi,C(K)=\frac{\sum_{i=1}^K \lambda_i}{\sum_{i=1}^{dM} \lambda_i},7

Offsets with C(K)=i=1Kλii=1dMλi,C(K)=\frac{\sum_{i=1}^K \lambda_i}{\sum_{i=1}^{dM} \lambda_i},8 localize abnormality. Subject-level abnormality is then quantified by

C(K)=i=1Kλii=1dMλi,C(K)=\frac{\sum_{i=1}^K \lambda_i}{\sum_{i=1}^{dM} \lambda_i},9

with decision rule G(K)=1Nn=1Nznz^n(K)2,z^n(K)=i=1K(uiTzn)ui,G(K)=\frac1N\sum_{n=1}^N \left\|\mathbf z_n-\hat{\mathbf z}_n(K)\right\|^2, \qquad \hat{\mathbf z}_n(K)=\sum_{i=1}^K(\mathbf u_i^T\mathbf z_n)\mathbf u_i,0, and ROC analysis on training offsets calibrates G(K)=1Nn=1Nznz^n(K)2,z^n(K)=i=1K(uiTzn)ui,G(K)=\frac1N\sum_{n=1}^N \left\|\mathbf z_n-\hat{\mathbf z}_n(K)\right\|^2, \qquad \hat{\mathbf z}_n(K)=\sum_{i=1}^K(\mathbf u_i^T\mathbf z_n)\mathbf u_i,1 and the G(K)=1Nn=1Nznz^n(K)2,z^n(K)=i=1K(uiTzn)ui,G(K)=\frac1N\sum_{n=1}^N \left\|\mathbf z_n-\hat{\mathbf z}_n(K)\right\|^2, \qquad \hat{\mathbf z}_n(K)=\sum_{i=1}^K(\mathbf u_i^T\mathbf z_n)\mathbf u_i,2 threshold to obtain a desired sensitivity/specificity trade-off (Goparaju et al., 2020).

Reported results at G(K)=1Nn=1Nznz^n(K)2,z^n(K)=i=1K(uiTzn)ui,G(K)=\frac1N\sum_{n=1}^N \left\|\mathbf z_n-\hat{\mathbf z}_n(K)\right\|^2, \qquad \hat{\mathbf z}_n(K)=\sum_{i=1}^K(\mathbf u_i^T\mathbf z_n)\mathbf u_i,3 modes show mean compactness, generalization error, and specificity across the four anatomies of G(K)=1Nn=1Nznz^n(K)2,z^n(K)=i=1K(uiTzn)ui,G(K)=\frac1N\sum_{n=1}^N \left\|\mathbf z_n-\hat{\mathbf z}_n(K)\right\|^2, \qquad \hat{\mathbf z}_n(K)=\sum_{i=1}^K(\mathbf u_i^T\mathbf z_n)\mathbf u_i,4, G(K)=1Nn=1Nznz^n(K)2,z^n(K)=i=1K(uiTzn)ui,G(K)=\frac1N\sum_{n=1}^N \left\|\mathbf z_n-\hat{\mathbf z}_n(K)\right\|^2, \qquad \hat{\mathbf z}_n(K)=\sum_{i=1}^K(\mathbf u_i^T\mathbf z_n)\mathbf u_i,5, and G(K)=1Nn=1Nznz^n(K)2,z^n(K)=i=1K(uiTzn)ui,G(K)=\frac1N\sum_{n=1}^N \left\|\mathbf z_n-\hat{\mathbf z}_n(K)\right\|^2, \qquad \hat{\mathbf z}_n(K)=\sum_{i=1}^K(\mathbf u_i^T\mathbf z_n)\mathbf u_i,6 for ShapeWorks; G(K)=1Nn=1Nznz^n(K)2,z^n(K)=i=1K(uiTzn)ui,G(K)=\frac1N\sum_{n=1}^N \left\|\mathbf z_n-\hat{\mathbf z}_n(K)\right\|^2, \qquad \hat{\mathbf z}_n(K)=\sum_{i=1}^K(\mathbf u_i^T\mathbf z_n)\mathbf u_i,7, G(K)=1Nn=1Nznz^n(K)2,z^n(K)=i=1K(uiTzn)ui,G(K)=\frac1N\sum_{n=1}^N \left\|\mathbf z_n-\hat{\mathbf z}_n(K)\right\|^2, \qquad \hat{\mathbf z}_n(K)=\sum_{i=1}^K(\mathbf u_i^T\mathbf z_n)\mathbf u_i,8, and G(K)=1Nn=1Nznz^n(K)2,z^n(K)=i=1K(uiTzn)ui,G(K)=\frac1N\sum_{n=1}^N \left\|\mathbf z_n-\hat{\mathbf z}_n(K)\right\|^2, \qquad \hat{\mathbf z}_n(K)=\sum_{i=1}^K(\mathbf u_i^T\mathbf z_n)\mathbf u_i,9 for Deformetrica; and S(K)=1Jj=1Jminnzj(synth)zn2,zj(synth)N(μ,diag(λ1,,λK)).S(K)=\frac1J\sum_{j=1}^J\min_n \left\|\mathbf z_j^{(\mathrm{synth})}-\mathbf z_n\right\|^2, \qquad \mathbf z_j^{(\mathrm{synth})}\sim\mathcal N(\boldsymbol\mu,\mathrm{diag}(\lambda_1,\dots,\lambda_K)).0, S(K)=1Jj=1Jminnzj(synth)zn2,zj(synth)N(μ,diag(λ1,,λK)).S(K)=\frac1J\sum_{j=1}^J\min_n \left\|\mathbf z_j^{(\mathrm{synth})}-\mathbf z_n\right\|^2, \qquad \mathbf z_j^{(\mathrm{synth})}\sim\mathcal N(\boldsymbol\mu,\mathrm{diag}(\lambda_1,\dots,\lambda_K)).1, and S(K)=1Jj=1Jminnzj(synth)zn2,zj(synth)N(μ,diag(λ1,,λK)).S(K)=\frac1J\sum_{j=1}^J\min_n \left\|\mathbf z_j^{(\mathrm{synth})}-\mathbf z_n\right\|^2, \qquad \mathbf z_j^{(\mathrm{synth})}\sim\mathcal N(\boldsymbol\mu,\mathrm{diag}(\lambda_1,\dots,\lambda_K)).2 for SPHARM-PDM. Landmark or measurement errors are likewise lower for the groupwise methods: for LAA ostium max-diameter, ShapeWorks S(K)=1Jj=1Jminnzj(synth)zn2,zj(synth)N(μ,diag(λ1,,λK)).S(K)=\frac1J\sum_{j=1}^J\min_n \left\|\mathbf z_j^{(\mathrm{synth})}-\mathbf z_n\right\|^2, \qquad \mathbf z_j^{(\mathrm{synth})}\sim\mathcal N(\boldsymbol\mu,\mathrm{diag}(\lambda_1,\dots,\lambda_K)).3 mm, Deformetrica S(K)=1Jj=1Jminnzj(synth)zn2,zj(synth)N(μ,diag(λ1,,λK)).S(K)=\frac1J\sum_{j=1}^J\min_n \left\|\mathbf z_j^{(\mathrm{synth})}-\mathbf z_n\right\|^2, \qquad \mathbf z_j^{(\mathrm{synth})}\sim\mathcal N(\boldsymbol\mu,\mathrm{diag}(\lambda_1,\dots,\lambda_K)).4 mm, SPHARM-PDM S(K)=1Jj=1Jminnzj(synth)zn2,zj(synth)N(μ,diag(λ1,,λK)).S(K)=\frac1J\sum_{j=1}^J\min_n \left\|\mathbf z_j^{(\mathrm{synth})}-\mathbf z_n\right\|^2, \qquad \mathbf z_j^{(\mathrm{synth})}\sim\mathcal N(\boldsymbol\mu,\mathrm{diag}(\lambda_1,\dots,\lambda_K)).5 mm; for scapula glenoid radius, S(K)=1Jj=1Jminnzj(synth)zn2,zj(synth)N(μ,diag(λ1,,λK)).S(K)=\frac1J\sum_{j=1}^J\min_n \left\|\mathbf z_j^{(\mathrm{synth})}-\mathbf z_n\right\|^2, \qquad \mathbf z_j^{(\mathrm{synth})}\sim\mathcal N(\boldsymbol\mu,\mathrm{diag}(\lambda_1,\dots,\lambda_K)).6 mm, S(K)=1Jj=1Jminnzj(synth)zn2,zj(synth)N(μ,diag(λ1,,λK)).S(K)=\frac1J\sum_{j=1}^J\min_n \left\|\mathbf z_j^{(\mathrm{synth})}-\mathbf z_n\right\|^2, \qquad \mathbf z_j^{(\mathrm{synth})}\sim\mathcal N(\boldsymbol\mu,\mathrm{diag}(\lambda_1,\dots,\lambda_K)).7 mm, S(K)=1Jj=1Jminnzj(synth)zn2,zj(synth)N(μ,diag(λ1,,λK)).S(K)=\frac1J\sum_{j=1}^J\min_n \left\|\mathbf z_j^{(\mathrm{synth})}-\mathbf z_n\right\|^2, \qquad \mathbf z_j^{(\mathrm{synth})}\sim\mathcal N(\boldsymbol\mu,\mathrm{diag}(\lambda_1,\dots,\lambda_K)).8 mm; for humerus head radius, S(K)=1Jj=1Jminnzj(synth)zn2,zj(synth)N(μ,diag(λ1,,λK)).S(K)=\frac1J\sum_{j=1}^J\min_n \left\|\mathbf z_j^{(\mathrm{synth})}-\mathbf z_n\right\|^2, \qquad \mathbf z_j^{(\mathrm{synth})}\sim\mathcal N(\boldsymbol\mu,\mathrm{diag}(\lambda_1,\dots,\lambda_K)).9 mm, N80N\approx 800 mm, N80N\approx 801 mm. Test pathology classification accuracy is reported as N80N\approx 802, N80N\approx 803, and N80N\approx 804 for femur cam-lesion, and N80N\approx 805, N80N\approx 806, and N80N\approx 807 for humerus Hill-Sachs. The stated overall conclusion is that ShapeWorks and Deformetrica outperformed SPHARM-PDM on every quantitative and validation criterion (Goparaju et al., 2020).

The stated limitations are also benchmark-specific: Deformetrica depends on the initial atlas, SPHARM-PDM is constrained to genus-0 surfaces and may misalign axes, and dense ground-truth correspondences remain unavailable. Future work is described as extending ReShapeBench to additional tools such as SlicerSALT, more anatomies, deep-learning-based correspondence estimators, and a fully automated clinical pipeline (Goparaju et al., 2020).

3. Conformal-bending test suite for optimization

A different use of ReShapeBench appears in the optimization literature as a family of conformal-bent benchmark functions derived from a “graphic bending” transformation. Here the purpose is not anatomical modeling but the deformation of a benchmark landscape so that the function’s “shape” changes rather than only its orientation. The construction is defined for a twice-continuously differentiable base function N80N\approx 808, with the exposition focused on N80N\approx 809 and on the Cigar function

G(K)G(K)0

over G(K)G(K)1 (Liu et al., 2020).

The conformal-bending transformation G(K)G(K)2 has three stages. First, a forward box transform maps G(K)G(K)3 to

G(K)G(K)4

Second, conformal inversion is performed in the complex plane:

G(K)G(K)5

followed by

G(K)G(K)6

Third, an inverse box transform is applied:

G(K)G(K)7

The final bent function is

G(K)G(K)8

with the constraint that G(K)G(K)9 so that inversion is defined (Liu et al., 2020).

This transformation is presented as analytic on J=10,000J=10{,}0000 with nonzero derivative, locally bijective, and J=10,000J=10{,}0001 except at J=10,000J=10{,}0002; accordingly, J=10,000J=10{,}0003 remains J=10,000J=10{,}0004 on its domain. The benchmark text states that any single-modality valley of J=10,000J=10{,}0005 becomes a winding ring in J=10,000J=10{,}0006 without creating new local minima, because conformal maps preserve topological genus and angle structure. It also states that although Hessian eigenvalue ratios are unchanged in magnitude, the main valley direction becomes curved, which defeats conventional linear-search strategies (Liu et al., 2020).

The evaluation procedure adds only J=10,000J=10{,}0007 cost per function evaluation and can be wrapped around an existing 2-D optimizer. Parameter sensitivity is reported by varying J=10,000J=10{,}0008 one at a time while keeping the others at J=10,000J=10{,}0009, and recording the average number of evaluations to reach S(K)S(K)0 over 100 runs with CMA-ES and PSO. Increasing S(K)S(K)1 stretches the ring along one axis and can raise CMA-ES ERT by up to a factor of S(K)S(K)2; increasing S(K)S(K)3 flattens the ring and allows CMA-ES to recover much of its speed; increasing S(K)S(K)4 shifts the optimum into very thin parts of the ring and produces near-100% failure for both optimizers beyond S(K)S(K)5; increasing S(K)S(K)6 shrinks the ring and improves ERT for both CMA-ES and PSO (Liu et al., 2020).

On the default 2-D conformal-bent Cigar benchmark with S(K)S(K)7 and S(K)S(K)8, multi-restart CMA-ES and canonical PSO are evaluated with stopping condition S(K)S(K)9 or μ±3λiui\boldsymbol\mu\pm3\sqrt{\lambda_i}\mathbf u_i0 evaluations. The rotated-vs-bent comparison reports approximately μ±3λiui\boldsymbol\mu\pm3\sqrt{\lambda_i}\mathbf u_i1 rotated ERT and μ±3λiui\boldsymbol\mu\pm3\sqrt{\lambda_i}\mathbf u_i2 bent ERT for CMA-ES, with success decreasing from μ±3λiui\boldsymbol\mu\pm3\sqrt{\lambda_i}\mathbf u_i3 to μ±3λiui\boldsymbol\mu\pm3\sqrt{\lambda_i}\mathbf u_i4; for PSO, approximately μ±3λiui\boldsymbol\mu\pm3\sqrt{\lambda_i}\mathbf u_i5 rotated ERT and μ±3λiui\boldsymbol\mu\pm3\sqrt{\lambda_i}\mathbf u_i6 bent ERT are reported, with success decreasing from μ±3λiui\boldsymbol\mu\pm3\sqrt{\lambda_i}\mathbf u_i7 to μ±3λiui\boldsymbol\mu\pm3\sqrt{\lambda_i}\mathbf u_i8. The stated interpretation is that the conformal-bent problem slows both algorithms by roughly one to two orders of magnitude, with larger variance and higher failure rate for CMA-ES (Liu et al., 2020).

Practical recommendations are correspondingly explicit: μ±3λiui\boldsymbol\mu\pm3\sqrt{\lambda_i}\mathbf u_i9–dMdM0 and dMdM1 produce a clear winding valley of moderate width, dMdM2 should stay below dMdM3 to avoid almost singular regions, and dMdM4 shrinks the search region and eases the problem. The benchmark is intended to be composable with classical shifts and rotations to generate richer landscapes (Liu et al., 2020).

4. Shape-aware image editing benchmark

In text-guided image editing, ReShapeBench is introduced as a dedicated benchmark for shape-aware editing, with emphasis on large-scale transformations rather than subtle color or style changes. The dataset contains 120 newly curated images split into two primary subsets, together with a held-out evaluation set of 50 images drawn from the 120 plus selected examples from PIE-Bench. The single-object subset contains 70 images with one well-defined foreground subject per image, and the multi-object subset contains 50 images with 2–5 interacting objects. All images are resized or padded to dMdM5 pixels (Long et al., 11 Aug 2025).

Prompt design is a central part of the benchmark. Each image is paired with a source and target prompt in a four-sentence format: a general summary of the scene, a foreground object description, a background description, and an overall atmosphere or context. In the edit prompt, only the shape-relevant attributes change. Draft prompts are generated by Qwen-2.5-VL and then manually edited to ensure consistency, clarity, and focus on large-scale shape change. Manual validation enforces completeness of shape-relevant details, consistency of background descriptions between source and target, and explicit emphasis on contour or structural change (Long et al., 11 Aug 2025).

The benchmark taxonomizes transformations into four canonical groups: scaling, rotation and viewpoint shifts, perspective warping, and structural replacement. Approximate distribution across the 120 images is reported as structural replacement dMdM6, scaling dMdM7, rotation or viewpoint shifts dMdM8, and perspective warping dMdM9. Scene complexity is 70 single-object images, or 58%, and 50 multiple-object images, or 42%. Difficulty tiers, defined subjectively on the basis of silhouette divergence in pixel space, are mild for IoU C(K)=i=1Kλii=1dMλi,C(K)=\frac{\sum_{i=1}^K \lambda_i}{\sum_{i=1}^{dM} \lambda_i},00 at 30%, moderate for C(K)=i=1Kλii=1dMλi,C(K)=\frac{\sum_{i=1}^K \lambda_i}{\sum_{i=1}^{dM} \lambda_i},01 at 45%, and extreme for C(K)=i=1Kλii=1dMλi,C(K)=\frac{\sum_{i=1}^K \lambda_i}{\sum_{i=1}^{dM} \lambda_i},02 at 25% (Long et al., 11 Aug 2025).

Evaluation is organized around three axes: image fidelity, background preservation, and shape or text alignment. Background preservation includes PSNR,

C(K)=i=1Kλii=1dMλi,C(K)=\frac{\sum_{i=1}^K \lambda_i}{\sum_{i=1}^{dM} \lambda_i},03

and LPIPS, with optional background IoU when a ground-truth mask is available:

C(K)=i=1Kλii=1dMλi,C(K)=\frac{\sum_{i=1}^K \lambda_i}{\sum_{i=1}^{dM} \lambda_i},04

The protocol masks out a centered box around the subject to isolate the background region before computing these similarities (Long et al., 11 Aug 2025).

Shape accuracy is measured by IoU between predicted and reference shape masks,

C(K)=i=1Kλii=1dMλi,C(K)=\frac{\sum_{i=1}^K \lambda_i}{\sum_{i=1}^{dM} \lambda_i},05

with off-the-shelf segmentation allowed when reference masks are unavailable. Overall fidelity may be summarized with FID,

C(K)=i=1Kλii=1dMλi,C(K)=\frac{\sum_{i=1}^K \lambda_i}{\sum_{i=1}^{dM} \lambda_i},06

and text-image alignment with CLIP cosine similarity,

C(K)=i=1Kλii=1dMλi,C(K)=\frac{\sum_{i=1}^K \lambda_i}{\sum_{i=1}^{dM} \lambda_i},07

The paper reports PSNR, LPIPS, CLIP-Sim, and Aesthetic Score, while the benchmark description notes that users often augment these with IoU and FID (Long et al., 11 Aug 2025).

Licensing is specified as CC-BY-NC-SA 4.0, with noncommercial, research-only use and redistribution under the same license. The benchmark is explicitly associated with “Follow-Your-Shape: Shape-Aware Image Editing via Trajectory-Guided Region Control” (Long et al., 11 Aug 2025).

5. Non-rigid 3D human-shape retrieval benchmark

In shape retrieval, ReShapeBench denotes the non-rigid human-shape retrieval benchmark introduced in Pickup et al. (2016) and extended with additional training data in (Pickup et al., 2020). The benchmark comprises three collections of 3D human meshes: a “Real” set derived from CAESAR scans, a fully “Synthetic” set created in DAZ Studio, and the FAUST public-scan set. Each has disjoint Training and Test splits. The Real set contains 100 training meshes and 400 test meshes; the Synthetic set contains 45 training meshes and 300 test meshes; and FAUST contains 100 training meshes and 200 test meshes. Training and Test are strictly non-overlapping in both subject identity and pose, and no cross-validation beyond the fixed split is prescribed (Pickup et al., 2020).

Preprocessing and geometric standardization differ by subset. In the Real set, each scan is registered to a common SCAPE template of approximately 15,000 vertices, remeshed to prevent trivial nearest-vertex correspondence, and scaled to a canonical height. Synthetic meshes are remeshed to approximately 60,000 vertices to introduce discretization variation. FAUST consists of high-resolution stereo scans of approximately 172,000 vertices, with real surface noise and topological defects; a watertight version is distributed by automatic hole-filling in MeshLab. Many methods optionally simplify meshes to C(K)=i=1Kλii=1dMλi,C(K)=\frac{\sum_{i=1}^K \lambda_i}{\sum_{i=1}^{dM} \lambda_i},08–C(K)=i=1Kλii=1dMλi,C(K)=\frac{\sum_{i=1}^K \lambda_i}{\sum_{i=1}^{dM} \lambda_i},09 vertices before descriptor extraction, and the FAUST scans are pre-processed to remove non-manifold edges and fill holes (Pickup et al., 2020).

More than 25 methods are grouped into several descriptor families: simple global invariants, pose-canonical forms, spectral and manifold-based descriptors, local and mid-level features, learned higher-level features, topological matching, and APT or MAPT variants. Representative formulas include surface area,

C(K)=i=1Kλii=1dMλi,C(K)=\frac{\sum_{i=1}^K \lambda_i}{\sum_{i=1}^{dM} \lambda_i},10

compactness,

C(K)=i=1Kλii=1dMλi,C(K)=\frac{\sum_{i=1}^K \lambda_i}{\sum_{i=1}^{dM} \lambda_i},11

and the biharmonic-distance construction

C(K)=i=1Kλii=1dMλi,C(K)=\frac{\sum_{i=1}^K \lambda_i}{\sum_{i=1}^{dM} \lambda_i},12

The benchmark also documents Euclidean distance, Jeffrey divergence, Earth Mover’s Distance, manifold-ranking graph-Laplacian similarity, and geodesic path-based deformable-invariant distances as common similarity measures (Pickup et al., 2020).

Evaluation follows the standard retrieval protocol in which each Test mesh is used as a query and all Test meshes are ranked by distance or similarity. Reported metrics include precision and recall curves, nearest-neighbour accuracy, First-Tier and Second-Tier recall, E-measure, DCG, AUC, AP, and mAP. The benchmark gives

C(K)=i=1Kλii=1dMλi,C(K)=\frac{\sum_{i=1}^K \lambda_i}{\sum_{i=1}^{dM} \lambda_i},13

C(K)=i=1Kλii=1dMλi,C(K)=\frac{\sum_{i=1}^K \lambda_i}{\sum_{i=1}^{dM} \lambda_i},14

No re-ranking on Test is allowed, and all trainable parameters or learned components must be fixed using the Training data alone (Pickup et al., 2020).

Results vary by subset. On the Real set, Giachetti et al. APT (trained) reports approximately NN C(K)=i=1Kλii=1dMλi,C(K)=\frac{\sum_{i=1}^K \lambda_i}{\sum_{i=1}^{dM} \lambda_i},15, 1-T C(K)=i=1Kλii=1dMλi,C(K)=\frac{\sum_{i=1}^K \lambda_i}{\sum_{i=1}^{dM} \lambda_i},16, and 2-T C(K)=i=1Kλii=1dMλi,C(K)=\frac{\sum_{i=1}^K \lambda_i}{\sum_{i=1}^{dM} \lambda_i},17, while Litman et al. sparse-dictionary SI-HKS reports approximately NN C(K)=i=1Kλii=1dMλi,C(K)=\frac{\sum_{i=1}^K \lambda_i}{\sum_{i=1}^{dM} \lambda_i},18, 1-T C(K)=i=1Kλii=1dMλi,C(K)=\frac{\sum_{i=1}^K \lambda_i}{\sum_{i=1}^{dM} \lambda_i},19, and 2-T C(K)=i=1Kλii=1dMλi,C(K)=\frac{\sum_{i=1}^K \lambda_i}{\sum_{i=1}^{dM} \lambda_i},20. On the Synthetic set, Li et al. Spectral Geometry reports approximately NN C(K)=i=1Kλii=1dMλi,C(K)=\frac{\sum_{i=1}^K \lambda_i}{\sum_{i=1}^{dM} \lambda_i},21 and 1-T C(K)=i=1Kλii=1dMλi,C(K)=\frac{\sum_{i=1}^K \lambda_i}{\sum_{i=1}^{dM} \lambda_i},22, while Giachetti et al. APT (trained) reports approximately NN C(K)=i=1Kλii=1dMλi,C(K)=\frac{\sum_{i=1}^K \lambda_i}{\sum_{i=1}^{dM} \lambda_i},23 and 1-T C(K)=i=1Kλii=1dMλi,C(K)=\frac{\sum_{i=1}^K \lambda_i}{\sum_{i=1}^{dM} \lambda_i},24. On FAUST, Giachetti et al. APT reports approximately NN C(K)=i=1Kλii=1dMλi,C(K)=\frac{\sum_{i=1}^K \lambda_i}{\sum_{i=1}^{dM} \lambda_i},25 and 1-T C(K)=i=1Kλii=1dMλi,C(K)=\frac{\sum_{i=1}^K \lambda_i}{\sum_{i=1}^{dM} \lambda_i},26, and Tatsuma and Aono MR-BoF-APFH reports approximately NN C(K)=i=1Kλii=1dMλi,C(K)=\frac{\sum_{i=1}^K \lambda_i}{\sum_{i=1}^{dM} \lambda_i},27 and 1-T C(K)=i=1Kλii=1dMλi,C(K)=\frac{\sum_{i=1}^K \lambda_i}{\sum_{i=1}^{dM} \lambda_i},28 (Pickup et al., 2020).

Several findings are notable because they run against simple expectations. Precision-recall curves indicate that trained, spectral, and APT-type descriptors consistently lead, but even naïve global invariants such as surface area outperform many complex baselines on Synthetic data, implying that body size and scale are highly discriminative there. The benchmark also reports that models with the same pose but different subject identity account for 10–25% of nearest-neighbour mistakes among the top methods, indicating residual scope for stronger pose invariance (Pickup et al., 2020).

6. Comparative interpretation and recurring issues

Across these usages, ReShapeBench consistently denotes a benchmark in which shape, rather than only appearance or scalar performance, is the controlled variable of interest. In the clinical framework, the central issue is dense correspondence consistency across populations; in conformal bending, it is controlled curvature of an optimization valley; in image editing, it is the fidelity of structural change under background preservation; and in human-shape retrieval, it is invariance to pose, mesh discretization, and scan noise. This suggests a family resemblance at the level of research question, but not at the level of dataset or metric interoperability (Goparaju et al., 2020).

The benchmark-specific limitations are also structurally different. Clinical ReShapeBench lacks dense ground-truth correspondences and includes method-specific constraints such as atlas dependence and genus-0 assumptions. The conformal-bending suite is restricted to 2-D wrapping of base functions and requires avoiding the inversion singularity at C(K)=i=1Kλii=1dMλi,C(K)=\frac{\sum_{i=1}^K \lambda_i}{\sum_{i=1}^{dM} \lambda_i},29. The image-editing benchmark depends on prompt quality, manual validation, and sometimes approximate masks from off-the-shelf segmentation. The retrieval benchmark must control train-test leakage in subject identity and pose, and its own results show that trivial scale cues can be unexpectedly strong (Liu et al., 2020).

A plausible implication is that any citation of “ReShapeBench” should be accompanied by an explicit task description or arXiv identifier. Without that disambiguation, claims about performance, realism, compactness, IoU, or mAP are liable to be interpreted against the wrong benchmark family.

Topic to Video (Beta)

No one has generated a video about this topic yet.

Whiteboard

No one has generated a whiteboard explanation for this topic yet.

Follow Topic

Get notified by email when new papers are published related to ReShapeBench.