Noise-Tolerant Trajectory Distance Computation in the Presence of Inherent Noise for Video Surveillance Applications

Cited 1 time in webofscience Cited 0 time in scopus
  • Hit : 61
  • Download : 0
DC FieldValueLanguage
dc.contributor.authorKwon, Yongjinko
dc.contributor.authorMoon, Jinyoungko
dc.contributor.authorChung, Yeonseungko
dc.date.accessioned2024-09-10T05:00:07Z-
dc.date.available2024-09-10T05:00:07Z-
dc.date.created2024-09-10-
dc.date.created2024-09-10-
dc.date.created2024-09-10-
dc.date.created2024-09-10-
dc.date.issued2024-
dc.identifier.citationIEEE ACCESS, v.12, pp.92400 - 92418-
dc.identifier.issn2169-3536-
dc.identifier.urihttp://hdl.handle.net/10203/322856-
dc.description.abstractAs the importance of trajectory analysis arises in video surveillance, it becomes crucial to define the dissimilarity measure between two trajectories. Although the Hausdorff distance can be considered as a viable candidate for the measure, it is challenging to deal with noise present in trajectories since the Hausdorff distance is susceptible to noise so that even a single noise point may significantly distort the distance computation. In this paper, we propose a novel approach to alleviate the influence of inherent noise by setting noise-like points apart from ordinary points with a novel spatial tree structure during trajectory distance computation, without additional noise detection processes. In particular, we present R-on -tree, an extension of the existing spatial tree structure, that seamlessly finds permanent noise-like points, which are considered to have a low possibility of being ordinary points, and then keeps them in a separate auxiliary R-tree, without any separate process of disclosing noise-like points. We exploit R-on-tree to compute the noise-tolerant trajectory distance by modifying an existing algorithm for the Hausdorff distance. We also build an algorithm for noise-tolerant trajectory search to ensure accurate and high-quality search results even with noisy trajectories. The empirical results show that in all cases, our proposed approach yields the distance closest to the true one than any other competitor. The effectiveness of our approach is further examined by applying our noise-tolerant trajectory search to a real video surveillance dataset.-
dc.languageEnglish-
dc.publisherIEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC-
dc.titleNoise-Tolerant Trajectory Distance Computation in the Presence of Inherent Noise for Video Surveillance Applications-
dc.typeArticle-
dc.identifier.wosid001269300900001-
dc.identifier.scopusid2-s2.0-85197510646-
dc.type.rimsART-
dc.citation.volume12-
dc.citation.beginningpage92400-
dc.citation.endingpage92418-
dc.citation.publicationnameIEEE ACCESS-
dc.identifier.doi10.1109/ACCESS.2024.3422098-
dc.contributor.localauthorChung, Yeonseung-
dc.contributor.nonIdAuthorKwon, Yongjin-
dc.contributor.nonIdAuthorMoon, Jinyoung-
dc.description.isOpenAccessN-
dc.type.journalArticleArticle-
dc.subject.keywordAuthortrajectory search-
dc.subject.keywordAuthorvideo surveillance-
dc.subject.keywordAuthorTrajectory-
dc.subject.keywordAuthorNoise measurement-
dc.subject.keywordAuthorVideo surveillance-
dc.subject.keywordAuthorOptimization-
dc.subject.keywordAuthorFilters-
dc.subject.keywordAuthorSmoothing methods-
dc.subject.keywordAuthorTrajectory distance-
dc.subject.keywordAuthornoise-tolerant Hausdorff distance-
dc.subject.keywordPlusHAUSDORFF DISTANCE-
dc.subject.keywordPlusEFFICIENT-
dc.subject.keywordPlusRETRIEVAL-
Appears in Collection
MA-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 1 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0