Otsu2d_Xiefen

图像处理领域中用于处理LDR为HDR图像的程序，即从低动态范围的图像转成高动态范围的图像(The field of image processing procedures for handling LDR HDR images turn into a high dynamic range image from the low dynamic range image)

Image segmentation systems have the potential to dramatically improve the performance of Digital image processing. Segmentation procedures partition an image into its constituent parts or objects. In general, segmentation is one of the most difficult tasks in digital image processing. Detection of salient image regions is useful for applications like image segmentation, adaptive compression, and region-based image retrieval. This problem can be tackled by mapping the pixels into various feature spaces, which are subjected to various grouping algorithms It present a novel method to determine salient regions in images using low-level features of luminance and color. The method is fast, easy to implement and generates high quality saliency maps of the same size and resolution as the input image.

基于多相结构的信道化接收机，sar图像去噪的几种新的方法，小波包分析提取振动信号中的特征频率。( Channelized receiver based on multi-phase structure, Several new methods sar image denoising, Wavelet packet analysis to extract vibration signal characteristic frequency.)

一种特殊的小波图像处理与图像融合技术,可以用于处理图像加密(a wavelet image transform and image code)

这是一种简单的互相关图像匹配算法，已经在matlab环境下测试过，效果很好。附带两张匹配图片(This is a simple cross-correlation image matching algorithm has been tested in the matlab environment, the effect is very good. With two matching pictures)

说明：  针对一维最大类间方差算法(1-Otsu)抗噪性能较低、二维最大类间方差算法(2-Otsu)计算复杂度高、实时性差的问题,提出一种基于改进的萤火虫算法(FA)优化二维Otsu图像分割算法(FA-2-Otsu).(In order to solve the problems of low anti noise performance of 1-otsu, high computational complexity and poor real-time performance of 2-otsu, an improved firefly algorithm (FA) is proposed to optimize the 2-otsu image segmentation algorithm (fa-2-otsu).)

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

说明：  将像素点划分为超像素，便于进行图像处理！(Implementing superpixel segmentation)

稀疏自适应匹配追踪算法，无需稀疏度，就可以重构原始信号。(Sparse adaptive matching pursuit algorithm, without sparsity, we can reconstruct the original signal.)

说明：  可以实现基于matlab的加权平均方法的图像融合，亲测有效。(The weighted average method based on matlab can be used for image fusion)