Jihua  Zhu

Dr. Jihua Zhu


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
1 October 2014 in IET Image Processing
Verified
Journal Article
Open access
PDF file
JZJihua Zhu
Jihua Zhu
DMDeyu Meng
Deyu Meng
ZLZhongyu Li
Zhongyu Li
SDShaoyi Du
Shaoyi Du
ZYZejian Yuan
Zejian Yuan
Recently, genetic algorithm (GA) has been introduced as an effective method to solve the registration problem. It maintains a population of candidate solutions for the problem and evolves by iteratively applying a set of stochastic operators. Accordingly, a key question is how to reduce the population size. In this study, the authors present two techniques for reducing the population size in the GA for registration of partially overlapping point sets. Based on the trimmed iterative closest point algorithm, they introduce a growth operator into the GA. The growth operator, which is also inspired by the biological evolution, can improve the GA efficiency for registration. Furthermore, they present a technique called centre alignment to confirm the value range of all the registration parameters, which can reduce the search space and allow the well‐designed GA to directly solve the registration problem. Experimental results carried out with the m ‐dimensional point sets illustrate its advantages over previous approaches.

20 March 2015 in Robotica
Verified
Journal Article
Closed access
PDF file
LMLiang Ma
Liang Ma
JZJihua Zhu
Jihua Zhu
LZLi Zhu
Li Zhu
SDShaoyi Du
Shaoyi Du
JCJingru Cui
Jingru Cui
SUMMARY: This paper considers the problem of merging grid maps that have different resolutions. Because the goal of map merging is to find the optimal transformation between two partially overlapping grid maps, it can be viewed as a special image registration issue. To address this special issue, the solution considers the non-common areas and designs an objective function based on the trimmed mean-square error (MSE). The trimmed and scaling iterative closest point (TsICP) algorithm is then proposed to solve this well-designed objective function. As the TsICP algorithm can be proven to be locally convergent in theory, a good initial transformation should be provided. Accordingly, scale-invariant feature transform (SIFT) features are extracted for the maps to be potentially merged, and the random sample consensus (RANSAC) algorithm is employed to find the geometrically consistent feature matches that are used to estimate the initial transformation for the TsICP algorithm. In addition, this paper presents the rules for the fusion of the grid maps based on the estimated transformation. Experimental results carried out with publicly available datasets illustrate the superior performance of this approach at merging grid maps with respect to robustness and accuracy.

27 January 2022 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
JZJihua Zhu
Jihua Zhu
YHYujiao He
Yujiao He
GZGuoshuai Zhao
Guoshuai Zhao
XBXuxiao Bo
Xuxiao Bo
XQXueming Qian
Xueming Qian
Most recommendation systems focus on predicting rating or finding aspect information in reviews to understand user preferences and item properties. However, these methods ignore the effectiveness and persuasiveness of recommendation results. Consequently, explainable recommendation, namely providing recommendation results with recommendation reasons at the same time, has attracted increasing attention of researchers due to its ability in fostering transparency and trust. It is lucky that some E-commerce websites provide a kind of new interaction box called Tips and users can express their comments on items with a simple sentence. This brings us an opportunity to realize explainable recommendation. Under the supervision of two explicit feedback, namely rating and textual tips, we can implement a multi-task learning model which can provide recommendation results and generate recommendation reasons at the same time. In this paper, we propose an Encoder-Decoder and Multi-Layer Perception (MLP) based Explainable Recommendation model named EMER to simultaneously implement reason generation and rating prediction. Items title contains significant product-related information and plays an important role in grabbing users attention, so we fuse it in our model to generate recommendation reasons. Numerous experiments on benchmark datasets demonstrate that our model is superior to the state-of-the-art models.

7 July 2020 in Neurocomputing
Verified
Journal Article
Closed access
ZLZhongyu Li
Zhongyu Li
JLJiamin Liu
Jiamin Liu
ZTZhiqiang Tian
Zhiqiang Tian
JZJihua Zhu
Jihua Zhu
CLCe Li
Ce Li
SDShaoyi Du
Shaoyi Du

1 September 2013 in Electronics Letters
Verified
Journal Article
Open access
PDF file
LMLiang Ma
Liang Ma
JZJihua Zhu
Jihua Zhu
An efficient iterative closest point (ICP) variant is proposed for solving the scaling registration of partially overlapping point sets. By adopting the backward distance measurement and the overlapping rate, the aforementioned registration problem can be formulated as a least squares function, which can be solved in the iterative manner, inspired by the ICP algorithm. During each iteration, the inverse correspondences are set up to compute the overlapping percentage, scale and rigid transformation simultaneously between two m ‐D point sets. The experimental results clearly demonstrate its superior performances over previous approaches.

5 November 2018 in Sensors
Verified
Journal Article
Open access
PDF file
YLYaochen Li
Yaochen Li
ZCZhichao Cui
Zhichao Cui
YLYuehu Liu
Yuehu Liu
JZJihua Zhu
Jihua Zhu
DZDanchen Zhao
Danchen Zhao
JYJian Yuan
Jian Yuan
Road scene model construction is an important aspect of intelligent transportation system research. This paper proposes an intelligent framework that can automatically construct road scene models from image sequences. The road and foreground regions are detected at superpixel level via a new kind of random walk algorithm. The seeds for different regions are initialized by trapezoids that are propagated from adjacent frames using optical flow information. The superpixel level region detection is implemented by the random walk algorithm, which is then refined by a fast two-cycle level set method. After this, scene stages can be specified according to a graph model of traffic elements. These then form the basis of 3D road scene models. Each technical component of the framework was evaluated and the results confirmed the effectiveness of the proposed approach.