共查询到20条相似文献,搜索用时 15 毫秒
1.
We evaluate the use of a smoothed space-frequency distribution (SSFD) to retrieve optical phase maps in digital speckle pattern interferometry (DSPI). The performance of this method is tested by use of computer-simulated DSPI fringes. Phase gradients are found along a pixel path from a single DSPI image, and the phase map is finally determined by integration. This technique does not need the application of a phase unwrapping algorithm or the introduction of carrier fringes in the interferometer. It is shown that a Wigner-Ville distribution with a smoothing Gaussian kernel gives more-accurate results than methods based on the continuous wavelet transform. We also discuss the influence of filtering on smoothing of the DSPI fringes and some additional limitations that emerge when this technique is applied. The performance of the SSFD method for processing experimental data is then illustrated. 相似文献
2.
彩色图像量化的FSCAMMD聚类算法 总被引:5,自引:0,他引:5
提出了一种基于模式识别技术的彩色图像量化的新算法--基于最小距离最大的快速统计聚类算法(FSCAMMD)。本算法克服了SCA算法对聚类中心初始值选取的不足,给出了最大频度与类内最小距离最大相结合的方法--初始值优选法,实验结果表明,本算法可较大幅度地减少图像量化后的总方差以颜色失真度。 相似文献
3.
4.
5.
A. H. Lettington M. P. Rollason S. Tzimopoulou E. Boukouvala 《Journal of Modern Optics》2013,60(5):931-938
Abstract It is known that the distribution of intensity gradients along separate horizontal and vertical directions in an image of a general scene often has a sharp peak with a long tail. This property, can be described by a Lorentzian probability function, and is the basis of an efficient nonlinear one-dimensional restoration algorithm. It can also superresolve a two-dimensional separable image. This paper discusses the gradient distribution in a general two-dimensional image and shows that the distribution of the maximum gradient at any picture point is also Lorentzian. This has been used to develop an iterative two-dimensional restoration algorithm. It starts by evaluating the likelihood of the intensity gradients within a Wiener filtered image. Then a nonlinear correction term is introduced which increases this likelihood under mean square error criterion. The method is applied to synthetic images and to a 94 GHz passive millimetre wave image. This new two-dimensional method is shown to be superior to the previous one-dimensional algorithm which had to be applied separately along two orthogonal directions. 相似文献
6.
基于图像纹理特征的目标快速检索 总被引:1,自引:0,他引:1
在讨论共生矩阵的基础上,提出了一个通过图像分割获取目标图像纹理特征,进而实现图像快速检索的方法。试验表明,该方法检索目标图像的可靠性较高,具有良好的应用价值。 相似文献
7.
A numerical simulation for underwater imaging through a wavy sea surface has been done. We have used a common approach to model the sea surface elevation and its slopes as an important source of image disturbance. The simulation algorithm is based on a combination of ray tracing and optical propagation, which has taken to different approaches for downwelling and upwelling beams. The nature of randomly focusing and defocusing property of surface waves causes a fluctuated irradiance distribution as an illuminating source of immersed object, while it gives rise to a great disturbance on the image through a coordinate change of image pixels. We have also used a modulation transfer function based on Well’s small angle approximations to consider the underwater optical properties effect on the transferring of the image. As expected, the absorption effect reduces the light intensity and scattering decreases image contrast by blurring the image. 相似文献
8.
目的为了解决现有半色调算法产生的图像边界模糊以及视觉蠕虫等问题,研究一种视觉效果较好的半色调图像。方法提出一种在半色调过程中动态分配误差扩散系数的数字半色调方法,减少由固定误差扩散系数和固定扩散方向带来的边界模糊、视觉蠕虫以及结构性纹理等现象。结果文中提出的算法相较于传统的误差扩散算法其PSNR值提高了约0.5,SSIM值提高了约0.06,NSME值下降了约0.06。不仅解决了传统误差扩散算法中的边界模糊现象,同时也更好地表达了半色调图像的细节纹理信息。结论依据提出的算法产生的半色调图像视觉效果较好,并且算法简单易行,运行效率高。 相似文献
9.
结合Zernike矩的多尺度模板形状匹配 总被引:4,自引:1,他引:3
针对形状匹配中小波表达对起始点依赖的问题,提出一种结合Zernike矩的多尺度模板进行形状匹配的方法。该算法对输入图像进行预处理后提取目标轮廓,经过归一化处理得到目标形状的平移、尺度不变的链状表达,再通过小波变换进行多尺度分析;引入Zernike矩,利用Zernike矩的特性,实现小波表达的旋转不变性,解决了小波变换对起始点的依赖。匹配过程是以小波表达的各阶Zernike矩为特征向量,在由粗到精的尺度上进行的。实验结果表明,对于同一目标,原图像与旋转不同角度的图像的正确匹配率为91%。该算法适用于轮廓较明显的目标。 相似文献
10.
Hang Yang Zhongbo Zhang Danyang Wu 《International journal of imaging systems and technology》2012,22(4):233-240
In this article, we propose a new deconvolution algorithm, which is based on image reconstruction from incomplete measurements in Fourier domain. Our algorithm has two steps. First, an initial estimator is obtained using Fourier regularized inverse operator. Second, parts of the estimator's Fourier coefficients are saved, and the others are removed to suppress noise energy, then the remaining coefficients are used to recover image based on the sparse constraints. This image reconstruction problem is an optimization problem that is solved by a fast algorithm named split Bregman iteration. Different from other deconvolution algorithms, our algorithm only uses parts of Fourier components to restore the blurred image and combines two different regularization strategies efficiently by applying a selection matrix. The experiment shows that our method gives better performance than many other competitive deconvolution methods. © 2012 Wiley Periodicals, Inc. Int J Imaging Syst Technol, 22, 233–240, 2012 相似文献
11.
《成像科学杂志》2013,61(6):344-351
AbstractIn this paper, we propose a new deblurring algorithm, which is based on image reconstruction from incomplete measurements in Fourier domain. Our algorithm has two steps. Firstly, an initial estimator is obtained using Fourier regularised inverse operator. Secondly, parts of the estimator’s Fourier coefficients are saved, and the others are removed to suppress noise energy, and then the remaining coefficients are used to recover image based on the sparse constraints. This image reconstruction problem is an optimisation problem which is solved by a fast algorithm named split Bregman iteration. Our algorithm combines two different regularisation strategies efficiently by applying a selection matrix. The tests using images with different blurs and noise produce good results. The experiment shows that our method gives better performance than many other competitive deblurring methods. 相似文献
12.
13.
Electrical capacitance tomography (ECT) is a non-invasive imaging technology that aims at the visualisation of the cross-sectional permittivity distribution of a dielectric object based on the measured capacitance data. Successful applications of ECT depend greatly on the precision and speed of the image reconstruction algorithms. ECT image reconstruction is a typical ill-posed problem, and its solution is unstable, that is, the solution is sensitive to noises in the input data. Methods that ensure the stability of a solution while enhancing the quality of the reconstructed images should be used to obtain a meaningful reconstruction result. An image reconstruction algorithm based on the regularised total least squares (TLS) method that considers the errors in both the sensitivity field matrix and the capacitance data for ECT is presented. The regularised TLS method is extended using a combination robust estimation technique and an extended stabilising functional according to the ill-posed characteristics of ECT, which transforms the image reconstruction problem into an optimisation problem. In addition, the Newton algorithm is employed to solve the objective functional. Numerical simulations indicate that the algorithm is feasible and overcomes the numerical instability of ECT image reconstruction; for the cases of the reconstructed objects considered here, the spatial resolution of the reconstructed images obtained using the algorithm is enhanced; as a result, an efficient method for ECT image reconstruction is introduced. 相似文献
14.
15.
We propose a minimum variation of solution method to determine the optimal regularization parameter for singular value decomposition for obtaining the initial distribution for a Chahine iterative algorithm used to determine the particle size distribution from photon correlation spectroscopy data. We impose a nonnegativity constraint to make the initial distribution more realistic. The minimum variation of solution is a single constraint method and we show that a better regularization parameter may be obtained by increasing the discrimination between adjacent values. We developed the S-R curve method as a means of determining the modest iterative solution from the Chahine algorithm. The S-R curve method requires a smoothing operator. We have used simulated data to verify our new method and applied it to real data. Both simulated and experimental data show that the method works well and that the first derivative smoothing operator in the S-R curve gives the best results. 相似文献
16.
17.
Abstract The distribution of edge values for an image of a general scene often has a sharp peak with a long tail. This property, which can be well described by a Lorentzian probability function, has been used to develop an efficient nonlinear image restoration algorithm for reducing the various artifacts that often arise in the restored images. The algorithm starts with a Wiener filter solution which is used to model the edge image by the Lorentzian function so that the likelihood of the image can be estimated. A nonlinear correction term is then introduced which increases this image likelihood under the mean square error criterion. This process ensures that the resulting image retains its sharpness while reducing the noise and ringing artifacts. An iterative procedure has been developed to implement this method. Computer simulated results show that the algorithm is robust in reducing artifacts and easily implemented. The algorithm also possesses a superresolution capability due to the highly nonlinear property of the correction term. 相似文献
18.
A cellular automaton algorithm is developed that simulates the evolution of a surface due to surface mass transport. The driving force is the reduction of chemical potential differences on the surface. This process is important in the development of microstructure during the sintering of powders. The algorithm is implemented in 2D in a digital image mode, using discrete pixels to represent continuum objects. The heart of the algorithm is a pixel-counting-based method for computing the potential at a pixel located in a digital surface. This method gives an approximate measure of the curvature at the given surface pixel. The sontinuum version of this method is analytically shown to give the true curvature at a point on a continuum surface. The digital version of the curvature computation method is shown to obey the scaling laws derived for the continuum version. Several examples, both quantitative and qualitative, are computed of surfaces evolving under curvature differences, and are shown to agree with the known physics of sintering. 相似文献
19.
20.
A parallel-distributed blind deconvolution method based on a self-organizing neural network is introduced. A large degraded image is segmented into smaller subpatterns. Each subpattern can be used to get a blur function. Moreover, we propose a two-step unsupervised learning method in the self-organizing neural network. The two-step learning method includes parallel learning and series learning operations. The series learning operation is similar to a typical learning operation in the self-organizing neural network. The parallel learning operation is used as a positive perturbation to let the learning operation leave a local minimum. Several improved blur functions can be estimated from the different subpatterns, and the optimized blur function is evolved by use of a genetic algorithm. As the blur function is estimated, the source image of the large degraded image can be easily restored by use of a Wiener-type filter or other deconvolution methods. Computer simulations show that the proposed parallel-distributed blind deconvolution method gives good reconstruction and that the two-step learning method in the self-organizing neural network can promote learning. Since the main computational cost is dependent on the size of the subpattern, the proposed method is effective for the restoration of the large image. 相似文献