Jia Li

Jia Li

Auto-generated profile, based on publicly available information

Jia Li

School of Electrical and Information Engineering, Tianjin University, Tianjin, China

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

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

Representative Publications

View All Publications
9 September 2019 in IEEE Sensors Journal
Verified
Journal Article
Closed access
JLJia Li
Jia Li
SYShihong Yue
Shihong Yue
MDMingliang Ding
Mingliang Ding
ZCZiqiang Cui
Ziqiang Cui
HWHuaxiang Wang
Huaxiang Wang
Owing to its low cost, fast response, noninvasiveness, and non-radiation, electrical impedance tomography (EIT) has been applied to numerous fields. However, its spatial resolution is low due to the inherent ill-posed problem and the “soft field” effect. The L p regularization (0 <; p <; 2) is effective for overcoming these disadvantages, and efforts have been made to use regularization from the most popular L 2 to its variants L 1 and L 1/2 . Nevertheless, L p regularization is generally difficult to be solved fast and efficiently, and the selection of p yielding the best result is also a problem. In this paper, an adaptive re-weighted (ARW) algorithm with a general frame is presented to solve the L p regularization for EIT, with p for each pixel determined adaptively in iterations. Experiments were carried out to validate the proposed algorithm. Results show that compared with other EIT algorithms, the ARW algorithm had a higher spatial resolution. Moreover, it can provide a wider range of selection for regularization parameter, which increases the practicality of the proposed algorithm.

5 November 2020 in IEEE Access
Verified
Journal Article
Open access
Qi LiQi Li
Qi Li
SYShihong Yue
Shihong Yue
YWYaru Wang
Yaru Wang
MDMingliang Ding
Mingliang Ding
JLJia Li
Jia Li
The evaluation on clustering results is an important component of clustering analysis, which can be conducted by the cluster validity index. However, the performances of most existing indices depend on not only the specific clustering algorithms but also the measurements of within-and between-cluster distances and data structures, resulting in limited applications in practice. In this paper, a new within-cluster distance under a general assumption is defined first. After adjusting within-cluster distances of each point according to the adjustment rule, a novel cluster validity index is proposed. Moreover, the notion of chain is introduced to eliminate the effects of sizes, densities, and shapes of clusters. This index does not need any prior information about clustering algorithms and is independent of data structures. Two groups of synthetic datasets with various characteristics and real-world datasets are used to validate this proposed validity index. Experimental results demonstrate that the evaluation accuracy of this index is higher than that of the existing typical indices and performs well on datasets with irregular-shaped clusters.