2010 8th IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOM Workshops) 2010
DOI: 10.1109/percomw.2010.5470597
|View full text |Cite
|
Sign up to set email alerts
|

All for one or one for all? Combining heterogeneous features for activity spotting

Abstract: Abstract-Choosing the right feature for motion based activity spotting is not a trivial task. Often, features derived by intuition or that proved to work well in previous work are used. While feature selection algorithms allow automatic decision, definition of features remains a manual task. We conduct a comparative study of features with very different origin. To this end, we propose a new type of features based on polynomial approximation of signals. The new feature type is compared to features used routinel… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
8
0

Year Published

2012
2012
2017
2017

Publication Types

Select...
3
3
3

Relationship

2
7

Authors

Journals

citations
Cited by 24 publications
(17 citation statements)
references
References 19 publications
0
8
0
Order By: Relevance
“…On the other hand, discriminative approaches that model the boundary between different activity classes offer an effective alternative. These techniques include decision trees, meta classifiers based on boosting and bagging, support vector machines, and discriminative probabilistic graphical models such as conditional random fields [33,4143]. Other approaches combine these underlying learning algorithms, including boosting and other ensemble methods [35,44,45].…”
Section: Background and Related Workmentioning
confidence: 99%
“…On the other hand, discriminative approaches that model the boundary between different activity classes offer an effective alternative. These techniques include decision trees, meta classifiers based on boosting and bagging, support vector machines, and discriminative probabilistic graphical models such as conditional random fields [33,4143]. Other approaches combine these underlying learning algorithms, including boosting and other ensemble methods [35,44,45].…”
Section: Background and Related Workmentioning
confidence: 99%
“…These include Bayesian approaches [7], [26], [27], hidden Markov models [28]–[31], conditional random fields [10], [27], [32], support vector machines [14], decision trees [26], and ensemble methods [27], [33], [34]. Each of these approaches offers advantages in terms of amount of training that is required, model robustness, and computational cost.…”
Section: Activity Recognitionmentioning
confidence: 99%
“…On the other hand, discriminative approaches that model the boundary between different activity classes offer an effective alternative. These techniques include decision trees, meta classifiers based on boosting and bagging, support vector machines, and discriminative probabilistic graphical models such as conditional random fields [20,[52][53][54][55][56][57][58][59][60][61][62][63][64][65][66][67]. Other approaches combine these underlying learning algorithms, including boosting and other ensemble methods [68][69][70][71].…”
Section: Activity Awarenessmentioning
confidence: 99%