7
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      Efficient Global MOT Under Minimum-Cost Circulation Framework

      research-article

      Read this article at

      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          We developed a minimum-cost circulation framework for solving the global data association problem, which plays a key role in the tracking-by-detection paradigm of multi-object tracking (MOT). The global data association problem was extensively studied under the minimum-cost flow framework, which is theoretically attractive as being flexible and globally solvable. However, the high computational burden has been a long-standing obstacle to its wide adoption in practice. While enjoying the same theoretical advantages and maintaining the same optimal solution as the minimum-cost flow framework, our new framework has a better theoretical complexity bound and leads to orders of practical efficiency improvement. This new framework is motivated by the observation that minimum-cost flow only partially models the data association problem and it must be accompanied by an additional and time-consuming searching scheme to determine the optimal object number. By employing a minimum-cost circulation framework, we eliminate the searching step and naturally integrate the number of objects into the optimization problem. By exploring the special property of the associated graph, that is, an overwhelming majority of the vertices are with unit capacity, we designed an implementation of the framework and proved it has the best theoretical computational complexity so far for the global data association problem. We evaluated our method with 40 experiments on five MOT benchmark datasets. Our method was always the most efficient in every single experiment and averagely 53 to 1,192 times faster than the three state-of-the-art methods. When our method served as a sub-module for global data association methods utilizing higher-order constraints, similar running time improvement was attained. We further illustrated through several case studies how the improved computational efficiency enables more sophisticated tracking models and yields better tracking accuracy. We made the source code publicly available on GitHub with both Python and MATLAB interfaces.

          Related collections

          Most cited references26

          • Record: found
          • Abstract: not found
          • Article: not found

          An algorithm for tracking multiple targets

            Bookmark
            • Record: found
            • Abstract: found
            • Article: not found

            Object detection with discriminatively trained part-based models.

            We describe an object detection system based on mixtures of multiscale deformable part models. Our system is able to represent highly variable object classes and achieves state-of-the-art results in the PASCAL object detection challenges. While deformable part models have become quite popular, their value had not been demonstrated on difficult benchmarks such as the PASCAL data sets. Our system relies on new methods for discriminative training with partially labeled data. We combine a margin-sensitive approach for data-mining hard negative examples with a formalism we call latent SVM. A latent SVM is a reformulation of MI--SVM in terms of latent variables. A latent SVM is semiconvex, and the training problem becomes convex once latent information is specified for the positive examples. This leads to an iterative training algorithm that alternates between fixing latent values for positive examples and optimizing the latent SVM objective function.
              Bookmark
              • Record: found
              • Abstract: found
              • Article: found
              Is Open Access

              Objective comparison of particle tracking methods

              The first community competition designed to objectively compare the performance of particle tracking algorithms provides valuable practical information for both users and developers. Supplementary information The online version of this article (doi:10.1038/nmeth.2808) contains supplementary material, which is available to authorized users.
                Bookmark

                Author and article information

                Journal
                9885960
                29671
                IEEE Trans Pattern Anal Mach Intell
                IEEE Trans Pattern Anal Mach Intell
                IEEE transactions on pattern analysis and machine intelligence
                0162-8828
                1939-3539
                21 March 2022
                April 2022
                04 March 2022
                01 April 2022
                : 44
                : 4
                : 1888-1904
                Affiliations
                Bradley Department of Electrical and Computer Engineering, Virginia Tech, Arlington, VA 22203 USA.
                Author notes
                Corresponding author: Guoqiang Yu, yug@ 123456vt.edu .
                Author information
                http://orcid.org/0000-0002-1318-7180
                http://orcid.org/0000-0002-6743-7413
                Article
                NIHMS1786283
                10.1109/TPAMI.2020.3026257
                8966209
                32966213
                dc13cec9-4ff2-42d7-bdf0-687d641e9c7d

                This work is licensed under a Creative Commons Attribution 4.0 License. For more information, see https://creativecommons.org/licenses/by/4.0/

                History
                Categories
                Article

                minimum-cost circulation,overwhelming unit-vertex-capacity graph,data association,object tracking

                Comments

                Comment on this article