trecvid 2005 shot boundary detection task overview
play

TRECVID-2005: Shot Boundary Detection Task Overview Alan Smeaton - PowerPoint PPT Presentation

TRECVID-2005: Shot Boundary Detection Task Overview Alan Smeaton Dublin City University & Paul Over NIST SB Task Definition o Shot boundary detection is a fundamental task in any kind of video content manipulation o Task provides a


  1. 1. City University of Hong Kong o Approach n Spatio-temporal (SD) slides are time vs. space representations of video - shot transition types (cuts, dissolves) appear in SDs with certain characteristics; Gabor features for motion texture and SVM for binary classification; o Features n Expends previous (ACM MM) approach by including flash detection and extra visual features to discriminate GTs o Performance n Because of image processing and SVM it is expensive; o Results TRECVID 2005 20

  2. Cuts (zoomed again) � CLIPS Fudan FIU FXPal ���� HKPU IBM ��������� ��� IITB Im perial KDDI LaBri ���� M arburg Motorola NICTA RM IT ��� Tsinghua TUDelft ���� Uiowa Um odena � � � � � � � � � � � � URJC USP ������ CityU-HK TRECVID 2005 21

  3. Gradual transitions (zoomed) ����� ����� � ���� ��� ����� ��� ���� ��� ���� ��������� ���� �� ������ ��� ���� ���� ����� ��� � ������ � ������� ���� ����� �� �� ��� � ���!�� �����"� ���� ��� ���#� �� ����� � � � � � � � � � � � � � � � � ��$� �� � ������ ���%�&�� TRECVID 2005 22

  4. ���/�-�&�! �/1 Mean runtime in seconds 100000 150000 200000 250000 300000 350000 50000 0 KDDI Marburg LaBRI USP Tsinghua IBM Motorola RMIT TRECVID 2005 TUDelft Imperial ���&���"�� Uiowa Fudan HKPU & IITB REAL TIME ==> UniMore FXPal NICTA CLIPS FIU URJC CItyU-HK 23

  5. Gradual transitions: Frame-P & R (zoomed) ����� ����� � ���� ��� ����� ��� ���� ��� ���� ��������� ���� �� ������ ��� ���� ���� ����� ��� � ������ � ������� ���� ����� �� �� ��� � ���!�� �����"� ���� ��� ���#� �� ����� � � � � � � � � � � � � � � � � ��$� �� � ������ ���%�&�� TRECVID 2005 24

  6. 2. CLIPS-IMAG, LSR-IMAG, Laboratoire LIS o Approach n Appears to be a re-run of 2004 system, which was a re-run of 2003 (thanks for doing this) - emphasis was on features. o Features n Detect cuts by image comparisons after motion compensation and GTs by comparing norms of first and second temporal derivatives of the images; o Performance n About real-time, good on GTs; o Results TRECVID 2005 25

  7. Cuts (zoomed again) � CLIPS Fudan FIU FXPal ���� HKPU IBM ��������� ��� IITB Im perial KDDI LaBri ���� M arburg Motorola NICTA RM IT ��� Tsinghua TUDelft ���� Uiowa Um odena � � � � � � � � � � � � URJC USP ������ CityU-HK TRECVID 2005 26

  8. Gradual transitions (zoomed) ����� ����� � ���� ��� ����� ��� ���� ��� ���� ��������� ���� �� ������ ��� ���� ���� ����� ��� � ������ � ������� ���� ����� �� �� ��� � ���!�� �����"� ���� ��� ���#� �� ����� � � � � � � � � � � � � � � � � ��$� �� � ������ ���%�&�� TRECVID 2005 27

  9. ���/�-�&�! �/1 Mean runtime in seconds 100000 150000 200000 250000 300000 350000 50000 0 KDDI Marburg LaBRI USP Tsinghua IBM Motorola RMIT TRECVID 2005 TUDelft Imperial ���&���"�� Uiowa Fudan HKPU & IITB REAL TIME ==> UniMore FXPal NICTA CLIPS FIU URJC CItyU-HK 28

  10. Gradual transitions: Frame-P & R (zoomed) ����� ����� � ���� ��� ����� ��� ���� ��� ���� ��������� ���� �� ������ ��� ���� ���� ����� ��� � ������ � ������� ���� ����� �� �� ��� � ���!�� �����"� ���� ��� ���#� �� ����� � � � � � � � � � � � � � � � � ��$� �� � ������ ���%�&�� TRECVID 2005 29

  11. 3. Florida International University o Approach n Didn’t submit a paper so we don’t know ! TRECVID 2005 30

  12. Cuts (zoomed) � CLIPS Fudan ���� FIU FXPal ��� HKPU IBM ���� ��������� IITB Im perial ��� ���� KDDI LaBri ��� M arburg Motorola ���� NICTA RM IT ��� ���� Tsinghua TUDelft ��� Uiowa Um odena � � � � � � � � � � � � � � � � URJC USP ������ CityU-HK TRECVID 2005 31

  13. ���/�-�&�! �/1 Mean runtime in seconds 100000 150000 200000 250000 300000 350000 50000 0 KDDI Marburg LaBRI USP Tsinghua IBM Motorola RMIT TRECVID 2005 TUDelft Imperial ���&���"�� Uiowa Fudan HKPU & IITB REAL TIME ==> UniMore FXPal NICTA CLIPS FIU URJC CItyU-HK 32

  14. 4. Fudan University o Approach n Frame-frame similarities, vary thresholds, use SVM classifier; n Explore HSV vs. LAB colour spaces; o Features n Fudan definition of a short GT is a cut, differs from TRECVid evaluation, hence results depressed; o Performance n About mid-table in runtime and in accuracy; o Results n No differences between colour spaces TRECVID 2005 33

  15. Cuts (zoomed again) � CLIPS Fudan FIU FXPal ���� HKPU IBM ��������� ��� IITB Im perial KDDI LaBri ���� M arburg Motorola NICTA RM IT ��� Tsinghua TUDelft ���� Uiowa Um odena � � � � � � � � � � � � URJC USP ������ CityU-HK TRECVID 2005 34

  16. Gradual transitions (zoomed) ����� ����� � ���� ��� ����� ��� ���� ��� ���� ��������� ���� �� ������ ��� ���� ���� ����� ��� � ������ � ������� ���� ����� �� �� ��� � ���!�� �����"� ���� ��� ���#� �� ����� � � � � � � � � � � � � � � � � ��$� �� � ������ ���%�&�� TRECVID 2005 35

  17. ���/�-�&�! �/1 Mean runtime in seconds 100000 150000 200000 250000 300000 350000 50000 0 KDDI Marburg LaBRI USP Tsinghua IBM Motorola RMIT TRECVID 2005 TUDelft Imperial ���&���"�� Uiowa Fudan HKPU & IITB REAL TIME ==> UniMore FXPal NICTA CLIPS FIU URJC CItyU-HK 36

  18. Gradual transitions: Frame-P & R (zoomed) ����� ����� � ���� ��� ����� ��� ���� ��� ���� ��������� ���� �� ������ ��� ���� ���� ����� ��� � ������ � ������� ���� ����� �� �� ��� � ���!�� �����"� ���� ��� ���#� �� ����� � � � � � � � � � � � � � � � � ��$� �� � ������ ���%�&�� TRECVID 2005 37

  19. 5. FX Palo Alto Laboratory o Approach n Builds upon previous years with intermediate visual features derived from low-level image features for pairwise frame similarities over local and longer-distances; n Used as input to a kNN classifier; n Added information-theoretic secondary feature selection to select features used in classifier; o Features n Feature selection/reduction yielded improved performances; o Performance n Not as good as expected because sensitive to training data; o Results TRECVID 2005 38

  20. Cuts (zoomed again) � CLIPS Fudan FIU FXPal ���� HKPU IBM ��������� ��� IITB Im perial KDDI LaBri ���� M arburg Motorola NICTA RM IT ��� Tsinghua TUDelft ���� Uiowa Um odena � � � � � � � � � � � � URJC USP ������ CityU-HK TRECVID 2005 39

  21. Gradual transitions (zoomed) ����� ����� � ���� ��� ����� ��� ���� ��� ���� ��������� ���� �� ������ ��� ���� ���� ����� ��� � ������ � ������� ���� ����� �� �� ��� � ���!�� �����"� ���� ��� ���#� �� ����� � � � � � � � � � � � � � � � � ��$� �� � ������ ���%�&�� TRECVID 2005 40

  22. ���/�-�&�! �/1 Mean runtime in seconds 100000 150000 200000 250000 300000 350000 50000 0 KDDI Marburg LaBRI USP Tsinghua IBM Motorola RMIT TRECVID 2005 TUDelft Imperial ���&���"�� Uiowa Fudan HKPU & IITB REAL TIME ==> UniMore FXPal NICTA CLIPS FIU URJC CItyU-HK 41

  23. Gradual transitions: Frame-P & R (zoomed) ����� ����� � ���� ��� ����� ��� ���� ��� ���� ��������� ���� �� ������ ��� ���� ���� ����� ��� � ������ � ������� ���� ����� �� �� ��� � ���!�� �����"� ���� ��� ���#� �� ����� � � � � � � � � � � � � � � � � ��$� �� � ������ ���%�&�� TRECVID 2005 42

  24. 6. Hong Kong Polytechnical University o Approach n Compute frame-frame similarities over different distances and generate distance map; n Distance maps have characteristics for cuts, GTs, flashes, etc. o Performance n Computation is about real-time; o Results TRECVID 2005 43

  25. Cuts (zoomed again) � CLIPS Fudan FIU FXPal ���� HKPU IBM ��������� ��� IITB Im perial KDDI LaBri ���� M arburg Motorola NICTA RM IT ��� Tsinghua TUDelft ���� Uiowa Um odena � � � � � � � � � � � � URJC USP ������ CityU-HK TRECVID 2005 44

  26. Gradual transitions (zoomed) ����� ����� � ���� ��� ����� ��� ���� ��� ���� ��������� ���� �� ������ ��� ���� ���� ����� ��� � ������ � ������� ���� ����� �� �� ��� � ���!�� �����"� ���� ��� ���#� �� ����� � � � � � � � � � � � � � � � � ��$� �� � ������ ���%�&�� TRECVID 2005 45

  27. ���/�-�&�! �/1 Mean runtime in seconds 100000 150000 200000 250000 300000 350000 50000 0 KDDI Marburg LaBRI USP Tsinghua IBM Motorola RMIT TRECVID 2005 TUDelft Imperial ���&���"�� Uiowa Fudan HKPU & IITB REAL TIME ==> UniMore FXPal NICTA CLIPS FIU URJC CItyU-HK 46

  28. Gradual transitions: Frame-P & R (zoomed) ����� ����� � ���� ��� ����� ��� ���� ��� ���� ��������� ���� �� ������ ��� ���� ���� ����� ��� � ������ � ������� ���� ����� �� �� ��� � ���!�� �����"� ���� ��� ���#� �� ����� � � � � � � � � � � � � � � � � ��$� �� � ������ ���%�&�� TRECVID 2005 47

  29. 7. IBM Research o Approach n Builds upon previous CueVideo work at TRECVid, system is the same as 2005, except … n Noticed that GOP I/P- frame patterns (no B-frames) in TRECVid 2005 video encoding had no B-frames; n Used a different video decoder to overcome colour errors; o Performance n Switching the video decoder yielded improved performances; o Results TRECVID 2005 48

  30. Cuts (zoomed again) � CLIPS Fudan FIU FXPal ���� HKPU IBM ��������� ��� IITB Im perial KDDI LaBri ���� M arburg Motorola NICTA RM IT ��� Tsinghua TUDelft ���� Uiowa Um odena � � � � � � � � � � � � URJC USP ������ CityU-HK TRECVID 2005 49

  31. Gradual transitions (zoomed) ����� ����� � ���� ��� ����� ��� ���� ��� ���� ��������� ���� �� ������ ��� ���� ���� ����� ��� � ������ � ������� ���� ����� �� �� ��� � ���!�� �����"� ���� ��� ���#� �� ����� � � � � � � � � � � � � � � � � ��$� �� � ������ ���%�&�� TRECVID 2005 50

  32. ���/�-�&�! �/1 Mean runtime in seconds 100000 150000 200000 250000 300000 350000 50000 0 KDDI Marburg LaBRI USP Tsinghua IBM Motorola RMIT TRECVID 2005 TUDelft Imperial ���&���"�� Uiowa Fudan HKPU & IITB REAL TIME ==> UniMore FXPal NICTA CLIPS FIU URJC CItyU-HK 51

  33. Gradual transitions: Frame-P & R (zoomed) ����� ����� � ���� ��� ����� ��� ���� ��� ���� ��������� ���� �� ������ ��� ���� ���� ����� ��� � ������ � ������� ���� ����� �� �� ��� � ���!�� �����"� ���� ��� ���#� �� ����� � � � � � � � � � � � � � � � � ��$� �� � ������ ���%�&�� TRECVID 2005 52

  34. 8. Imperial College London o Approach n Same as previous TRECVid submissions; o Features n Exploits frame-frame differences based on colour histogram comparisons o Results TRECVID 2005 53

  35. Cuts (zoomed again) � CLIPS Fudan FIU FXPal ���� HKPU IBM ��������� ��� IITB Im perial KDDI LaBri ���� M arburg Motorola NICTA RM IT ��� Tsinghua TUDelft ���� Uiowa Um odena � � � � � � � � � � � � URJC USP ������ CityU-HK TRECVID 2005 54

  36. Gradual transitions (zoomed) ����� ����� � ���� ��� ����� ��� ���� ��� ���� ��������� ���� �� ������ ��� ���� ���� ����� ��� � ������ � ������� ���� ����� �� �� ��� � ���!�� �����"� ���� ��� ���#� �� ����� � � � � � � � � � � � � � � � � ��$� �� � ������ ���%�&�� TRECVID 2005 55

  37. ���/�-�&�! �/1 Mean runtime in seconds 100000 150000 200000 250000 300000 350000 50000 0 KDDI Marburg LaBRI USP Tsinghua IBM Motorola RMIT TRECVID 2005 TUDelft Imperial ���&���"�� Uiowa Fudan HKPU & IITB REAL TIME ==> UniMore FXPal NICTA CLIPS FIU URJC CItyU-HK 56

  38. Gradual transitions: Frame-P & R (zoomed) ����� ����� � ���� ��� ����� ��� ���� ��� ���� ��������� ���� �� ������ ��� ���� ���� ����� ��� � ������ � ������� ���� ����� �� �� ��� � ���!�� �����"� ���� ��� ���#� �� ����� � � � � � � � � � � � � � � � � ��$� �� � ������ ���%�&�� TRECVID 2005 57

  39. 9. Indian Institute of Technology o Approach n Addressed false positives caused by abnormal lighting (flashes, reflections, camera movements, explosions, fire, etc.) o Features n 2-pass algorithm - firstly compute similarity between adjacent frames using wavelets, then focus on candidate areas to eliminate false positives; o Performance n Computation about real-time; o Results n Submitted only 1 run, focus on hard cuts only; TRECVID 2005 58

  40. Cuts � CLIPS Fudan ��� FIU FXPal ��� HKPU IBM ��� ��������� IITB Im perial ��� ��� KDDI LaBri ��� M arburg Motorola ��� NICTA RM IT ��� ��� Tsinghua TUDelft � Uiowa Um odena � � � � � � � � � � � � � � � � � � � � � � � � � � � � � URJC USP ������ CityU-HK TRECVID 2005 59

  41. ���/�-�&�! �/1 Mean runtime in seconds 100000 150000 200000 250000 300000 350000 50000 0 KDDI Marburg LaBRI USP Tsinghua IBM Motorola RMIT TRECVID 2005 TUDelft Imperial ���&���"�� Uiowa Fudan HKPU & IITB REAL TIME ==> UniMore FXPal NICTA CLIPS FIU URJC CItyU-HK 60

  42. 10. KDDI R&D Laboratories, Inc. o Approach n Late arrival of paper - available at registration desk; n Compressed domain - hence fast; n Luminance adaptive threshold and image cropping equals goo results; n Last year worked in the compressed domain, extending an approach by adding edge features from DC image, colour layout, and SVM learning; o Results n Worth looking at … TRECVID 2005 61

  43. Cuts (zoomed again) � CLIPS Fudan FIU FXPal ���� HKPU IBM ��������� ��� IITB Im perial KDDI LaBri ���� M arburg Motorola NICTA RM IT ��� Tsinghua TUDelft ���� Uiowa Um odena � � � � � � � � � � � � URJC USP ������ CityU-HK TRECVID 2005 62

  44. Gradual transitions (zoomed) ����� ����� � ���� ��� ����� ��� ���� ��� ���� ��������� ���� �� ������ ��� ���� ���� ����� ��� � ������ � ������� ���� ����� �� �� ��� � ���!�� �����"� ���� ��� ���#� �� ����� � � � � � � � � � � � � � � � � ��$� �� � ������ ���%�&�� TRECVID 2005 63

  45. ���/�-�&�! �/1 Mean runtime in seconds 100000 150000 200000 250000 300000 350000 50000 0 KDDI Marburg LaBRI USP Tsinghua IBM Motorola RMIT TRECVID 2005 TUDelft Imperial ���&���"�� Uiowa Fudan HKPU & IITB REAL TIME ==> UniMore FXPal NICTA CLIPS FIU URJC CItyU-HK 64

  46. Gradual transitions: Frame-P & R (zoomed) ����� ����� � ���� ��� ����� ��� ���� ��� ���� ��������� ���� �� ������ ��� ���� ���� ����� ��� � ������ � ������� ���� ����� �� �� ��� � ���!�� �����"� ���� ��� ���#� �� ����� � � � � � � � � � � � � � � � � ��$� �� � ������ ���%�&�� TRECVID 2005 65

  47. 11. LaBRI o Approach n Last year worked in compressed domain, computing motion and frame statistics, then measure similarity between compensated adjacent I-frames; n This year most effort in camera motion task but submitted SBD runs based on this o Performance n Good on hard cuts, and fast, not good on GTs o Results TRECVID 2005 66

  48. Cuts (zoomed again) � CLIPS Fudan FIU FXPal ���� HKPU IBM ��������� ��� IITB Im perial KDDI LaBri ���� M arburg Motorola NICTA RM IT ��� Tsinghua TUDelft ���� Uiowa Um odena � � � � � � � � � � � � URJC USP ������ CityU-HK TRECVID 2005 67

  49. ���/�-�&�! �/1 Mean runtime in seconds 100000 150000 200000 250000 300000 350000 50000 0 KDDI Marburg LaBRI USP Tsinghua IBM Motorola RMIT TRECVID 2005 TUDelft Imperial ���&���"�� Uiowa Fudan HKPU & IITB REAL TIME ==> UniMore FXPal NICTA CLIPS FIU URJC CItyU-HK 68

  50. 12. Motorola Multimedia Research Laboratory o Approach n Didn’t submit a paper so we don’t know ! o Results n Fast execution but don’t appear in the zoomed areas of graphs except for … TRECVID 2005 69

  51. Gradual transitions: Frame-P & R (zoomed) ����� ����� � ���� ��� ����� ��� ���� ��� ���� ��������� ���� �� ������ ��� ���� ���� ����� ��� � ������ � ������� ���� ����� �� �� ��� � ���!�� �����"� ���� ��� ���#� �� ����� � � � � � � � � � � � � � � � � ��$� �� � ������ ���%�&�� TRECVID 2005 70

  52. 13. National ICT Australia o Approach n Late paper submitted and it doesn’t reveal much … “Video analysis + machine learning: - New to TRECVID - Developers- - Drs Zhenghua (Jack) Yu, SVN Vishwanathan and Alex Smola” o Results n Expensive computation but worth a peek at … TRECVID 2005 71

  53. Cuts (zoomed again) � CLIPS Fudan FIU FXPal ���� HKPU IBM ��������� ��� IITB Im perial KDDI LaBri ���� M arburg Motorola NICTA RM IT ��� Tsinghua TUDelft ���� Uiowa Um odena � � � � � � � � � � � � URJC USP ������ CityU-HK TRECVID 2005 72

  54. Gradual transitions (zoomed) ����� ����� � ���� ��� ����� ��� ���� ��� ���� ��������� ���� �� ������ ��� ���� ���� ����� ��� � ������ � ������� ���� ����� �� �� ��� � ���!�� �����"� ���� ��� ���#� �� ����� � � � � � � � � � � � � � � � � ��$� �� � ������ ���%�&�� TRECVID 2005 73

  55. ���/�-�&�! �/1 Mean runtime in seconds 100000 150000 200000 250000 300000 350000 50000 0 KDDI Marburg LaBRI USP Tsinghua IBM Motorola RMIT TRECVID 2005 TUDelft Imperial ���&���"�� Uiowa Fudan HKPU & IITB REAL TIME ==> UniMore FXPal NICTA CLIPS FIU URJC CItyU-HK 74

  56. Gradual transitions: Frame-P & R (zoomed) ����� ����� � ���� ��� ����� ��� ���� ��� ���� ��������� ���� �� ������ ��� ���� ���� ����� ��� � ������ � ������� ���� ����� �� �� ��� � ���!�� �����"� ���� ��� ���#� �� ����� � � � � � � � � � � � � � � � � ��$� �� � ������ ���%�&�� TRECVID 2005 75

  57. 14. RMIT University o Approach n New implementation of their sliding query window approach, compute frame similarities among X frames before/after; n Frame similarities based on colour histograms; n Experimented with different (HSV) colour histogram representations; o Features n Feature selection/reduction yielded improved performances; o Performance n Not as good as expected because sensitive to training data; o Results TRECVID 2005 76

  58. Cuts (zoomed again) � CLIPS Fudan FIU FXPal ���� HKPU IBM ��������� ��� IITB Im perial KDDI LaBri ���� M arburg Motorola NICTA RM IT ��� Tsinghua TUDelft ���� Uiowa Um odena � � � � � � � � � � � � URJC USP ������ CityU-HK TRECVID 2005 77

  59. Gradual transitions (zoomed) ����� ����� � ���� ��� ����� ��� ���� ��� ���� ��������� ���� �� ������ ��� ���� ���� ����� ��� � ������ � ������� ���� ����� �� �� ��� � ���!�� �����"� ���� ��� ���#� �� ����� � � � � � � � � � � � � � � � � ��$� �� � ������ ���%�&�� TRECVID 2005 78

  60. ���/�-�&�! �/1 Mean runtime in seconds 100000 150000 200000 250000 300000 350000 50000 0 KDDI Marburg LaBRI USP Tsinghua IBM Motorola RMIT TRECVID 2005 TUDelft Imperial ���&���"�� Uiowa Fudan HKPU & IITB REAL TIME ==> UniMore FXPal NICTA CLIPS FIU URJC CItyU-HK 79

  61. Gradual transitions: Frame-P & R (zoomed) ����� ����� � ���� ��� ����� ��� ���� ��� ���� ��������� ���� �� ������ ��� ���� ���� ����� ��� � ������ � ������� ���� ����� �� �� ��� � ���!�� �����"� ���� ��� ���#� �� ����� � � � � � � � � � � � � � � � � ��$� �� � ������ ���%�&�� TRECVID 2005 80

  62. 15. Technical University of Delft o Approach n Represents video as spatio-temporal video data blocks and extracts patterns from these to indicate cuts and GTs; o Performance n Efficient, expect to include camera motion information in future development; o Results TRECVID 2005 81

  63. Cuts (zoomed again) � CLIPS Fudan FIU FXPal ���� HKPU IBM ��������� ��� IITB Im perial KDDI LaBri ���� M arburg Motorola NICTA RM IT ��� Tsinghua TUDelft ���� Uiowa Um odena � � � � � � � � � � � � URJC USP ������ CityU-HK TRECVID 2005 82

  64. Gradual transitions (zoomed) ����� ����� � ���� ��� ����� ��� ���� ��� ���� ��������� ���� �� ������ ��� ���� ���� ����� ��� � ������ � ������� ���� ����� �� �� ��� � ���!�� �����"� ���� ��� ���#� �� ����� � � � � � � � � � � � � � � � � ��$� �� � ������ ���%�&�� TRECVID 2005 83

  65. ���/�-�&�! �/1 Mean runtime in seconds 100000 150000 200000 250000 300000 350000 50000 0 KDDI Marburg LaBRI USP Tsinghua IBM Motorola RMIT TRECVID 2005 TUDelft Imperial ���&���"�� Uiowa Fudan HKPU & IITB REAL TIME ==> UniMore FXPal NICTA CLIPS FIU URJC CItyU-HK 84

  66. Gradual transitions: Frame-P & R (zoomed) ����� ����� � ���� ��� ����� ��� ���� ��� ���� ��������� ���� �� ������ ��� ���� ���� ����� ��� � ������ � ������� ���� ����� �� �� ��� � ���!�� �����"� ���� ��� ���#� �� ����� � � � � � � � � � � � � � � � � ��$� �� � ������ ���%�&�� TRECVID 2005 85

  67. 16. Tsinghua University o Approach n Re-implement previous years very successful approaches which had evolved to a set of collaboration rules for various detectors; n Now a unified framework with SVMs combining fade-in/out detectors, GT detector and cut detectors, each developed in previous years; o Features n Appears to be a mixture of different detectors; o Performance n Despite individual detectors performing separately, very fast; o Results TRECVID 2005 86

  68. Cuts (zoomed again) � CLIPS Fudan FIU FXPal ���� HKPU IBM ��������� ��� IITB Im perial KDDI LaBri ���� M arburg Motorola NICTA RM IT ��� Tsinghua TUDelft ���� Uiowa Um odena � � � � � � � � � � � � URJC USP ������ CityU-HK TRECVID 2005 87

  69. Gradual transitions (zoomed) ����� ����� � ���� ��� ����� ��� ���� ��� ���� ��������� ���� �� ������ ��� ���� ���� ����� ��� � ������ � ������� ���� ����� �� �� ��� � ���!�� �����"� ���� ��� ���#� �� ����� � � � � � � � � � � � � � � � � ��$� �� � ������ ���%�&�� TRECVID 2005 88

  70. ���/�-�&�! �/1 Mean runtime in seconds 100000 150000 200000 250000 300000 350000 50000 0 KDDI Marburg LaBRI USP Tsinghua IBM Motorola RMIT TRECVID 2005 TUDelft Imperial ���&���"�� Uiowa Fudan HKPU & IITB REAL TIME ==> UniMore FXPal NICTA CLIPS FIU URJC CItyU-HK 89

  71. Gradual transitions: Frame-P & R (zoomed) ����� ����� � ���� ��� ����� ��� ���� ��� ���� ��������� ���� �� ������ ��� ���� ���� ����� ��� � ������ � ������� ���� ����� �� �� ��� � ���!�� �����"� ���� ��� ���#� �� ����� � � � � � � � � � � � � � � � � ��$� �� � ������ ���%�&�� TRECVID 2005 90

  72. 17. University of Central Florida/U. Modena o Approach n Frame-frame distances computed based on pixels, and based on histograms; n Examined frame difference behaviours over time to see if it corresponds to a linear transformation; o Features n Work carried out by U Modena; o Performance n Could be speeded up but no optimisation; o Results TRECVID 2005 91

  73. Cuts (zoomed again) � CLIPS Fudan FIU FXPal ���� HKPU IBM ��������� ��� IITB Im perial KDDI LaBri ���� M arburg Motorola NICTA RM IT ��� Tsinghua TUDelft ���� Uiowa Um odena � � � � � � � � � � � � URJC USP ������ CityU-HK TRECVID 2005 92

  74. Gradual transitions (zoomed) ����� ����� � ���� ��� ����� ��� ���� ��� ���� ��������� ���� �� ������ ��� ���� ���� ����� ��� � ������ � ������� ���� ����� �� �� ��� � ���!�� �����"� ���� ��� ���#� �� ����� � � � � � � � � � � � � � � � � ��$� �� � ������ ���%�&�� TRECVID 2005 93

  75. ���/�-�&�! �/1 Mean runtime in seconds 100000 150000 200000 250000 300000 350000 50000 0 KDDI Marburg LaBRI USP Tsinghua IBM Motorola RMIT TRECVID 2005 TUDelft Imperial ���&���"�� Uiowa Fudan HKPU & IITB REAL TIME ==> UniMore FXPal NICTA CLIPS FIU URJC CItyU-HK 94

  76. Gradual transitions: Frame-P & R (zoomed) ����� ����� � ���� ��� ����� ��� ���� ��� ���� ��������� ���� �� ������ ��� ���� ���� ����� ��� � ������ � ������� ���� ����� �� �� ��� � ���!�� �����"� ���� ��� ���#� �� ����� � � � � � � � � � � � � � � � � ��$� �� � ������ ���%�&�� TRECVID 2005 95

  77. 18. University of Iowa o Approach n Builds upon previous years with a cut detection followed by GT detection; n Frame similarities based on colour histograms, on aggregated pixel distances and on edges; o Performance n Still some issues of combining GT and cut logic detection, not appearing in zoomed areas of graphs; o Results TRECVID 2005 96

  78. ���/�-�&�! �/1 Mean runtime in seconds 100000 150000 200000 250000 300000 350000 50000 0 KDDI Marburg LaBRI USP Tsinghua IBM Motorola RMIT TRECVID 2005 TUDelft Imperial ���&���"�� Uiowa Fudan HKPU & IITB REAL TIME ==> UniMore FXPal NICTA CLIPS FIU URJC CItyU-HK 97

  79. Gradual transitions: Frame-P & R (zoomed) ����� ����� � ���� ��� ����� ��� ���� ��� ���� ��������� ���� �� ������ ��� ���� ���� ����� ��� � ������ � ������� ���� ����� �� �� ��� � ���!�� �����"� ���� ��� ���#� �� ����� � � � � � � � � � � � � � � � � ��$� �� � ������ ���%�&�� TRECVID 2005 98

  80. 19. University of Marburg o Approach n Frame similarities measured by motion-compensated pixel differences and histogram differences for several frame distances; n An unsupervised ensemble of classifiers is then used. o Features n SVM classifiers trained on 2004 data; o Performance n Surprisingly efficient and good performance; o Results TRECVID 2005 99

  81. Cuts (zoomed again) � CLIPS Fudan FIU FXPal ���� HKPU IBM ��������� ��� IITB Im perial KDDI LaBri ���� M arburg Motorola NICTA RM IT ��� Tsinghua TUDelft ���� Uiowa Um odena � � � � � � � � � � � � URJC USP ������ CityU-HK TRECVID 2005 100

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend