Z
Zhijiang Zhang
Researcher at Shanghai University
Publications - 40
Citations - 672
Zhijiang Zhang is an academic researcher from Shanghai University. The author has contributed to research in topics: Feature (computer vision) & Convolutional neural network. The author has an hindex of 10, co-authored 32 publications receiving 515 citations.
Papers
More filters
Journal ArticleDOI
Spatial-temporal convolutional neural networks for anomaly detection and localization in crowded scenes
TL;DR: The proposed method for detecting and locating anomalous activities in video sequences of crowded scenes is a coupling of anomaly detection with a spatial-temporal Convolutional Neural Networks (CNN), which to the best of the knowledge has not been previously done.
Proceedings ArticleDOI
Object Skeleton Extraction in Natural Images by Fusing Scale-Associated Deep Side Outputs
TL;DR: A fully convolutional network with multiple scale-associated side outputs is presented to address object skeleton extraction in natural images, and achieves promising results on two skeleton extraction datasets, and significantly outperforms other competitors.
Journal ArticleDOI
Multiple instance subspace learning via partial random projection tree for local reflection symmetry in natural images
TL;DR: A novel multiple instance learning framework for local reflection symmetry detection, named multiple instance subspace learning (MISL), which instead learns a group of models respectively on well partitioned subspaces, and an efficient dividing strategy under MIL setting, named partial random projection tree (PRPT).
Proceedings ArticleDOI
Unusual event detection in crowded scenes by trajectory analysis
TL;DR: Experimental results show that the proposed method can capture abnormal crowd behaviors successfully and achieves state-of-the-art performances.
Journal ArticleDOI
Text detection in scene images based on exhaustive segmentation
TL;DR: This paper proposes a novel method, which is based on exhaustive segmentation, to detect text in scene images, and argues that the text line grouping problem can be posed as the edge cut of the fully connected graph.