Screening cell–cell communication in spatial transcriptomics via collective optimal transport
Spatial transcriptomic technologies and spatially annotated single-cell RNA sequencing
datasets provide unprecedented opportunities to dissect cell–cell communication (CCC) …
datasets provide unprecedented opportunities to dissect cell–cell communication (CCC) …
Sliced optimal partial transport
Optimal transport (OT) has become exceedingly popular in machine learning, data science,
and computer vision. The core assumption in the OT problem is the equal total amount of …
and computer vision. The core assumption in the OT problem is the equal total amount of …
Partial optimal tranport with applications on positive-unlabeled learning
Classical optimal transport problem seeks a transportation map that preserves the total mass
between two probability distributions, requiring their masses to be equal. This may be too …
between two probability distributions, requiring their masses to be equal. This may be too …
Accurate point cloud registration with robust optimal transport
This work investigates the use of robust optimal transport (OT) for shape matching.
Specifically, we show that recent OT solvers improve both optimization-based and deep …
Specifically, we show that recent OT solvers improve both optimization-based and deep …
A survey of optimal transport for computer graphics and computer vision
Optimal transport is a long‐standing theory that has been studied in depth from both
theoretical and numerical point of views. Starting from the 50s this theory has also found a …
theoretical and numerical point of views. Starting from the 50s this theory has also found a …
Differentiable rendering using rgbxy derivatives and optimal transport
Traditional differentiable rendering approaches are usually hard to converge in inverse
rendering optimizations, especially when initial and target object locations are not so close …
rendering optimizations, especially when initial and target object locations are not so close …
Fast Optimal Transport through Sliced Generalized Wasserstein Geodesics
Wasserstein distance (WD) and the associated optimal transport plan have been proven
useful in many applications where probability measures are at stake. In this paper, we …
useful in many applications where probability measures are at stake. In this paper, we …
Hierarchical sliced wasserstein distance
Sliced Wasserstein (SW) distance has been widely used in different application scenarios
since it can be scaled to a large number of supports without suffering from the curse of …
since it can be scaled to a large number of supports without suffering from the curse of …
Delving into high-quality synthetic face occlusion segmentation datasets
This paper performs comprehensive analysis on datasets for occlusion-aware face
segmentation, a task that is crucial for many downstream applications. The collection and …
segmentation, a task that is crucial for many downstream applications. The collection and …
Unbalanced optimal transport through non-negative penalized linear regression
This paper addresses the problem of Unbalanced Optimal Transport (UOT) in which the
marginal conditions are relaxed (using weighted penalties in lieu of equality) and no …
marginal conditions are relaxed (using weighted penalties in lieu of equality) and no …