Ray casting algorithm can obtain a better quality image in volume rendering, however, it exists some problems, such as powerful computing capacity and slow rendering speed. How to improve the re-sampled speed is a key...Ray casting algorithm can obtain a better quality image in volume rendering, however, it exists some problems, such as powerful computing capacity and slow rendering speed. How to improve the re-sampled speed is a key to speed up the ray casting algorithm. An algorithm is introduced to reduce matrix computation by matrix transformation characteristics of re-sampling points in a two coordinate system. The projection of 3-D datasets on image plane is adopted to reduce the number of rays. Utilizing boundary box technique avoids the sampling in empty voxel. By extending the Bresenham algorithm to three dimensions, each re-sampling point is calculated. Experimental results show that a two to three-fold improvement in rendering speed using the optimized algorithm, and the similar image quality to traditional algorithm can be achieved. The optimized algorithm can produce the required quality images, thus reducing the total operations and speeding up the volume rendering.展开更多
A novel approach is proposed for improving adaptive feedback cancellation using a variable step-size affine projection algorithm(VSS-APA) based on global speech absence probability(GSAP).The variable step-size of the ...A novel approach is proposed for improving adaptive feedback cancellation using a variable step-size affine projection algorithm(VSS-APA) based on global speech absence probability(GSAP).The variable step-size of the proposed VSS-APA is adjusted according to the GSAP of the current frame.The weight vector of the adaptive filter is updated by the probability of the speech absence.The performance measure of acoustic feedback cancellation is evaluated using normalized misalignment.Experimental results demonstrate that the proposed approach has better performance than the normalized least mean square(NLMS) and the constant step-size affine projection algorithms.展开更多
The adaptive algorithm used for echo cancellation(EC) system needs to provide 1) low misadjustment and 2) high convergence rate. The affine projection algorithm(APA) is a better alternative than normalized least mean ...The adaptive algorithm used for echo cancellation(EC) system needs to provide 1) low misadjustment and 2) high convergence rate. The affine projection algorithm(APA) is a better alternative than normalized least mean square(NLMS) algorithm in EC applications where the input signal is highly correlated. Since the APA with a constant step-size has to make compromise between the performance criteria 1) and 2), a variable step-size APA(VSS-APA) provides a more reliable solution. A nonparametric VSS-APA(NPVSS-APA) is proposed by recovering the background noise within the error signal instead of cancelling the a posteriori errors. The most problematic term of its variable step-size formula is the value of background noise power(BNP). The power difference between the desired signal and output signal, which equals the power of error signal statistically, has been considered the BNP estimate in a rough manner. Considering that the error signal consists of background noise and misalignment noise, a precise BNP estimate is achieved by multiplying the rough estimate with a corrective factor. After the analysis on the power ratio of misalignment noise to background noise of APA, the corrective factor is formulated depending on the projection order and the latest value of variable step-size. The new algorithm which does not require any a priori knowledge of EC environment has the advantage of easier controllability in practical application. The simulation results in the EC context indicate the accuracy of the proposed BNP estimate and the more effective behavior of the proposed algorithm compared with other versions of APA class.展开更多
Ovarian cancer is one of the three most common gynecological cancers in the world,and is regarded as a priority in terms of women’s cancer.In the past few years,many researchers have attempted to develop and apply ar...Ovarian cancer is one of the three most common gynecological cancers in the world,and is regarded as a priority in terms of women’s cancer.In the past few years,many researchers have attempted to develop and apply artificial intelligence(AI)techniques to multiple clinical scenarios of ovarian cancer,especially in the field of medical imaging.AI-assisted imaging studies have involved computer tomography(CT),ultrasonography(US),and magnetic resonance imaging(MRI).In this review,we perform a literature search on the published studies that using AI techniques in the medical care of ovarian cancer,and bring up the advances in terms of four clinical aspects,including medical diagnosis,pathological classification,targeted biopsy guidance,and prognosis prediction.Meanwhile,current status and existing issues of the researches on AI application in ovarian cancer are discussed.展开更多
A clustering algorithm based on Sparse Projection (SP), called Sparse Projection Clus- tering (SPC), is proposed in this letter. The basic idea is applying SP to project the observed data onto a high-dimensional spars...A clustering algorithm based on Sparse Projection (SP), called Sparse Projection Clus- tering (SPC), is proposed in this letter. The basic idea is applying SP to project the observed data onto a high-dimensional sparse space, which is a nonlinear mapping with an explicit form and the K-means clustering algorithm can be therefore used to explore the inherent data patterns in the new space. The proposed algorithm is applied to cluster a complete artificial dataset and an incomplete real dataset. In comparison with the kernel K-means clustering algorithm, the proposed algorithm is more efficient.展开更多
The real in time computerized tomography (CT) testing of the meso damage propagation law of the whole sandstone failure process under triaxial compression has been completed using the newest specified triaxial loading...The real in time computerized tomography (CT) testing of the meso damage propagation law of the whole sandstone failure process under triaxial compression has been completed using the newest specified triaxial loading equipment corresponding to the CT machine. Through the CT scanning, the clear CT images which include from the microcracks compressed stage to growth stage, bifurcation stage, development stage, crack fracture stage,the rock sample failure until to unloading stage in the different stress states were obtained. The CT values, CT images and the other data have been analyzed. Based on the results of the CT testing of meso damage evolution law of rock,the stress threshold value of meso damage of rock is given, and the stress strain complete process curve of rock is divided into some sections. The initial rock damage propagation law is given in this paper.展开更多
Aimed at the problem of adaptive noise canceling(ANC),three implementary algorithms which are least mean square(LMS) algorithm,recursive least square(RLS) algorithm and fast affine projection(FAP) algorithm,have been ...Aimed at the problem of adaptive noise canceling(ANC),three implementary algorithms which are least mean square(LMS) algorithm,recursive least square(RLS) algorithm and fast affine projection(FAP) algorithm,have been researched.The simulations were made for the performance of these algorithms.The extraction of fetal electrocardiogram(FECG) is applied to compare the application effect of the above algorithms.The proposed FAP algorithm has obvious advantages in computational complexity,convergence speed and steadystate error.展开更多
文摘Ray casting algorithm can obtain a better quality image in volume rendering, however, it exists some problems, such as powerful computing capacity and slow rendering speed. How to improve the re-sampled speed is a key to speed up the ray casting algorithm. An algorithm is introduced to reduce matrix computation by matrix transformation characteristics of re-sampling points in a two coordinate system. The projection of 3-D datasets on image plane is adopted to reduce the number of rays. Utilizing boundary box technique avoids the sampling in empty voxel. By extending the Bresenham algorithm to three dimensions, each re-sampling point is calculated. Experimental results show that a two to three-fold improvement in rendering speed using the optimized algorithm, and the similar image quality to traditional algorithm can be achieved. The optimized algorithm can produce the required quality images, thus reducing the total operations and speeding up the volume rendering.
基金Project(2010-0020163)supported by Basic Science Research Program through the National Research Foundation of Korea(NRF)funded by the Ministry of Education
文摘A novel approach is proposed for improving adaptive feedback cancellation using a variable step-size affine projection algorithm(VSS-APA) based on global speech absence probability(GSAP).The variable step-size of the proposed VSS-APA is adjusted according to the GSAP of the current frame.The weight vector of the adaptive filter is updated by the probability of the speech absence.The performance measure of acoustic feedback cancellation is evaluated using normalized misalignment.Experimental results demonstrate that the proposed approach has better performance than the normalized least mean square(NLMS) and the constant step-size affine projection algorithms.
文摘The adaptive algorithm used for echo cancellation(EC) system needs to provide 1) low misadjustment and 2) high convergence rate. The affine projection algorithm(APA) is a better alternative than normalized least mean square(NLMS) algorithm in EC applications where the input signal is highly correlated. Since the APA with a constant step-size has to make compromise between the performance criteria 1) and 2), a variable step-size APA(VSS-APA) provides a more reliable solution. A nonparametric VSS-APA(NPVSS-APA) is proposed by recovering the background noise within the error signal instead of cancelling the a posteriori errors. The most problematic term of its variable step-size formula is the value of background noise power(BNP). The power difference between the desired signal and output signal, which equals the power of error signal statistically, has been considered the BNP estimate in a rough manner. Considering that the error signal consists of background noise and misalignment noise, a precise BNP estimate is achieved by multiplying the rough estimate with a corrective factor. After the analysis on the power ratio of misalignment noise to background noise of APA, the corrective factor is formulated depending on the projection order and the latest value of variable step-size. The new algorithm which does not require any a priori knowledge of EC environment has the advantage of easier controllability in practical application. The simulation results in the EC context indicate the accuracy of the proposed BNP estimate and the more effective behavior of the proposed algorithm compared with other versions of APA class.
文摘Ovarian cancer is one of the three most common gynecological cancers in the world,and is regarded as a priority in terms of women’s cancer.In the past few years,many researchers have attempted to develop and apply artificial intelligence(AI)techniques to multiple clinical scenarios of ovarian cancer,especially in the field of medical imaging.AI-assisted imaging studies have involved computer tomography(CT),ultrasonography(US),and magnetic resonance imaging(MRI).In this review,we perform a literature search on the published studies that using AI techniques in the medical care of ovarian cancer,and bring up the advances in terms of four clinical aspects,including medical diagnosis,pathological classification,targeted biopsy guidance,and prognosis prediction.Meanwhile,current status and existing issues of the researches on AI application in ovarian cancer are discussed.
基金Supported by the National Natural Science Foundation of China (No.60872123)the Joint Fund of the National Natural Science Foundation and the Guangdong Provin-cial Natural Science Foundation (No.U0835001)
文摘A clustering algorithm based on Sparse Projection (SP), called Sparse Projection Clus- tering (SPC), is proposed in this letter. The basic idea is applying SP to project the observed data onto a high-dimensional sparse space, which is a nonlinear mapping with an explicit form and the K-means clustering algorithm can be therefore used to explore the inherent data patterns in the new space. The proposed algorithm is applied to cluster a complete artificial dataset and an incomplete real dataset. In comparison with the kernel K-means clustering algorithm, the proposed algorithm is more efficient.
基金FundofStateKeyLaboratoryofFrozenSoilEngineeringofChina !(No 980 2 No 2 0 0 3 )
文摘The real in time computerized tomography (CT) testing of the meso damage propagation law of the whole sandstone failure process under triaxial compression has been completed using the newest specified triaxial loading equipment corresponding to the CT machine. Through the CT scanning, the clear CT images which include from the microcracks compressed stage to growth stage, bifurcation stage, development stage, crack fracture stage,the rock sample failure until to unloading stage in the different stress states were obtained. The CT values, CT images and the other data have been analyzed. Based on the results of the CT testing of meso damage evolution law of rock,the stress threshold value of meso damage of rock is given, and the stress strain complete process curve of rock is divided into some sections. The initial rock damage propagation law is given in this paper.
基金the National Key Technologies R&D Program (No. 2006BAI22B01)
文摘Aimed at the problem of adaptive noise canceling(ANC),three implementary algorithms which are least mean square(LMS) algorithm,recursive least square(RLS) algorithm and fast affine projection(FAP) algorithm,have been researched.The simulations were made for the performance of these algorithms.The extraction of fetal electrocardiogram(FECG) is applied to compare the application effect of the above algorithms.The proposed FAP algorithm has obvious advantages in computational complexity,convergence speed and steadystate error.
