SOC-and--SOH-of-Li-ion-Batteries

这是一个经典的fourier translate 傅里叶变换的程序 计算图像的中心点并标记和傅里叶频谱图的最大能量环并标记(This is a classic Fourier transform fourier translate the program to calculate the center of the image and mark and Fourier frequency spectrum of the maximum energy ring and mark)

MATLAB可见水印、不可见水印添加程序源代码，可见水印部分采用中值法，不可见部分采用DWT变换。(MATLAB visible watermark, invisible watermark to add the source code, we can see the watermark part in value method, the invisible part on DWT.)

读入图像，对图像进行预处理，随后检测边缘，对得到的图像进行二值化，然后进行hough变换，获得圆边界，将此图与原图叠加，增强边缘(Read in the image, the image pre-processing, followed by edge detection, binarization on the image to get, and then the hough transform to obtain the circular boundary, this map and the original image overlay to enhance the edge)

整个数字水印的程序。包括峰值信躁比的计算，各种攻击后的水印提取等等。(entire digital watermarking process. Including peak impatient than the letter, after the attacks watermark extraction, and so on.)

说明：  一篇介绍cs理论的文章，以及与图像处理结合的概述(conpressin sensor)

说明：  同态滤波利用去除乘性噪声(multiplicative noise)，可以同时增加对比度以及标准化亮度，借此达到图像增强的目的。(Homomorphic filtering can increase contrast and standardize brightness simultaneously by removing multiplicative noise, so as to achieve the purpose of image enhancement.)

下面是基于小波图像去噪的MATLAB源程序，希望对大家有用！ (Below are images based on wavelet denoising MATLAB source, a member of the useful!)

说明：  Jsteg_Mu可批量对JPEG图像进行Jsteg隐写。 Jpeg_Or 为jpeg密写的原始图像的文件夹， Jpeg_Di 为jpeg密写后密写了的图像的文件夹,code_file 为密写的文件,rate 为密写嵌入率.(Jsteg_Mu JPEG images can be batch Jsteg on steganography. Jpeg_Or jpeg steganography for the original image folder, Jpeg_Di as jpeg steganography written after the close of the images folder, code_file written document for the dense, rate for the steganography embedding rate.)

用matlab做的基于小波降噪和自适应滤波的程序，已经调试可以使用。(Program based on wavelet noise reduction and adaptive filtering using matlab, debugging can use.)

广度优先搜索和深度优先搜索在网络拓扑图上的实现。广度优先搜索是从某一节点开始，搜索与其线连接的所有节点，按照广度方向像外扩展，直到不重复遍历所有节点；深度优先搜索是从某一节点开始，沿着其搜索到的第一个节点不断深入下去，当无法再深入的时候，回溯节点，然后再在回溯中的某一节点开始沿另一个方向深度搜索，直到不重复的遍历所有节点。 (Breadth-first search and depth-first search in the network topology is realized. Breadth-first search is started from a node, searching all the nodes connected to its line, in accordance with the breadth direction as extracapsular extension, until no repeat traverse all nodes depth-first search is started from a node along its search to the first nodes deepening it, when it can not go any further, backtracking node, and then back again in the beginning of a node depth search in the other direction until the non-repetition of the traverse all nodes.)