REVIEW 4 major objections 6 minor 5 cited by
FlowAlign: Trajectory-Regularized, Inversion-Free Flow-based Image Editing
T0 review · 4 major / 6 minor · reviewed 2026-08-07 · deepseek-v4-flash
Pith's one-line read By adding a terminal-point similarity term to the inversion-free editing ODE, FlowAlign keeps the edited image structurally close to the source while following the edit prompt, and makes the edit trajectory reversible.
desk verdict FlowAlign is a practical inversion-free editing method with strong empirical results and a heuristic theory that has a sign inconsistency; worth refereeing, but the derivation needs repair. read the letter →
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
What carries the argument
The central object is the regularized velocity field $v_x^t = v_t(p_t,c_{tgt}) - v_t(q_t,c_{src}) + \gamma(E[p_0|p_t] - E[q_0|q_t])$ obtained from the optimal-control problem whose terminal cost penalizes squared distance to the source latent. The terms $E[p_0|p_t] = p_t - t v_t(p_t,c_{tgt})$ and $E[q_0|q_t] = q_t - t v_t(q_t,c_{src})$ are Tweedie denoising estimates, and their difference supplies the source-consistency gradient. The proof uses a first-order approximation of the velocity integral over the remaining time interval, which converts the terminal cost into an instantaneous pull during the ODE solve.
What would settle it
Compute the regularized ODE update with the exact integral of the velocity difference over the remaining time interval instead of the first-order approximation, then run backward editing; if source reconstruction quality worsens materially or the trajectory deviates from the claimed update, the load-bearing approximation fails.
Extended reading notes
Core claim
The central claim is that the inversion-free editing ODE can be stabilized by appending a terminal-point similarity term. Concretely, the velocity field becomes $v_x^t = [v_t(p_t,c_{tgt}) - v_t(q_t,c_{src})] + \gamma(E[p_0|p_t] - E[q_0|q_t])$, where $E[p_0|p_t]$ and $E[q_0|q_t]$ are Tweedie denoising estimates of the target-clean and source-clean latents. The first bracket is the semantic guidance that moves the sample from the source distribution toward the target distribution; the second bracket is the source-consistency gradient that pulls the trajectory back toward the source along the way. The paper proves this velocity solves a time-reversal optimal-control problem whose terminal cost penalizes the squared distance between the final latent and the source latent, and shows experimentally that the regularized trajectory yields higher background preservation and near-perfect backward reconstruction compared with prior inversion-free and inversion-based editing baselines.
Load-bearing premise
The derivation assumes the velocity difference between the source and target flows stays roughly constant over the remaining time interval, letting the integral be replaced by an instantaneous Tweedie estimate; if that approximation fails, the claimed regularization term is not justified.
Editorial extensions
If this is right
- FlowAlign preserves source structure better than the inversion-free baseline and inversion-based methods under the same number of function evaluations.
- Backward editing with FlowAlign nearly reconstructs the source image, indicating the regularized trajectory behaves close to a deterministic ODE.
- The method extends to editing video frames independently and to 3D Gaussian splatting scenes without retraining the flow model.
- Classifier-free guidance is applied only to the target-direction velocity, keeping the per-step cost to roughly one extra function evaluation instead of doubling it.
- The two hyperparameters controlling semantic guidance and source consistency have a clear trade-off, with a constant default value giving balanced performance across samples.
Reading between the lines
- The same terminal-cost construction could be adapted to regional edits by weighting the Tweedie-difference term with a spatial mask, letting an editor suppress regularization outside the edited object.
- Because the regularized trajectory is reversible, one could compute the implied edit direction as a vector field in latent space and use it for smooth interpolation between source and target prompts.
- A natural portability test is to apply the same regularization with a different flow backbone; if a constant default weighting transfers across models, the method is less dependent on the specific velocity model.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper proposes FlowAlign, an inversion-free flow-based image editing method. Building on FlowEdit's idea of simulating an editing ODE without latent inversion, FlowAlign adds a terminal-point regularization term derived from an optimal control problem, which penalizes deviation of the final output from the source image. The resulting velocity field decomposes into a semantic guidance term and a source-consistency term involving Tweedie denoising estimates. The method also applies classifier-free guidance only to the target trajectory, reducing computational cost. Experiments on PIEBench report improved source-consistency metrics (PSNR, LPIPS, DINO distance) and competitive CLIP scores, with additional evidence from a human preference study, backward-editing reconstruction, and applications to video and 3D Gaussian splatting editing.
Significance. If the theoretical derivation were sound, FlowAlign would be a simple and efficient extension of inversion-free editing, requiring only one additional function evaluation per step while improving source preservation. The empirical results are promising and the applications to video and 3D editing show potential breadth. However, the central Proposition 1, which motivates the method, relies on an uncontrolled approximation and contains a sign inconsistency with the algorithm. The terminal regularization also makes some of the reported source-consistency gains unsurprising. The work therefore has clear potential, but the current manuscript does not fully establish the claimed optimal-control justification.
major comments (4)
- [Appendix A, Eq. (41)-(42)] The proof of Proposition 1 replaces the integral ∫_t^0 (v_s(p_s)−v_s(q_s))ds with −t v_t(p_t)+t v_t(q_t), assuming the velocity difference is constant on the interval [0,t]. For a nonlinear learned velocity field this is not an equality, and the paper provides no error bound or empirical validation of the approximation. Since this step is what allows the Tweedie estimates E[p0|pt]−E[q0|qt] to appear in the final velocity field, the derivation is load-bearing. Please either justify the approximation (e.g., under a Lipschitz or linearity assumption), provide a numerical check of its accuracy over the edit trajectory, or explicitly reframe Proposition 1 as a heuristic construction rather than a derived optimal control.
- [Section 3.3 and Algorithm 1 (Eq. (21), Eq. (24), line 10)] There is a sign and coefficient inconsistency between the derived update and the implemented algorithm. Equation (21) gives dxt = [v_t(pt)−v_t(qt)]dt + γ(E[p0|pt]−E[q0|qt])dt with γ = −η/(1−ηt), while Algorithm 1 line 10 implements xt ← xt + [vθ(pt)−vθ(qt)]dt + ζ(E[q0|qt]−E[p0|pt]), i.e., a positive constant ζ multiplying the negative of the derived term. As γ(t) changes sign over t∈[0,1] for η>1 (negative for t<1/η, positive for t>1/η), a single constant ζ>0 cannot equal −γ(t)dt for all steps. The text states ζ = −γdt > 0 without addressing this sign variation. This means the implemented trajectory is not, step-by-step, the optimal-control solution of Eq. (17)-(19). Please reconcile the theory and algorithm, for example by redefining γ, using a schedule-dependent ζ, or clarifying that the algorithm uses a deliberate approximation.
- [Section 4, Backward Editing and Table 1] The backward-editing experiment measures how well the source is recovered by reversing the forward trajectory. Since the terminal regularization m(x0) = (η/2)||x0−xsrc||^2 explicitly penalizes deviations of x0 from xsrc, the forward trajectory is pulled toward the source, making high backward reconstruction fidelity expected even without a genuinely smooth or invertible trajectory. The paper argues that the edited image 'faithfully reflects the intended editing direction' and therefore the reconstruction is not trivial, but this claim would be stronger with an ablation that includes a baseline using only the terminal penalty (or a simple post-hoc projection toward the source) without the full optimal-control term. Please add such a comparison to isolate the contribution of the proposed gradient form.
- [Section 4, Table 1, Table 3, Figure 3a] The main quantitative results are reported as point estimates without error bars, confidence intervals, or significance tests. Given that some differences (e.g., CLIP scores in Table 3) are small, and that PIEBench contains 700 images, the paper should report standard deviations or standard errors across samples, and ideally a paired significance test for the key source-consistency metrics. This is important for assessing whether the improvements over FlowEdit and DDIB are robust rather than driven by a few outlier cases.
minor comments (6)
- [Abstract] The word 'highliting' should be 'highlighting'.
- [Figure 3b caption] 'out method' should be 'our method'.
- [Appendix D, first sentence] 'resuling' should be 'resulting' in 'resuling in a sampling process'.
- [Appendix F.2, last paragraph] 'vidw' appears to be a typo for 'view' in 'rendered vidw'.
- [Algorithm 1 and Section 3.3] The definition of ζ is given only in the text after Eq. (24) as ζ = −γdt > 0, but Algorithm 1 uses ζ as a tunable hyperparameter; please state explicitly that ζ is treated as a constant hyperparameter in practice and explain how this relates to the (potentially time-dependent) γ.
- [Figure 6] The legend mentions a 'block dot' that should probably be 'black dot'.
Circularity Check
Mild self-definitional circularity: the terminal regularizer is literally source-distance, so reported source-consistency gains reflect the objective; the optimal-control derivation itself is not circular.
-
self definitional
[Section 3.3, Eq. (19)-(22); Table 1]
"Specifically, we introduce a l2-based terminal point regularization: m(x0) = η/2 ∥x0 − xsrc∥^2 (19) ... the second term becomes a source consistent regularization gradient based on the distance between the clean estimates of pt and qt, computed using Tweedie formula."
The 'source consistency' that FlowAlign claims to achieve is defined by the same distance to the source image that is minimized by m(x0): Eq. (19) penalizes ||x0 - xsrc||^2, and the reported source-preservation metrics (PSNR, DINO, LPIPS, MSE against the source) quantify essentially the same deviation. Adding this terminal loss therefore forces the measured source-consistency improvement; it is an optimization objective, not an emergent or predicted property. The derivation from the cost to the Tweedie-gradient update is mathematically valid, so this is a mild by-construction element rather than a false equivalence of the whole method.
full rationale
The core of FlowAlign is an explicit optimal-control problem: minimize running cost (18) plus terminal cost m(x0)=η/2||x0-xsrc||^2. Proposition 1 solves this variational problem; solving a stated optimization problem is not circular, and the Hamiltonian/Lemma derivation is independent of the empirical claims. The only by-construction element is that the terminal loss literally measures distance to xsrc, so the later source-consistency gains (Table 1) are partly the objective being optimized, not an emergent discovery. The semantic-alignment, human-preference, and backward-editing results are not forced by this term and provide independent content. The approximation in Eq. (41)-(42) and the sign/coefficient mismatch between Eq. (21)/(24) and Algorithm 1 are correctness concerns, not circularity. No load-bearing self-citation chain exists: [1,6] are external textbooks, [28,29] are external groups, and the authors' self-citations [10,11,14,24] concern video/motion/score-distillation and do not carry the main argument. Overall, the paper would not reduce to its inputs by definition, so the score is low.
Assumptions & free parameters
free parameters (4)
- CFG scale ω =
10.0 (swept 5.0, 7.5, 10.0, 13.5)
- Source consistency scale ζ =
0.01
- Terminal regularization weight η =
Not directly reported; absorbed into ζ via ζ=−γdt
- NFE (number of function evaluations) =
33
assumptions (3)
- ad hoc to paper First-order approximation: ∫_t^0 (vt(pt)−vt(qt))dt ≃ −t vt(pt)+t vt(qt)
- domain assumption The pre-trained Stable Diffusion 3 flow model provides reliable Tweedie estimates E[q0|qt] = qt − t vt(qt) along the edited trajectories.
- domain assumption The optimal-control solution for an ideal deterministic ODE applies to the discrete-time algorithm with freshly sampled noise ϵ at each step.
Cite this review
Pith. "Pith review of FlowAlign: Trajectory-Regularized, Inversion-Free Flow-based Image Editing." pith.science (2026). https://pith.science/paper/Q6F5PTGB
@misc{pith2026250523145,
author = {Pith},
title = {Pith review of: FlowAlign: Trajectory-Regularized, Inversion-Free Flow-based Image Editing},
year = {2026},
howpublished = {\url{https://pith.science/paper/Q6F5PTGB}},
note = {Machine review of arXiv:2505.23145}
}
read the original abstract
Recent inversion-free, flow-based image editing methods such as FlowEdit leverages a pre-trained noise-to-image flow model such as Stable Diffusion 3, enabling text-driven manipulation by solving an ordinary differential equation (ODE). While the lack of exact latent inversion is a core advantage of these methods, it often results in unstable editing trajectories and poor source consistency. To address this limitation, we propose {\em FlowAlign}, a novel inversion-free flow-based framework for consistent image editing with optimal control-based trajectory control. Specifically, FlowAlign introduces source similarity at the terminal point as a regularization term to promote smoother and more consistent trajectories during the editing process. Notably, our terminal point regularization is shown to explicitly balance semantic alignment with the edit prompt and structural consistency with the source image along the trajectory. Furthermore, FlowAlign naturally supports reverse editing by simply reversing the ODE trajectory, highliting the reversible and consistent nature of the transformation. Extensive experiments demonstrate that FlowAlign outperforms existing methods in both source preservation and editing controllability.
Figures
Figures from the paper (13 more)
Forward citations
Cited by 5 Pith papers
-
h-Flow: Flexible Flow-based Image Editing via Doob's h-Transform
h-Flow extends Doob's h-transform to deterministic rectified flows via an equivalent SDE, yielding closed-form reconstruction guidance plus orthogonal velocity editing for controllable text-based image editing.
-
ElasticTTT: Prior-Preserving Test-Time Tuning for Video Editing
Test-time tuning of video diffusion models collapses generation toward the source video; ElasticTTT counters this with noisy targets, contrastive source-prompt guidance, and asynchronous region-wise noise scheduling, ...
-
Bridging the Manifold Gap: Riemannian Residual Line Search for One-Step Image Editing
Second-order curvature-corrected residual line search over energy-field transport candidates yields SOTA one-step text-guided image editing on PIE-Bench++.
-
Translationese as a Rational Response to Translation Task Difficulty
Translationese is partly predictable from quantifiable translation-task difficulty, especially cross-lingual transfer load, more so for English-to-German than the reverse.
-
FlowSteer: Conditioning Flow Field for Consistent Image Restoration
A sparse mid-to-late schedule of null-space fidelity updates lets a frozen text-to-image flow model restore images with high measurement consistency.
Reference graph
Works this paper leans on
-
[1]
Lecture Notes on Control System Theory and Design
Tamer Basar, Sean Meyn, and William R Perkins. Lecture notes on control system theory and design. arXiv preprint arXiv:2007.01367, 2020
work page Pith review arXiv 2007
-
[2]
The perception-distortion tradeoff
Yochai Blau and Tomer Michaeli. The perception-distortion tradeoff. In Proceedings of the IEEE conference on computer vision and pattern recognition, pages 6228–6237, 2018. 9
work page 2018
-
[3]
Instructpix2pix: Learning to follow image editing instructions
Tim Brooks, Aleksander Holynski, and Alexei A Efros. Instructpix2pix: Learning to follow image editing instructions. In Proceedings of the IEEE/CVF conference on computer vision and pattern recognition, pages 18392–18402, 2023
2023
-
[4]
The 2019 davis challenge on vos: Unsupervised multi-object segmentation
Sergi Caelles, Jordi Pont-Tuset, Federico Perazzi, Alberto Montes, Kevis-Kokitsi Maninis, and Luc Van Gool. The 2019 davis challenge on vos: Unsupervised multi-object segmentation. arXiv:1905.00737, 2019
arXiv 2019
-
[5]
Scaling rectified flow trans- formers for high-resolution image synthesis
Patrick Esser, Sumith Kulal, Andreas Blattmann, Rahim Entezari, Jonas Müller, Harry Saini, Yam Levi, Dominik Lorenz, Axel Sauer, Frederic Boesel, et al. Scaling rectified flow trans- formers for high-resolution image synthesis. In Forty-first international conference on machine learning, 2024
2024
-
[6]
Deterministic and stochastic optimal control, volume 1
Wendell H Fleming and Raymond W Rishel. Deterministic and stochastic optimal control, volume 1. Springer Science & Business Media, 2012
work page 2012
-
[7]
Instruct-nerf2nerf: Editing 3d scenes with instructions
Ayaan Haque, Matthew Tancik, Alexei A Efros, Aleksander Holynski, and Angjoo Kanazawa. Instruct-nerf2nerf: Editing 3d scenes with instructions. In Proceedings of the IEEE/CVF International Conference on Computer Vision, pages 19740–19750, 2023
2023
-
[8]
Delta denoising score
Amir Hertz, Kfir Aberman, and Daniel Cohen-Or. Delta denoising score. In Proceedings of the IEEE/CVF International Conference on Computer Vision, pages 2328–2337, 2023
2023
Show all 53 references
-
[9]
Denoising diffusion probabilistic models
Jonathan Ho, Ajay Jain, and Pieter Abbeel. Denoising diffusion probabilistic models. Advances in Neural Information Processing Systems, 33:6840–6851, 2020
2020
-
[10]
Dreammotion: Space-time self-similar score distillation for zero-shot video editing
Hyeonho Jeong, Jinho Chang, Geon Yeong Park, and Jong Chul Ye. Dreammotion: Space-time self-similar score distillation for zero-shot video editing. In European Conference on Computer Vision, pages 358–376. Springer, 2024
2024
-
[11]
Vmc: Video motion customization using temporal attention adaption for text-to-video diffusion models
Hyeonho Jeong, Geon Yeong Park, and Jong Chul Ye. Vmc: Video motion customization using temporal attention adaption for text-to-video diffusion models. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pages 9212–9221, 2024
2024
-
[12]
Direct inversion: Boosting diffusion-based editing with 3 lines of code
Xuan Ju, Ailing Zeng, Yuxuan Bian, Shaoteng Liu, and Qiang Xu. Direct inversion: Boosting diffusion-based editing with 3 lines of code. CoRR, abs/2310.01506, 2023
2023 arXiv
-
[13]
Pnp inversion: Boosting diffusion-based editing with 3 lines of code
Xuan Ju, Ailing Zeng, Yuxuan Bian, Shaoteng Liu, and Qiang Xu. Pnp inversion: Boosting diffusion-based editing with 3 lines of code. In The Twelfth International Conference on Learning Representations, 2024
2024
-
[14]
Dreamsampler: Unifying diffusion sampling and score distillation for image manipulation
Jeongsol Kim, Geon Yeong Park, and Jong Chul Ye. Dreamsampler: Unifying diffusion sampling and score distillation for image manipulation. arXiv preprint arXiv:2403.11415, 2024
2024 arXiv
-
[15]
Posterior distillation sampling
Juil Koo, Chanho Park, and Minhyuk Sung. Posterior distillation sampling. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pages 13352–13361, 2024
2024
-
[16]
Flowedit: Inversion-free text-based editing using pre-trained flow models
Vladimir Kulikov, Matan Kleiner, Inbar Huberman-Spiegelglas, and Tomer Michaeli. Flowedit: Inversion-free text-based editing using pre-trained flow models. arXiv preprint arXiv:2412.08629, 2024
2024 arXiv
-
[17]
Yaron Lipman, Ricky T. Q. Chen, Heli Ben-Hamu, Maximilian Nickel, and Matthew Le. Flow matching for generative modeling. In The Eleventh International Conference on Learning Representations, 2023
2023
-
[18]
Visual instruction tuning.Advances in neural information processing systems, 36:34892–34916, 2023
Haotian Liu, Chunyuan Li, Qingyang Wu, and Yong Jae Lee. Visual instruction tuning.Advances in neural information processing systems, 36:34892–34916, 2023
2023
-
[19]
Video-p2p: Video editing with cross-attention control
Shaoteng Liu, Yuechen Zhang, Wenbo Li, Zhe Lin, and Jiaya Jia. Video-p2p: Video editing with cross-attention control. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pages 8599–8608, 2024. 10
2024
-
[20]
Flow straight and fast: Learning to generate and transfer data with rectified flow
Xingchao Liu, Chengyue Gong, and qiang liu. Flow straight and fast: Learning to generate and transfer data with rectified flow. In The Eleventh International Conference on Learning Representations, 2023
2023
-
[21]
SDEdit: Image synthesis and editing with stochastic differential equations
Chenlin Meng, Yang Song, Jiaming Song, Jiajun Wu, Jun-Yan Zhu, and Stefano Ermon. SDEdit: Image synthesis and editing with stochastic differential equations. arXiv preprint arXiv:2108.01073, 2021
2021 arXiv
-
[22]
Null-text inversion for editing real images using guided diffusion models
Ron Mokady, Amir Hertz, Kfir Aberman, Yael Pritch, and Daniel Cohen-Or. Null-text inversion for editing real images using guided diffusion models. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pages 6038–6047, 2023
2023
-
[23]
Normalizing flows for probabilistic modeling and inference
George Papamakarios, Eric Nalisnick, Danilo Jimenez Rezende, Shakir Mohamed, and Balaji Lakshminarayanan. Normalizing flows for probabilistic modeling and inference. Journal of Machine Learning Research, 22(57):1–64, 2021
2021
-
[24]
Spectral motion alignment for video motion transfer using diffusion models
Geon Yeong Park, Hyeonho Jeong, Sang Wan Lee, and Jong Chul Ye. Spectral motion alignment for video motion transfer using diffusion models. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 39, pages 6398–6405, 2025
2025
-
[25]
Scalable diffusion models with transformers
William Peebles and Saining Xie. Scalable diffusion models with transformers. In Proceedings of the IEEE/CVF international conference on computer vision, pages 4195–4205, 2023
2023
-
[26]
Barron, and Ben Mildenhall
Ben Poole, Ajay Jain, Jonathan T. Barron, and Ben Mildenhall. Dreamfusion: Text-to-3d using 2d diffusion. arXiv, 2022
2022
-
[27]
Learning transferable visual models from natural language supervision
Alec Radford, Jong Wook Kim, Chris Hallacy, Aditya Ramesh, Gabriel Goh, Sandhini Agarwal, Girish Sastry, Amanda Askell, Pamela Mishkin, Jack Clark, et al. Learning transferable visual models from natural language supervision. In International conference on machine learning, pa...
2021
-
[28]
Semantic image inversion and editing using rectified stochastic differential equations
L Rout, Y Chen, N Ruiz, C Caramanis, S Shakkottai, and W Chu. Semantic image inversion and editing using rectified stochastic differential equations. In The Thirteenth International Conference on Learning Representations, 2025
2025
-
[29]
RB-modulation: Training-free stylization using reference-based modulation
Litu Rout, Yujia Chen, Nataniel Ruiz, Abhishek Kumar, Constantine Caramanis, Sanjay Shakkot- tai, and Wen-Sheng Chu. RB-modulation: Training-free stylization using reference-based modulation. In The Thirteenth International Conference on Learning Representations, 2025
2025
-
[30]
Denoising diffusion implicit models
Jiaming Song, Chenlin Meng, and Stefano Ermon. Denoising diffusion implicit models. In 9th International Conference on Learning Representations, ICLR, 2021
2021
-
[31]
Kingma, Abhishek Kumar, Stefano Ermon, and Ben Poole
Yang Song, Jascha Sohl-Dickstein, Diederik P. Kingma, Abhishek Kumar, Stefano Ermon, and Ben Poole. Score-based generative modeling through stochastic differential equations. In 9th International Conference on Learning Representations, ICLR, 2021
2021
-
[32]
Dual diffusion implicit bridges for image-to-image translation
Xuan Su, Jiaming Song, Chenlin Meng, and Stefano Ermon. Dual diffusion implicit bridges for image-to-image translation. In International Conference on Learning Representations, 2023
2023
-
[33]
Plug-and-play diffusion features for text-driven image-to-image translation
Narek Tumanyan, Michal Geyer, Shai Bagon, and Tali Dekel. Plug-and-play diffusion features for text-driven image-to-image translation. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pages 1921–1930, 2023
1921
-
[34]
Instruct-gs2gs: Editing 3d gaussian splats with instructions, 2024
Cyrus Vachha and Ayaan Haque. Instruct-gs2gs: Editing 3d gaussian splats with instructions, 2024
2024
-
[35]
Image quality assessment: from error visibility to structural similarity
Zhou Wang, Alan C Bovik, Hamid R Sheikh, and Eero P Simoncelli. Image quality assessment: from error visibility to structural similarity. IEEE transactions on image processing, 13(4):600– 612, 2004
2004
-
[36]
Ultraedit: Instruction-based fine-grained image editing at scale
Haozhe Zhao, Xiaojian Shawn Ma, Liang Chen, Shuzheng Si, Rujie Wu, Kaikai An, Peiyu Yu, Minjia Zhang, Qing Li, and Baobao Chang. Ultraedit: Instruction-based fine-grained image editing at scale. Advances in Neural Information Processing Systems, 37:3058–3093, 2024. 11 Suppleme...
2024
-
[37]
For inversion, we adopt the backward flow ODE
DDIB [32] : DDIB involves an inversion process followed by a sampling process. For inversion, we adopt the backward flow ODE. Regarding classifier-free guidance (CFG), we use only the null-text embedding during inversion and both target text and null-text embeddings during the...
-
[38]
timestep), and its performance can vary significantly depending on this choice
SDEdit [21] : SDEdit requires specifying the initial SNR (i.e. timestep), and its performance can vary significantly depending on this choice. In this work, our main focus is to address the limitations of inversion-free editing methods. To fairly demonstrate the effectiveness ...
-
[39]
We follow the official implementation, setting γ = 0.5, η = 0.9, the starting time s = 0, and the stopping time τ = 0.25
RF-inversion [28] : RF-Inversion introduces an optimal-control-based guidance mechanism that ensures the inverted representation aligns with a target terminal state, resuling in a sampling process that is more likely under a predefined terminal distribution. We follow the offi...
-
[40]
Additionally, we solve the flow ODE starting from the 18th timestep out of 50, resulting in 33 ODE timesteps
FlowEdit [16] : We follow the official implementation of FlowEdit, setting the CFG scale to 3.0 for the source direction and 13.5 for the target direction. Additionally, we solve the flow ODE starting from the 18th timestep out of 50, resulting in 33 ODE timesteps. Evaluation ...
-
[41]
Accordingly, we compute the PSNR by excluding the masked region, resulting in the background PSNR
Background PSNR : PIEbench [ 13] provides masks that cover the object to be edited. Accordingly, we compute the PSNR by excluding the masked region, resulting in the background PSNR
-
[42]
Background LPIPS : We measure the LPIPS [ 2], which is defined as distance between feature maps of pre-trained VGG network, by excluding the masked region
-
[43]
Background SSIM : We compute the structural similarity [ 35] by excluding the masked region
-
[44]
Background MSE : we compute pixel-wise mean-squared-error by excluding the masked region
-
[45]
For the CLIP score within the edited region, we apply it only to the masked area
CLIP-score : We report the similarity between features embedded by pre-trained CLIP [27]3 image encoder and text encoder. For the CLIP score within the edited region, we apply it only to the masked area. C Human preference test protocol To evaluate the quality of image editing...
-
[46]
Randomly select one sample from the 100-image pool
-
[47]
Randomly choose one baseline method from the four
-
[48]
Randomly assign the baseline and the proposed method to gruops A and B
-
[49]
Display AB-test user instruction with editing instruction, source image, and edited results from both methods
-
[50]
A is better
The participant selects one of the following options: "A is better", "B is better", or "Not sure"
-
[51]
The participant clicks "Submit", and the response is recorded
-
[52]
Step 1-6 are repeated until 20 cases are completed
-
[53]
Not sure
If more than half of the responses are "Not sure", an additional 5 comparisons is presented following the same protocol. Although the editing methods utilize source–target text pairs, we present the editing instructions from PIEBench to participants instead, aiming to improve ...
Reviewed August 7, 2026 · model on record in the stance chip above.
Discussion (0). Sign in to comment.