Mengzhe Ruan

Mengzhe Ruan

Auto-generated profile, based on publicly available information

Mengzhe Ruan

City University of Hong Kong, Kowloon, China and City University of Hong Kong Shenzhen Research Institute, Shenzhen, China

Research Focus & Metrics

Academic Career Length

26Years (2001-Present)

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

Representative Publications

View All Publications
11 May 2024 in ACM Transactions on Sensor Networks
Verified
Journal Article
Open access
MHMingda Han
Mingda Han
HYHuanqi Yang
Huanqi Yang
TNTao Ni
Tao Ni
DDDi Duan
Di Duan
MRMengzhe Ruan
Mengzhe Ruan
WXWeitao Xu
Weitao Xu
Handwritten signature verification has become one of the most important document authentication methods that are widely used in the financial, legal, and administrative sectors. Compared with offline methods based on static signature images, online handwritten signature verification methods are more reliable because of the temporary dynamic information (e.g., signing velocity, writing force, stroke order) that alleviates the risk of being forged. However, most existing online handwritten signature verification solutions are reliant on specific signing devices (e.g., customized pens or writing pads) and require extensive data collection during the registration phase, resulting in poor adaptability and applicability for new users. In this article, we propose mmSign, a millimeter wave (mmWave)–based online handwritten signature verification system, which enables accurate sensing of the user’s hand movements when signing through the superior sensing capability of mmWave. mmSign extracts the time-velocity feature maps from the captured mmWave signals by the carefully designed signal processing algorithms and then exploits a transformer-based verification model for signature verification. In addition, a novel meta-learning strategy with proposed task generation and data augmentation methods is introduced in mmSign to teach the verification model to learn effectively with limited samples, allowing our model to quickly adapt to new users. Extensive experiments show that mmSign is a robust, efficient, and secure handwritten signature verification system, achieving 84.07%, 87.31%, 91.12%, and 96.54% verification accuracy when 1, 3, 5, and 10 labeled signatures are available, respectively, while being resistant to common forgery attacks.

18 December 2001 in Nuclear Physics A
Verified
Journal Article
Closed access
CSC. Signorini
C. Signorini
AAA. Andrighetto
A. Andrighetto
JGJianzhong Guo
Jianzhong Guo
MRM. Ruan
M. Ruan
LSL. Stroe
L. Stroe
AVAndrea Vitturi
Andrea Vitturi

5 April 2024 in IEEE Journal of Selected Topics in Signal Processing
Verified
Journal Article
Closed access
MRMengzhe Ruan
Mengzhe Ruan
GYGuangfeng Yan
Guangfeng Yan
YXYuanzhang Xiao
Yuanzhang Xiao
LSLinqi Song
Linqi Song
WXWeitao Xu
Weitao Xu
Distributed stochastic gradient descent (D-SGD) with gradient compression has become a popular communication-efficient solution for accelerating optimization procedures in distributed learning systems like multi-robot systems. One commonly used method for gradient compression is Top-K sparsification, which sparsifies the gradients by a fixed degree during model training. However, there has been a lack of an adaptive approach with a systematic treatment and analysis to adjust the sparsification degree to maximize the potential of the model's performance or training speed. This paper proposes a novel adaptive Top-K in Stochastic Gradient Descent framework that enables an adaptive degree of sparsification for each gradient descent step to optimize the convergence performance by balancing the trade-off between communication cost and convergence error with respect to the norm of gradients and the communication budget. Firstly, an upper bound of convergence error is derived for the adaptive sparsification scheme and the loss function. Secondly, we consider communication budget constraints and propose an optimization formulation for minimizing the deep model's convergence error under such constraints. We obtain an enhanced compression algorithm that significantly improves model accuracy under given communication budget constraints. Finally, we conduct numerical experiments on general image classification tasks using the MNIST, CIFAR-10 datasets. For the multi-robot collaboration tasks, we choose the object detection task on the PASCAL VOC dataset. The results demonstrate that the proposed adaptive Top-K algorithm in SGD achieves a significantly better convergence rate compared to state-of-the-art methods, even after considering error compensation.