Related Experiment Video
Updated: Jan 4, 2026

Image Processing Protocol for the Analysis of the Diffusion and Cluster Size of Membrane Receptors by Fluorescence Microscopy
Published on: April 9, 2019
Two efficient calculations of edit distance between marked point processes
Yoshito Hirata1, Noriyoshi Sukegawa2
1Mathematics and Informatics Center and International Research Center for Neurointelligence, The University of Tokyo, 7-3-1 Hongo, Bunkyo-ku, Tokyo 113-8656, Japan.
Abstract:
In this paper, we propose to use linear programming methods or a more specialized method, namely, the Hungarian method, for speeding up the exact calculation of an edit distance for marked point processes [Y. Hirata and K. Aihara, Chaos 25, 123117 (2015)]. The key observation is that the problem of calculating the edit distance reduces to a matching problem on a bipartite graph. Our preliminary numerical results show that the proposed implementations are faster than the conventional ones by a factor of 10-1000.
Related Concept Videos
The Distance Formula
The Dot Product
Design Example: Measuring Distance Between Two Points with Obstructions
Distance Corrections
Calculations of Electric Potential II
Consider a...
The Midpoint Formula

