45 research outputs found

    OSNet & MNetO: Two Types of General Reconstruction Architectures for Linear Computed Tomography in Multi-Scenarios

    Full text link
    Recently, linear computed tomography (LCT) systems have actively attracted attention. To weaken projection truncation and image the region of interest (ROI) for LCT, the backprojection filtration (BPF) algorithm is an effective solution. However, in BPF for LCT, it is difficult to achieve stable interior reconstruction, and for differentiated backprojection (DBP) images of LCT, multiple rotation-finite inversion of Hilbert transform (Hilbert filtering)-inverse rotation operations will blur the image. To satisfy multiple reconstruction scenarios for LCT, including interior ROI, complete object, and exterior region beyond field-of-view (FOV), and avoid the rotation operations of Hilbert filtering, we propose two types of reconstruction architectures. The first overlays multiple DBP images to obtain a complete DBP image, then uses a network to learn the overlying Hilbert filtering function, referred to as the Overlay-Single Network (OSNet). The second uses multiple networks to train different directional Hilbert filtering models for DBP images of multiple linear scannings, respectively, and then overlays the reconstructed results, i.e., Multiple Networks Overlaying (MNetO). In two architectures, we introduce a Swin Transformer (ST) block to the generator of pix2pixGAN to extract both local and global features from DBP images at the same time. We investigate two architectures from different networks, FOV sizes, pixel sizes, number of projections, geometric magnification, and processing time. Experimental results show that two architectures can both recover images. OSNet outperforms BPF in various scenarios. For the different networks, ST-pix2pixGAN is superior to pix2pixGAN and CycleGAN. MNetO exhibits a few artifacts due to the differences among the multiple models, but any one of its models is suitable for imaging the exterior edge in a certain direction.Comment: 13 pages, 13 figure

    BPF Algorithms for Multiple Source-Translation Computed Tomography Reconstruction

    Full text link
    Micro-computed tomography (micro-CT) is a widely used state-of-the-art instrument employed to study the morphological structures of objects in various fields. Object-rotation is a classical scanning mode in micro-CT allowing data acquisition from different angles; however, its field-of-view (FOV) is primarily constrained by the size of the detector when aiming for high spatial resolution imaging. Recently, we introduced a novel scanning mode called multiple source translation CT (mSTCT), which effectively enlarges the FOV of the micro-CT system. Furthermore, we developed a virtual projection-based filtered backprojection (V-FBP) algorithm to address truncated projection, albeit with a trade-off in acquisition efficiency (high resolution reconstruction typically requires thousands of source samplings). In this paper, we present a new algorithm for mSTCT reconstruction, backprojection-filtration (BPF), which enables reconstructions of high-resolution images with a low source sampling ratio. Additionally, we found that implementing derivatives in BPF along different directions (source and detector) yields two distinct BPF algorithms (S-BPF and D-BPF), each with its own reconstruction performance characteristics. Through simulated and real experiments conducted in this paper, we demonstrate that achieving same high-resolution reconstructions, D-BPF can reduce source sampling by 75% compared with V-FBP. S-BPF shares similar characteristics with V-FBP, where the spatial resolution is primarily influenced by the source sampling.Comment: 22 pages, 12 figure

    Small-amplitude limit cycles for class of (<i>m</i>=5, <i>n</i>=10) Lienard system

    No full text
    We studied the number of limit cycles for the class of Li&#233;nard system (m=5, n=10) in the neighborhood of the origin is studied. We proved that nine small amplitude limit cycles could bifurcate from the origin by using computer symbolic computation to compute singular point values and using the method of Jacobi determinant. It is a new lower bound estimate on Li&#233;nard system in the case of m is equal to five and n is equal to ten, that is H(5, 10) > 9

    TxCP: A Coprocessor for LTE-A

    No full text
    With the widely use of 4G network, the corresponding bandwidth processing has become a critical issue. The current recognized 4G network is LTE-A. In the baseband processing for LTE-A, the processing of its physical layer algorithm is the biggest bottleneck for current processors. The use of application specific integrated circuit (ASIC) design has become necessary. This article will introduce a communication dedicated coprocessor (TxCP), specifically for LTE-A physical layer uplink shared/control channel (PUSCH/PUCCH) algorithm for bit-level acceleration. Its internal support for PUSCH/PUCCH CRC, Turbo encoding, equation definable convolutional encoding, data channel and control channel rate matching, channel interleaving, scrambling and modulation supporting QPSK, 16QAM and 64QAM. And in order to ensure that the coprocessor has a certain degree of flexibility, its internal controller design will support a variety of modes to ensure that some of the algorithm modules can be run separately. The programming model of the processor is relatively simple, and the user does not need to go through a complicated design

    TxCP: A Coprocessor for LTE-A

    No full text
    With the widely use of 4G network, the corresponding bandwidth processing has become a critical issue. The current recognized 4G network is LTE-A. In the baseband processing for LTE-A, the processing of its physical layer algorithm is the biggest bottleneck for current processors. The use of application specific integrated circuit (ASIC) design has become necessary. This article will introduce a communication dedicated coprocessor (TxCP), specifically for LTE-A physical layer uplink shared/control channel (PUSCH/PUCCH) algorithm for bit-level acceleration. Its internal support for PUSCH/PUCCH CRC, Turbo encoding, equation definable convolutional encoding, data channel and control channel rate matching, channel interleaving, scrambling and modulation supporting QPSK, 16QAM and 64QAM. And in order to ensure that the coprocessor has a certain degree of flexibility, its internal controller design will support a variety of modes to ensure that some of the algorithm modules can be run separately. The programming model of the processor is relatively simple, and the user does not need to go through a complicated design

    TxCP: A Coprocessor for LTE-A

    No full text
    With the widely use of 4G network, the corresponding bandwidth processing has become a critical issue. The current recognized 4G network is LTE-A. In the baseband processing for LTE-A, the processing of its physical layer algorithm is the biggest bottleneck for current processors. The use of application specific integrated circuit (ASIC) design has become necessary. This article will introduce a communication dedicated coprocessor (TxCP), specifically for LTE-A physical layer uplink shared/control channel (PUSCH/PUCCH) algorithm for bit-level acceleration. Its internal support for PUSCH/PUCCH CRC, Turbo encoding, equation definable convolutional encoding, data channel and control channel rate matching, channel interleaving, scrambling and modulation supporting QPSK, 16QAM and 64QAM. And in order to ensure that the coprocessor has a certain degree of flexibility, its internal controller design will support a variety of modes to ensure that some of the algorithm modules can be run separately. The programming model of the processor is relatively simple, and the user does not need to go through a complicated design
    corecore