Multimodal medical image fusion can help physicians provide more accurate treatment plans for patients, as unimodal images provide limited valid information. To address the insufficient ability of traditional medical ...Multimodal medical image fusion can help physicians provide more accurate treatment plans for patients, as unimodal images provide limited valid information. To address the insufficient ability of traditional medical image fusion solutions to protect image details and significant information, a new multimodality medical image fusion method(NSST-PAPCNNLatLRR) is proposed in this paper. Firstly, the high and low-frequency sub-band coefficients are obtained by decomposing the source image using NSST. Then, the latent low-rank representation algorithm is used to process the low-frequency sub-band coefficients;An improved PAPCNN algorithm is also proposed for the fusion of high-frequency sub-band coefficients. The improved PAPCNN model was based on the automatic setting of the parameters, and the optimal method was configured for the time decay factor αe. The experimental results show that, in comparison with the five mainstream fusion algorithms, the new algorithm has significantly improved the visual effect over the comparison algorithm,enhanced the ability to characterize important information in images, and further improved the ability to protect the detailed information;the new algorithm has achieved at least four firsts in six objective indexes.展开更多
Medical image fusion has been developed as an efficient assistive technology in various clinical applications such as medical diagnosis and treatment planning.Aiming at the problem of insufficient protection of image ...Medical image fusion has been developed as an efficient assistive technology in various clinical applications such as medical diagnosis and treatment planning.Aiming at the problem of insufficient protection of image contour and detail information by traditional image fusion methods,a new multimodal medical image fusion method is proposed.This method first uses non-subsampled shearlet transform to decompose the source image to obtain high and low frequency subband coefficients,then uses the latent low rank representation algorithm to fuse the low frequency subband coefficients,and applies the improved PAPCNN algorithm to fuse the high frequency subband coefficients.Finally,based on the automatic setting of parameters,the optimization method configuration of the time decay factorαe is carried out.The experimental results show that the proposed method solves the problems of difficult parameter setting and insufficient detail protection ability in traditional PCNN algorithm fusion images,and at the same time,it has achieved great improvement in visual quality and objective evaluation indicators.展开更多
Low-Rank and Sparse Representation(LRSR)method has gained popularity in Hyperspectral Image(HSI)processing.However,existing LRSR models rarely exploited spectral-spatial classification of HSI.In this paper,we proposed...Low-Rank and Sparse Representation(LRSR)method has gained popularity in Hyperspectral Image(HSI)processing.However,existing LRSR models rarely exploited spectral-spatial classification of HSI.In this paper,we proposed a novel Low-Rank and Sparse Representation with Adaptive Neighborhood Regularization(LRSR-ANR)method for HSI classification.In the proposed method,we first represent the hyperspectral data via LRSR since it combines both sparsity and low-rankness to maintain global and local data structures simultaneously.The LRSR is optimized by using a mixed Gauss-Seidel and Jacobian Alternating Direction Method of Multipliers(M-ADMM),which converges faster than ADMM.Then to incorporate the spatial information,an ANR scheme is designed by combining Euclidean and Cosine distance metrics to reduce the mixed pixels within a neighborhood.Lastly,the predicted labels are determined by jointly considering the homogeneous pixels in the classification rule of the minimum reconstruction error.Experimental results based on three popular hyperspectral images demonstrate that the proposed method outperforms other related methods in terms of classification accuracy and generalization performance.展开更多
Principal Component Analysis (PCA) is a widely used technique for data analysis and dimensionality reduction, but its sensitivity to feature scale and outliers limits its applicability. Robust Principal Component Anal...Principal Component Analysis (PCA) is a widely used technique for data analysis and dimensionality reduction, but its sensitivity to feature scale and outliers limits its applicability. Robust Principal Component Analysis (RPCA) addresses these limitations by decomposing data into a low-rank matrix capturing the underlying structure and a sparse matrix identifying outliers, enhancing robustness against noise and outliers. This paper introduces a novel RPCA variant, Robust PCA Integrating Sparse and Low-rank Priors (RPCA-SL). Each prior targets a specific aspect of the data’s underlying structure and their combination allows for a more nuanced and accurate separation of the main data components from outliers and noise. Then RPCA-SL is solved by employing a proximal gradient algorithm for improved anomaly detection and data decomposition. Experimental results on simulation and real data demonstrate significant advancements.展开更多
The conventional sparse representation-based image classification usually codes the samples independently,which will ignore the correlation information existed in the data.Hence,if we can explore the correlation infor...The conventional sparse representation-based image classification usually codes the samples independently,which will ignore the correlation information existed in the data.Hence,if we can explore the correlation information hidden in the data,the classification result will be improved significantly.To this end,in this paper,a novel weighted supervised spare coding method is proposed to address the image classification problem.The proposed method firstly explores the structural information sufficiently hidden in the data based on the low rank representation.And then,it introduced the extracted structural information to a novel weighted sparse representation model to code the samples in a supervised way.Experimental results show that the proposed method is superiority to many conventional image classification methods.展开更多
The nonlocal means( NLM) has been widely used in image processing. In this paper,we introduce a modified weight function for NLM denoising, which will compute the nonlocal similarities among the pre-processing pixel p...The nonlocal means( NLM) has been widely used in image processing. In this paper,we introduce a modified weight function for NLM denoising, which will compute the nonlocal similarities among the pre-processing pixel patches instead of the commonly used similarity measure based on noisy observations. By the law of large number,the norm for the pre-processing pixel patches is closer to the norm of the original clean pixel patches,so the proposed weight functions are more optimized and the selected similar patches are more accurate. Experimental results indicate the proposed algorithm achieves better restored results compared to the classical NLM's method.展开更多
Sparse representation has attracted extensive attention and performed well on image super-resolution(SR) in the last decade. However, many current image SR methods face the contradiction of detail recovery and artif...Sparse representation has attracted extensive attention and performed well on image super-resolution(SR) in the last decade. However, many current image SR methods face the contradiction of detail recovery and artifact suppression. We propose a multi-resolution dictionary learning(MRDL) model to solve this contradiction, and give a fast single image SR method based on the MRDL model. To obtain the MRDL model, we first extract multi-scale patches by using our proposed adaptive patch partition method(APPM). The APPM divides images into patches of different sizes according to their detail richness. Then, the multiresolution dictionary pairs, which contain structural primitives of various resolutions, can be trained from these multi-scale patches.Owing to the MRDL strategy, our SR algorithm not only recovers details well, with less jag and noise, but also significantly improves the computational efficiency. Experimental results validate that our algorithm performs better than other SR methods in evaluation metrics and visual perception.展开更多
A super-resolution reconstruction algorithm is proposed. The algorithm is based on the idea of the sparse representation of signals, by using the fact that the sparsest representation of a sig- nal is unique as the co...A super-resolution reconstruction algorithm is proposed. The algorithm is based on the idea of the sparse representation of signals, by using the fact that the sparsest representation of a sig- nal is unique as the constraint of the patched-based reconstruction, and compensating residual errors of the reconstruction results both locally and globally to solve the distortion problem in patch-based reconstruction algorithms. Three reconstruction algorithms are compared. The results show that the images reconstructed with the new algorithm have the best quality.展开更多
A simple and effective image inpainting method is proposed in this paper, which is proved to be suitable for different kinds of target regions with shapes from little scraps to large unseemly objects in a wide range o...A simple and effective image inpainting method is proposed in this paper, which is proved to be suitable for different kinds of target regions with shapes from little scraps to large unseemly objects in a wide range of images. It is an important improvement upon the traditional image inpainting techniques. By introducing a new bijeetive-mapping term into the matching cost function, the artificial repetition problem in the final inpainting image is practically solved. In addition, by adopting an inpainting error map, not only the target pixels are refined gradually during the inpainting process but also the overlapped target patches are combined more seamlessly than previous method. Finally, the inpainting time is dramatically decreased by using a new acceleration method in the matching process.展开更多
With the explosion in the number of digital images taken every day,the demand for more accurate and visually pleasing images is increasing.However,the images captured by modern cameras are inevitably degraded by noise...With the explosion in the number of digital images taken every day,the demand for more accurate and visually pleasing images is increasing.However,the images captured by modern cameras are inevitably degraded by noise,which leads to deteriorated visual image quality.Therefore,work is required to reduce noise without losing image features(edges,corners,and other sharp structures).So far,researchers have already proposed various methods for decreasing noise.Each method has its own advantages and disadvantages.In this paper,we summarize some important research in the field of image denoising.First,we give the formulation of the image denoising problem,and then we present several image denoising techniques.In addition,we discuss the characteristics of these techniques.Finally,we provide several promising directions for future research.展开更多
In recent years,utilizing the low-rank prior information to construct a signal from a small amount of measures has attracted much attention.In this paper,a generalized nonconvex low-rank(GNLR) algorithm for magnetic r...In recent years,utilizing the low-rank prior information to construct a signal from a small amount of measures has attracted much attention.In this paper,a generalized nonconvex low-rank(GNLR) algorithm for magnetic resonance imaging(MRI)reconstruction is proposed,which reconstructs the image from highly under-sampled k-space data.In the algorithm,the nonconvex surrogate function replacing the conventional nuclear norm is utilized to enhance the low-rank property inherent in the reconstructed image.An alternative direction multiplier method(ADMM) is applied to solving the resulting non-convex model.Extensive experimental results have demonstrated that the proposed method can consistently recover MRIs efficiently,and outperforms the current state-of-the-art approaches in terms of higher peak signal-to-noise ratio(PSNR) and lower high-frequency error norm(HFEN) values.展开更多
Due to highly underdetermined nature of Single Image Super-Resolution(SISR)problem,deep learning neural networks are required to be more deeper to solve the problem effectively.One of deep neural networks successful i...Due to highly underdetermined nature of Single Image Super-Resolution(SISR)problem,deep learning neural networks are required to be more deeper to solve the problem effectively.One of deep neural networks successful in the Super-Resolution(SR)problem is ResNet which can render the capability of deeper networks with the help of skip connections.However,zero padding(ZP)scheme in the network restricts benefits of skip connections in SRResNet and its performance as the ratio of the number of pure input data to that of zero padded data increases.In this paper.we consider the ResNet with Partial Convolution based Padding(PCP)instead of ZP to solve SR problem.Since training of deep neural networks using patch images is advantageous in many aspects such as the number of training image data and network complexities,patch image based SR performance is compared with single full image based one.The experimental results show that patch based SRResNet SR results are better than single full image based ones and the performance of deep SRResNet with PCP is better than the one with ZP.展开更多
In this paper, a novel Magnetic Resonance (MR) reconstruction framework which combines image-wise and patch-wise sparse prior is proposed. For addressing, a truncated beta-Bernoulli process is firstly employed to enfo...In this paper, a novel Magnetic Resonance (MR) reconstruction framework which combines image-wise and patch-wise sparse prior is proposed. For addressing, a truncated beta-Bernoulli process is firstly employed to enforce sparsity on overlapping image patches emphasizing local structures. Due to its properties, beta-Bernoulli process can adaptive infer the sparsity (number of non-zero coefficients) of each patch, an appropriate dictionary, and the noise variance simultaneously, which are prerequisite for iterative image reconstruction. Secondly, a General Gaussian Distribution (GGD) prior is introduced to engage image-wise sparsity for wavelet coefficients, which can be then estimated by a threshold denoising algorithm. Finally, MR image is reconstructed by patch-wise estimation, image-wise estimation and under-sampled k-space data with least square data fitting. Experimental results have demonstrated that proposed approach exhibits excellent reconstruction performance. Moreover, if the image is full of similar low-dimensional-structures, proposed algorithm has dramatically improved Peak Signal to Noise Ratio (PSNR) 7~9 dB, with comparisons to other state-of-art compressive sampling methods.展开更多
A broadband microstrip patch antenna was analyzed and designed.Full wave analysis method(FWAM) was employed to show that a stacked microstrip dual patch antenna(SMDPA) might have a much wider bandwidth than that of ...A broadband microstrip patch antenna was analyzed and designed.Full wave analysis method(FWAM) was employed to show that a stacked microstrip dual patch antenna(SMDPA) might have a much wider bandwidth than that of the ordinanry uni patch one.By means of discrete complex image theory(DCIT),the Sommerfeld integrals (SI) involved were accurately calculated at a speed several hundred times faster than numerical integration method(NIM).The feeding structure of the SMDPA was then improved and the bandwidth was extended to about 22% or more for voltage standing wave ratio (VSWR)s≤2 Finally,a matching network was constructed to obtain a bandwidth of about 25% for s≤1.5.展开更多
针对如何充分利用空间特征来达到较高的高光谱图像分类精度的问题,提出了一种基于三维离散小波变换(3D-DWT)与随机补丁网络(RPNet)结合的高光谱图像的地物属性分类算法。在分类过程中,综合3D-DWT提取的特征和RPNet深度学习框架提取的特...针对如何充分利用空间特征来达到较高的高光谱图像分类精度的问题,提出了一种基于三维离散小波变换(3D-DWT)与随机补丁网络(RPNet)结合的高光谱图像的地物属性分类算法。在分类过程中,综合3D-DWT提取的特征和RPNet深度学习框架提取的特征,利用支持向量机(SVM)对特征向量进行分类。所提出的方法在Indian Pines和University of Pavia两个数据集上进行测试,结果表明该方法比现有方法有显著的分类性能的提高。展开更多
The proximal esophagus is rarely examined,and its inspection is often inadequate.Optical chromoendoscopy techniques such as narrow band imaging improve the detection rate of inlet patches in the proximal esophagus,a r...The proximal esophagus is rarely examined,and its inspection is often inadequate.Optical chromoendoscopy techniques such as narrow band imaging improve the detection rate of inlet patches in the proximal esophagus,a region in which their prevalence is likely underestimated.Various studies have reported correlations between these esophageal marks with different issues such as Barrett’s esophagus,but these findings remain controversial.Conflicting reports complicate the process of interpreting the clinical features of esophageal inlet patches and underestimate their importance.Unfortunately,the limited clinical data and statistical analyses make reaching any conclusions difficult.It is hypothesized that inlet patches are correlated with various esophageal and extraesophageal symptoms,diagnoses and the personalized therapeutic management of patients with inlet patches as well as the differential diagnosis for premalignant lesions or early cancers.Due to its potential underdiagnosis,there are no consensus guidelines for the management and follow up of inlet patches.This review focuses on questions that were raised from published literature on esophageal inlet patches in adults.展开更多
基金funded by the National Natural Science Foundation of China,grant number 61302188.
文摘Multimodal medical image fusion can help physicians provide more accurate treatment plans for patients, as unimodal images provide limited valid information. To address the insufficient ability of traditional medical image fusion solutions to protect image details and significant information, a new multimodality medical image fusion method(NSST-PAPCNNLatLRR) is proposed in this paper. Firstly, the high and low-frequency sub-band coefficients are obtained by decomposing the source image using NSST. Then, the latent low-rank representation algorithm is used to process the low-frequency sub-band coefficients;An improved PAPCNN algorithm is also proposed for the fusion of high-frequency sub-band coefficients. The improved PAPCNN model was based on the automatic setting of the parameters, and the optimal method was configured for the time decay factor αe. The experimental results show that, in comparison with the five mainstream fusion algorithms, the new algorithm has significantly improved the visual effect over the comparison algorithm,enhanced the ability to characterize important information in images, and further improved the ability to protect the detailed information;the new algorithm has achieved at least four firsts in six objective indexes.
文摘Medical image fusion has been developed as an efficient assistive technology in various clinical applications such as medical diagnosis and treatment planning.Aiming at the problem of insufficient protection of image contour and detail information by traditional image fusion methods,a new multimodal medical image fusion method is proposed.This method first uses non-subsampled shearlet transform to decompose the source image to obtain high and low frequency subband coefficients,then uses the latent low rank representation algorithm to fuse the low frequency subband coefficients,and applies the improved PAPCNN algorithm to fuse the high frequency subband coefficients.Finally,based on the automatic setting of parameters,the optimization method configuration of the time decay factorαe is carried out.The experimental results show that the proposed method solves the problems of difficult parameter setting and insufficient detail protection ability in traditional PCNN algorithm fusion images,and at the same time,it has achieved great improvement in visual quality and objective evaluation indicators.
基金National Natural Foundation of China(No.41971279)Fundamental Research Funds of the Central Universities(No.B200202012)。
文摘Low-Rank and Sparse Representation(LRSR)method has gained popularity in Hyperspectral Image(HSI)processing.However,existing LRSR models rarely exploited spectral-spatial classification of HSI.In this paper,we proposed a novel Low-Rank and Sparse Representation with Adaptive Neighborhood Regularization(LRSR-ANR)method for HSI classification.In the proposed method,we first represent the hyperspectral data via LRSR since it combines both sparsity and low-rankness to maintain global and local data structures simultaneously.The LRSR is optimized by using a mixed Gauss-Seidel and Jacobian Alternating Direction Method of Multipliers(M-ADMM),which converges faster than ADMM.Then to incorporate the spatial information,an ANR scheme is designed by combining Euclidean and Cosine distance metrics to reduce the mixed pixels within a neighborhood.Lastly,the predicted labels are determined by jointly considering the homogeneous pixels in the classification rule of the minimum reconstruction error.Experimental results based on three popular hyperspectral images demonstrate that the proposed method outperforms other related methods in terms of classification accuracy and generalization performance.
文摘Principal Component Analysis (PCA) is a widely used technique for data analysis and dimensionality reduction, but its sensitivity to feature scale and outliers limits its applicability. Robust Principal Component Analysis (RPCA) addresses these limitations by decomposing data into a low-rank matrix capturing the underlying structure and a sparse matrix identifying outliers, enhancing robustness against noise and outliers. This paper introduces a novel RPCA variant, Robust PCA Integrating Sparse and Low-rank Priors (RPCA-SL). Each prior targets a specific aspect of the data’s underlying structure and their combination allows for a more nuanced and accurate separation of the main data components from outliers and noise. Then RPCA-SL is solved by employing a proximal gradient algorithm for improved anomaly detection and data decomposition. Experimental results on simulation and real data demonstrate significant advancements.
基金This research is funded by the National Natural Science Foundation of China(61771154).
文摘The conventional sparse representation-based image classification usually codes the samples independently,which will ignore the correlation information existed in the data.Hence,if we can explore the correlation information hidden in the data,the classification result will be improved significantly.To this end,in this paper,a novel weighted supervised spare coding method is proposed to address the image classification problem.The proposed method firstly explores the structural information sufficiently hidden in the data based on the low rank representation.And then,it introduced the extracted structural information to a novel weighted sparse representation model to code the samples in a supervised way.Experimental results show that the proposed method is superiority to many conventional image classification methods.
基金National Natural Science Foundations of China(Nos.U1504603,61301229)Key Scientific Research Project of Colleges and Universities in Henan Province,China(Nos.18A120002,19A110014)
文摘The nonlocal means( NLM) has been widely used in image processing. In this paper,we introduce a modified weight function for NLM denoising, which will compute the nonlocal similarities among the pre-processing pixel patches instead of the commonly used similarity measure based on noisy observations. By the law of large number,the norm for the pre-processing pixel patches is closer to the norm of the original clean pixel patches,so the proposed weight functions are more optimized and the selected similar patches are more accurate. Experimental results indicate the proposed algorithm achieves better restored results compared to the classical NLM's method.
文摘Sparse representation has attracted extensive attention and performed well on image super-resolution(SR) in the last decade. However, many current image SR methods face the contradiction of detail recovery and artifact suppression. We propose a multi-resolution dictionary learning(MRDL) model to solve this contradiction, and give a fast single image SR method based on the MRDL model. To obtain the MRDL model, we first extract multi-scale patches by using our proposed adaptive patch partition method(APPM). The APPM divides images into patches of different sizes according to their detail richness. Then, the multiresolution dictionary pairs, which contain structural primitives of various resolutions, can be trained from these multi-scale patches.Owing to the MRDL strategy, our SR algorithm not only recovers details well, with less jag and noise, but also significantly improves the computational efficiency. Experimental results validate that our algorithm performs better than other SR methods in evaluation metrics and visual perception.
基金Supported by the Basic Research Foundation of Beijing Institute of Technology(3050012211105)
文摘A super-resolution reconstruction algorithm is proposed. The algorithm is based on the idea of the sparse representation of signals, by using the fact that the sparsest representation of a sig- nal is unique as the constraint of the patched-based reconstruction, and compensating residual errors of the reconstruction results both locally and globally to solve the distortion problem in patch-based reconstruction algorithms. Three reconstruction algorithms are compared. The results show that the images reconstructed with the new algorithm have the best quality.
基金Supported by the National Natural Science Foundation of China (No. 60403044, No. 60373070) and partly funded by Microsoft Research Asia: Project 2004-Image-01.
文摘A simple and effective image inpainting method is proposed in this paper, which is proved to be suitable for different kinds of target regions with shapes from little scraps to large unseemly objects in a wide range of images. It is an important improvement upon the traditional image inpainting techniques. By introducing a new bijeetive-mapping term into the matching cost function, the artificial repetition problem in the final inpainting image is practically solved. In addition, by adopting an inpainting error map, not only the target pixels are refined gradually during the inpainting process but also the overlapped target patches are combined more seamlessly than previous method. Finally, the inpainting time is dramatically decreased by using a new acceleration method in the matching process.
基金This work is supported by NSFC Joint Fund with Zhejiang Integration of Informatization and Industrialization under Key Project(No.U1609218)the National Nature Science Foundation of China(No.61602277)Shandong Provincial Natural Science Foundation of China(No.ZR2016FQ12).
文摘With the explosion in the number of digital images taken every day,the demand for more accurate and visually pleasing images is increasing.However,the images captured by modern cameras are inevitably degraded by noise,which leads to deteriorated visual image quality.Therefore,work is required to reduce noise without losing image features(edges,corners,and other sharp structures).So far,researchers have already proposed various methods for decreasing noise.Each method has its own advantages and disadvantages.In this paper,we summarize some important research in the field of image denoising.First,we give the formulation of the image denoising problem,and then we present several image denoising techniques.In addition,we discuss the characteristics of these techniques.Finally,we provide several promising directions for future research.
基金National Natural Science Foundations of China(Nos.61362001,61365013,51165033)the Science and Technology Department of Jiangxi Province of China(Nos.20132BAB211030,20122BAB211015)+1 种基金the Jiangxi Advanced Projects for Postdoctoral Research Funds,China(o.2014KY02)the Innovation Special Fund Project of Nanchang University,China(o.cx2015136)
文摘In recent years,utilizing the low-rank prior information to construct a signal from a small amount of measures has attracted much attention.In this paper,a generalized nonconvex low-rank(GNLR) algorithm for magnetic resonance imaging(MRI)reconstruction is proposed,which reconstructs the image from highly under-sampled k-space data.In the algorithm,the nonconvex surrogate function replacing the conventional nuclear norm is utilized to enhance the low-rank property inherent in the reconstructed image.An alternative direction multiplier method(ADMM) is applied to solving the resulting non-convex model.Extensive experimental results have demonstrated that the proposed method can consistently recover MRIs efficiently,and outperforms the current state-of-the-art approaches in terms of higher peak signal-to-noise ratio(PSNR) and lower high-frequency error norm(HFEN) values.
文摘Due to highly underdetermined nature of Single Image Super-Resolution(SISR)problem,deep learning neural networks are required to be more deeper to solve the problem effectively.One of deep neural networks successful in the Super-Resolution(SR)problem is ResNet which can render the capability of deeper networks with the help of skip connections.However,zero padding(ZP)scheme in the network restricts benefits of skip connections in SRResNet and its performance as the ratio of the number of pure input data to that of zero padded data increases.In this paper.we consider the ResNet with Partial Convolution based Padding(PCP)instead of ZP to solve SR problem.Since training of deep neural networks using patch images is advantageous in many aspects such as the number of training image data and network complexities,patch image based SR performance is compared with single full image based one.The experimental results show that patch based SRResNet SR results are better than single full image based ones and the performance of deep SRResNet with PCP is better than the one with ZP.
基金Supported by the National Natural Science Foundation of China (No. 30900328, 61172179)the Fundamental Research Funds for the Central Universities (No.2011121051)the Natural Science Foundation of Fujian Province of China (No. 2012J05160)
文摘In this paper, a novel Magnetic Resonance (MR) reconstruction framework which combines image-wise and patch-wise sparse prior is proposed. For addressing, a truncated beta-Bernoulli process is firstly employed to enforce sparsity on overlapping image patches emphasizing local structures. Due to its properties, beta-Bernoulli process can adaptive infer the sparsity (number of non-zero coefficients) of each patch, an appropriate dictionary, and the noise variance simultaneously, which are prerequisite for iterative image reconstruction. Secondly, a General Gaussian Distribution (GGD) prior is introduced to engage image-wise sparsity for wavelet coefficients, which can be then estimated by a threshold denoising algorithm. Finally, MR image is reconstructed by patch-wise estimation, image-wise estimation and under-sampled k-space data with least square data fitting. Experimental results have demonstrated that proposed approach exhibits excellent reconstruction performance. Moreover, if the image is full of similar low-dimensional-structures, proposed algorithm has dramatically improved Peak Signal to Noise Ratio (PSNR) 7~9 dB, with comparisons to other state-of-art compressive sampling methods.
文摘A broadband microstrip patch antenna was analyzed and designed.Full wave analysis method(FWAM) was employed to show that a stacked microstrip dual patch antenna(SMDPA) might have a much wider bandwidth than that of the ordinanry uni patch one.By means of discrete complex image theory(DCIT),the Sommerfeld integrals (SI) involved were accurately calculated at a speed several hundred times faster than numerical integration method(NIM).The feeding structure of the SMDPA was then improved and the bandwidth was extended to about 22% or more for voltage standing wave ratio (VSWR)s≤2 Finally,a matching network was constructed to obtain a bandwidth of about 25% for s≤1.5.
文摘针对如何充分利用空间特征来达到较高的高光谱图像分类精度的问题,提出了一种基于三维离散小波变换(3D-DWT)与随机补丁网络(RPNet)结合的高光谱图像的地物属性分类算法。在分类过程中,综合3D-DWT提取的特征和RPNet深度学习框架提取的特征,利用支持向量机(SVM)对特征向量进行分类。所提出的方法在Indian Pines和University of Pavia两个数据集上进行测试,结果表明该方法比现有方法有显著的分类性能的提高。
文摘The proximal esophagus is rarely examined,and its inspection is often inadequate.Optical chromoendoscopy techniques such as narrow band imaging improve the detection rate of inlet patches in the proximal esophagus,a region in which their prevalence is likely underestimated.Various studies have reported correlations between these esophageal marks with different issues such as Barrett’s esophagus,but these findings remain controversial.Conflicting reports complicate the process of interpreting the clinical features of esophageal inlet patches and underestimate their importance.Unfortunately,the limited clinical data and statistical analyses make reaching any conclusions difficult.It is hypothesized that inlet patches are correlated with various esophageal and extraesophageal symptoms,diagnoses and the personalized therapeutic management of patients with inlet patches as well as the differential diagnosis for premalignant lesions or early cancers.Due to its potential underdiagnosis,there are no consensus guidelines for the management and follow up of inlet patches.This review focuses on questions that were raised from published literature on esophageal inlet patches in adults.