Institution profile

École Normale Supérieure Paris-Saclay

Academic institutioneurope · fr
Official website
Research library179linked papers
Opportunities0open roles
Selected work

Representative Papers

Train-Free Segmentation in MRI with Cubical Persistent Homology

Jan 02, 2024arXiv.org

To address the scarcity of annotated data in MRI segmentation, this paper proposes a training-free, fully unsupervised topological segmentation framework. Methodologically, it leverages cubical persistent homology to extract topological features—such as connected components and voids—from MRI volumes; employs automated threshold selection and spatial localization of representative cycles; and integrates anatomical geometric priors (e.g., spheres, cylinders, circles) to achieve precise segmentation of target structures—including glioblastoma, myocardium, and fetal cortical plate. Its key innovation lies in the first use of spatial coordinates of representative cycles to directly guide segmentation, thereby ensuring interpretability, topological stability, and geometric adaptability. Evaluated across multiple clinical MRI tasks, the method matches state-of-the-art supervised approaches in performance while requiring no labeled data—significantly enhancing robustness and clinical trustworthiness.

2 citations1 influentialRead paper

Bipartite Tur'an number of paths and other trees

Nov 10, 2025

This paper investigates the maximum number of edges in a bipartite connected graph containing a longest path of prescribed length as a subgraph, with fixed partite set sizes |A| and |B|. Prior work established exact results only for the symmetric case (|A| = |B|) and path lengths at most five. We provide, for the first time, an exact closed-form expression for the extremal number across all partite sizes, establishing a tight functional relationship between the edge bound, path length, and partite set cardinalities. This fully resolves the bipartite path Turán number problem posed by Caro–Patkós–Tuza. Our approach integrates extremal graph theory, structural characterization, and inductive reasoning; we construct extremal graphs and prove their optimality. Additionally, we explore generalizations to star-like trees and other specific tree families, thereby introducing a new paradigm for bipartite extremal problems under subgraph constraints.

1 citationsRead paper

A new introduction rule for disjunction

Feb 26, 2025

This paper addresses the long-standing absence of the strong introduction property—i.e., the requirement that every closed cut-free proof must end with an introduction rule—in natural deduction for disjunction. We introduce a third disjunction introduction rule (∨-i₃), applicable only when both disjuncts are provable. This rule is the first in natural deduction to guarantee the strong introduction property for disjunction, ensuring all closed cut-free proofs terminate with an introduction step. It eliminates reliance on hyper-reduction rules in termination proofs, enables faithful modeling of quantum measurement within linear logic—without introducing new connectives—and reduces the complexity of exchange-cut elimination in substructural logics. Collectively, these contributions enhance structural regularity, provability-theoretic robustness, and computational expressivity in proof theory.

1 citationsRead paper
Recent publications

Latest Papers