scispace - formally typeset
T

Tianwei Lin

Researcher at Shanghai Jiao Tong University

Publications -  48
Citations -  2410

Tianwei Lin is an academic researcher from Shanghai Jiao Tong University. The author has contributed to research in topics: Computer science & Feature (computer vision). The author has an hindex of 13, co-authored 36 publications receiving 1278 citations. Previous affiliations of Tianwei Lin include Baidu.

Papers
More filters
Book ChapterDOI

BSN: Boundary Sensitive Network for Temporal Action Proposal Generation

TL;DR: An effective proposal generation method, named Boundary-Sensitive Network (BSN), which adopts "local to global" fashion and significantly improves the state-of-the-art temporal action detection performance.
Proceedings ArticleDOI

BMN: Boundary-Matching Network for Temporal Action Proposal Generation

TL;DR: This work proposes an effective, efficient and end-to-end proposal generation method, named Boundary-Matching Network (BMN), which generates proposals with precise temporal boundaries as well as reliable confidence scores simultaneously, and can achieve state-of-the-art temporal action detection performance.
Proceedings ArticleDOI

Single Shot Temporal Action Detection

TL;DR: Wang et al. as discussed by the authors proposed a Single Shot Action Detector (SSAD) network based on 1D temporal convolutional layers to skip the proposal generation step via directly detecting action instances in untrimmed video.
Proceedings ArticleDOI

Single Shot Temporal Action Detection

TL;DR: This work proposes a novel Single Shot Action Detector (SSAD) network based on 1D temporal convolutional layers to skip the proposal generation step via directly detecting action instances in untrimmed video and empirically investigates into input feature types and fusion strategies to further improve detection accuracy.
Posted Content

BMN: Boundary-Matching Network for Temporal Action Proposal Generation

TL;DR: Zhang et al. as discussed by the authors proposed a boundary-matching network (BMN) to evaluate confidence scores of densely distributed proposals, which denote a proposal as a matching pair of starting and ending boundaries and combine all densely distributed BM pairs into the BM confidence map.