Jianbing Yi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Jianbing Yi has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
- Feng Cao
Jiangxi University of Science and Technology, Ganzhou, China
2 shared publications - Xuan Yang
College of Computer Science and Software Engineering, Shenzhen University, Shenzhen, 518060, China
2 shared publications Cong Tan
1 shared publication- Guanfeng Wu
School of Mathematics, Southwest Jiaotong University, Chengdu, China
1 shared publication - Guoliang Chen
College of Computer Science and Software Engineering, Shenzhen University, Shenzhen, China
1 shared publication - Hailin Guo
School of Information Engineering, Jiangxi University of Science and Technology, Ganzhou, China
1 shared publication
Latest Publications
- Open Access
- 9 January 2025
- Published by Springer Nature in International Journal of Computational Intelligence Systems
- Vol. 18 (1) , 1-15
A Novel Conflict Deduction Algorithm Based on Contradiction Separation Inference Rule
- 9 January 2025
- Published by Springer Nature in International Journal of Computational Intelligence Systems
- Vol. 18 (1) , 1-15
Open AccessA Novel Conflict Deduction Algorithm Based on Contradiction Separation Inference Rule
- Open Access
- 21 March 2024
- Published by Springer Nature in Research Square
CSE - A Automated Theorem Prover Based on Standard Contradiction Separation Dynamic Deduction
Contradiction Separation Extension (CSE in short), an automated theorem prover for first-order logic without equality, which is based on a novel standard contradiction separation (S-CS) inference rule. Different from binary resolution or its refinements, the biggest difference and characteristic of S-CS rule is that each resolution step can handle multiple (two or more) clauses for synergized deduction. This paper mainly describes problem format conversion, clause set preprocessing, deduction framework, distinctive heuristic strategies, S-CS dynamic inference mechanism in CSE. CSE is evaluated through benchmarks and the deduction characteristics of this multi-clause dynamic deduction are demonstrated, e.g., FOF division problems of CASC-26, CASC-J9. In addition, the CASC-J9 is also tested by combined systems, which combine CSE and other prover (Prover9, Eprover, Vampire), and the combined systems is applied to test on the hard problems with rating of 1. Experimental results show the CSE shows a competitive performance and can play a role in first-order logic automated theorem proving.
- 21 March 2024
- Published by Springer Nature in Research Square
Open AccessCSE - A Automated Theorem Prover Based on Standard Contradiction Separation Dynamic Deduction
Contradiction Separation Extension (CSE in short), an automated theorem prover for first-order logic without equality, which is based on a novel standard contradiction separation (S-CS) inference rule. Different from binary resolution or its refinements, the biggest difference and characteristic of S-CS rule is that each resolution step can handle multiple (two or more) clauses for synergized deduction. This paper mainly describes problem format conversion, clause set preprocessing, deduction framework, distinctive heuristic strategies, S-CS dynamic inference mechanism in CSE. CSE is evaluated through benchmarks and the deduction characteristics of this multi-clause dynamic deduction are demonstrated, e.g., FOF division problems of CASC-26, CASC-J9. In addition, the CASC-J9 is also tested by combined systems, which combine CSE and other prover (Prover9, Eprover, Vampire), and the combined systems is applied to test on the hard problems with rating of 1. Experimental results show the CSE shows a competitive performance and can play a role in first-order logic automated theorem proving.
- 24 May 2016
- Published by Bentham Science Publishers Ltd. in Recent Patents and Topics on Imaging
- Vol. 5 (2) , 88-96
Transformation Models for Four-Dimensional Image Registration: A Survey
- 24 May 2016
- Published by Bentham Science Publishers Ltd. in Recent Patents and Topics on Imaging
- Vol. 5 (2) , 88-96
Transformation Models for Four-Dimensional Image Registration: A Survey
- 8 September 2015
- Published by Wiley in Medical Physics
- Vol. 42 (10) , 5616-5632
Lung motion estimation using dynamic point shifting: An innovative model based on a robust point matching algorithm
Purpose: Image‐guided radiotherapy is an advanced 4D radiotherapy technique that has been developed in recent years. However, respiratory motion causes significant uncertainties in image‐guided radiotherapy procedures. To address these issues, an innovative lung motion estimation model based on a robust point matching is proposed in this paper.Methods: An innovative robust point matching algorithm using dynamic point shifting is proposed to estimate patient‐specific lung motion during free breathing from 4D computed tomography data. The correspondence of the landmark points is determined from the Euclidean distance between the landmark points and the similarity between the local images that are centered at points at the same time. To ensure that the points in the source image correspond to the points in the target image during other phases, the virtual target points are first created and shifted based on the similarity between the local image centered at the source point and the local image centered at the virtual target point. Second, the target points are shifted by the constrained inverse function mapping the target points to the virtual target points. The source point set and shifted target point set are used to estimate the transformation function between the source image and target image.Results: The performances of the authors’ method are evaluated on two publicly available DIR‐lab and POPI‐model lung datasets. For computing target registration errors on 750 landmark points in six phases of the DIR‐lab dataset and 37 landmark points in ten phases of the POPI‐model dataset, the mean and standard deviation by the authors’ method are 1.11 and 1.11 mm, but they are 2.33 and 2.32 mm without considering image intensity, and 1.17 and 1.19 mm with sliding conditions. For the two phases of maximum inhalation and maximum exhalation in the DIR‐lab dataset with 300 landmark points of each case, the mean and standard deviation of target registration errors on the 3000 landmark points of ten cases by the authors’ method are 1.21 and 1.04 mm. In the EMPIRE10 lung registration challenge, the authors’ method ranks 24 of 39. According to the index of the maximum shear stretch, the authors’ method is also efficient to describe the discontinuous motion at the lung boundaries.Conclusions: By establishing the correspondence of the landmark points in the source phase and the other target phases combining shape matching and image intensity matching together, the mismatching issue in the robust point matching algorithm is adequately addressed. The target registration errors are statistically reduced by shifting the virtual target points and target points. The authors’ method with consideration of sliding conditions can effectively estimate the discontinuous motion, and the estimated motion is natural. The primary limitation of the proposed method is that the temporal constraints of the trajectories of voxels are not introduced into the motion model. However, the proposed method provides satisfactory motion information, which results in precise tumor coverage by the radiation dose during radiotherapy.
- 8 September 2015
- Published by Wiley in Medical Physics
- Vol. 42 (10) , 5616-5632
Lung motion estimation using dynamic point shifting: An innovative model based on a robust point matching algorithm
Purpose: Image‐guided radiotherapy is an advanced 4D radiotherapy technique that has been developed in recent years. However, respiratory motion causes significant uncertainties in image‐guided radiotherapy procedures. To address these issues, an innovative lung motion estimation model based on a robust point matching is proposed in this paper.Methods: An innovative robust point matching algorithm using dynamic point shifting is proposed to estimate patient‐specific lung motion during free breathing from 4D computed tomography data. The correspondence of the landmark points is determined from the Euclidean distance between the landmark points and the similarity between the local images that are centered at points at the same time. To ensure that the points in the source image correspond to the points in the target image during other phases, the virtual target points are first created and shifted based on the similarity between the local image centered at the source point and the local image centered at the virtual target point. Second, the target points are shifted by the constrained inverse function mapping the target points to the virtual target points. The source point set and shifted target point set are used to estimate the transformation function between the source image and target image.Results: The performances of the authors’ method are evaluated on two publicly available DIR‐lab and POPI‐model lung datasets. For computing target registration errors on 750 landmark points in six phases of the DIR‐lab dataset and 37 landmark points in ten phases of the POPI‐model dataset, the mean and standard deviation by the authors’ method are 1.11 and 1.11 mm, but they are 2.33 and 2.32 mm without considering image intensity, and 1.17 and 1.19 mm with sliding conditions. For the two phases of maximum inhalation and maximum exhalation in the DIR‐lab dataset with 300 landmark points of each case, the mean and standard deviation of target registration errors on the 3000 landmark points of ten cases by the authors’ method are 1.21 and 1.04 mm. In the EMPIRE10 lung registration challenge, the authors’ method ranks 24 of 39. According to the index of the maximum shear stretch, the authors’ method is also efficient to describe the discontinuous motion at the lung boundaries.Conclusions: By establishing the correspondence of the landmark points in the source phase and the other target phases combining shape matching and image intensity matching together, the mismatching issue in the robust point matching algorithm is adequately addressed. The target registration errors are statistically reduced by shifting the virtual target points and target points. The authors’ method with consideration of sliding conditions can effectively estimate the discontinuous motion, and the estimated motion is natural. The primary limitation of the proposed method is that the temporal constraints of the trajectories of voxels are not introduced into the motion model. However, the proposed method provides satisfactory motion information, which results in precise tumor coverage by the radiation dose during radiotherapy.
- 1 January 2013
- Published by Springer Nature
- p. 707-714
Using Genetic Algorithm to Improve Gray Watermark Algorithm
- 1 January 2013
- Published by Springer Nature
- p. 707-714
Using Genetic Algorithm to Improve Gray Watermark Algorithm