Please use this identifier to cite or link to this item: https://doi.org/10.1007/978-3-642-17829-0_27
DC FieldValue
dc.titlePedestrian tracking based on Hidden-Latent temporal Markov chain
dc.contributor.authorZhang, P.
dc.contributor.authorEmmanuel, S.
dc.contributor.authorKankanhalli, M.
dc.date.accessioned2013-07-04T07:56:51Z
dc.date.available2013-07-04T07:56:51Z
dc.date.issued2011
dc.identifier.citationZhang, P.,Emmanuel, S.,Kankanhalli, M. (2011). Pedestrian tracking based on Hidden-Latent temporal Markov chain. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 6524 LNCS (PART 2) : 285-295. ScholarBank@NUS Repository. <a href="https://doi.org/10.1007/978-3-642-17829-0_27" target="_blank">https://doi.org/10.1007/978-3-642-17829-0_27</a>
dc.identifier.isbn3642178286
dc.identifier.issn03029743
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/40109
dc.description.abstractRobust, accurate and efficient pedestrian tracking in surveillance scenes is a critical task in many intelligent visual security systems and robotic vision applications. The usual Markov chain based tracking algorithms suffer from error accumulation problem in which the tracking drifts from the objects as time passes. To minimize the accumulation of tracking errors, in this paper we propose to incorporate the semantic information about each observation in the Markov chain model. We thus obtain pedestrian tracking as a temporal Markov chain with two hidden states, called hidden-latent temporal Markov chain (HL-TMC). The hidden state is used to generate the estimated observations during the Markov chain transition process and the latent state represents the semantic information about each observation. The hidden state and the latent state information are then used to obtain the optimum observation, which is the pedestrian. Use of latent states and the probabilistic latent semantic analysis (pLSA) handles the tracking error accumulation problem and improves the accuracy of tracking. Further, the proposed HL-TMC method can effectively track multiple pedestrians in real time. The performance evaluation on standard benchmarking datasets such as CAVIAR, PETS2006 and AVSS2007 shows that the proposed approach minimizes the accumulation of tracking errors and is able to track multiple pedestrians in most of the surveillance situations. © 2011 Springer-Verlag Berlin Heidelberg.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1007/978-3-642-17829-0_27
dc.sourceScopus
dc.subjectError Accumulation
dc.subjectHidden-Latent
dc.subjectSurveillance
dc.subjectTemporal Markov Chain
dc.subjectTracking
dc.typeConference Paper
dc.contributor.departmentCOMPUTER SCIENCE
dc.description.doi10.1007/978-3-642-17829-0_27
dc.description.sourcetitleLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
dc.description.volume6524 LNCS
dc.description.issuePART 2
dc.description.page285-295
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.