威望0
积分7946
贡献0
在线时间762 小时
UID1
注册时间2021-4-14
最后登录2024-11-21
管理员
- UID
- 1
- 威望
- 0
- 积分
- 7946
- 贡献
- 0
- 注册时间
- 2021-4-14
- 最后登录
- 2024-11-21
- 在线时间
- 762 小时
|
【代码名称】:加性近似最优传输算法的实现为论文
【代码介绍】:加性近似最优传输算法的实现为论文[https://arxiv.org pdf 1905...](https://arxiv.org pdf 1905.11830.pdf)
(The implementation of the additive approximation optimal transport algorithm for the paper <https://arxiv.org/pdf/1905.11830.pdf>)
【代码截图】:文件列表:
APDAGD.m (4906, 2020-02-12)
GabowTarjan (0, 2020-02-12)
GabowTarjan\GTTransport.m (17845, 2020-02-12)
GabowTarjan\GTTransportMapping.m (4053, 2020-02-12)
GabowTarjan\greedyMatch.m (644, 2020-02-12)
GabowTarjanJavaCode (0, 2020-02-12)
GabowTarjanJavaCode\GTTransport (0, 2020-02-12)
GabowTarjanJavaCode\GTTransport\src (0, 2020-02-12)
GabowTarjanJavaCode\GTTransport\src\optimaltransport (0, 2020-02-12)
GabowTarjanJavaCode\GTTransport\src\optimaltransport\GTTransport.java (12243, 2020-02-12)
GabowTarjanJavaCode\GTTransport\src\optimaltransport\Mapping.java (5545, 2020-02-12)
NIPS17Code (0, 2020-02-12)
NIPS17Code\computeot_lp.m (569, 2020-02-12)
NIPS17Code\frobinnerproduct.m (62, 2020-02-12)
NIPS17Code\gcpb_compute_ot.m (802, 2020-02-12)
NIPS17Code\gcpb_ot.m (1296, 2020-02-12)
NIPS17Code\greenkhorn.m (4087, 2020-02-12)
NIPS17Code\round_transpoly.m (491, 2020-02-12)
NIPS17Code\sinkhorn2.m (2054, 2020-02-12)
Testing (0, 2020-02-12)
Testing\IterationsAllMethods.m (5775, 2020-02-12)
Testing\SinkhornComparison.m (5166, 2020-02-12)
Testing\SmallDelta.m (4113, 2020-02-12)
Testing\computeot_lp.m (663, 2020-02-12)
Testing\mnist.mat (14278089, 2020-02-12)
Testing\my_im_resize.m (670, 2020-02-12)
computeDistanceMatrixGrid.m (515, 2020-02-12)
round_matrix.m (450, 2020-02-12)
【代码下载】:
加性近似最优传输算法的实现为论文.zip
(13.63 MB, 下载次数: 0)
|
上一篇:利用枝切法进行相位消跳变(解包裹);有示例图像。下一篇:不平衡运输问题的缩放算法
|