OpenAlex ·
Solution of the Mumford-Shah conjecture
- Published
- Source
- OpenAlex
- Published in
- arXiv (Cornell University)
- DOI
- 10.48550/arxiv.2609.26732
- Original
- Read it at the publisher
- Topics
Abstract
We prove the Mumford--Shah conjecture, formulated in 1989, by completing the classification of blow-up limits of minimizers in the plane. The remaining case concerns limits whose discontinuity set is noncompact and has connected complement. In this setting, we rule out bounded connected components using second-variation inequalities obtained from combined inner and outer variations associated with two perpendicular translations of a compact subset separated from the rest of the discontinuity set. Established results then imply that the discontinuity set is connected, and the known classification for connected discontinuity sets completes the proof.
The authors’ abstract, as arXiv lists it. arXiv’s listings, abstracts included, are free for anyone to reuse.
Read it on ReadSearch
Each opens after you create an account, and brings you back to this paper.
More in Computer Vision
AURA: Angular Update Rate Adaptation for training complex-valued neural networks
KATOsuper: Surrogate-accelerated neural topology optimization with sensitivity-consistent Fourier neural operators
SuperPCA: subspace analysis and an efficient algorithm for high-dimensional PCA
Sparse-Observation Atmospheric Thermal Forecasting with Physics-Informed Neural Networks for Climate-Aware Digital Twins
One-Step Generative Surrogate Models via Block-Triangular Joint Drifting
Get the few papers worth your time in Computer Vision every morning.
ReadSearch reads the new papers in your field each day and brings you the few worth reading, each with its key finding in a sentence.