登录
首页 » matlab » 低照度图像增强算法

低照度图像增强算法

于 2020-07-16 发布 文件大小:4KB
0 327
下载积分: 1 下载次数: 86

代码说明:

  一种可适用于复杂光照环境的低照度图像增强算法,即基于内容感知的自适应对比度提高的增强算法。引入了改进的伽马矫正,可以根据低照度图像的明暗程度自适应的对图像进行预处理。在实验过程中还发现,虽然改进算法有效避免引入大量噪声,但仍有少量噪声存在,为了达到更好的视觉效果,利用改进的双边滤波对增强的图像进行处理,获得最后的增强图像。实验效果显示,该算法可对低照度图像实现理想的增强效果。(A can be applied to complex light environment of low illumination image enhancement algorithm, which based on the content of perception adaptive contrast enhancement algorithm. Introduced the improvement of gamma correction, can according to the low illumination image of light and shade degree adaptive to image preprocessing. In the process of experiment also found that although the improved algorithm effectively avoid introducing a lot of noise, but there still have a small amount of noise, in order to achieve better visual effect, use of improved bilateral filtering to enhance the image processing, finally enhance image. The experimental results showed that the algorithm can achieve a low illumination image enhancement effect. )

文件列表:

复杂光照增强代码
................\bflt.m,976,2015-05-05
................\Demo2.m,1910,2015-06-26
................\gmCD.m,4541,2015-06-26
................\OL.m,1060,2015-06-26

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • 提取不同颜色
    说明:  对图像中不同的颜色进行提取,从而实现图像分割和不同颜色处理(Extracting different colors from images)
    2020-05-06 16:16:54下载
    积分:1
  • densecrf-master
    应用条件随机场进行图像分割 使用方法:将pydensecrf-py27或pydensecrf-py35重命名为pydensecrf,放入C:Program FilesAnaconda3Libsite-packages 运行:python inference.py im1.png anno1.png out.png(Renameing the file "pydensecrf-py27" or "pydensecrf-py35" to the new name "pydensecrf" Puting this file "pydensecrf" in this directory "C:Program FilesAnaconda3Libsite-packages" cd examples/ python inference.py im1.png anno1.png out.png)
    2020-11-25 15:49:32下载
    积分:1
  • computer_vision-master
    图像特征提取,有SIFT、BOW、VLAD、LBP、HOG、FishVector、gist、Metric、colorhist。(Image feature extraction, including SIFT, BOW, VLAD, LBP, HOG, FishVector, gist, Metric, colorhist.)
    2019-07-20 20:53:34下载
    积分:1
  • Hough
    实现Hough直线检测,标记直线的两端点坐标,再对相似的直线做曲线拟合,可以完美实现边缘连接。(Hough line detection, marking a straight line at both ends of point coordinates, similar linear curve fitting, can be the perfect realization of the edge connector.)
    2012-08-27 14:51:42下载
    积分:1
  • StereoRegion
    利用matlabde实现双目立体视觉中,对应图像对的深度信息的获取 (区域匹配算法实现)。(Use of matlab binocular stereo vision, corresponding to the depth of the image information )
    2011-12-19 15:34:12下载
    积分:1
  • target-tracking-radar
    下面是利用卡尔曼滤波的方法,实现雷达对目标的跟踪:一目标沿水平方向运动,起始位置为(-2000米,1000米),运动速度为15米/秒,扫描周期T=2秒, 米,采用蒙特卡洛方法对跟踪滤波器进行仿真,仿真次数为100次。(Below is the use of Kalman filtering method, to achieve the target tracking radar. Parameter :: a target in a horizontal direction, the starting position (2000m, 1000m), the motion speed of 15 m/s, the scan period T = 2 seconds, rice, Monte Carlo method using the tracking filter simulation, simulation 100 times.)
    2013-05-23 16:13:31下载
    积分:1
  • SARimagetargetdectionoverview.pdf
    SAR图像目标检测是SAR ATR(自动目标识别)的关键步骤,也是近年来SAR图像解译应用的一大研究热点.在广泛文献调研的基础上,本文从SAR图像目标检测的历史沿革、研究现状开始,综述了SAR图像目标检测的研究进展及存在问题(SAR image target detection is the SAR ATR (automatic target recognition) a critical step in SAR image interpretation is also applied in recent years, a major research focus. In the extensive literature on the basis of research, this article from the SAR image target detection to the history and study of the status quo began an overview of SAR image target detection Progress and Problems)
    2009-10-22 14:10:02下载
    积分:1
  • matlab-goat
    说明:  MATLAB遗传算法图像边缘检测和图像分割(MATLAB genetic algorithm image edge detection and image segmentation)
    2021-05-13 01:30:03下载
    积分:1
  • downSample
    实现图像下采样,实现的采样方法有最邻近采样法、二次插值法、双三次卷积法。(Image sampling, the sampling method to achieve the nearest neighbor sampling method, the quadratic interpolation, bicubic convolution.)
    2012-06-21 15:32:59下载
    积分:1
  • minimum-spanning-tree
    在一个具有几个顶点的连通图G中,如果存在子图G 包含G中所有顶点和一部分边,且不形成回路,则称G 为图G的生成树,代价最小生成树则称为最小生成树。 (Has several vertices in a connected graph G, if there subgraph G ' contains all vertices of G and part of the side, and does not form a loop, called G' is a spanning tree of G, the minimum cost spanning tree is called minimum spanning tree.)
    2013-08-23 23:06:57下载
    积分:1
  • 696518资源总数
  • 105531会员总数
  • 4今日下载