To reduce the radiation dose in dental computed tomography (CT), backprojection-filtration (BPF) algorithm is the preferred choice as it can reconstruct images from truncated data within limited scanning angle, thereby reducing radiation dose and avoiding irradiation to the brain. However, the integral interval of backprojection is variable for every PI-line which causes the calculation efficiency and parallel performance to be low. In this paper, the tent BPF method (T-BPF) was developed, which was performed by firstly rearranging the cone-beam data to tent-like parallel-beam data, and then applying the proposed BPF-type algorithm to reconstruct images from the rearranged data. T-BPF turns the variable integral interval of backprojection into fixed integral interval, which means the reconstruction efficiency and the parallel performance of T-BPF are improvements over those of the original BPF algorithm. The experiments of numerical simulation and real data reconstruction show that the reconstruction efficiency of T-BPF is faster than the original BPF algorithm and the FDK algorithm in the case of comparable reconstruction quality. The results demonstrate that the proposed T-BPF is good at achieving fast low-dose reconstruction from truncated projection data in dental CT.
1 January 2023 in Mathematical Problems in Engineering
The minimum spanning tree (MST) is widely used in planning the most economical network. The algorithm for finding the MST of a connected graph is essential. In this paper, a new algorithm for finding MST is proposed based on a deduced theorem of MST. The algorithm first sorts the edges in the graph according to their weight, from large to small. Next, on the premise of ensuring the connectivity of the graph, it deletes the edges in this order until the number of edges of the graph is equal to the number of vertexes minus 1. Finally, the remaining graph is an MST. This algorithm is equivalent to an inverse Kruskal algorithm. For sparse graphs, the proposed algorithm has higher efficiency than the Kruskal algorithm. Experiments and analysis verify the effectiveness of the algorithm proposed in this paper. The algorithm provides a better choice for finding the MST of the sparse graph.
12 May 2025 in IEEE Transactions on Instrumentation and Measurement
Human sensing based on Wi-Fi channel state information (CSI) has attracted attention due to its nonintrusiveness and wide applications. However, due to its susceptibility to external environmental noise and interference, high-complexity deep learning (DL) algorithms are usually adopted to improve the sensing accuracy, which can hardly be deployed in edge devices with limited computational abilities. Building a high-precision, low-complexity human sensing system remains challenging. To improve the accuracy of CSI time series (TS) classification, we proposed a TS-to-image conversion method based on feature fusion, which is developed to increase the spatial structure information of the original data and expand the feature vector space. To build an efficient and lightweight feature extraction network, we designed a framework LWiHS, which is a lightweight universal feature extraction network used to extract the perceptual information containing both deep and shallow features in the images. To reduce the number of model parameters, we adopted channel pruning based on layer adaptive amplitude pruning (LAMP) scoring. LWiHS is lightweight while maintaining good feature extraction capabilities. Our proposed LWiHS outperforms other advanced algorithms in both complexity and sensing performance on four open-source datasets.
1 February 2012 in Journal of X-Ray Science and Technology
In circular cone-beam computed tomography (CT), although the minimum data filtered-backprojection (MD-FBP) algorithm has many significant applications, such as handling super-short scan problem, its reconstruction efficiency is limited by the heavy calculation of backprojection. In this paper, aiming at the image reconstruction of flat region in a super-short scan, an improved method based on MD-FBP algorithm is developed using an integral operation with fixed integral interval during the implementation of backprojection, which has an improvement in reconstruction efficiency and parallel performance compared with the original MD-FBP algorithm. It is found that if the thickness of the flat region is less than 0.0349 R (R is the scanning radius), the uncertainty of the method can be ignored. When the thickness of reconstructed region is a little fat, it can also be reconstructed by increasing the scanning radius befittingly. The results of numerical simulation and real data experiments have demonstrated the correctness and merits of the proposed method.
1 January 2014 in Journal of X-Ray Science and Technology
In various applications of computed tomography (CT), it is common that the reconstructed object is over the field of view (FOV) or we may intend to sue a FOV which only covers the region of interest (ROI) for the sake of reducing radiation dose. These kinds of imaging situations often lead to interior reconstruction problems which are difficult cases in the reconstruction field of CT, due to the truncated projection data at every view angle. In this paper, an interior reconstruction method is developed based on a rotation-translation (RT) scanning model. The method is implemented by first scanning the reconstructed region, and then scanning a small region outside the support of the reconstructed object after translating the rotation centre. The differentiated backprojection (DBP) images of the reconstruction region and the small region outside the object can be respectively obtained from the two-time scanning data without data rebinning process. At last, the projection onto convex sets (POCS) algorithm is applied to reconstruct the interior region. Numerical simulations are conducted to validate the proposed reconstruction method.