<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>27</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Ljudmil  Bojilov</style></author><author><style face="normal" font="default" size="100%">Pavlina Konstantinova</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A Comparison study of two approaches for determining ranked set of assignments for multitarget tracking</style></title></titles><dates><year><style  face="normal" font="default" size="100%">2017</style></year></dates><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Ljudmil  Bojilov</style></author><author><style face="normal" font="default" size="100%">Kiril Alexiev</style></author><author><style face="normal" font="default" size="100%">Pavlina Konstantinova</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">An Accelerated IMM-JPDA Algorithm for Tracking Multiple Maneuvering Targets in Clutter</style></title><secondary-title><style face="normal" font="default" size="100%">Information &amp; Security: An International Journal</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">assignment</style></keyword><keyword><style  face="normal" font="default" size="100%">cluttered environment</style></keyword><keyword><style  face="normal" font="default" size="100%">multiple maneuvering targets</style></keyword><keyword><style  face="normal" font="default" size="100%">Tracking</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2002</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2002</style></date></pub-dates></dates><volume><style face="normal" font="default" size="100%">9</style></volume><pages><style face="normal" font="default" size="100%">141-153</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Theoretically, the Multiple Hypothesis Tracking (MHT) method is the most powerful approach for tracking multiple targets. The MHT method, however, leads to combinatorial explosion and computational overload. By using an algorithm for finding the K-best assignments, the MHT approach can be considerably optimized in terms of computational load. A much simpler alternative of the MHT approach is provided by the Joint Probabilistic Data Association (JPDA) algorithm in combination with the Interacting Multiple Models (IMM) approach. Even though it is much more simple, this approach can also be computationally overwhelming. To overcome this drawback, an algorithm due to Murty and optimized by Miller, Stone and Cox is embedded in the IMM-JPDA algorithm in order to determine a ranked set of K-best hypotheses (instead of all feasible hypotheses). The presented algorithm assures continuous maneuver detection and adequate estimation of maneuvering targets in heavy clutter. This results in a good overall target tracking performance with moderate computational and memory requirements. The article further presents corresponding simulation results.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Ljudmil  Bojilov</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">An Improved Version of a Multiple Target Tracking Algorithm</style></title><secondary-title><style face="normal" font="default" size="100%">Information &amp; Security: An International Journal</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">assignments</style></keyword><keyword><style  face="normal" font="default" size="100%">multiple hypotheses tracking</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2002</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2002</style></date></pub-dates></dates><volume><style face="normal" font="default" size="100%">9</style></volume><pages><style face="normal" font="default" size="100%">130-140</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">The author presents an improved version of an algorithm for multitarget tracking. The algorithm extends the seminal algorithm of Nagarajan et. al., overcoming to some extent combinatorial problems, arising while simultaneously tracking multiple targets using track-while-scan radars. In a previous work, the algorithm was tested in comparatively simple to moderate scenarios. In this article, the author changes some of the previously suggested additional rules of the Nagarajan’s algorithm and presents more comprehensive experimental results with more sophisticated scenarios, using at the same time more processing power. By an additional experiment, the author reveals a useful feature of the presented algorithm that makes it a viable alternative to the well known algorithms for finding the first K-best hypotheses in the framework of the MHT approach.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Ljudmil  Bojilov</style></author><author><style face="normal" font="default" size="100%">Pavlina Konstantinova</style></author><author><style face="normal" font="default" size="100%">Kiril Alexiev</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A particular programme realization of JPDAF algorithm</style></title><secondary-title><style face="normal" font="default" size="100%">Comptes rendus de l'Academie bulgare des Sciences</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2002</style></year></dates><volume><style face="normal" font="default" size="100%">55</style></volume><pages><style face="normal" font="default" size="100%">37-44</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><issue><style face="normal" font="default" size="100%">9</style></issue></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Ljudmil  Bojilov</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">An Extension of an Algorithm for Multiple Hypotheses Tracking</style></title><secondary-title><style face="normal" font="default" size="100%">Comptes rendus del’Academie Bulgare de Sciences</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">1997</style></year></dates><volume><style face="normal" font="default" size="100%">5</style></volume><pages><style face="normal" font="default" size="100%">45-48</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><issue><style face="normal" font="default" size="100%">5</style></issue></record></records></xml>