提出了一种基于分数阶傅里叶变换(FrFT)和混沌的彩色图像加密算法。 将原始彩色图像的颜色转换为HSI(色相饱和度强度),并通过基于FrFT的随机相位编码对S分量进行转换,以获得新的随机相位。 使用H分量和新的随机相位作为两个相位板,通过基于FrFT的双随机相位编码来转换I分量。 然后使用混沌加扰技术对图像进行加密,从而使所得图像在空间域和频域均具有非线性和无序性。 另外,密文不是彩色图像而是灰色图像和相位矩阵的组合,因此密文在某种程度上具有伪装特性。 数值仿真结果证明了该算法的有效性和安全性。
1
matlab希尔伯特变换代码短响应希尔伯特变换 如Pei等人在2008年发表的论文《用于边缘检测的短响应希尔伯特变换》中所述,它是MATLAB对短响应希尔伯特变换的实现。 从MATLAB的内置HILBERT函数改编而成的代码。
2022-03-11 18:11:04 4KB 系统开源
1
on累积分布变换 Radon累积分布变换(Radon-CDT),如下所述: 是非负d维信号的非线性和可逆变换,可确保某些线性分离定理。 该转换建立在累积分布转换(CDT)的基础上,该累积转换描述于: 并将CDT扩展到d维概率分布。 与CDT相似,Radon-CDT也源于最佳质量传输的丰富数学基​​础,并将其与积分几何和Radon变换相结合。 与当前数据广泛的非线性模型(包括深层神经网络及其变体)不同,Radon-CDT提供了定义明确的可逆非线性变换,可与线性建模技术(包括主成分分析,线性判别分析和支持向量机)一起使用( SVM),并且不需要大量的培训数据。 可以在找到与该帖子相对应的iPython Notebook文件。 该演示已通过以下测试: numpy的'1.13.1' sklearn'0.18.1' skimage'0.13.0' scipy'0.19
2022-03-10 11:01:08 3.17MB transform-data radon JupyterNotebook
1
使用拉普拉斯变换求解常微分方程
2022-03-08 22:46:32 1KB matlab
1
掌握three.js的基本用法; 掌握three.js与dom相结合使用; 掌握元素周期表排列的各种形式; 掌握元素周期表排列方式的举一反三;
1
distance_transform  计算区域每个点到区域边缘的距离变换,并将距离信息赋值到图像中。 distance_transform(Region : DistanceImage : Metric, Foreground, Width, Height : ) Region:  (输入)输入区域 DistanceImage:(输出)输出 像素值 为 到边缘距离 的图像 Width, Height :(输入)输出图像的宽  和   高 Foreground:(输入) 若为 true  则计算区域内 所有点到 区域边缘的 距离信息;若为false 则计算 区域外所有点到区域边缘的 距离信息。
2022-02-26 17:02:59 83KB al any c
1
在信号处理中,小波变换效果受到整形参数、小波长度、中心频率、频带宽度及小波个数等参数的制约,特别是整形参数与小波中心频率及频带之间关系对小波变换起到决定性作用。在信号的实际处理中,可选取恰当的整形参数,同时采用合适的小波中心频率以避免小波变换对信号产生的遗漏和冗余,自适应连续小波变换就能达到此目的。
2022-02-24 12:44:12 788KB Adaptive wavelet transform
1
这是一篇介绍快速傅里叶变换的英文论文。其中文翻译在我的博客中有。
2022-02-24 12:18:21 265KB 算法分析
1
1.Transformer原文 2.ViT原文 3.Transformer综述 4.博客:ViT 简单理解 Vision Transformer 地址:https://blog.csdn.net/weixin_43312117/article/details/122922513?spm=1001.2014.3001.5501
2022-02-17 19:11:32 8.22MB Transformer ViT 综述
1
Title: Fast Fourier Transform - Algorithms and Applications Author(s): K.R. Rao, D.N. Kim, J.-J. Hwang (auth.) Series: Signals and Communication Technology Publisher: Springer Netherlands Year: 2010 Edition: 1 Language: English Pages (biblio\tech): 426\437 ISBN: 1402066287, 9781402066283 Fast Fourier Transform - Algorithms and Applications presents an introduction to the principles of the fast Fourier transform (FFT). It covers FFTs, frequency domain filtering, and applications to video and audio signal processing. As fields like communications, speech and image processing, and related areas are rapidly developing, the FFT as one of the essential parts in digital signal processing has been widely used. Thus there is a pressing need from instructors and students for a book dealing with the latest FFT topics. Fast Fourier Transform - Algorithms and Applications provides a thorough and detailed explanation of important or up-to-date FFTs. It also has adopted modern approaches like MATLAB examples and projects for better understanding of diverse FFTs. Fast Fourier Transform - Algorithms and Applications is designed for senior undergraduate and graduate students, faculty, engineers, and scientists in the field, and self-learners to understand FFTs and directly apply them to their fields, efficiently. It is designed to be both a text and a reference. Thus examples, projects and problems all tied with MATLAB, are provided for grasping the concepts concretely. It also includes references to books and review papers and lists of applications, hardware/software, and useful websites. By including many figures, tables, bock diagrams and graphs, this book helps the reader understand the concepts of fast algorithms readily and intuitively. It provides new MATLAB functions and MATLAB source codes. The material in Fast Fourier Transform - Algorithms and Applications is presented without assuming any prior knowledge of FFT. This book is for any professional who wants to have a basic understanding of the latest developments in and applications of FFT. It provides a good reference for any engineer planning to work in this field, either in basic implementation or in research and development. Table of contents : Front Matter....Pages i-xviii Introduction....Pages 1-3 Discrete Fourier Transform....Pages 5-40 Fast Algorithms....Pages 41-110 Integer Fast Fourier Transform....Pages 111-126 Two-Dimensional Discrete Fourier Transform....Pages 127-184 Vector-Radix 2D-FFT Algorithms....Pages 185-193 Nonuniform DFT....Pages 195-234 Applications....Pages 235-316 Back Matter....Pages 317-423
2022-01-26 21:29:57 11.84MB Fast Fourier Algorithms K.R.
1