Comparing Evaluation Protocols on the KTH Dataset

被引:0
|
作者
Gao, Zan [1 ]
Chen, Ming-yu [2 ]
Hauptmann, Alexander G. [2 ]
Cai, Anni [1 ]
机构
[1] Beijing Univ Posts & Telecommun, Sch Informat & Commun Engn, Beijing 100876, Peoples R China
[2] Carnegie Mellon Univ, Sch Comp Sci, Pittsburgh, PA 15213 USA
来源
HUMAN BEHAVIOR UNDERSTANDING | 2010年 / 6219卷
基金
美国国家科学基金会;
关键词
Action Recognition; training/test data sets; partitioning; experimental methods; RECOGNITION; DENSE;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Human action recognition has become a hot research topic, and a lot of algorithms have been proposed Most of researchers evaluated their performances on the KTH dataset. but there is no unified standard how to evaluate algorithms on this dataset Different researchers have employed different test setups, so the comparison is not accurate. lair or complete In order to know how much difference there is when different experimental setups are used, we take our own spatiotemporal MoSIFT feature as an example to assess its performance on the KTH dataset using different test scenarios and different partitioning of the data In all experiments, support vector machine (SVM) with a chi-square kernel is adopted First, we evaluate performance changes resulting from differing vocabulary sizes of the codebook, and then decide on a suitable vocabulary size of codebook Then, we train the models using different training dataset partitions, and test the performances one the corresponding held-out test sets Experiments show that the best performance of MoSIF7 can reach 96 33% on the KTH dataset When different n-fold cross-validation methods are used, there can be up to 10 67% difference in the result And when different dataset segmentations are used (such as KTH1 and KTH2), the difference in results can be up to 5 8% absolute In addition, the performance changes dramatically when different scenarios are used in the training and test dataset When training on KTH1 S1+S2+S3+S4 and testing on KTH I SI and S3 scenarios, the performance can reach 97 33% and 89 33% respectively This paper shows how different test configurations can skew results, even on standard data set The recommendation is to use a simple leave-one-out as the most easily replicable clear-cut partitioning
引用
收藏
页码:88 / +
页数:3
相关论文
共 50 条
  • [31] Objective and automated protocols for the evaluation of biomedical search engines using No Title Evaluation protocols
    Fabien Campagne
    BMC Bioinformatics, 9
  • [32] Comparing Refugee Resettlement Services: A New Global Dataset and Typology
    Benson, Grace E. K.
    REFUGEE SURVEY QUARTERLY, 2024,
  • [33] Comparing Thinning Based Morphological operation on Sindhi Printed Dataset
    Nizamani, Nasreen
    Chowdhry, Bhawani Shankar
    Shaikh, Mujtaba
    Saand, Abdul Sattar
    Ali, Ehsan
    INTERNATIONAL JOURNAL OF COMPUTER SCIENCE AND NETWORK SECURITY, 2018, 18 (02): : 126 - 129
  • [34] EVALUATION OF ACCESS PROTOCOLS FOR ISDN
    WONG, J
    HWA, HR
    AUSTRALIAN TELECOMMUNICATION RESEARCH, 1986, 20 (02): : 13 - 26
  • [35] Sanitation protocols and methods of evaluation
    Samaraweera, IS
    Rheault, DL
    Buschette, LA
    ZUCKERINDUSTRIE, 2005, 130 (11): : 827 - 833
  • [36] An evaluation of reliable multicast protocols
    Appala, SV
    Austen, JR
    IEEE SOUTHEASTCON '99, PROCEEDINGS, 1999, : 165 - 168
  • [37] CONTROVERSIAL TECHNIQUES - PROTOCOLS FOR EVALUATION
    BUKANTZ, SC
    LOCKEY, RF
    HOSPITAL PRACTICE, 1981, 16 (07) : 11 - 12
  • [38] An evaluation of network management protocols
    Goncalves, Pedro
    Oliveira, Jose Luis
    Aguiar, Rui L.
    2009 IFIP/IEEE INTERNATIONAL SYMPOSIUM ON INTEGRATED NETWORK MANAGEMENT (IM 2009) VOLS 1 AND 2, 2009, : 537 - +
  • [39] Evaluation of MRSAD phasing protocols
    Pederzoli, Riccardo
    Dall'Antonia, Fabio
    Bento, Isabel
    Cianci, Michele
    Schneider, Thomas R.
    ACTA CRYSTALLOGRAPHICA A-FOUNDATION AND ADVANCES, 2016, 72 : S202 - S202
  • [40] Evaluation of protocols for wireless networks
    Biaz, S
    Holland, G
    Ko, YB
    Vaidya, N
    INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS I-V, PROCEEDINGS, 1999, : 2150 - 2156