2010 First International Conference on Integrated Intelligent Computing 2010
DOI: 10.1109/iciic.2010.49
|View full text |Cite
|
Sign up to set email alerts
|

Efficient and Fast Pattern Matching in Stream Time Series Image Data

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2012
2012
2015
2015

Publication Types

Select...
2
2

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(4 citation statements)
references
References 9 publications
0
4
0
Order By: Relevance
“…The study in Wang et al (2013) compares 8 different time-series representation techniques and compares their performance over several time series data sets. The approaches in Lian et al (2009) and Sethukkarasi et al (2010) represents time series using Multi Segment Mean (MSM) representation and multi scale segment median approximation representation for stream time-series image data, respectively for fast pattern matching in stream time.…”
Section: Representation Of Time-series With Reduced Dimensionalitymentioning
confidence: 99%
“…The study in Wang et al (2013) compares 8 different time-series representation techniques and compares their performance over several time series data sets. The approaches in Lian et al (2009) and Sethukkarasi et al (2010) represents time series using Multi Segment Mean (MSM) representation and multi scale segment median approximation representation for stream time-series image data, respectively for fast pattern matching in stream time.…”
Section: Representation Of Time-series With Reduced Dimensionalitymentioning
confidence: 99%
“…This approach is not so suitable for image data streams. Sethukkarasi et al, [8] presented a technique for similarity matching between static/dynamic patterns and time-series image data to perform effective retrieval of image data.…”
Section: Literature Surveymentioning
confidence: 99%
“…If the original data is represented by the set T after data approximation at level 1 as MSM1 , then MSM 1 = ( MSM 11 where m = length ( T ) / seg_size l ...... (8) The time complexity for the MSM reduction process is O(l*n i ) where l is the number of levels of MSM and n i is the number of segments at each stage. The time complexity is directly proportional to the number of MSM levels.…”
Section: -Illustration Of Msmmentioning
confidence: 99%
See 1 more Smart Citation