Pub Date : 2021-07-23DOI: 10.1142/S0219467822500383
Rafiqul Islam, Md. Shafiqul Islam, Muhammad Shahin Uddin
Magnetic resonance imaging (MRI) is a dynamic and safe imaging technique in medical imaging. Recently, parallel MRI (pMRI) is widely used for accelerating conventional MRI. Both frequency and image domain-based reconstructions are the most attractive methods for generating the image from multi-channel k-space data. Compressed sensing (CS) is a recently used procedure to reduce the acquisition time of conventional MRI. This reduction is achieved by taking fewer measurements from the fully sampled k-space data. Therefore, applying the CS technique in pMRI is the most emerging way for further improving the acquisition time that is a tremendous research interest. However, as the phase encoding plane may be perpendicular or parallel to the coil elements plane, finding the exact domain for CS in pMRI reconstruction is a major challenging issue. In this work, the application of the CS technique in pMRI in both domains is investigated. Later some widely used methodologies are presented as the nonlinear reconstruction algorithm of CS in pMRI. Finally, a discussion is performed based on CS in pMRI to perceive the reality of different reconstruction algorithms at a glance for finding preferred methodologies.
{"title":"Compressed Sensing in Parallel MRI: A Review","authors":"Rafiqul Islam, Md. Shafiqul Islam, Muhammad Shahin Uddin","doi":"10.1142/S0219467822500383","DOIUrl":"https://doi.org/10.1142/S0219467822500383","url":null,"abstract":"Magnetic resonance imaging (MRI) is a dynamic and safe imaging technique in medical imaging. Recently, parallel MRI (pMRI) is widely used for accelerating conventional MRI. Both frequency and image domain-based reconstructions are the most attractive methods for generating the image from multi-channel k-space data. Compressed sensing (CS) is a recently used procedure to reduce the acquisition time of conventional MRI. This reduction is achieved by taking fewer measurements from the fully sampled k-space data. Therefore, applying the CS technique in pMRI is the most emerging way for further improving the acquisition time that is a tremendous research interest. However, as the phase encoding plane may be perpendicular or parallel to the coil elements plane, finding the exact domain for CS in pMRI reconstruction is a major challenging issue. In this work, the application of the CS technique in pMRI in both domains is investigated. Later some widely used methodologies are presented as the nonlinear reconstruction algorithm of CS in pMRI. Finally, a discussion is performed based on CS in pMRI to perceive the reality of different reconstruction algorithms at a glance for finding preferred methodologies.","PeriodicalId":177479,"journal":{"name":"Int. J. Image Graph.","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126755708","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Automatic diagnosis of brain diseases based on brain connectivity network (BCN) classification is one of the hot research fields in medical image analysis. The functional brain network reflects the brain functional activities and structural brain network reflects the neural connections of the main brain regions. It is of great significance to explore and explain the inner mechanism of the brain and to understand and treat brain diseases. In this paper, based on the graph structure characteristics of brain network, the fusion model of functional brain network and structural brain network is designed to classify the diagnosis of brain mental diseases. Specifically, the main work of this paper is to use the Laplacian graph embed the information of diffusion tensor imaging, which contains the characteristics of structural brain networks, into the functional brain network with hyper-order functional connectivity information built based on functional magnetic resonance data using the sparse representation method, to obtain brain network with both functional and structural characteristics. Projection of the brain network and the two original modes data to the kernel space respectively and then classified by the multi-task learning method. Experiments on the epilepsy dataset show that our method has better performance than several state-of-the-art methods. In addition, brain regions and connections that are highly correlated with disease revealed by our method are discussed.
{"title":"Functional Brain Connectivity Hyper-Network Embedded with Structural Information for Epilepsy Diagnosis","authors":"Gengbiao Zhang, Qi Zhu, Jing Yang, Ruting Xu, Zhiqiang Zhang, Daoqiang Zhang","doi":"10.1142/s0219467822500292","DOIUrl":"https://doi.org/10.1142/s0219467822500292","url":null,"abstract":"Automatic diagnosis of brain diseases based on brain connectivity network (BCN) classification is one of the hot research fields in medical image analysis. The functional brain network reflects the brain functional activities and structural brain network reflects the neural connections of the main brain regions. It is of great significance to explore and explain the inner mechanism of the brain and to understand and treat brain diseases. In this paper, based on the graph structure characteristics of brain network, the fusion model of functional brain network and structural brain network is designed to classify the diagnosis of brain mental diseases. Specifically, the main work of this paper is to use the Laplacian graph embed the information of diffusion tensor imaging, which contains the characteristics of structural brain networks, into the functional brain network with hyper-order functional connectivity information built based on functional magnetic resonance data using the sparse representation method, to obtain brain network with both functional and structural characteristics. Projection of the brain network and the two original modes data to the kernel space respectively and then classified by the multi-task learning method. Experiments on the epilepsy dataset show that our method has better performance than several state-of-the-art methods. In addition, brain regions and connections that are highly correlated with disease revealed by our method are discussed.","PeriodicalId":177479,"journal":{"name":"Int. J. Image Graph.","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133071081","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-07-17DOI: 10.1142/S0219467822500334
Maryam Abedini, Horriyeh Haddad, M. F. Masouleh, A. Shahbahrami
This study proposes an image denoising algorithm based on sparse representation and Principal Component Analysis (PCA). The proposed algorithm includes the following steps. First, the noisy image is divided into overlapped [Formula: see text] blocks. Second, the discrete cosine transform is applied as a dictionary for the sparse representation of the vectors created by the overlapped blocks. To calculate the sparse vector, the orthogonal matching pursuit algorithm is used. Then, the dictionary is updated by means of the PCA algorithm to achieve the sparsest representation of vectors. Since the signal energy, unlike the noise energy, is concentrated on a small dataset by transforming into the PCA domain, the signal and noise can be well distinguished. The proposed algorithm was implemented in a MATLAB environment and its performance was evaluated on some standard grayscale images under different levels of standard deviations of white Gaussian noise by means of peak signal-to-noise ratio, structural similarity indexes, and visual effects. The experimental results demonstrate that the proposed denoising algorithm achieves significant improvement compared to dual-tree complex discrete wavelet transform and K-singular value decomposition image denoising methods. It also obtains competitive results with the block-matching and 3D filtering method, which is the current state-of-the-art for image denoising.
{"title":"Image Denoising Using Sparse Representation and Principal Component Analysis","authors":"Maryam Abedini, Horriyeh Haddad, M. F. Masouleh, A. Shahbahrami","doi":"10.1142/S0219467822500334","DOIUrl":"https://doi.org/10.1142/S0219467822500334","url":null,"abstract":"This study proposes an image denoising algorithm based on sparse representation and Principal Component Analysis (PCA). The proposed algorithm includes the following steps. First, the noisy image is divided into overlapped [Formula: see text] blocks. Second, the discrete cosine transform is applied as a dictionary for the sparse representation of the vectors created by the overlapped blocks. To calculate the sparse vector, the orthogonal matching pursuit algorithm is used. Then, the dictionary is updated by means of the PCA algorithm to achieve the sparsest representation of vectors. Since the signal energy, unlike the noise energy, is concentrated on a small dataset by transforming into the PCA domain, the signal and noise can be well distinguished. The proposed algorithm was implemented in a MATLAB environment and its performance was evaluated on some standard grayscale images under different levels of standard deviations of white Gaussian noise by means of peak signal-to-noise ratio, structural similarity indexes, and visual effects. The experimental results demonstrate that the proposed denoising algorithm achieves significant improvement compared to dual-tree complex discrete wavelet transform and K-singular value decomposition image denoising methods. It also obtains competitive results with the block-matching and 3D filtering method, which is the current state-of-the-art for image denoising.","PeriodicalId":177479,"journal":{"name":"Int. J. Image Graph.","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134473305","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-07-17DOI: 10.1142/S0219467822500280
S. K. Shah
This paper describes the Fast Radial Basis Function (RBF) method for cardiac motion tracking in 3D CT using non-rigid medical image registration based on parameterized (regular) surfaces. The technique is a point-based registration evaluation algorithm which does register 3D MR or CT images in real time. We first extract the surface of the whole heart 3D CT and its contrast enhanced part (left ventricle (LV) blood cavity) of each dataset with a semiautomatic contouring and a fully-automatic triangulation method followed by a global surface parameterization and optimization algorithm. In second step, a set of registration experiments are run to calculate the deformation field at various phases of cardiac motion or cycle from CT images, which results into significant deformation during each phase of a cycle. The surface points of the whole heart and LV are used to register the source systole image to various diastole target images taken at different phases during a heart beat. Our registration accuracy improves with the increase in number of salient feature points (i.e. optimized parameterized surfaces) and it has no effect on the speed of the algorithm (i.e. still less than a second). The results show that the target registration error is less than 3[Formula: see text]mm (2.53) and the performance of the Fast RBF algorithm is less than a second using a whole heart CT dataset of a single patient taken over the course of the entire cardiac cycle. At the end, the results for recovery (or analysis) of bigger deformation in heart CT images using the Fast RBF algorithm is compared to the state-of-the-art Free Form Deformation (FFD) registration technique. It is proved that the Fast RBF method is performing better in speed and slightly less accurate than the FFD (when measured in terms of NMI) due to iterative nature of the latter.
{"title":"Non-Rigid Image Registration based on Parameterized Surfaces: Application to 3D Cardiac Motion Image Analysis","authors":"S. K. Shah","doi":"10.1142/S0219467822500280","DOIUrl":"https://doi.org/10.1142/S0219467822500280","url":null,"abstract":"This paper describes the Fast Radial Basis Function (RBF) method for cardiac motion tracking in 3D CT using non-rigid medical image registration based on parameterized (regular) surfaces. The technique is a point-based registration evaluation algorithm which does register 3D MR or CT images in real time. We first extract the surface of the whole heart 3D CT and its contrast enhanced part (left ventricle (LV) blood cavity) of each dataset with a semiautomatic contouring and a fully-automatic triangulation method followed by a global surface parameterization and optimization algorithm. In second step, a set of registration experiments are run to calculate the deformation field at various phases of cardiac motion or cycle from CT images, which results into significant deformation during each phase of a cycle. The surface points of the whole heart and LV are used to register the source systole image to various diastole target images taken at different phases during a heart beat. Our registration accuracy improves with the increase in number of salient feature points (i.e. optimized parameterized surfaces) and it has no effect on the speed of the algorithm (i.e. still less than a second). The results show that the target registration error is less than 3[Formula: see text]mm (2.53) and the performance of the Fast RBF algorithm is less than a second using a whole heart CT dataset of a single patient taken over the course of the entire cardiac cycle. At the end, the results for recovery (or analysis) of bigger deformation in heart CT images using the Fast RBF algorithm is compared to the state-of-the-art Free Form Deformation (FFD) registration technique. It is proved that the Fast RBF method is performing better in speed and slightly less accurate than the FFD (when measured in terms of NMI) due to iterative nature of the latter.","PeriodicalId":177479,"journal":{"name":"Int. J. Image Graph.","volume":"17 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125917639","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-07-15DOI: 10.1142/S0219467822500309
U. Nnolim
Conventional thresholding algorithms have had limited success with degraded document images. Recently, partial differential equations (PDEs) have been applied with good results. However, these are usually tailored to handle relatively few specific distortions. In this study, we combine an edge detection term with a linear binarization source term in a PDE formulation. Additionally, a new proposed diffusivity function further amplifies desired edges. It also suppresses undesired edges that comprise bleed-through effects. Furthermore, we develop the fractional variant of the proposed scheme, which further improves results and provides more flexibility. Moreover, nonlinear color spaces are utilized to improve binarization results for images with color distortion. The proposed scheme removes document image degradation such as bleed-through, stains, smudges, etc., and also restores faded text in the images. Experimental subjective and objective results show consistently superior performance of the proposed approach compared to the state-of-the-art PDE-based models.
{"title":"Dynamic Selective Edge-Based Integer/Fractional-Order Partial Differential Equation for Degraded Document Image Binarization","authors":"U. Nnolim","doi":"10.1142/S0219467822500309","DOIUrl":"https://doi.org/10.1142/S0219467822500309","url":null,"abstract":"Conventional thresholding algorithms have had limited success with degraded document images. Recently, partial differential equations (PDEs) have been applied with good results. However, these are usually tailored to handle relatively few specific distortions. In this study, we combine an edge detection term with a linear binarization source term in a PDE formulation. Additionally, a new proposed diffusivity function further amplifies desired edges. It also suppresses undesired edges that comprise bleed-through effects. Furthermore, we develop the fractional variant of the proposed scheme, which further improves results and provides more flexibility. Moreover, nonlinear color spaces are utilized to improve binarization results for images with color distortion. The proposed scheme removes document image degradation such as bleed-through, stains, smudges, etc., and also restores faded text in the images. Experimental subjective and objective results show consistently superior performance of the proposed approach compared to the state-of-the-art PDE-based models.","PeriodicalId":177479,"journal":{"name":"Int. J. Image Graph.","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116980037","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-07-14DOI: 10.1142/S0219467822500310
H. Moradi, A. H. Foruzan
Accurate delineation of the prostate in MR images is an essential step for treatment planning and volume estimation of the organ. Prostate segmentation is a challenging task due to its variable size and shape. Moreover, neighboring tissues have a low-contrast with the prostate. We propose a robust and precise automatic algorithm to define the prostate’s boundaries in MR images in this paper. First, we find the prostate’s ROI by a deep neural network and decrease the input image’s size. Next, a dynamic multi-atlas-based approach obtains the initial segmentation of the prostate. A watershed algorithm improves the initial segmentation at the next stage. Finally, an SSM algorithm keeps the result in the domain of allowable prostate shapes. The quantitative evaluation of 74 prostate volumes demonstrated that the proposed method yields a mean Dice coefficient of [Formula: see text]. In comparison with recent researches, our algorithm is robust against shape and size variations.
{"title":"Integration of Dynamic Multi-Atlas and Deep Learning Techniques to Improve Segmentation of the Prostate in MR Images","authors":"H. Moradi, A. H. Foruzan","doi":"10.1142/S0219467822500310","DOIUrl":"https://doi.org/10.1142/S0219467822500310","url":null,"abstract":"Accurate delineation of the prostate in MR images is an essential step for treatment planning and volume estimation of the organ. Prostate segmentation is a challenging task due to its variable size and shape. Moreover, neighboring tissues have a low-contrast with the prostate. We propose a robust and precise automatic algorithm to define the prostate’s boundaries in MR images in this paper. First, we find the prostate’s ROI by a deep neural network and decrease the input image’s size. Next, a dynamic multi-atlas-based approach obtains the initial segmentation of the prostate. A watershed algorithm improves the initial segmentation at the next stage. Finally, an SSM algorithm keeps the result in the domain of allowable prostate shapes. The quantitative evaluation of 74 prostate volumes demonstrated that the proposed method yields a mean Dice coefficient of [Formula: see text]. In comparison with recent researches, our algorithm is robust against shape and size variations.","PeriodicalId":177479,"journal":{"name":"Int. J. Image Graph.","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133972879","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-07-12DOI: 10.1142/S0219467822400010
A. Vasantharaj, P. Rani, Sirajul Huque, K. S. Raghuram, R. Ganeshkumar, Sebahadin Nasir Shafi
Earlier identification of brain tumor (BT) is essential to increase the survival rate of the patients. The commonly used imaging technique for BT diagnosis is magnetic resonance imaging (MRI). Automated BT classification model is required for assisting the radiologists to save time and enhance efficiency. The classification of BT is difficult owing to the non-uniform shapes of tumors and location of tumors in the brain. Therefore, deep learning (DL) models can be employed for the effective identification, prediction, and diagnosis of diseases. In this view, this paper presents an automated BT diagnosis using rat swarm optimization (RSO) with deep learning based capsule network (DLCN) model, named RSO-DLCN model. The presented RSO-DLCN model involves bilateral filtering (BF) based preprocessing to enhance the quality of the MRI. Besides, non-iterative grabcut based segmentation (NIGCS) technique is applied to detect the affected tumor regions. In addition, DLCN model based feature extractor with RSO algorithm based parameter optimization processes takes place. Finally, extreme learning machine with stacked autoencoder (ELM-SA) based classifier is employed for the effective classification of BT. For validating the BT diagnostic performance of the presented RSO-DLCN model, an extensive set of simulations were carried out and the results are inspected under diverse dimensions. The simulation outcome demonstrated the promising results of the RSO-DLCN model on BT diagnosis with the sensitivity of 98.4%, specificity of 99%, and accuracy of 98.7%.
早期发现脑肿瘤对提高患者的生存率至关重要。BT诊断常用的成像技术是磁共振成像(MRI)。为了帮助放射科医生节省时间，提高工作效率，需要自动BT分类模型。由于肿瘤的形状和肿瘤在大脑中的位置不均匀，BT的分类很困难。因此，深度学习(DL)模型可以用于疾病的有效识别、预测和诊断。基于此，本文提出了一种基于深度学习的胶囊网络(DLCN)模型的大鼠群优化(RSO)自动BT诊断方法，命名为RSO-DLCN模型。提出的RSO-DLCN模型采用基于双边滤波(BF)的预处理来提高MRI的质量。此外，采用非迭代grabcut based segmentation (NIGCS)技术检测受影响的肿瘤区域。此外，基于DLCN模型的特征提取器与基于RSO算法的参数优化过程进行了比较。最后，采用基于ELM-SA分类器的极限学习机对BT进行有效分类。为了验证所提出的RSO-DLCN模型的BT诊断性能，进行了大量的仿真，并在不同维度下对结果进行了检验。仿真结果表明，RSO-DLCN模型对BT的诊断具有良好的效果，灵敏度为98.4%，特异性为99%，准确率为98.7%。
{"title":"Automated Brain Imaging Diagnosis and Classification Model using Rat Swarm Optimization with Deep Learning based Capsule Network","authors":"A. Vasantharaj, P. Rani, Sirajul Huque, K. S. Raghuram, R. Ganeshkumar, Sebahadin Nasir Shafi","doi":"10.1142/S0219467822400010","DOIUrl":"https://doi.org/10.1142/S0219467822400010","url":null,"abstract":"Earlier identification of brain tumor (BT) is essential to increase the survival rate of the patients. The commonly used imaging technique for BT diagnosis is magnetic resonance imaging (MRI). Automated BT classification model is required for assisting the radiologists to save time and enhance efficiency. The classification of BT is difficult owing to the non-uniform shapes of tumors and location of tumors in the brain. Therefore, deep learning (DL) models can be employed for the effective identification, prediction, and diagnosis of diseases. In this view, this paper presents an automated BT diagnosis using rat swarm optimization (RSO) with deep learning based capsule network (DLCN) model, named RSO-DLCN model. The presented RSO-DLCN model involves bilateral filtering (BF) based preprocessing to enhance the quality of the MRI. Besides, non-iterative grabcut based segmentation (NIGCS) technique is applied to detect the affected tumor regions. In addition, DLCN model based feature extractor with RSO algorithm based parameter optimization processes takes place. Finally, extreme learning machine with stacked autoencoder (ELM-SA) based classifier is employed for the effective classification of BT. For validating the BT diagnostic performance of the presented RSO-DLCN model, an extensive set of simulations were carried out and the results are inspected under diverse dimensions. The simulation outcome demonstrated the promising results of the RSO-DLCN model on BT diagnosis with the sensitivity of 98.4%, specificity of 99%, and accuracy of 98.7%.","PeriodicalId":177479,"journal":{"name":"Int. J. Image Graph.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114301604","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-07-12DOI: 10.1142/S0219467822500279
Qi Zhang
Raycasting can display volumetric medical data in fine details and reveal crucial inner imaging information, while implicit surface is able to effectively model complex objects with high flexibility, combining these two rendering modalities together will provide comprehensive information of the scene and has wide applications in surgical simulation, image-guided intervention, and medical training. However, medical data rendering is based on texture depth at every sampling point, while mathematically modeled implicit surfaces do not have geometric information in texture space. It is a challenging task to visualize both physical scalar data and virtual implicit surfaces simultaneously. To address this issue, in this paper, we present a new dual-casting ray-based double modality data rendering algorithm and web-based software platform to visualize volumetric medical data and implicit surface in the same browser. The algorithm runs on graphics processing unit and casts two virtual rays from camera to each pixel on the display panel, where one ray travels through the mathematically defined scene for implicit surface rendering and the other one passes the 3D texture space for volumetric data visualization. The proposed algorithm can detect voxel depth information and algebraic surface models along each casting ray and dynamically enhance the visualized dual-modality data with the improved lighting model and transparency adjustment function. Moreover, auxiliary innovative techniques are also presented to enhance the shading and rendering features of interest. Our software platform can seamlessly visualize volumetric medical data and implicit surfaces in the same web browser over Internet.
{"title":"Medical Data and Mathematically Modeled Implicit Surface Real-Rime Visualization in Web Browsers","authors":"Qi Zhang","doi":"10.1142/S0219467822500279","DOIUrl":"https://doi.org/10.1142/S0219467822500279","url":null,"abstract":"Raycasting can display volumetric medical data in fine details and reveal crucial inner imaging information, while implicit surface is able to effectively model complex objects with high flexibility, combining these two rendering modalities together will provide comprehensive information of the scene and has wide applications in surgical simulation, image-guided intervention, and medical training. However, medical data rendering is based on texture depth at every sampling point, while mathematically modeled implicit surfaces do not have geometric information in texture space. It is a challenging task to visualize both physical scalar data and virtual implicit surfaces simultaneously. To address this issue, in this paper, we present a new dual-casting ray-based double modality data rendering algorithm and web-based software platform to visualize volumetric medical data and implicit surface in the same browser. The algorithm runs on graphics processing unit and casts two virtual rays from camera to each pixel on the display panel, where one ray travels through the mathematically defined scene for implicit surface rendering and the other one passes the 3D texture space for volumetric data visualization. The proposed algorithm can detect voxel depth information and algebraic surface models along each casting ray and dynamically enhance the visualized dual-modality data with the improved lighting model and transparency adjustment function. Moreover, auxiliary innovative techniques are also presented to enhance the shading and rendering features of interest. Our software platform can seamlessly visualize volumetric medical data and implicit surfaces in the same web browser over Internet.","PeriodicalId":177479,"journal":{"name":"Int. J. Image Graph.","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125496798","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-07-12DOI: 10.1142/S0219467822500358
H. Ghilas, M. Gagaoua, A. Tari, M. Cheriet
This paper addresses the challenging task of word spotting in Arabic handwritten documents. We proposed a novel feature that we called Spatial Distribution of Ink at Keypoints (SDIK). The proposed feature captures the characteristics of Arabic handwriting concentrated at endpoints and branch points. SDIK feature quantizes the spatial repartition of ink pixels in the neighborhoods of keypoints. The resulting SDIK features are very fast to match, we take this advantage to match a query word with lines images rather than words images. By this matching mechanism, we overcome the hard task of segmenting an Arabic document into words. The method proposed in this study is tested on historical Arabic document with IBN SINA dataset and on modern handwriting with IFN/ENIT database. The obtained results are great of interest for retrieving query words in an Arabic document.
{"title":"Spatial Distribution of Ink at Keypoints (SDIK): A Novel Feature for Word Spotting in Arabic Documents","authors":"H. Ghilas, M. Gagaoua, A. Tari, M. Cheriet","doi":"10.1142/S0219467822500358","DOIUrl":"https://doi.org/10.1142/S0219467822500358","url":null,"abstract":"This paper addresses the challenging task of word spotting in Arabic handwritten documents. We proposed a novel feature that we called Spatial Distribution of Ink at Keypoints (SDIK). The proposed feature captures the characteristics of Arabic handwriting concentrated at endpoints and branch points. SDIK feature quantizes the spatial repartition of ink pixels in the neighborhoods of keypoints. The resulting SDIK features are very fast to match, we take this advantage to match a query word with lines images rather than words images. By this matching mechanism, we overcome the hard task of segmenting an Arabic document into words. The method proposed in this study is tested on historical Arabic document with IBN SINA dataset and on modern handwriting with IFN/ENIT database. The obtained results are great of interest for retrieving query words in an Arabic document.","PeriodicalId":177479,"journal":{"name":"Int. J. Image Graph.","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116702921","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-07-03DOI: 10.1142/s0219467822500395
Tanvi Arora
The coronavirus disease (COVID-19) pandemic that is caused by the SARS-CoV2 has spread all over the world. It is an infectious disease that can spread from person to person. The severity of the disease can be categorized into five categories namely asymptomatic, mild, moderate, severe, and critical. From the reported cases thus, it has been seen that 80% of the cases that test positive with COVID-19 infection have less than moderate complications, whereas 20% of the positive cases develop severe and critical complications. The virus infects the lungs of an individual, therefore, it has been observed that the X-ray and computed tomography (CT) scan images of the infected people can be used by the machine learning-based application programs to predict the presence of the infection. Therefore, in the proposed work, a Convolutional Neural Network model based upon the DenseNet architecture is being used to predict the presence of COVID-19 infection using the CT scan images of the chest. The proposed work has been carried out using the dataset of the CT images from the COVID CT Dataset. It has 349 images marked as COVID-19 positive and 397 images have been marked as COVID-19 negative. The proposed system can categorize the test set images with an accuracy of 91.4%. The proposed method is capable of detecting the presence of COVID-19 infection with good accuracy using the chest CT scan images of the humans.
{"title":"CNN-based Prediction of COVID-19 using Chest CT Images","authors":"Tanvi Arora","doi":"10.1142/s0219467822500395","DOIUrl":"https://doi.org/10.1142/s0219467822500395","url":null,"abstract":"The coronavirus disease (COVID-19) pandemic that is caused by the SARS-CoV2 has spread all over the world. It is an infectious disease that can spread from person to person. The severity of the disease can be categorized into five categories namely asymptomatic, mild, moderate, severe, and critical. From the reported cases thus, it has been seen that 80% of the cases that test positive with COVID-19 infection have less than moderate complications, whereas 20% of the positive cases develop severe and critical complications. The virus infects the lungs of an individual, therefore, it has been observed that the X-ray and computed tomography (CT) scan images of the infected people can be used by the machine learning-based application programs to predict the presence of the infection. Therefore, in the proposed work, a Convolutional Neural Network model based upon the DenseNet architecture is being used to predict the presence of COVID-19 infection using the CT scan images of the chest. The proposed work has been carried out using the dataset of the CT images from the COVID CT Dataset. It has 349 images marked as COVID-19 positive and 397 images have been marked as COVID-19 negative. The proposed system can categorize the test set images with an accuracy of 91.4%. The proposed method is capable of detecting the presence of COVID-19 infection with good accuracy using the chest CT scan images of the humans.","PeriodicalId":177479,"journal":{"name":"Int. J. Image Graph.","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125912805","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：