Long-term leap attention, short-term periodic shift for video classification

Video transformer naturally incurs a heavier computation burden than a static vision transformer, as the former processes �� times longer sequence than the latter under the current attention of quadratic complexity (�� 2�� 2 ). The existing works treat the temporal axis as a simple extension of spat...

Full description

Saved in:
Bibliographic Details
Main Authors: ZHANG, Hao, CHENG, Lechao, HAO, Yanbin, NGO, Chong-wah
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2022
Subjects:
Online Access:https://ink.library.smu.edu.sg/sis_research/7507
https://ink.library.smu.edu.sg/context/sis_research/article/8510/viewcontent/3503161.3547908.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Singapore Management University
Language: English
id sg-smu-ink.sis_research-8510
record_format dspace
spelling sg-smu-ink.sis_research-85102022-11-18T08:04:28Z Long-term leap attention, short-term periodic shift for video classification ZHANG, Hao CHENG, Lechao HAO, Yanbin NGO, Chong-wah Video transformer naturally incurs a heavier computation burden than a static vision transformer, as the former processes �� times longer sequence than the latter under the current attention of quadratic complexity (�� 2�� 2 ). The existing works treat the temporal axis as a simple extension of spatial axes, focusing on shortening the spatio-temporal sequence by either generic pooling or local windowing without utilizing temporal redundancy. However, videos naturally contain redundant information between neighboring frames; thereby, we could potentially suppress attention on visually similar frames in a dilated manner. Based on this hypothesis, we propose the LAPS, a long-term “Leap Attention” (LA), short-term “Periodic Shift” (P-Shift) module for video transformers, with (2�� ��2 ) complexity. Specifically, the “LA” groups longterm frames into pairs, then refactors each discrete pair via attention. The “P-Shift” exchanges features between temporal neighbors to confront the loss of short-term dynamics. By replacing a vanilla 2D attention with the LAPS, we could adapt a static transformer into a video one, with zero extra parameters and neglectable computation overhead (∼2.6%). Experiments on the standard Kinetics-400 benchmark demonstrate that our LAPS transformer could achieve competitive performances in terms of accuracy, FLOPs, and Params among CNN and transformer SOTAs. We open-source our project in https://github.com/VideoNetworks/ LAPS-transformer. 2022-10-01T07:00:00Z text application/pdf https://ink.library.smu.edu.sg/sis_research/7507 info:doi/10.1145/3503161.3547908 https://ink.library.smu.edu.sg/context/sis_research/article/8510/viewcontent/3503161.3547908.pdf http://creativecommons.org/licenses/by-nc-nd/4.0/ Research Collection School Of Computing and Information Systems eng Institutional Knowledge at Singapore Management University Video classification Transformer Shift Leap attention Artificial Intelligence and Robotics Graphics and Human Computer Interfaces
institution Singapore Management University
building SMU Libraries
continent Asia
country Singapore
Singapore
content_provider SMU Libraries
collection InK@SMU
language English
topic Video classification
Transformer
Shift
Leap attention
Artificial Intelligence and Robotics
Graphics and Human Computer Interfaces
spellingShingle Video classification
Transformer
Shift
Leap attention
Artificial Intelligence and Robotics
Graphics and Human Computer Interfaces
ZHANG, Hao
CHENG, Lechao
HAO, Yanbin
NGO, Chong-wah
Long-term leap attention, short-term periodic shift for video classification
description Video transformer naturally incurs a heavier computation burden than a static vision transformer, as the former processes �� times longer sequence than the latter under the current attention of quadratic complexity (�� 2�� 2 ). The existing works treat the temporal axis as a simple extension of spatial axes, focusing on shortening the spatio-temporal sequence by either generic pooling or local windowing without utilizing temporal redundancy. However, videos naturally contain redundant information between neighboring frames; thereby, we could potentially suppress attention on visually similar frames in a dilated manner. Based on this hypothesis, we propose the LAPS, a long-term “Leap Attention” (LA), short-term “Periodic Shift” (P-Shift) module for video transformers, with (2�� ��2 ) complexity. Specifically, the “LA” groups longterm frames into pairs, then refactors each discrete pair via attention. The “P-Shift” exchanges features between temporal neighbors to confront the loss of short-term dynamics. By replacing a vanilla 2D attention with the LAPS, we could adapt a static transformer into a video one, with zero extra parameters and neglectable computation overhead (∼2.6%). Experiments on the standard Kinetics-400 benchmark demonstrate that our LAPS transformer could achieve competitive performances in terms of accuracy, FLOPs, and Params among CNN and transformer SOTAs. We open-source our project in https://github.com/VideoNetworks/ LAPS-transformer.
format text
author ZHANG, Hao
CHENG, Lechao
HAO, Yanbin
NGO, Chong-wah
author_facet ZHANG, Hao
CHENG, Lechao
HAO, Yanbin
NGO, Chong-wah
author_sort ZHANG, Hao
title Long-term leap attention, short-term periodic shift for video classification
title_short Long-term leap attention, short-term periodic shift for video classification
title_full Long-term leap attention, short-term periodic shift for video classification
title_fullStr Long-term leap attention, short-term periodic shift for video classification
title_full_unstemmed Long-term leap attention, short-term periodic shift for video classification
title_sort long-term leap attention, short-term periodic shift for video classification
publisher Institutional Knowledge at Singapore Management University
publishDate 2022
url https://ink.library.smu.edu.sg/sis_research/7507
https://ink.library.smu.edu.sg/context/sis_research/article/8510/viewcontent/3503161.3547908.pdf
_version_ 1770576360273608704