Locally Orderless Images for Optimization in Differentiable Rendering

Ishit Mehta, M. Chandraker, Ravi Ramamoorthi
3/1/2025

No confident code implementation found for this paper.

Abstract

Problems in differentiable rendering often involve optimizing scene parameters that cause motion in image space. The gradients for such parameters tend to be sparse, leading to poor convergence. While existing methods address this sparsity through proxy gradients such as topological derivatives or lagrangian derivatives, they make simplifying assumptions about rendering. Multi-resolution image pyramids offer an alternative approach but prove unreliable in practice. We introduce a method that uses locally orderless images — where each pixel maps to a histogram of intensities that preserves local variations in appearance. Using an inverse rendering objective that minimizes histogram distance, our method extends support for sparsely defined image gradients and recovers optimal parameters. We validate our method on various inverse problems using both synthetic and real data.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Cite this paper

@article{mehta2025locally,
  title  = {Locally Orderless Images for Optimization in Differentiable Rendering},
  author = {Ishit Mehta and M. Chandraker and Ravi Ramamoorthi},
  year   = {2025},
  eprint = {2503.21931},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/2503.21931},
  journal = {CVPR 2025 2025}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2503.21931.svg)](https://codeofpaper.com/paper/2503.21931)

Discussion