Yuquan Zhu

Yuquan Zhu

Auto-generated profile, based on publicly available information

Yuquan Zhu

Jiangsu University

Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

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

Representative Publications

View All Publications
1 June 2019 in Ocean Engineering
Verified
Journal Article
Closed access
HWHuawei Wang
Huawei Wang
SCShuping Cao
Shuping Cao
XLXiaohui Luo
Xiaohui Luo
XHXiaofeng He
Xiaofeng He
ZZZuti Zhang
Zuti Zhang
YZYuquan Zhu
Yuquan Zhu

4 May 2010 in Neural Computing and Applications
Verified
Journal Article
Closed access
PDF file
ZYZhu Yu-Quan
Zhu Yu-Quan
JOJishun Ou
Jishun Ou
CGChen Geng
Chen Geng
YHYu Hai-Ping
Yu Hai-Ping

13 February 2019 in Sensors
Verified
Journal Article
Open access
PDF file
LSLiang Shi
Liang Shi
XSXiaoning Song
Xiaoning Song
TZTao Zhang
Tao Zhang
YZYuquan Zhu
Yuquan Zhu
Traditional Collaborative Representation-based Classification algorithms for face recognition (CRC) usually suffer from data uncertainty, especially if it includes various poses and illuminations. To address this issue, in this paper, we design a new CRC method using histogram statistical measurement (H-CRC) combined with a 3D morphable model (3DMM) for pose-invariant face classification. First, we fit a 3DMM to raw images in the dictionary to reconstruct the 3D shapes and textures. The fitting results are used to render numerous virtual samples of 2D images that are frontalized from arbitrary poses. In contrast to other distance-based evaluation algorithms for collaborative (or sparse) representation-based methods, the histogram information of all the generated 2D face images is subsequently exploited. Second, we use a histogram-based metric learning to evaluate the most similar neighbours of the test sample, which aims to obtain ideal result for pose-invariant face recognition using the designed histogram-based 3DMM model and online pruning strategy, forming a unified 3D-aided CRC framework. The proposed method achieves desirable classification results that are conducted on a set of well-known face databases, including ORL, Georgia Tech, FERET, FRGC, PIE and LFW.

1 December 2006 in Proceedings of the Institution of Mechanical Engineers, Part A: Journal of Power and Energy
Verified
Journal Article
Closed access
SZshendan zhao
shendan zhao
ZBZhu Bihai
Zhu Bihai
ZYZhu Yuquan
Zhu Yuquan
LZLi Zhuangyun
Li Zhuangyun
The flow in damping orifices when using water as the working media is of high Reynolds number and cavitation is inevitable. In this article, experimental studies are made on the flow and cavitation characteristics of water hydraulic orifices and the coefficient formulae in previous documents are testified with the Reynolds number ranging from 104 to 105. All the orifices are made of transparent materials, so the flow and the occurrence process of the cavitation can be observed with the naked eye. The experiments for each orifice are carried out under the two cases with and without backpressure, respectively. Experimental results show that the flow coefficient with backpressure is larger than the case without it. The larger the aspect ratio, the less the flow characteristics are influenced by backpressure. The cavitation first occurs at the inlet of orifices and then shifts to the outlet gradually. When there is cavitation happening at the outlet, flow saturation emerges simultaneously.

25 February 2022 in Symmetry
Verified
Journal Article
Open access
PDF file
LXLiu Xiangwen
Liu Xiangwen
XFXia Feng
Xia Feng
YZYuquan Zhu
Yuquan Zhu
Ubiquitous devices in IoT-based environments create a large amount of transactional data on daily personal behaviors. Releasing these data across various platforms and applications for data mining can create tremendous opportunities for knowledge-based decision making. However, solid guarantees on the risk of re-identification are required to make these data broadly available. Disassociation is a popular method for transactional data anonymization against re-identification attacks in privacy-preserving data publishing. The anonymization algorithm of disassociation is performed in parallel, suitable for the asymmetric paralleled data process in IoT where the nodes have limited computation power and storage space. However, the anonymization algorithm of disassociation is based on the global recoding mode to achieve transactional data km -anonymization, which leads to a loss of combinations of items in transactional datasets, thus decreasing the data quality of the published transactions. To address the issue, we propose a novel vertical partition strategy in this paper. By employing local suppression and global partition, we first eliminate the itemsets which violate km-anonymity to construct the first km-anonymous record chunk. Then, by the processes of itemset creating and reducing, we recombine the globally partitioned items from the first record chunk to construct remaining km-anonymous record chunks. The experiments illustrate that our scheme can retain more association between items in the dataset, which improves the utility of published data.

1 January 2021 in Computational Intelligence and Neuroscience
Verified
Journal Article
Open access
PDF file
LLLei Li
Lei Li
TZTingting Zou
Tingting Zou
TCTao Cai
Tao Cai
DNDejiao Niu
Dejiao Niu
YZYuquan Zhu
Yuquan Zhu
As a new type of artificial neural network model, HTM has become the focus of current research and application. The sparse distributed representation is the basis of the HTM model, but the existing spatial pool learning algorithms have high training time overhead and may cause the spatial pool to become unstable. To overcome these disadvantages, we propose a fast spatial pool learning algorithm of HTM based on minicolumn’s nomination, where the minicolumns are selected according to the load‐carrying capacity and the synapses are adjusted using compressed encoding. We have implemented the prototype of the algorithm and carried out experiments on three datasets. It is verified that the training time overhead of the proposed algorithm is almost unaffected by the encoding length, and the spatial pool becomes stable after fewer iterations of training. Moreover, the training of the new input does not affect the already trained results.