登录
首页 » Visual C++ » image

image

于 2012-05-18 发布 文件大小:2242KB
0 205
下载积分: 1 下载次数: 2

代码说明:

  可以打开各种图像格式,并显示,很好很强大(Can open a variety of image formats)

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

发表评论

0 个回复

  • Hough
    用Visual C++实现Hough变换(Using Visual C++ Achieve Hough Transform)
    2007-12-10 15:02:21下载
    积分:1
  • shuz
    常用数字图像处理,图像变换等功能的实现,锐化平滑等算法(digital image processing)
    2017-10-19 20:54:38下载
    积分:1
  • 0451
    说明:  《visual C++ 开发经验技术宝典》图像锐化处理,主要是将图像的亮度增加,颜色的鲜艳感增强。("Visual C++ development experience Technical Collection," Image sharpening, mainly to increase the brightness of the image, bright sense of color enhancement. )
    2011-02-21 15:16:27下载
    积分:1
  • photoediter
    这是一个简单的图象处理的小软件的原代码,试试吧,不错的(This is a simple image of the original small software code, try it, good)
    2007-05-22 13:54:05下载
    积分:1
  • CvThrehold
    基于opencv实时图像的2值化处理,一定要有摄像头(Opencv-based real-time image processing of two values, there must be a camera)
    2013-11-29 20:29:33下载
    积分:1
  • prient
    静态画图,可以改变图形边框颜色与矩形或椭圆的填充颜色(Static drawing, you can change the fill color graphics border color and rectangular or oval)
    2012-11-22 17:26:00下载
    积分:1
  • HazeRemoval
    暗通道去雾代码,使用c++实现 根据cvpr论文改写(Channel code to the dark fog)
    2011-08-22 08:48:18下载
    积分:1
  • test3
    利用Artoolkit实现了虚拟现实的算法,VS2008下测试通过(Use Artoolkit algorithm to achieve a virtual reality, VS2008 under test)
    2013-12-12 12:39:48下载
    积分:1
  • 统计独立算法求的信息熵
    一幅大小为256×256的256级灰度图像(每像素8bit) 如果图像的各个像素之间是统计独立的,求该图像的信息熵 -离散无记忆信源 如果图像的各个像素之间不是统计独立的,求该图像的信息熵 -图像像素的概率分布模型(A 256 gray scale image (8bit per pixel) with a size of 256 x 256 If each pixel of the image is statistically independent, the information entropy of the image is calculated Discrete memoryless source If each pixel of the image is not statistically independent, the information entropy of the image is calculated Probability distribution model of image pixels)
    2017-11-24 21:49:34下载
    积分:1
  • EDLines 快速直线检测算子
    EDLines是一种快速直线检测算子,2012年在ICCV上提出,也是目前处理直线检测最快的算法之一,该算法包含三个步骤:(1)边缘提取:利用Edge Drawing (ED)算法[28,29]从灰度图像中提取边缘片段;(2)线段检测:利用最小二乘法提取直线段;(3)线段确认:遵循Helmholtz定律,从已提取的直线段中摒弃虚假线段。EDLines算法的优越性得益于Edge Drawing (ED)算法能够从灰度图像中准确、快速、稳定地提取出光滑、完整的边缘片段。Edge Drawing (ED)算法包含以下步骤: (1)采用size=5*5,σ=1的高斯核对灰度图像进行平滑滤波,去除噪声; (2)采用一种常用的梯度算子,如Prewitt、Sobel或Scharr等计算平滑后图像中每个像素点的梯度幅度和梯度方向; (3)将梯度图中邻域内幅度最大的像素点标记为锚点,这些锚点成为图像边缘点(edge elements)的概率很大; (4)将相邻的锚点连接成边缘线。从一个锚点起始,ED利用相邻像素的梯度幅度和方向在梯度为最大值的锚点之间游走。 (Edge Drawing (ED) is our recently-proposed, novel, fast edge detection algorithm. What makes ED stand out the existing edge detectors, e.g., Canny, is the following: While the other edge detectors give out a binary edge image as output, where the etected edge pixels are usually independent, discontinuous entities ED produces a set of edge segments, which are clean, contiguous, i.e., connected, chains of edge pixels. Thus, while the output of the other edge detectors requires urther processing to generate potential object boundaries, which may not even be possible or result in inaccuracies ED not only produces perfectly connected object boundaries by default, but it also achieves this in blazing speed compared to other edge detector.)
    2021-03-22 16:29:16下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载