Lingji Xu

According to our database, Lingji Xu authored at least 12 papers between 2013 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2024

Multiple synchro-tuning chirplet transform.

Lingji Xu, Lixing Chen, Zixin Wang, Weihua Jiang, Zhenglin Li

Digit. Signal Process., January, 2024

2023

Enhancing time-frequency resolution via deep-learning framework.

Zixin Wang, Lixing Chen, Peng Xiao, Lingji Xu, Zhenglin Li

IET Signal Process., April, 2023

1-Bit Hilbert Transform for Signed Signals with Sparse Prior.

Peng Xiao, Yidi Li, Yinglin Chen, Lingji Xu, Jixing Qin

Circuits Syst. Signal Process., March, 2023

Combining Synchrosqueezing Transform and Encoder-Decoder Classification Network for Modulation Recognition of Underwater Acoustic Communication Signals.

Zixin Wang, Lingji Xu, Lixing Chen, Weihua Jiang, Fanchang Zeng, Xinzhe Chen

Proceedings of the IEEE International Conference on Signal Processing, 2023

Deep Learning Based DOA Estimation with Single Vector Hydrophone in Shallow Water.

Xinzhe Chen, Lingji Xu, Fanchang Zeng, Zixin Wang, Zhenglin Li

Proceedings of the IEEE International Conference on Signal Processing, 2023

2020

Automatic Design of Compliant Surgical Forceps With Adaptive Grasping Functions.

Yilun Sun, Yuqing Liu, Lingji Xu, Yunzhe Zou, Angela Faragasso, Tim C. Lueth

IEEE Robotics Autom. Lett., 2020

Automatic synthesis of compliant forceps for robot-assisted minimally invasive surgery.

Yilun Sun, Lingji Xu, Dingzhi Zhang, Tim C. Lueth

Autom., 2020

2019

Design of a Disposable Compliant Medical Forceps using Topology Optimization Techniques.

Yilun Sun, Yuqing Liu, Lingji Xu, Tim C. Lueth

Proceedings of the 2019 IEEE International Conference on Robotics and Biomimetics, 2019

2014

Every planar graph with cycles of length neither 4 nor 5 is (1, 1, 0)-colorable.

Lingji Xu, Zhengke Miao, Yingqian Wang

J. Comb. Optim., 2014

2013

Improper Choosability of Planar Graphs without 4-Cycles.

Yingqian Wang, Lingji Xu

SIAM J. Discret. Math., 2013

Planar graphs without cycles of length 4 or 5 are (3, 0, 0)(3, 0, 0)-colorable.

Owen Hill, Diana Smith, Yingqian Wang, Lingji Xu, Gexin Yu

Discret. Math., 2013

A sufficient condition for a plane graph with maximum degree 6 to be class 1.

Yingqian Wang, Lingji Xu

Discret. Appl. Math., 2013