A diffusion inpainting model finetuned on video frame pairs with noisy captions and pose conditioning gives text-controllable identity-preserving edits of people in new scenes.
Tverberg Partition Graphs
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
Given a finite set of points in $\mathbb{R}^d$, Tverberg's theorem guarantees the existence of partitions of this set into parts whose convex hulls intersect. We introduce a graph structured on the family of Tverberg partitions of a given set of points, whose edges describe closeness between different Tverberg partitions. We prove bounds on the minimum and maximum degree of this graph, the number of vertices of maximal degree, its clique number, and its connectedness.
citation-role summary
background 1
citation-polarity summary
fields
cs.CV 1years
2024 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Learning Complex Non-Rigid Image Edits from Multimodal Conditioning
A diffusion inpainting model finetuned on video frame pairs with noisy captions and pose conditioning gives text-controllable identity-preserving edits of people in new scenes.