paper-with-me

홈 › Papers

Extension of Sinkhorn Method: Optimal Movement Estimation of Agents Moving at Constant Velocity

2019-07-11 · Daigo Okada, Naotoshi Nakamura, Takuya Wada, Ayako Iwasaki, Ryo Yamada

In the field of bioimaging, an important part of analyzing the motion of objects is tracking. We propose a method that applies the Sinkhorn distance for solving the optimal transport problem to track objects. The advantage of this method is that it can flexibly incorporate various assumptions in tracking as a cost matrix. First, we extend the Sinkhorn distance from two dimensions to three dimensions. Using this three-dimensional distance, we compare the performance of two types of tracking technique, namely tracking that associates objects that are close to each other, which conventionally uses the nearest-neighbor method, and tracking that assumes that the object is moving at constant velocity, using three types of simulation data. The results suggest that when tracking objects moving at constant velocity, our method is superior to conventional nearest-neighbor tracking as long as the added noise is not excessively large. We show that the Sinkhorn method can be applied effectively to object tracking. Our simulation data analysis suggests that when objects are moving at constant velocity, our method, which sets acceleration as a cost, outperforms the traditional nearest-neighbor method in terms of tracking objects. To apply the proposed method to real bioimaging data, it is necessary to set an appropriate cost indicator based on the movement features.

📄 PDF Abstract BibTeX arXiv:1907.05036

Code (0)

등록된 구현이 없습니다.

Tasks

Object Tracking

Similar Papers 제목 키워드 기반

Sinkhorn Algorithm for Sequentially Composed Optimal Transports

2024-12-04 · Kazuki Watanabe, Noboru Isobe

Sinkhorn algorithm is the de-facto standard approximation algorithm for optimal transport, which has been applied to a variety of applications, including image processing and natural language processing. In theory, the p…

Statistical Analysis of the Sinkhorn Iterations for Two-Sample Schrödinger Bridge Estimation

2025-10-26 · Ibuki Maeda, Rentian Yao, Atsushi Nitanda arxiv

The Schrödinger bridge problem seeks the optimal stochastic process that connects two given probability distributions with minimal energy modification. While the Sinkhorn algorithm is widely used to solve the static opti…

Sinkhorn Algorithm as a Special Case of Stochastic Mirror Descent

2019-09-16 · Konstantin Mishchenko

We present a new perspective on the celebrated Sinkhorn algorithm by showing that is a special case of incremental/stochastic mirror descent. In order to see this, one should simply plug Kullback-Leibler divergence in bo…

Accelerating Sinkhorn Algorithm with Sparse Newton Iterations

2024-01-20 · Xun Tang, Michael Shavlovsky, Holakou Rahmanian, Elisa Tardini 외

Computing the optimal transport distance between statistical distributions is a fundamental task in machine learning. One remarkable recent advancement is entropic regularization and the Sinkhorn algorithm, which utilize…

LSMI-Sinkhorn: Semi-supervised Mutual Information Estimation with Optimal Transport

2019-09-05 · Yanbin Liu, Makoto Yamada, Yao-Hung Hubert Tsai, Tam Le 외

Estimating mutual information is an important statistics and machine learning problem. To estimate the mutual information from data, a common practice is preparing a set of paired samples $\{(\mathbf{x}_i,\mathbf{y}_i)\}…

BIG-bench Machine LearningMutual Information Estimation