Simple vs complex temporal recurrences for video saliency prediction
About
This paper investigates modifying an existing neural network architecture for static saliency prediction using two types of recurrences that integrate information from the temporal domain. The first modification is the addition of a ConvLSTM within the architecture, while the second is a conceptually simple exponential moving average of an internal convolutional state. We use weights pre-trained on the SALICON dataset and fine-tune our model on DHF1K. Our results show that both modifications achieve state-of-the-art results and produce similar saliency maps. Source code is available at https://git.io/fjPiB.
Panagiotis Linardos, Eva Mohedano, Juan Jose Nieto, Noel E. O'Connor, Xavier Giro-i-Nieto, Kevin McGuinness• 2019
Related benchmarks
| Task | Dataset | Result | Rank | |
|---|---|---|---|---|
| Video saliency prediction | DHF1K (test) | AUC-J0.895 | 89 | |
| Video saliency prediction | Hollywood-2 (test) | SIM0.53 | 83 | |
| Video saliency prediction | UCF Sports (test) | SIM0.477 | 71 | |
| Saliency Prediction | DHF1K | Model Size (MB)364 | 12 | |
| Video saliency prediction | UCF Sports | NSS2.638 | 11 |
Showing 5 of 5 rows