Qingzhou Mao

Dr. Qingzhou Mao

orcid

Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

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

Representative Publications

View All Publications
1 February 2012 in Pattern Recognition Letters
Verified
Journal Article
Closed access
QZQin Zou
Qin Zou
YCYu Cao
Yu Cao
QLQingquan Li
Qingquan Li
QMQingzhou Mao
Qingzhou Mao
SWSong Wang
Song Wang

1 November 2011 in Image and Vision Computing
Verified
Journal Article
Closed access
QLQingquan Li
Qingquan Li
QZQin Zou
Qin Zou
DZDaqiang Zhang
Daqiang Zhang
QMQingzhou Mao
Qingzhou Mao

13 March 2019 in Applied Sciences
Verified
Journal Article
Open access
PDF file
Chenguang LiuChenguang Liu
Chenguang Liu
QMQingzhou Mao
Qingzhou Mao
Xiumin ChuXiumin Chu
Xiumin Chu
SXShuo Xie
Shuo Xie
A traditional A-Star (A*) algorithm generates an optimal path by minimizing the path cost. For a vessel, factors of path length, obstacle collision risk, traffic separation rule and manoeuvrability restriction should be all taken into account for path planning. Meanwhile, the water current also plays an important role in voyaging and berthing for vessels. In consideration of these defects of the traditional A-Star algorithm when it is used for vessel path planning, an improved A-Star algorithm has been proposed. To be specific, the risk models of obstacles (bridge pier, moored or anchored ship, port, shore, etc.) considering currents, traffic separation, berthing, manoeuvrability restriction have been built firstly. Then, the normal path generation and the berthing path generation with the proposed improved A-Star algorithm have been represented, respectively. Moreover, the problem of combining the normal path and the berthing path has been also solved. To verify the effectiveness of the proposed A-Star path planning methods, four cases have been studied in simulation and real scenarios. The results of experiments show that the proposed A-Star path planning methods can deal with the problems denoted in this article well, and realize the trade-off between the path length and the navigation safety.

1 October 2019 in Automation in Construction
Verified
Journal Article
Closed access
HCHao Cui
Hao Cui
XRXiaochun Ren
Xiaochun Ren
QMQingzhou Mao
Qingzhou Mao
HQHu Qingwu
Hu Qingwu
WWWei Wang
Wei Wang

2 December 2014 in IEEE Transactions on Human-Machine Systems
Verified
Journal Article
Closed access
BZBaoding Zhou
Baoding Zhou
QLQingquan Li
Qingquan Li
QMQingzhou Mao
Qingzhou Mao
Wei TuWei Tu
Wei Tu
XZXing Zhang
Xing Zhang
This paper presents an activity sequence-based indoor pedestrian localization approach using smartphones. The activity sequence consists of several continuous activities during the walking process, such as turning at a corner, taking the elevator, taking the escalator, and walking stairs. These activities take place when a user walks at some special points in the building, like corners, elevators, escalators, and stairs. The special points form an indoor road network. In our approach, we first detect the user's activities using the built-in sensors in a smartphone. The detected activities constitute the activity sequence. Meanwhile, the user's trajectory is reckoned by Pedestrian Dead Reckoning (PDR). Based on the detected activity sequence and reckoned trajectory, we realize pedestrian localization by matching them to the indoor road network using a Hidden Markov Model. After encountering several special points, the location of the user would converge on the true one. We evaluate our proposed approach using smartphones in two buildings: an office building and a shopping mall. The results show that the proposed approach can realize autonomous pedestrian localization even without knowing the initial point in the environments. The mean offline localization error is about 1.3 m. The results also demonstrate that the proposed approach is robust to activity detection error and PDR estimation error.

4 August 2017 in Sensors
Verified
Journal Article
Open access
PDF file
ZXZhimin Xiong
Zhimin Xiong
QLQingquan Li
Qingquan Li
QMQingzhou Mao
Qingzhou Mao
QZQin Zou
Qin Zou
Rail surface defects such as the abrasion, scratch and peeling often cause damages to the train wheels and rail bearings. An efficient and accurate detection of rail defects is of vital importance for the safety of railway transportation. In the past few decades, automatic rail defect detection has been studied; however, most developed methods use optic-imaging techniques to collect the rail surface data and are still suffering from a high false recognition rate. In this paper, a novel 3D laser profiling system (3D-LPS) is proposed, which integrates a laser scanner, odometer, inertial measurement unit (IMU) and global position system (GPS) to capture the rail surface profile data. For automatic defect detection, first, the deviation between the measured profile and a standard rail model profile is computed for each laser-imaging profile, and the points with large deviations are marked as candidate defect points. Specifically, an adaptive iterative closest point (AICP) algorithm is proposed to register the point sets of the measured profile with the standard rail model profile, and the registration precision is improved to the sub-millimeter level. Second, all of the measured profiles are combined together to form the rail surface through a high-precision positioning process with the IMU, odometer and GPS data. Third, the candidate defect points are merged into candidate defect regions using the K-means clustering. At last, the candidate defect regions are classified by a decision tree classifier. Experimental results demonstrate the effectiveness of the proposed laser-profiling system in rail surface defect detection and classification.