With the increasing requirements of precision mechanical systems in electronic packaging, ultra-precision machining, biomedicine and other high-tech fields, it is necessary to study a precision two-stage amplification micro-drive system that can safely provide high precision and a large amplification ratio. In view of the disadvantages of the current two-stage amplification and micro-drive system, such as poor security, low motion accuracy and limited amplification ratio, an optimization design of a precise symmetrical two-stage amplification micro-drive system was completed in this study, and its related performance was studied. Based on the guiding principle of the flexure hinge, a two-stage amplification micro-drive mechanism with no parasitic motion or non-motion direction force was designed. In addition, the structure optimization design of the mechanism was completed using the particle swarm optimization algorithm, which increased the amplification ratio of the mechanism from 5 to 18 times. A precise symmetrical two-stage amplification system was designed using a piezoelectric ceramic actuator and two-stage amplification micro-drive mechanism as the micro-driver and actuator, respectively. The driving, strength, and motion performances of the system were subsequently studied. The results showed that the driving linearity of the system was high, the strength satisfied the design requirements, the motion amplification ratio was high and the motion accuracy was high (relative error was 5.31%). The research in this study can promote the optimization of micro-drive systems.
{"title":"Optimization design of two-stage amplification micro-drive system without additional motion based on particle swarm optimization algorithm.","authors":"Manzhi Yang, Kaiyang Wei, Chuanwei Zhang, Dandan Liu, Yizhi Yang, Feiyan Han, Shuanfeng Zhao","doi":"10.1186/s42492-022-00124-1","DOIUrl":"https://doi.org/10.1186/s42492-022-00124-1","url":null,"abstract":"<p><p>With the increasing requirements of precision mechanical systems in electronic packaging, ultra-precision machining, biomedicine and other high-tech fields, it is necessary to study a precision two-stage amplification micro-drive system that can safely provide high precision and a large amplification ratio. In view of the disadvantages of the current two-stage amplification and micro-drive system, such as poor security, low motion accuracy and limited amplification ratio, an optimization design of a precise symmetrical two-stage amplification micro-drive system was completed in this study, and its related performance was studied. Based on the guiding principle of the flexure hinge, a two-stage amplification micro-drive mechanism with no parasitic motion or non-motion direction force was designed. In addition, the structure optimization design of the mechanism was completed using the particle swarm optimization algorithm, which increased the amplification ratio of the mechanism from 5 to 18 times. A precise symmetrical two-stage amplification system was designed using a piezoelectric ceramic actuator and two-stage amplification micro-drive mechanism as the micro-driver and actuator, respectively. The driving, strength, and motion performances of the system were subsequently studied. The results showed that the driving linearity of the system was high, the strength satisfied the design requirements, the motion amplification ratio was high and the motion accuracy was high (relative error was 5.31%). The research in this study can promote the optimization of micro-drive systems.</p>","PeriodicalId":52384,"journal":{"name":"Visual Computing for Industry, Biomedicine, and Art","volume":"5 1","pages":"28"},"PeriodicalIF":0.0,"publicationDate":"2022-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9700539/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"10327931","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-11-24DOI: 10.1186/s42492-022-00123-2
Yujie Zhao, Changqing Liu, Zhiwei Zhao, Kai Tang, Dong He
Precise control of machining deformation is crucial for improving the manufacturing quality of structural aerospace components. In the machining process, different batches of blanks have different residual stress distributions, which pose a significant challenge to machining deformation control. In this study, a reinforcement learning method for machining deformation control based on a meta-invariant feature space was developed. The proposed method uses a reinforcement-learning model to dynamically control the machining process by monitoring the deformation force. Moreover, combined with a meta-invariant feature space, the proposed method learns the internal relationship of the deformation control approaches under different stress distributions to achieve the machining deformation control of different batches of blanks. Finally, the experimental results show that the proposed method achieves better deformation control than the two existing benchmarking methods.
{"title":"Reinforcement learning method for machining deformation control based on meta-invariant feature space.","authors":"Yujie Zhao, Changqing Liu, Zhiwei Zhao, Kai Tang, Dong He","doi":"10.1186/s42492-022-00123-2","DOIUrl":"https://doi.org/10.1186/s42492-022-00123-2","url":null,"abstract":"<p><p>Precise control of machining deformation is crucial for improving the manufacturing quality of structural aerospace components. In the machining process, different batches of blanks have different residual stress distributions, which pose a significant challenge to machining deformation control. In this study, a reinforcement learning method for machining deformation control based on a meta-invariant feature space was developed. The proposed method uses a reinforcement-learning model to dynamically control the machining process by monitoring the deformation force. Moreover, combined with a meta-invariant feature space, the proposed method learns the internal relationship of the deformation control approaches under different stress distributions to achieve the machining deformation control of different batches of blanks. Finally, the experimental results show that the proposed method achieves better deformation control than the two existing benchmarking methods.</p>","PeriodicalId":52384,"journal":{"name":"Visual Computing for Industry, Biomedicine, and Art","volume":" ","pages":"27"},"PeriodicalIF":0.0,"publicationDate":"2022-11-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9684396/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"40702767","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-11-05DOI: 10.1186/s42492-022-00122-3
Louis Zhang
As one of the most widely used assays in biological research, an enumeration of the bacterial cell colonies is an important but time-consuming and labor-intensive process. To speed up the colony counting, a machine learning method is presented for counting the colony forming units (CFUs), which is referred to as CFUCounter. This cell-counting program processes digital images and segments bacterial colonies. The algorithm combines unsupervised machine learning, iterative adaptive thresholding, and local-minima-based watershed segmentation to enable an accurate and robust cell counting. Compared to a manual counting method, CFUCounter supports color-based CFU classification, allows plates containing heterologous colonies to be counted individually, and demonstrates overall performance (slope 0.996, SD 0.013, 95%CI: 0.97-1.02, p value < 1e-11, r = 0.999) indistinguishable from the gold standard of point-and-click counting. This CFUCounter application is open-source and easy to use as a unique addition to the arsenal of colony-counting tools.
{"title":"Machine learning for enumeration of cell colony forming units.","authors":"Louis Zhang","doi":"10.1186/s42492-022-00122-3","DOIUrl":"https://doi.org/10.1186/s42492-022-00122-3","url":null,"abstract":"<p><p>As one of the most widely used assays in biological research, an enumeration of the bacterial cell colonies is an important but time-consuming and labor-intensive process. To speed up the colony counting, a machine learning method is presented for counting the colony forming units (CFUs), which is referred to as CFUCounter. This cell-counting program processes digital images and segments bacterial colonies. The algorithm combines unsupervised machine learning, iterative adaptive thresholding, and local-minima-based watershed segmentation to enable an accurate and robust cell counting. Compared to a manual counting method, CFUCounter supports color-based CFU classification, allows plates containing heterologous colonies to be counted individually, and demonstrates overall performance (slope 0.996, SD 0.013, 95%CI: 0.97-1.02, p value < 1e-11, r = 0.999) indistinguishable from the gold standard of point-and-click counting. This CFUCounter application is open-source and easy to use as a unique addition to the arsenal of colony-counting tools.</p>","PeriodicalId":52384,"journal":{"name":"Visual Computing for Industry, Biomedicine, and Art","volume":" ","pages":"26"},"PeriodicalIF":0.0,"publicationDate":"2022-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9637067/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"40448099","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-10-11DOI: 10.1186/s42492-022-00121-4
Jia Ying, Renee Cattell, Tianyun Zhao, Lan Lei, Zhao Jiang, Shahid M Hussain, Yi Gao, H-H Sherry Chow, Alison T Stopeck, Patricia A Thompson, Chuan Huang
Presence of higher breast density (BD) and persistence over time are risk factors for breast cancer. A quantitatively accurate and highly reproducible BD measure that relies on precise and reproducible whole-breast segmentation is desirable. In this study, we aimed to develop a highly reproducible and accurate whole-breast segmentation algorithm for the generation of reproducible BD measures. Three datasets of volunteers from two clinical trials were included. Breast MR images were acquired on 3 T Siemens Biograph mMR, Prisma, and Skyra using 3D Cartesian six-echo GRE sequences with a fat-water separation technique. Two whole-breast segmentation strategies, utilizing image registration and 3D U-Net, were developed. Manual segmentation was performed. A task-based analysis was performed: a previously developed MR-based BD measure, MagDensity, was calculated and assessed using automated and manual segmentation. The mean squared error (MSE) and intraclass correlation coefficient (ICC) between MagDensity were evaluated using the manual segmentation as a reference. The test-retest reproducibility of MagDensity derived from different breast segmentation methods was assessed using the difference between the test and retest measures (Δ2-1), MSE, and ICC. The results showed that MagDensity derived by the registration and deep learning segmentation methods exhibited high concordance with manual segmentation, with ICCs of 0.986 (95%CI: 0.974-0.993) and 0.983 (95%CI: 0.961-0.992), respectively. For test-retest analysis, MagDensity derived using the registration algorithm achieved the smallest MSE of 0.370 and highest ICC of 0.993 (95%CI: 0.982-0.997) when compared to other segmentation methods. In conclusion, the proposed registration and deep learning whole-breast segmentation methods are accurate and reliable for estimating BD. Both methods outperformed a previously developed algorithm and manual segmentation in the test-retest assessment, with the registration exhibiting superior performance for highly reproducible BD measurements.
{"title":"Two fully automated data-driven 3D whole-breast segmentation strategies in MRI for MR-based breast density using image registration and U-Net with a focus on reproducibility.","authors":"Jia Ying, Renee Cattell, Tianyun Zhao, Lan Lei, Zhao Jiang, Shahid M Hussain, Yi Gao, H-H Sherry Chow, Alison T Stopeck, Patricia A Thompson, Chuan Huang","doi":"10.1186/s42492-022-00121-4","DOIUrl":"10.1186/s42492-022-00121-4","url":null,"abstract":"<p><p>Presence of higher breast density (BD) and persistence over time are risk factors for breast cancer. A quantitatively accurate and highly reproducible BD measure that relies on precise and reproducible whole-breast segmentation is desirable. In this study, we aimed to develop a highly reproducible and accurate whole-breast segmentation algorithm for the generation of reproducible BD measures. Three datasets of volunteers from two clinical trials were included. Breast MR images were acquired on 3 T Siemens Biograph mMR, Prisma, and Skyra using 3D Cartesian six-echo GRE sequences with a fat-water separation technique. Two whole-breast segmentation strategies, utilizing image registration and 3D U-Net, were developed. Manual segmentation was performed. A task-based analysis was performed: a previously developed MR-based BD measure, MagDensity, was calculated and assessed using automated and manual segmentation. The mean squared error (MSE) and intraclass correlation coefficient (ICC) between MagDensity were evaluated using the manual segmentation as a reference. The test-retest reproducibility of MagDensity derived from different breast segmentation methods was assessed using the difference between the test and retest measures (Δ<sub>2-1</sub>), MSE, and ICC. The results showed that MagDensity derived by the registration and deep learning segmentation methods exhibited high concordance with manual segmentation, with ICCs of 0.986 (95%CI: 0.974-0.993) and 0.983 (95%CI: 0.961-0.992), respectively. For test-retest analysis, MagDensity derived using the registration algorithm achieved the smallest MSE of 0.370 and highest ICC of 0.993 (95%CI: 0.982-0.997) when compared to other segmentation methods. In conclusion, the proposed registration and deep learning whole-breast segmentation methods are accurate and reliable for estimating BD. Both methods outperformed a previously developed algorithm and manual segmentation in the test-retest assessment, with the registration exhibiting superior performance for highly reproducible BD measurements.</p>","PeriodicalId":52384,"journal":{"name":"Visual Computing for Industry, Biomedicine, and Art","volume":"5 1","pages":"25"},"PeriodicalIF":0.0,"publicationDate":"2022-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9554077/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"9769827","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-10-01DOI: 10.1186/s42492-022-00120-5
Lin Yin, Wei Li, Yang Du, Kun Wang, Zhenyu Liu, Hui Hui, Jie Tian
Magnetic particle imaging (MPI) is an emerging molecular imaging technique with high sensitivity and temporal-spatial resolution. Image reconstruction is an important research topic in MPI, which converts an induced voltage signal into the image of superparamagnetic iron oxide particles concentration distribution. MPI reconstruction primarily involves system matrix- and x-space-based methods. In this review, we provide a detailed overview of the research status and future research trends of these two methods. In addition, we review the application of deep learning methods in MPI reconstruction and the current open sources of MPI. Finally, research opinions on MPI reconstruction are presented. We hope this review promotes the use of MPI in clinical applications.
{"title":"Recent developments of the reconstruction in magnetic particle imaging.","authors":"Lin Yin, Wei Li, Yang Du, Kun Wang, Zhenyu Liu, Hui Hui, Jie Tian","doi":"10.1186/s42492-022-00120-5","DOIUrl":"10.1186/s42492-022-00120-5","url":null,"abstract":"<p><p>Magnetic particle imaging (MPI) is an emerging molecular imaging technique with high sensitivity and temporal-spatial resolution. Image reconstruction is an important research topic in MPI, which converts an induced voltage signal into the image of superparamagnetic iron oxide particles concentration distribution. MPI reconstruction primarily involves system matrix- and x-space-based methods. In this review, we provide a detailed overview of the research status and future research trends of these two methods. In addition, we review the application of deep learning methods in MPI reconstruction and the current open sources of MPI. Finally, research opinions on MPI reconstruction are presented. We hope this review promotes the use of MPI in clinical applications.</p>","PeriodicalId":52384,"journal":{"name":"Visual Computing for Industry, Biomedicine, and Art","volume":" ","pages":"24"},"PeriodicalIF":0.0,"publicationDate":"2022-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9525566/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"40384453","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-09-28DOI: 10.1186/s42492-022-00118-z
Tianrui Qi, Ge Wang
To enrich the diversity of artificial neurons, a type of quadratic neurons was proposed previously, where the inner product of inputs and weights is replaced by a quadratic operation. In this paper, we demonstrate the superiority of such quadratic neurons over conventional counterparts. For this purpose, we train such quadratic neural networks using an adapted backpropagation algorithm and perform a systematic comparison between quadratic and conventional neural networks for classificaiton of Gaussian mixture data, which is one of the most important machine learning tasks. Our results show that quadratic neural networks enjoy remarkably better efficacy and efficiency than conventional neural networks in this context, and potentially extendable to other relevant applications.
{"title":"Superiority of quadratic over conventional neural networks for classification of gaussian mixture data.","authors":"Tianrui Qi, Ge Wang","doi":"10.1186/s42492-022-00118-z","DOIUrl":"https://doi.org/10.1186/s42492-022-00118-z","url":null,"abstract":"<p><p>To enrich the diversity of artificial neurons, a type of quadratic neurons was proposed previously, where the inner product of inputs and weights is replaced by a quadratic operation. In this paper, we demonstrate the superiority of such quadratic neurons over conventional counterparts. For this purpose, we train such quadratic neural networks using an adapted backpropagation algorithm and perform a systematic comparison between quadratic and conventional neural networks for classificaiton of Gaussian mixture data, which is one of the most important machine learning tasks. Our results show that quadratic neural networks enjoy remarkably better efficacy and efficiency than conventional neural networks in this context, and potentially extendable to other relevant applications.</p>","PeriodicalId":52384,"journal":{"name":"Visual Computing for Industry, Biomedicine, and Art","volume":" ","pages":"23"},"PeriodicalIF":0.0,"publicationDate":"2022-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9515302/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"40378129","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-09-08DOI: 10.1186/s42492-022-00119-y
Shixie Jiang, Linda L Carpenter, Huabei Jiang
Transcranial magnetic stimulation (TMS) has been established as an important and effective treatment for various psychiatric disorders. However, its effectiveness has likely been limited due to the dearth of neuronavigational tools for targeting purposes, unclear ideal stimulation parameters, and a lack of knowledge regarding the physiological response of the brain to TMS in each psychiatric condition. Modern optical imaging modalities, such as functional near-infrared spectroscopy and diffuse optical tomography, are promising tools for the study of TMS optimization and functional targeting in psychiatric disorders. They possess a unique combination of high spatial and temporal resolutions, portability, real-time capability, and relatively low costs. In this mini-review, we discuss the advent of optical imaging techniques and their innovative use in several psychiatric conditions including depression, panic disorder, phobias, and eating disorders. With further investment and research in the development of these optical imaging approaches, their potential will be paramount for the advancement of TMS treatment protocols in psychiatry.
{"title":"Optical neuroimaging: advancing transcranial magnetic stimulation treatments of psychiatric disorders.","authors":"Shixie Jiang, Linda L Carpenter, Huabei Jiang","doi":"10.1186/s42492-022-00119-y","DOIUrl":"https://doi.org/10.1186/s42492-022-00119-y","url":null,"abstract":"<p><p>Transcranial magnetic stimulation (TMS) has been established as an important and effective treatment for various psychiatric disorders. However, its effectiveness has likely been limited due to the dearth of neuronavigational tools for targeting purposes, unclear ideal stimulation parameters, and a lack of knowledge regarding the physiological response of the brain to TMS in each psychiatric condition. Modern optical imaging modalities, such as functional near-infrared spectroscopy and diffuse optical tomography, are promising tools for the study of TMS optimization and functional targeting in psychiatric disorders. They possess a unique combination of high spatial and temporal resolutions, portability, real-time capability, and relatively low costs. In this mini-review, we discuss the advent of optical imaging techniques and their innovative use in several psychiatric conditions including depression, panic disorder, phobias, and eating disorders. With further investment and research in the development of these optical imaging approaches, their potential will be paramount for the advancement of TMS treatment protocols in psychiatry.</p>","PeriodicalId":52384,"journal":{"name":"Visual Computing for Industry, Biomedicine, and Art","volume":" ","pages":"22"},"PeriodicalIF":0.0,"publicationDate":"2022-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9452613/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"40623825","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Combining computer-aided design and computer numerical control (CNC) with global technical connections have become interesting topics in the manufacturing industry. A framework was implemented that includes point clouds to workpieces and consists of a mesh generation from geometric data, optimal surface segmentation for CNC, and tool path planning with a certified scallop height. The latest methods were introduced into the mesh generation with implicit geometric regularization and total generalized variation. Once the mesh model was obtained, a fast and robust optimal surface segmentation method is provided by establishing a weighted graph and searching for the minimum spanning tree of the graph for extraordinary points. This method is easy to implement, and the number of segmented patches can be controlled while preserving the sharp features of the workpiece. Finally, a contour parallel tool-path with a confined scallop height is generated on each patch based on B-spline fitting. Experimental results show that the proposed framework is effective and robust.
{"title":"A framework from point clouds to workpieces.","authors":"Li-Yong Shen, Meng-Xing Wang, Hong-Yu Ma, Yi-Fei Feng, Chun-Ming Yuan","doi":"10.1186/s42492-022-00117-0","DOIUrl":"https://doi.org/10.1186/s42492-022-00117-0","url":null,"abstract":"<p><p>Combining computer-aided design and computer numerical control (CNC) with global technical connections have become interesting topics in the manufacturing industry. A framework was implemented that includes point clouds to workpieces and consists of a mesh generation from geometric data, optimal surface segmentation for CNC, and tool path planning with a certified scallop height. The latest methods were introduced into the mesh generation with implicit geometric regularization and total generalized variation. Once the mesh model was obtained, a fast and robust optimal surface segmentation method is provided by establishing a weighted graph and searching for the minimum spanning tree of the graph for extraordinary points. This method is easy to implement, and the number of segmented patches can be controlled while preserving the sharp features of the workpiece. Finally, a contour parallel tool-path with a confined scallop height is generated on each patch based on B-spline fitting. Experimental results show that the proposed framework is effective and robust.</p>","PeriodicalId":52384,"journal":{"name":"Visual Computing for Industry, Biomedicine, and Art","volume":" ","pages":"21"},"PeriodicalIF":0.0,"publicationDate":"2022-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9395558/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"40632606","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-08-03DOI: 10.1186/s42492-022-00116-1
Haofan Huang, Xiaxia Yu, Mu Tian, Weizhen He, Shawn Xiang Li, Zhengrong Liang, Yi Gao
Pancreatoscopy plays a significant role in the diagnosis and treatment of pancreatic diseases. However, the risk of pancreatoscopy is remarkably greater than that of other endoscopic procedures, such as gastroscopy and bronchoscopy, owing to its severe invasiveness. In comparison, virtual pancreatoscopy (VP) has shown notable advantages. However, because of the low resolution of current computed tomography (CT) technology and the small diameter of the pancreatic duct, VP has limited clinical use. In this study, an optimal path algorithm and super-resolution technique are investigated for the development of an open-source software platform for VP based on 3D Slicer. The proposed segmentation of the pancreatic duct from the abdominal CT images reached an average Dice coefficient of 0.85 with a standard deviation of 0.04. Owing to the excellent segmentation performance, a fly-through visualization of both the inside and outside of the duct was successfully reconstructed, thereby demonstrating the feasibility of VP. In addition, a quantitative analysis of the wall thickness and topology of the duct provides more insight into pancreatic diseases than a fly-through visualization. The entire VP system developed in this study is available at https://github.com/gaoyi/VirtualEndoscopy.git .
{"title":"Open-source algorithm and software for computed tomography-based virtual pancreatoscopy and other applications.","authors":"Haofan Huang, Xiaxia Yu, Mu Tian, Weizhen He, Shawn Xiang Li, Zhengrong Liang, Yi Gao","doi":"10.1186/s42492-022-00116-1","DOIUrl":"https://doi.org/10.1186/s42492-022-00116-1","url":null,"abstract":"<p><p>Pancreatoscopy plays a significant role in the diagnosis and treatment of pancreatic diseases. However, the risk of pancreatoscopy is remarkably greater than that of other endoscopic procedures, such as gastroscopy and bronchoscopy, owing to its severe invasiveness. In comparison, virtual pancreatoscopy (VP) has shown notable advantages. However, because of the low resolution of current computed tomography (CT) technology and the small diameter of the pancreatic duct, VP has limited clinical use. In this study, an optimal path algorithm and super-resolution technique are investigated for the development of an open-source software platform for VP based on 3D Slicer. The proposed segmentation of the pancreatic duct from the abdominal CT images reached an average Dice coefficient of 0.85 with a standard deviation of 0.04. Owing to the excellent segmentation performance, a fly-through visualization of both the inside and outside of the duct was successfully reconstructed, thereby demonstrating the feasibility of VP. In addition, a quantitative analysis of the wall thickness and topology of the duct provides more insight into pancreatic diseases than a fly-through visualization. The entire VP system developed in this study is available at https://github.com/gaoyi/VirtualEndoscopy.git .</p>","PeriodicalId":52384,"journal":{"name":"Visual Computing for Industry, Biomedicine, and Art","volume":" ","pages":"20"},"PeriodicalIF":0.0,"publicationDate":"2022-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9346031/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"40595553","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In recent years, human motion prediction has become an active research topic in computer vision. However, owing to the complexity and stochastic nature of human motion, it remains a challenging problem. In previous works, human motion prediction has always been treated as a typical inter-sequence problem, and most works have aimed to capture the temporal dependence between successive frames. However, although these approaches focused on the effects of the temporal dimension, they rarely considered the correlation between different joints in space. Thus, the spatio-temporal coupling of human joints is considered, to propose a novel spatio-temporal network based on a transformer and a gragh convolutional network (GCN) (STTG-Net). The temporal transformer is used to capture the global temporal dependencies, and the spatial GCN module is used to establish local spatial correlations between the joints for each frame. To overcome the problems of error accumulation and discontinuity in the motion prediction, a revision method based on fusion strategy is also proposed, in which the current prediction frame is fused with the previous frame. The experimental results show that the proposed prediction method has less prediction error and the prediction motion is smoother than previous prediction methods. The effectiveness of the proposed method is also demonstrated comparing it with the state-of-the-art method on the Human3.6 M dataset.
{"title":"STTG-net: a Spatio-temporal network for human motion prediction based on transformer and graph convolution network.","authors":"Lujing Chen, Rui Liu, Xin Yang, Dongsheng Zhou, Qiang Zhang, Xiaopeng Wei","doi":"10.1186/s42492-022-00112-5","DOIUrl":"https://doi.org/10.1186/s42492-022-00112-5","url":null,"abstract":"<p><p>In recent years, human motion prediction has become an active research topic in computer vision. However, owing to the complexity and stochastic nature of human motion, it remains a challenging problem. In previous works, human motion prediction has always been treated as a typical inter-sequence problem, and most works have aimed to capture the temporal dependence between successive frames. However, although these approaches focused on the effects of the temporal dimension, they rarely considered the correlation between different joints in space. Thus, the spatio-temporal coupling of human joints is considered, to propose a novel spatio-temporal network based on a transformer and a gragh convolutional network (GCN) (STTG-Net). The temporal transformer is used to capture the global temporal dependencies, and the spatial GCN module is used to establish local spatial correlations between the joints for each frame. To overcome the problems of error accumulation and discontinuity in the motion prediction, a revision method based on fusion strategy is also proposed, in which the current prediction frame is fused with the previous frame. The experimental results show that the proposed prediction method has less prediction error and the prediction motion is smoother than previous prediction methods. The effectiveness of the proposed method is also demonstrated comparing it with the state-of-the-art method on the Human3.6 M dataset.</p>","PeriodicalId":52384,"journal":{"name":"Visual Computing for Industry, Biomedicine, and Art","volume":" ","pages":"19"},"PeriodicalIF":0.0,"publicationDate":"2022-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9338210/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"40572283","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}