Peiyin Xing

Dr. Peiyin Xing

Peking University
orcid

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
16 August 2021 in IEEE Transactions on Circuits and Systems for Video Technology
Verified
Journal Article
Closed access
WGWen Gao
Wen Gao
SMSiwei Ma
Siwei Ma
LDLingyu Duan
Lingyu Duan
YTYonghong Tian
Yonghong Tian
Peiyin XingPeiyin Xing
Peiyin Xing
THTiejun Huang
Tiejun Huang
The ubiquitous camera networks in the city brain system grow at a rapid pace, creating massive amounts of images and videos at a range of spatial-temporal scales and thereby forming the “biggest” big data. However, the sensing system often lags behind the construction of the fast-growing city brain system, in the sense that such exponentially growing data far exceed today’s sensing capabilities. Therefore, critical issues arise regarding how to better leverage the existing city brain system and significantly improve the city-scale performance in intelligent applications. To tackle the unprecedented challenges, we articulate a vision towards a novel visual computing framework, termed as digital retina , which aligns high-efficiency sensing models with the emerging Visual Coding for Machine (VCM) paradigm. In particular, digital retina may consist of video coding, feature coding, model coding, as well as their joint optimization. The digital retina is biologically-inspired, rooted on the widely accepted view that the retina encodes the visual information for human perception, and extracts features by the brain downstream areas to disentangle the visual objects. Within the digital retina framework, three streams, i.e., video stream, feature stream, and model stream, work collaboratively over the end-edge-cloud platform. In particular, the compressed video stream serves for human vision, the compact feature stream targets for machine vision, and the model stream incrementally updates deep learning models to improve the performance of human/machine vision tasks. We have developed a prototype to demonstrate the technical advantages of digital retina, and extensive experiments have been conducted to validate that it is able to effectively support the video big data analysis and retrieval in the intelligent city system. In particular, up to $7000\times $ compression ratio could be realized for visual data compression while maintaining competitive performance with pristine signal in a series of visual analysis tasks.

1 December 2013
Verified
Conference Paper
Closed access
Peiyin XingPeiyin Xing
Peiyin Xing
YTYonghong Tian
Yonghong Tian
THTiejun Huang
Tiejun Huang
WGWen Gao
Wen Gao
To reduce the surveillance video coding cost, it is intuitive to encode surveillance videos by dealing with the foreground objects and the background separately. One widely used method following this strategy is Region-of-Interest (ROI) based coding. To achieve significant improvement for the coding efficiency of ROI based methods, this paper presents a surveillance video coding method with High Efficiency Video Coding (HEVC) quadtree partition based ROI extraction. With automatically generated foreground mask and modeled background frame, a ROI extraction following the block partition in HEVC's quadtree structure is firstly performed. Afterwards, surveillance videos can be compressed by coding two-layer videos. One is the ROI-layer video generated by merging ROIs and background data in each frame together. The other is the background-layer video produced by subtracting the ROIs from the original input video. Results show our method can achieve remarkable total bit-rate saving and significant bit-rate cost reduction on ROIs.

1 November 2013
Verified
Conference Paper
Closed access
Peiyin XingPeiyin Xing
Peiyin Xing
YTYonghong Tian
Yonghong Tian
XZXianguo Zhang
Xianguo Zhang
YWYaowei Wang
Yaowei Wang
THTiejun Huang
Tiejun Huang
To save the storage and transmission cost, it is applicable now to develop fast and efficient methods to transcode the perennial surveillance videos to HEVC ones, since HEVC has doubled the compression ratio. Considering the long-time static background characteristic of surveillance videos, this paper presents a coding unit (CU) classification based AVC-to-HEVC transcoding method with background modeling. In our method, the background frame modeled from originally decoded frames is firstly transcoded into HEVC stream as long-term reference to enhance the prediction efficiency. Afterwards, a CU classification algorithm which employs decoded motion vectors and the modeled background frame as input is proposed to divide the decoded data into background, foreground and hybrid CUs. Following this, different transcoding strategies of CU partition termination, prediction unit candidate selection and motion estimation simplification are adopted for different CU categories to reduce the complexity. Experimental results show our method can achieve 45% bit saving and 50% complexity reduction against traditional AVC-to-HEVC transcoding.

12 June 2019 in IEEE MultiMedia
Verified
Journal Article
Closed access
LMLi Ma
Li Ma
YTYonghong Tian
Yonghong Tian
Peiyin XingPeiyin Xing
Peiyin Xing
THTiejun Huang
Tiejun Huang
We proposed a residual-based post-processing for High Efficiency Video Coding (HEVC). Based on the proposed network, Residual-based Video Restoration Network (Residual-VRN), the decoded image quality has been improved significantly. We experimentally verified the superiority of the method.

1 August 2020
Verified
Conference Paper
Closed access
ZYZhaoyi Yan
Zhaoyi Yan
Peiyin XingPeiyin Xing
Peiyin Xing
YWYaowei Wang
Yaowei Wang
YTYonghong Tian
Yonghong Tian
Deep neural network pruning is to reduce the model size by removing redundant structures and weights. Existing methods focus on single layer information which ignore other layers. And pruning progress is simply removing all weights at the same time. To address these limitations, we propose Prune it Yourself (PIY) framework. First, we collect both filter and channel sensitivity information. Then combine them to decide the structure to be pruned. At last we use the gradual pruning algorithm to reduce the accuracy loss without extra hyper-parameters. We use VGG-16 and ResNet to perform experiments on CIFAR-10 and ImageNet. The experimental results prove the effectiveness of our method.

22 August 2022 in IEEE Transactions on Circuits and Systems for Video Technology
Verified
Journal Article
Closed access
YCYangang Cai
Yangang Cai
Peiyin XingPeiyin Xing
Peiyin Xing
XGXuesong Gao
Xuesong Gao
In this paper, a high efficient 3D convolution feature compression method is proposed. This method is mainly used to compress the three-dimensional convolution deep features extracted by video analysis. Gather the compressed features to the cloud server instead of all video features. This method can solve the problem that the data aggregation of video big data analysis requires a large amount of network bandwidth. Quantization is a common method for feature compression, but the existing quantization-based methods often carry out model training and quantization in stages, which makes the robustness of quantization results poor. To solve this problem, the method proposed in this paper is to apply the feature quantization operation directly to the network and train it with the analysis task, and use the parameter iterative optimization method to solve the non-differentiable problem of quantization operation. Different from the deep features extracted from images or single objects, the 3D convolution features extracted from video clips have high time-domain redundancy. In this paper, by serializing the three-dimensional convolution features, the time-domain prediction coding method is used to remove the time-domain redundancy of the three-dimensional convolution features, to improve the feature compression ratio. The experimental results show that this method can only use 1 bit to represent the elements in the three-dimensional convolution deep feature. When the analysis accuracy loss is no more than 1%, the feature compression ratio can reach 4500 times compared with the original feature data, and the data transmission can be reduced by 96%.