Optimal-flow minimum-cost correspondence assignment in particle flow tracking

Alexandre Matov, Marcus M. Edvall, Ge Yang, Gaudenz Danuser

Research output: Contribution to journalArticle

7 Citations (Scopus)

Abstract

A diversity of tracking problems exists in which cohorts of densely packed particles move in an organized fashion, however the stability of individual particles within the cohort is low. Moreover, the flows of cohorts can regionally overlap. Together, these conditions yield a complex tracking scenario that cannot be addressed by optical flow techniques that assume piecewise coherent flows, or by multi-particle tracking techniques that suffer from the local ambiguity in particle assignment. Here, we propose a graph-based assignment of particles in three consecutive frames to recover from image sequences the instantaneous organized motion of groups of particles, i.e. flows. The algorithm makes no a priori assumptions on the fraction of particles participating in organized movement, as this number continuously alters with the evolution of the flow fields in time. Graph-based assignment methods generally maximize the number of acceptable particles assignments between consecutive frames and only then minimize the association cost. In dense and unstable particle flow fields this approach produces many false positives. The here proposed approach avoids this via solution of a multi-objective optimization problem in which the number of assignments is maximized while their total association cost is minimized. The method is validated on standard benchmark data for particle tracking. In addition, we demonstrate its application to live cell microscopy where several large molecular populations with different behaviors are tracked.

Original languageEnglish (US)
Pages (from-to)531-540
Number of pages10
JournalComputer Vision and Image Understanding
Volume115
Issue number4
DOIs
StatePublished - Apr 2011

Fingerprint

Flow fields
Optical flows
Multiobjective optimization
Costs
Microscopic examination

Keywords

  • Graph algorithms
  • Multi-directional flows
  • Multi-objective optimization
  • Particle tracking
  • Vector field

ASJC Scopus subject areas

  • Software
  • Computer Vision and Pattern Recognition
  • Signal Processing

Cite this

Optimal-flow minimum-cost correspondence assignment in particle flow tracking. / Matov, Alexandre; Edvall, Marcus M.; Yang, Ge; Danuser, Gaudenz.

In: Computer Vision and Image Understanding, Vol. 115, No. 4, 04.2011, p. 531-540.

Research output: Contribution to journalArticle

Matov, Alexandre ; Edvall, Marcus M. ; Yang, Ge ; Danuser, Gaudenz. / Optimal-flow minimum-cost correspondence assignment in particle flow tracking. In: Computer Vision and Image Understanding. 2011 ; Vol. 115, No. 4. pp. 531-540.
@article{c4d2fd2425f34f9da0b94f1ac113193d,
title = "Optimal-flow minimum-cost correspondence assignment in particle flow tracking",
abstract = "A diversity of tracking problems exists in which cohorts of densely packed particles move in an organized fashion, however the stability of individual particles within the cohort is low. Moreover, the flows of cohorts can regionally overlap. Together, these conditions yield a complex tracking scenario that cannot be addressed by optical flow techniques that assume piecewise coherent flows, or by multi-particle tracking techniques that suffer from the local ambiguity in particle assignment. Here, we propose a graph-based assignment of particles in three consecutive frames to recover from image sequences the instantaneous organized motion of groups of particles, i.e. flows. The algorithm makes no a priori assumptions on the fraction of particles participating in organized movement, as this number continuously alters with the evolution of the flow fields in time. Graph-based assignment methods generally maximize the number of acceptable particles assignments between consecutive frames and only then minimize the association cost. In dense and unstable particle flow fields this approach produces many false positives. The here proposed approach avoids this via solution of a multi-objective optimization problem in which the number of assignments is maximized while their total association cost is minimized. The method is validated on standard benchmark data for particle tracking. In addition, we demonstrate its application to live cell microscopy where several large molecular populations with different behaviors are tracked.",
keywords = "Graph algorithms, Multi-directional flows, Multi-objective optimization, Particle tracking, Vector field",
author = "Alexandre Matov and Edvall, {Marcus M.} and Ge Yang and Gaudenz Danuser",
year = "2011",
month = "4",
doi = "10.1016/j.cviu.2011.01.001",
language = "English (US)",
volume = "115",
pages = "531--540",
journal = "Computer Vision and Image Understanding",
issn = "1077-3142",
publisher = "Academic Press Inc.",
number = "4",

}

TY - JOUR

T1 - Optimal-flow minimum-cost correspondence assignment in particle flow tracking

AU - Matov, Alexandre

AU - Edvall, Marcus M.

AU - Yang, Ge

AU - Danuser, Gaudenz

PY - 2011/4

Y1 - 2011/4

N2 - A diversity of tracking problems exists in which cohorts of densely packed particles move in an organized fashion, however the stability of individual particles within the cohort is low. Moreover, the flows of cohorts can regionally overlap. Together, these conditions yield a complex tracking scenario that cannot be addressed by optical flow techniques that assume piecewise coherent flows, or by multi-particle tracking techniques that suffer from the local ambiguity in particle assignment. Here, we propose a graph-based assignment of particles in three consecutive frames to recover from image sequences the instantaneous organized motion of groups of particles, i.e. flows. The algorithm makes no a priori assumptions on the fraction of particles participating in organized movement, as this number continuously alters with the evolution of the flow fields in time. Graph-based assignment methods generally maximize the number of acceptable particles assignments between consecutive frames and only then minimize the association cost. In dense and unstable particle flow fields this approach produces many false positives. The here proposed approach avoids this via solution of a multi-objective optimization problem in which the number of assignments is maximized while their total association cost is minimized. The method is validated on standard benchmark data for particle tracking. In addition, we demonstrate its application to live cell microscopy where several large molecular populations with different behaviors are tracked.

AB - A diversity of tracking problems exists in which cohorts of densely packed particles move in an organized fashion, however the stability of individual particles within the cohort is low. Moreover, the flows of cohorts can regionally overlap. Together, these conditions yield a complex tracking scenario that cannot be addressed by optical flow techniques that assume piecewise coherent flows, or by multi-particle tracking techniques that suffer from the local ambiguity in particle assignment. Here, we propose a graph-based assignment of particles in three consecutive frames to recover from image sequences the instantaneous organized motion of groups of particles, i.e. flows. The algorithm makes no a priori assumptions on the fraction of particles participating in organized movement, as this number continuously alters with the evolution of the flow fields in time. Graph-based assignment methods generally maximize the number of acceptable particles assignments between consecutive frames and only then minimize the association cost. In dense and unstable particle flow fields this approach produces many false positives. The here proposed approach avoids this via solution of a multi-objective optimization problem in which the number of assignments is maximized while their total association cost is minimized. The method is validated on standard benchmark data for particle tracking. In addition, we demonstrate its application to live cell microscopy where several large molecular populations with different behaviors are tracked.

KW - Graph algorithms

KW - Multi-directional flows

KW - Multi-objective optimization

KW - Particle tracking

KW - Vector field

UR - http://www.scopus.com/inward/record.url?scp=79851511153&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79851511153&partnerID=8YFLogxK

U2 - 10.1016/j.cviu.2011.01.001

DO - 10.1016/j.cviu.2011.01.001

M3 - Article

C2 - 21720496

AN - SCOPUS:79851511153

VL - 115

SP - 531

EP - 540

JO - Computer Vision and Image Understanding

JF - Computer Vision and Image Understanding

SN - 1077-3142

IS - 4

ER -