Image+retrieval+matla

能够用 matlab确定模最大值，利用小波变换去噪，对地震信号进行处理(The maximum modulus can be determined by MATLAB, and the seismic signal is processed by wavelet transform denoising.)

说明：  随机中点位移法matlab程序代码，生成三维山地模型(Random Midpoint Displacement Method for Mountains Generation)

二维otsu的快速实验算法，具体可参考相应的文献。(Two-dimensional Otsu rapid test algorithm, specific reference to the corresponding literature.)

说明：  对图像进行小波分解后，并抽取出分解后的垂直高频分量，并将其保存出来。(Image after wavelet decomposition, and to take out after the decomposition of the vertical high-frequency component, and save it out.)

基于差值的可逆水印算法源码，及详解说明。还包括一篇英文论文和该作者的一些理解和解释，希望对大家有帮助(Reversible watermarking algorithm based on difference of source code, and the Detailed Description. Also includes an English papers and some of the author' s understanding and interpretation, we hope to help)

图像处理算法质量评估，图像结构相似度（ssim)评价的matlab实现，并附带原始论文pdf(This is an implementation of the algorithm for calculating the Structural SIMilarity (SSIM) index between two images. Please refer to the following paper: Z. Wang, A. C. Bovik, H. R. Sheikh, and E. P. Simoncelli, "Image quality assessment: From error measurement to structural similarity" IEEE Transactios on Image Processing, vol. 13, no. 1, Jan. 2004.)

Camshift算法，即"Continuously Adaptive Mean-Shift"算法，是一种自适应的运动跟踪算法。它主要通过视频图像中运动物体的颜色信息来达到跟踪目的。(Camshift algorithm, namely " Continuously Adaptive Mean-Shift" algorithm is an adaptive motion tracking algorithm. It is primarily the color information of the object' s movement through the video images to achieve tracking purposes.)

说明：  可对lytro相机所得到的光场图像进行各种处理(The light field image obtained by lytro camera can be processed in various ways.)

基本实现光流法，可以显示出两张图片中，光流的方向。(The basic realization of optical flow method, can show two pictures of the direction of flow.)

绣花问题是连续型的填充，在不同区域的缝制过程中，缝针不能提针，因此不能用一般的离散型区 域填充方法处理。本文运用几何计算和图论理论提出了一个绣花缝针轨迹自动生成算法：先对轮廓走向进行 定义，通过轮廓铅垂方向的局部极值点的分割线将图案从上向下进行分割，采用交点的特征值比较彻底的解 决了分割时的重点问题，将图案区域准确的划分成缝针能一次完成的若干个节点。在此基础上根据节点的邻 接关系建立节点的邻接“图”，通过图论中半哈密尔顿路径或深度遍历方法找到节点的遍历（缝制）序列和每 个节点的缝制方向，最后可对设定的起点、终点和缝针间隔的条件自动提供缝针的走向轨迹。(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)