siftp28pE7p94pA8pE4p

计算一个封闭区域的最小外接矩形的matlab代码。(calculate the minest rect of area)

说明：  独立分量分析，快速独立分量分析，FAST-ICA可以用(Independent component analysis)

Jsteg隐写算法[23][24]由D. Upham提出，该算法将秘密信息嵌入在量化后的DCT系数的LSB上，但值为-1、0、+1的DCT系数例外。提取秘密信息时，也只是将隐藏信息的图像中不等于-1、0、+1的量化DCT系数的LSB取出即可(steganography of jsteg)

对测井曲线进行重构的程序，可以充分利用测井特征曲线所反应的岩性特征信息，完成多信息的融合(Log curve reconstruction procedures)

Video processing and coding algorithms

已知一图像的轮廓，计算该轮廓质心，并标注在图上(A known the outline of image, the contour centroid calculation, and marked on the map )

一种基于DCT变换的数字水印算法的实现过程,水印为伪随机序列，包括嵌入和提取两个过程。其中textmark.m为攻击实验代码。(DCT-based Digital Watermarking Algorithm Transform realize the process, the watermark for the pseudo-random sequence, including both the process of embedding and extraction. Textmark.m experiment in which the attack code.)

说明：  基于contourlet的图像融合利用的融合策略是取像素绝对值最大。此方法用得较少，有学习价值(Contourlet based image fusion using the fusion strategy is to take the absolute value of the maximum pixel. This method is used less, the value of learning)

说明：  利用BP神经网络进行图像分割。主要适用于RGB信息丰富的图像。以RGB为BP网络的三个输入，与对应的灰度图对网络进行训练。(The use of BP neural network image segmentation. RGB is mainly applied to information-rich images. BP network to RGB for the three inputs, with grayscale corresponds to the network training.)

CGAL，Computational Geometry Algorithms Library，计算几何算法库，设计目标是，以C++库的形式，提供方便，高效，可靠的几何算法。CGAL可用于各种需要几何计算的领域，如计算机图形学，科学可视化，计算机辅助设计和建模，地理信息系统，分子生物学，医学成像，机器人运动规划，网格生成，数值方法等等。 　　 计算几何算法库（CGAL），提供计算几何相关的数据结构和算法，诸如三角剖分（2D约束三角剖分及二维和三维Delaunay三角剖分），Voronoi图（二维和三维的点，2D加权Voronoi图，分割Voronoi图等），多边形（布尔操作，偏置），多面体（布尔运算），曲线整理及其应用，网格生成（二维Delaunay网格生成和三维表面和体积网格生成等），几何处理（表面网格简化，细分和参数化等），凸壳算法（2D，3D和dD），搜索结构（近邻搜索，kd树等），插值，形状分析，拟合，距离等。(The goal of the CGAL Open Source Project is to provide easy access to efficient and reliable geometric algorithms in the form of a C++ library. CGAL is used in various areas needing geometric computation, such as: computer graphics, scientific visualization, computer aided design and modeling, geographic information systems, molecular biology, medical imaging, robotics and motion planning, mesh generation, numerical methods... More on the projects using CGAL web page. The Computational Geometry Algorithms Library (CGAL), offers data structures and algorithms like triangulations (2D constrained triangulations, and Delaunay triangulations and periodic triangulations in 2D and 3D), Voronoi diagrams (for 2D and 3D points, 2D additively weighted Voronoi diagrams, and segment Voronoi diagrams), polygons (Boolean operations, offsets, straight skeleton), polyhedra (Boolean operations), arrangements of curves and their applications (2D and 3D envelopes, Minkowski sums), mesh generation (2D Del)