登录
首页 » Visual C++ » ppbNakagami

ppbNakagami

于 2021-04-12 发布 文件大小:681KB
0 121
下载积分: 1 下载次数: 35

代码说明:

  处理Gamma乘性噪声的PPB方法,考虑了非局部patch的相似性,可处理SAR图像去噪。(The PPB method for multicative noise removal, which based on the Probabilistic Patch similarity.)

文件列表:

ppbNakagami
...........\example_nakagami.m,1114,2010-03-23
...........\exemple_nakagami.m,1114,2010-03-23

...........\plotimage.m,187,2010-03-23
...........\plotimage_sar.m,326,2010-03-23
...........\ppbNakagami.mexa64,637537,2010-03-23
...........\ppbNakagami.mexglx,618644,2010-03-23
...........\ppbNakagami.mexw32,77824,2010-03-23
...........\ppbNakagami.mexw64,263168,2012-05-26
...........\ppb_nakagami.m,6853,2012-05-26
...........\psnr.m,137,2010-03-23
...........\htm" target=_blank>README,2624,2012-05-26
...........\snr.m,129,2010-03-23

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

发表评论

0 个回复

  • algorithm-of-findpath
    绣花问题是连续型的填充,在不同区域的缝制过程中,缝针不能提针,因此不能用一般的离散型区 域填充方法处理。本文运用几何计算和图论理论提出了一个绣花缝针轨迹自动生成算法:先对轮廓走向进行 定义,通过轮廓铅垂方向的局部极值点的分割线将图案从上向下进行分割,采用交点的特征值比较彻底的解 决了分割时的重点问题,将图案区域准确的划分成缝针能一次完成的若干个节点。在此基础上根据节点的邻 接关系建立节点的邻接“图”,通过图论中半哈密尔顿路径或深度遍历方法找到节点的遍历(缝制)序列和每 个节点的缝制方向,最后可对设定的起点、终点和缝针间隔的条件自动提供缝针的走向轨迹。(In the process of embroidering, needle can not hang up for changing to a different area. Therefore, Embroider problem could be abstract as a continuous area-filling work. Considering disperse area-filling methods can not process this problem well. Based on geometry computing and graph theory, an algorithm of finding path of embroidering needle are proposed in this paper. First, outline orientations are defined, and finding all local extreme points of inner outline on their gravitational orientation to build sectioning lines so as to divide the picture. By using intersection point character the overlap point problem was solved perfectly. Therefore, the picture is divided into some nodes which can be finished alone. Then, based on connections of these nodes, an adjacency graph of nodes was built. Using half-Hamilton path or depth-first search method, both embroidering sequence and direction of these nodes could be got from the graph. Finally, from a defined start-point, end-point)
    2012-12-09 23:26:22下载
    积分:1
  • two
    :植物种类识别方法主要是根据叶片低维特征进行自动化鉴定。然而,低维特征不能全面描述叶片信息,识别准确率低,本文提 出一种基于多特征降维的植物叶片识别方法。首先通过数字图像处理技术对植物叶片彩色样本图像进行预处理,获得去除颜色、虫洞、 叶柄和背景的叶片二值图像、灰度图像和纹理图像。然后对二值图像提取几何特征和结构特征,对灰度图像提取 Hu不变矩特征、灰 度共生矩阵特征、局部二值模式特征和 Gabor 特征,对纹理图像提取分形维数,共得到 2183 维特征参数。再采用主成分分析与线性 评判分析相结合的方法对叶片多特征进行特征降维,将叶片高维特征数据降到低维空间。使用降维后的训练样本特征数据对支持向量 机分类器进行训练(plant species identification method is mainly based on blade automatic identification of low dimensional characteristics.However, can not fully describe blade low-dimensional feature information, identification accuracy is low, in this paper A kind of plant leaves recognition method based on multiple feature dimension reduction.First by digital image processing technology to the plant leaf color sample image preprocessing, obtain background color removal, wormhole, petioles, and the blades of a binary image, gray image and texture image.Then the binary image to extract the geometric characteristics and characteristics of structure and characteristics of gray image extraction Hu moment invariants, gray co-occurrence matrix feature, local binary pattern features and Gabor, to extract the fractal dimension of texture image, get 2183 d characteristic parameters.By principal component analysis and linear uation analysis method of combining the characteristics of blade more feature dimensi)
    2017-02-28 09:57:50下载
    积分:1
  • ImageGrayProcessVS2008
    打开bmp位图文件 彩色转灰阶 直方图均衡 直方图规定 灰阶线性化(Open the bmp grayscale bitmap image binarization functions connected domain extraction features)
    2010-06-19 15:17:28下载
    积分:1
  • HarrisCorner
    对输入的一张彩色图像,自己写代码实现Harris Corner 检测算法: 1. 不能直接调用OpenCV 里面与Harris 角点检测相关的一些函数; 2. 只能用C/C++,不能用其他语言; 3. GUI 只能用自带的HighGUI,不能用QT 或其他的; 4. 平台可以用Windows, Linux, MacOS; 5. 显示中间的处理结果及最终的检测结果,包括最大特征值图,最小特征值图,R 图(可以考虑彩色 展示),原图上叠加检测结果等,并将这些中间结果都输出成图像文件; 6. 命令格式: “xxx.exe 图片文件 k 参数(=0.04) Aperture_size(=3)”。(The input of a color image, write your own code to achieve Harris Corner Detection Algorithm: 1. Can not be called directly inside OpenCV some functions associated with the Harris corner detection 2. To only use C/C++, can not be used in other languages 3. GUI only with their own HighGUI, can not use QT or other 4. The platform can be used Windows, Linux, MacOS 5. Display intermediate and final results of the test results, including the largest eigenvalues diagram, the minimum feature value graph , R chart (you can consider color display), picture superimposed on the test results, etc., and these intermediate results are output as an image file 6. Command Format: " xxx.exe picture file k parameters (= 0.04) Aperture_size (= 3 ). " )
    2016-01-04 12:44:23下载
    积分:1
  • disparity2007
    利用SIFT检测两图片的相同点,并获取两幅图像的视差。(SIFT detection using the same picture two points, and to obtain two images of the parallax.)
    2021-05-16 18:30:07下载
    积分:1
  • polygon_merge
    多边形的合并算法,该算法能够实现任意两个多边形(包括凹多边形)的合并.( The polygon merge algorithm, this algorithm can realize wilfully two polygons (including concave polygon) merge )
    2020-11-16 10:39:41下载
    积分:1
  • xiaobo
    结合维纳滤波的小波降噪方法,滤波效果很好(Combination of Wiener filtering of wavelet noise reduction method, filter works well)
    2009-10-24 13:59:40下载
    积分:1
  • HoughMFC
    用OpenCV进行图像处理与工程开发的一个入门示例程序——Hough变换,效果不错(using OpenCV for image processing and development of a project portal sample program-- Hough Transform good results!)
    2006-11-03 21:15:57下载
    积分:1
  • DIC
    通过数字图像相关的方法计算两幅图像之间的位移,计算时间较长,是最基础的DIC,没有优化。(Digital image correlation method to calculate the displacement between the two images, the time is longer, is the most basic DIC, no optimization.)
    2021-03-31 10:59:09下载
    积分:1
  • RC_C++
    说明:  显著性检测的代码,是程明明在12年的CVPR的文章,HC,RC的算法源码。(The code for saliency detection is the source code of Cheng Mingming's CVPR article, HC, RC, in 12 years.)
    2018-03-27 21:14:02下载
    积分:1
  • 696524资源总数
  • 103913会员总数
  • 34今日下载