A smith-waterman local sequence alignment approach to spatial activity recognition
MetadataShow full item record
In this paper we address the spatial activity recognition problem with an algorithm based on Smith-Waterman (SW) local alignment. The proposed SW approach utilises dynamic programming with two dimensional spatial data to quantify sequence similarity. SW is well suited for spatial activity recognition as the approach is robust to noise and can accommodate gaps, resulting from tracking system errors. Unlike other approaches SW is able to locate and quantify activities embedded within extraneous spatial data. Through experimentation with a three class data set, we show that the proposed SW algorithm is capable of recognising accurately and inaccurately segmented spatial sequences. To benchmark the techniques classification performance we compare it to the discrete hidden markov model (HMM). Results show that SW exhibits higher accuracy than the HMM, and also maintains higher classification accuracy with smaller training set sizes. We also confirm the robust property of the SW approach via evaluation with sequences containing artificially introduced noise.
Showing items related by title, author, creator and subject.
Riedel, Daniel; Venkatesh, Svetha; Liu, Wan-Quan (2008)In this paper we address the problem of recognising embedded activities within continuous spatial sequences obtained from an online video tracking system. Traditionally, continuous data streams such as video tracking data ...
Riedel, Daniel; Venkatesh, Svetha; Liu, Wan-Quan (2007)Non-invasive spatial activity recognition is a difficult task, complicated by variation in how the same activities are conducted and furthermore by noise introduced by video tracking procedures. In this paper we propose ...
Truong, Huy S. (1999)Still image and image sequence compression plays an important role in the development of digital television. Although various still image and image sequence compression algorithms have already been developed, it is very ...