共查询到20条相似文献,搜索用时 468 毫秒
1.
Faming Liang 《Journal of statistical physics》2006,122(3):511-529
The flat histogram Monte Carlo algorithms have been successfully used in many problems in scientific computing.However, there
is no a rigorous theory for the convergence of the algorithms. In this paper, a modified flat histogram algorithm is presented
and its convergence is studied. The convergence of the multicanonical algorithm and the Wang-Landau algorithm is argued based
on their relations to the modified algorithm. The numerical results show the superiority of the modified algorithm to the
multicanonical and Wang-Landau algorithms.
PACS number: 02.70.Tt, 02.50.Ng 相似文献
2.
Image contrast enhancement using adjacent-blocks-based modification for local histogram equalization
Infrared images usually have some non-ideal characteristics such as weak target-to-background contrast and strong noise. Because of these characteristics, it is necessary to apply the contrast enhancement algorithm to improve the visual quality of infrared images. Histogram equalization (HE) algorithm is a widely used contrast enhancement algorithm due to its effectiveness and simple implementation. But a drawback of HE algorithm is that the local contrast of an image cannot be equally enhanced. Local histogram equalization algorithms are proved to be the effective techniques for local image contrast enhancement. However, over-enhancement of noise and artifacts can be easily found in the local histogram equalization enhanced images. In this paper, a new contrast enhancement technique based on local histogram equalization algorithm is proposed to overcome the drawbacks mentioned above. The input images are segmented into three kinds of overlapped sub-blocks using the gradients of them. To overcome the over-enhancement effect, the histograms of these sub-blocks are then modified by adjacent sub-blocks. We pay more attention to improve the contrast of detail information while the brightness of the flat region in these sub-blocks is well preserved. It will be shown that the proposed algorithm outperforms other related algorithms by enhancing the local contrast without introducing over-enhancement effects and additional noise. 相似文献
3.
4.
M. Bayindir Z. Gedik 《The European Physical Journal B - Condensed Matter and Complex Systems》1999,10(2):287-291
We show explicitly that the broad histogram single-spin-flip random walk dynamics does not give correct microcanonical average
even in one dimension. The dynamics violates the detailed balance condition by an amount proportional to the inverse system
size. As a result, in distribution different configurations with the same energy can have different probabilities. We propose
a modified dynamics which ensures detailed balance and the histogram obtained from this dynamics is exactly flat. The broad
histogram equation relating the average number of potential moves to density of states is generally valid.
Received 2 October 1998 and Received in final form 13 October 1998 相似文献
5.
6.
针对闪光造成的光照变化会导致视频帧之间巨大的强度差异问题,提出利用反向投影的flash场景自适应视频编码算法。根据直方图差异提取闪光和非闪光帧,相应地为每个帧分配适当的编码类型,并在加权预测(WP)参数集确定中采用运动向量导数,通过反向投影保证flash场景的全局一致性。实验结果表明,相比其他几种加权预测算法,本文算法在峰值信噪比(PSNR)及计算复杂度方面获得了更加优越的编码性能。 相似文献
7.
We introduce a new class of models for polymer collapse, given by random walks on regular lattices which are weighted according to multiple site visits. A Boltzmann weight omegal is assigned to each (l+1)-fold visited lattice site, and self-avoidance is incorporated by restricting to a maximal number K of visits to any site via setting omegal=0 for l>or=K. In this Letter we study this model on the square and simple cubic lattices for the case K=3. Moreover, we consider a variant of this model, in which we forbid immediate self-reversal of the random walk. We perform simulations for random walks up to n=1024 steps using FlatPERM, a flat histogram stochastic growth algorithm. We find evidence that the existence of a collapse transition depends sensitively on the details of the model and has an unexpected dependence on dimension. 相似文献
8.
Otsu algorithm, an automatic thresholding method, is widely used in classic image segmentation applications. In this paper, a novel two-dimensional (2D) Otsu thresholding algorithm based on local grid box filter is proposed. In our method, firstly by utilizing the coarse-to-fine idea, the 2D histogram is divided into regions by grid technique, and each region is used as a point to form a new 2D histogram, to which 2D Otsu thresholding algorithm and an improved particle swarm optimization (PSO) algorithm are applied to get the region number of the new 2D histogram threshold. Then on the result region, the mean of the 2D histogram is computed base on box filter, and the two algorithms are applied again to obtain the final threshold for the original image. Experimental results on real data show that the proposed algorithm gets better segmentation results than the traditional recursion Otsu algorithm. It significantly reduces the time of segmentation process and simultaneously has the higher segmentation accuracy. 相似文献
9.
10.
A blind deconvolution algorithm with spatially adaptive total variation regularization is introduced. The spatial information in different image regions is incorporated into regularization by using the edge indicator called difference eigenvalue to distinguish edges from flat areas. The proposed algorithm can effectively reduce the noise in flat regions as well as preserve the edge and detailed information. Moreover, it becomes more robust with the change of the regularization parameter. Comparative results on simulated and real degraded images are reported. 相似文献
11.
单个矢量水听器直方图算法具有良好的鲁棒性和目标方位估计性能,该文对直方图算法目标探测性能进行了分析和总结,并提出了一种基于目标方位估计的水中目标自主探测与跟踪算法,该算法可实现水中目标有无自主检测。仿真和消声水池测试结果表明,直方图算法实现目标自主跟踪所要求的信噪比需大于-7 dB,此时测向误差约为8°,-3 dB方位谱宽度在20°左右。海上试验数据分析表明,直方图算法对航速8.4 kn的水面航船在距离13.8 km范围内,可实现全程目标探测和跟踪,测向误差最优可达5?,在距离2 km时-3 dB方位谱宽度可达10°左右。 相似文献
12.
Yoshiaki Ueda Takanori Koga Hideaki Misawa Noriaki Suetake Eiji Uchino 《Optical Review》2017,24(3):406-415
In the present paper, we propose an image contrast enhancement method that can enhance the contrast of a color image naturally by taking account of a color space shape. The proposed method realizes the natural enhancement based on two kinds of intensity histograms: a gradient-norm-based histogram and an ideal histogram derived from the shape of a color space. The former histogram is used to suppress over-enhancement in the flat regions of an image and the latter histogram is used to prevent the whole image from being darken. Concretely, the aforementioned intensity histograms are appropriately mixed into a histogram with a weight based on the average intensity of the input image. The contrast enhancement of the input image is realized using the cumulative histogram of the mixed histogram as an intensity transform function. To verify the validity of the proposed method, in experiments, the proposed method is applied to a variety of images and experimental results are evaluated qualitatively and quantitatively. 相似文献
13.
14.
15.
基于直方图变换的多光谱图像3D SPIHT压缩编码算法 总被引:2,自引:0,他引:2
提出了新的多光谱图像压缩方案,直方图变换的三维分层树的集划分(3D SPIHT)压缩编码算法。基于多光谱图像的成像特点,在去相关之前,提出一种可逆的直方图变换方法对多光谱各波段图像灰度值进行调整,来提高各波段间的相关性,然后再对变换后的图像利用K_L和二维小波变换去除谱间冗余和空间冗余。小波编码采用两种编码方案:3D_SPIHT以及对它进行改进后的三维位平面的SPIHT算法,并对两者进行了比较。实验表明,采用直方图变换的这两种方法都获得了良好的效果,比没变换前有更好的图像质量和压缩性能。 相似文献
16.
提出了一种在倾斜刃边法的基础上进行部分改进的方法。该方法由Canny算子检测采集到的图像中的刃边分割位置,结合刃边图像直方图呈双峰性的特点,利用类间方差最大化阈值分割算法(Otsu)计算对Canny算子性能具有决定意义的高阈值。以刃边区域中每行的质心为ESF中心位置,以0.1亚像素间距对Canny检测下每一行的分割位置及其刃边邻域像素进行离散采样,将获得的二维刃边信息数据沿着刃边方向整体投影成一维数据,得到提高采样率下平均处理的ESF。增加了测量结果的信噪比,运用该方法进行了实验室CCD相机整机系统的调制传递函数测试,对实验中影响MTF测试精度的因素进行了分析。实验测得在奈奎斯特频率处与理论值误差在5%以内。 相似文献
17.
Der-Chyuan Lou Chao-Lung Chou Hao-Kuan Tso Chung-Cheng Chiu 《Optics Communications》2012,285(10-11):2510-2518
This paper presents an innovative active steganalysis algorithm for reversible data hiding schemes based on histogram shifting. These schemes use histogram shifting to embed secret data in cover-images. However, some histogram patterns originating during the embedding procedure may be recognized readily by a steganalyst. The proposed algorithm analyzes the characteristics of histogram changing during the data embedding procedure, and then models these features into reference templates by using a 1 × 4 sliding window. A support vector machine is trained as the classifier for discriminating between cover-images and stego-images by adopting the template matching techniques. The hidden messages located at the histogram peak of the cover-image were further estimated by measuring the feature of adjacent histogram differences. Experimental results indicate that the proposed active steganalysis algorithm can effectively detect stego-images at low bit rates and estimate the hidden messages locations. 相似文献
18.
Visnja Ognjenovic Vladimir Brtka Jelena Stojanov Eleonora Brtka Ivana Berkovic 《Entropy (Basel, Switzerland)》2022,24(5)
The preprocessing of data is an important task in rough set theory as well as in Entropy. The discretization of data as part of the preprocessing of data is a very influential process. Is there a connection between the segmentation of the data histogram and data discretization? The authors propose a novel data segmentation technique based on a histogram with regard to the quality of a data discretization. The significance of a cut’s position has been researched on several groups of histograms. A data set reduct was observed with respect to the histogram type. Connections between the data histograms and cuts, reduct and the classification rules have been researched. The result is that the reduct attributes have a more irregular histogram than attributes out of the reduct. The following discretization algorithms were used: the entropy algorithm and the Maximal Discernibility algorithm developed in rough set theory. This article presents the Cuts Selection Method based on histogram segmentation, reduct of data and MD algorithm of discretization. An application on the selected database shows that the benefits of a selection of cuts relies on histogram segmentation. The results of the classification were compared with the results of the Naïve Bayes algorithm. 相似文献
19.
20.
A quantitative measure based infrared image enhancement algorithm using plateau histogram 总被引:3,自引:0,他引:3
A quantitative measure based scene-adaptive contrast enhancement algorithm for an infrared (IR) image is proposed. This method regulates the probability density function (PDF) of the raw image firstly, and then applies an improved plateau histogram equalization method whose plateau threshold is determined by the concavity of the regulated PDF to enhance the raw IR image. In the stepped parameter tuning process of the algorithm, quantitative measure EME is used as the criterion to determine the optimal PDF regulator factor and plateau threshold. The above improvements contribute to the performance promotion of the proposed algorithm, whose effectiveness is validated by the final assessment with visual quality and quantitative measures. 相似文献