Wang Zhen

Wang Zhen

Auto-generated profile, based on publicly available information

Wang Zhen

School of Computer Science and Technology, Shandong University of Technology, Zibo, 255000, China

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

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

Representative Publications

View All Publications
1 July 2015
Verified
Conference Paper
Closed access
FXFen XU
Fen XU
WZWang Zhen
Wang Zhen
This paper introduces a visual SLAM system based on Kinect sensor and ORB features. The RGB image output by the Kinect sensor is processed and Oriented FAST and Rotated BRIEF (ORB) features are extracted for landmark detection. The depth information output by Kinect is processed and repaired using nearest neighbor repairing algorithm to achieve a complete depth map. Locality-sensitive hashing (LSH) algorithm is used during feature association process to improve the mapping speed. Experiments show that the visual SLAM system based on Kinect and ORB feature is feasible and has an acceptable accuracy, with a good potential for indoor robot navigation tasks in an unknown environment.

5 March 2020 in EURASIP Journal on Image and Video Processing
Verified
Journal Article
Open access
PDF file
ZWZhen Wang
Zhen Wang
FSFuzhen Sun
Fuzhen Sun
LZLongbo Zhang
Longbo Zhang
PLPingping Liu
Pingping Liu
The binary coding technique has been widely used in approximate nearest neighbors (ANN) search tasks. Traditional hashing algorithms treat binary bits equally, which usually causes an ambiguous ranking. To solve this issue, we propose an innovative bitwise weight method dubbed minimal residual ordinal loss hashing (MROLH). Different from a two-step mechanism, MROLH simultaneously learns binary codes and bitwise weights by a feedback mechanism. When the algorithm converges, the binary codes and bitwise weights can be well adaptive to each other. Furthermore, we establish the ordinal relation preserving constraint based on quartic samples to enhance the power of preserving relative similarity. To decrease the training complexity, we utilize a tensor ordinal graph to represent quartic ordinal relation, and the original objective function is approximated by the one based on triplet samples. In this paper, we also assign different weight values to training samples. During the training procedure, the weight of each data is initialized to the same value, and we iteratively boost the weight of the data whose relative similarity is not well preserved. As a result, we can minimize the residual ordinal loss. Experimental results on three large-scale ANN search benchmark datasets, i.e., SIFT1M, GIST1M, and Cifar10, show that the proposed method MROLH achieves a superior ANN search performance in both the Hamming space and the weighted Hamming space over the sate-of-the-art approaches.