opencv4.3

基于openCV的gabor函数,一位牛人编写的。希望对大家有用(gabor function based on openCV)

实现了三维超声PNN算法的GPU加速；实现GPU加速的CT圆轨道平板探测器FDK重建算法；提供对canny边缘检测算法的支持；提供交互式graph cut分割方法；实现OSTU分割算法；(Three dimensional ultrasound PNN algorithm GPU acceleration to achieve GPU accelerated CT reconstruction algorithm for circular orbits FDK flat panel detector provide support for canny edge detection algorithm provide interactive graph cut segmentation achieve OSTU segmentation )

数字图像处理用到的标准测试图像，很多图片。(IMP test images。)

：数字水印将感觉不到的信号嵌入到声频、视频和图像中以实现不同的目的。例如: 添加标题和版权保护。首先介绍 了有关数字水印的基本原理、重要属性及其主体框架。然后,将数字水印按不同角度划分为不同种类。讨论了各种各样的数 字水印算法以及数字水印在不同领域的应用,并简要介绍了对数字水印的攻击。最后,给出了数字水印当前的研究现状和发 展形式及前景。(: Digital watermark embedding imperceptible signals to the audio, video and images to achieve different purposes. Example: Add a title and copyright protection. Firstly, the basic principle about digital watermarking, and the main framework of the important attributes. Then, the digital watermark according to different angles into different types. Discussed a wide range of digital watermarking algorithms and digital watermarking applications in different fields, and a brief introduction of the digital watermarking attacks. Finally, the digital watermark of the current situation and development in the form of research and prospects.)

这是一个关于图像处理的程序，能够将像素比较低的图像变成分辨率高的图像.(This is a matter of image processing procedures, can be relatively low-pixel high resolution image into the image.)

图像处理的IPP库使用手册，包括每个函数的使用说明，以及参数的意义。(IPP library of image processing using the manual, including instructions for each function, as well as the significance of the parameters.)

说明：  本程序使用MFC编写了一个能够在同一界面上显示立体图形的三视图的源程序。(This program using MFC wrote a can in the same interface shown on the SanShiTu three-dimensional graph of the source program.)

实现了Thien在他的文章《secret image sharing》中提出的（r，n）门限秘密图像分存方案。 (Thien in his article " secret image sharing" (r, n) Door Threshold Secret Image Sharing Scheme.)

该源程序可以实现BMP图片的压缩(BMP pictures)

实现凸多边形排样，使用临界多边形NFP判断两个凸多边形形是否相交,使用启发式算法提高效率， (Convex polygon nesting, polygon NFP to determine whether two convex polygon-shaped intersection, the use of heuristic algorithms to improve efficiency,)