Description: 摘 要 运动模糊恢复就是利用运动模糊退化的某种先验知识来重建或恢复原有图像 在运动模糊的点扩散函数未知的情况下
: 。 ,
估计运动模糊的点扩散函数是运动模糊恢复的前提和关键 从傅立叶变换的角度对匀速直线运动模糊图像的点扩散函数在频域
。
论证了点扩散函数在频域内的零点特性及模糊图像两次傅立叶同态变换后的方向特性 并提出了利用这中的特点做了理论分析,些特性进行运动模糊方向估计的方法及两种模糊距离的估计方法 实验结果证明了所提出方法的有效性-Abstract motion blur is to use motion blur to restore the degradation of some prior knowledge to rebuild or restore the original image in the motion blur point spread function of the unknown circumstances:. , It is estimated that the motion blur point spread function is a prerequisite for the restoration of motion-blurred and critical perspective from the Fourier transform of the uniform linear motion blurred image of the point spread function in the frequency domain. Demonstrated that the point spread function of the zero in the frequency domain characteristics and the two blurred images after Fourier transform with the direction of state properties and proposed use of the characteristics of this has done a theoretical analysis, some characteristics of the estimated direction of motion-blurred and the two kinds of fuzzy distance estimation results proved the effectiveness of the proposed method Platform: |
Size: 956416 |
Author:zy |
Hits:
Description: 采用OPENCV封装的图像二维DFT运算，通过该类可生成图像二维傅里叶变换矩阵，通过可选参数可调整生成傅里叶矩阵、傅里叶频谱同时可选择对数加强属性增强傅里叶频谱的显示效果。-OPENCV package using two-dimensional DFT computation of image, the image can be generated through such two-dimensional Fourier transform matrix generated by the optional parameter adjustable Fourier matrix, Fourier spectrum also can choose the number of enhancing properties of the enhanced fourier leaves the spectrum display. Platform: |
Size: 1024 |
Author:葛世超 |
Hits:
Description: 付里叶变换的频移特性；付里叶变换的时域卷积特性-Fourier transform of the frequency shift characteristics the Fourier transform of time domain convolution properties Platform: |
Size: 1024 |
Author:亢伟 |
Hits:
Description: 快速傅氏变换（FFT）是离散傅氏变换(DFT)的快速算法，它是根据离散傅氏变换的奇、偶、虚、实等特性，对离散傅立叶变换的算法进行改进获得的。快速傅里叶变换有广泛的应用，如数字信号处理、计算大整数乘法、求解偏微分方程-Fast Fourier Transform (FFT) is the discrete Fourier transform (DFT) in the fast algorithm, which is based on discrete Fourier transform of the odd and even, true, real and other properties, on the discrete Fourier transform algorithm was modified to obtain. Fast Fourier Transform has a wide range of applications such as digital signal processing, computing a large integer multiplication, solution of partial differential equations, etc. Platform: |
Size: 1024 |
Author:KW |
Hits:
Description: 快速傅氏变换（FFT）是离散傅氏变换的快速算法，它是根据离散傅氏变换的奇、偶、虚、实等特性，对离散傅立叶变换的算法进行改进获得的。它对傅氏变换的理论并没有新的发现，但是对于在计算机系统或者说数字系统中应用离散傅立叶变换，可以说是进了一大步。数字信号处理器(DSP)是一种可编程的高性能处理器，近年来发展很快．它不仅适用于数字信号处理，而且在图像处理、语音处理、通信等领域得到了广泛的应用．通用的微处理器在运算速度上很难适应信号实时处理的要求．联沪处理器中集成有高速的乘法器硬件，能快速地进行大量数据的乘法和加法运算。快速傅里叶变换(FFT)的出现使得DFr在实际应用中得到了广泛的应用．-Fast Fourier Transform (FFT) is the Discrete Fourier Transform Algorithm, which is the discrete Fourier transform of the odd and even, true, real and other properties, on the discrete Fourier transform algorithm was modified to obtain. Fourier transform theory it is not a new discovery, but for the computer systems or digital systems using discrete Fourier transform, can be said that a big step into. Digital signal processor (DSP) is a programmable high-performance processor, developed rapidly in recent years. It is not only applicable to digital signal processing, and image processing, speech processing, communications and other fields has been widely used. General computing speed of microprocessors is difficult to adapt in real-time signal processing requirements. Contact Shanghai high-speed processor integrated hardware multiplier, can carry large amounts of data fast multiplication and addition operations. Fast Fourier Transform (FFT) of the DFR s emergence made in practical applic Platform: |
Size: 351232 |
Author:Raymond |
Hits:
Description: 快速傅氏变换，是离散傅氏变换的快速算法，它是根据离散傅氏变换的奇、偶、虚、实等特性，对离散傅立叶变换的算法进行改进获得的-Fast Fourier transform, discrete Fourier Transform Algorithm, which is the discrete Fourier transform of the odd and even, true, real and other properties, on the discrete Fourier transform algorithm to improve access to the Platform: |
Size: 1024 |
Author:林敏 |
Hits:
Description: 快速傅氏变换，是离散傅氏变换的快速算法，它是根据离散傅氏变换的奇、偶、虚、实等特性，对离散傅立叶变换的算法进行改进获得的-Fast Fourier transform, discrete Fourier Transform Algorithm, which is the discrete Fourier transform of the odd and even, true, real and other properties, on the discrete Fourier transform algorithm to improve access to the Platform: |
Size: 1024 |
Author:林敏 |
Hits:
Description: Coefficients a and b control the low and high frequency ranges that the watermark affects. Because of the watermark invariant properties, we embed the watermark only in the Fourier descriptor magnitude. We use the inverse Fourier transform of the Fourier coefficients to produce the watermarked curve L . This watermarking method is also applicable in the control points of B-spline contour representations. In both polygonal curves and in B-spline curves, watermark embedding can create curve discontinuities or curve self-crossing. Platform: |
Size: 265216 |
Author:Mr Leo |
Hits:
Description: This demonstration is intended for people who know something about the theory of the discrete Fourier transform, and who would find it helpful to see some its properties demonstrated graphically, using a programming language.
The demonstration shows the form of the Fourier components of a signal in 1-D and in 2-D, and shows how elementary filtering can be applied in the Fourier domain. Platform: |
Size: 809984 |
Author:aqwerty854 |
Hits:
Description: 提出Radon变换的一系列性质，对于重要性质给予了证明，并且利用广义函数和Fourier变换得到Radon变换的反演定理
-The Radon transform of a series of properties, and give a proof of the important properties, and the use of generalized functions and the Fourier transform of the Radon transform inversion theorem Platform: |
Size: 139264 |
Author:郁杉妮 |
Hits:
Description: A Fast Fourier Transform(FFT) is an efficient algorithm for calculating the discrete Fourier transform of a set of data. A DFT basically decomposes a set of data in time domain into different frequency components. DFT is defined by the following equation:
A FFT algorithm uses some interesting properties of the above formula to simply the calculations. -A Fast Fourier Transform(FFT) is an efficient algorithm for calculating the discrete Fourier transform of a set of data. A DFT basically decomposes a set of data in time domain into different frequency components. DFT is defined by the following equation:
A FFT algorithm uses some interesting properties of the above formula to simply the calculations. Platform: |
Size: 12288 |
Author:krishna |
Hits:
Description: 使用图形化的方法显示傅里叶变换的一些性质(至少应包括时移性质和尺度变换性质)
对于信号的时移和频谱的关系，选择一个信号，让它在时域上作移位，可调节不同的时移大小，然后用软件演示其傅立叶变换在幅度上几乎没有变换，但在相位上会有变化。
对于信号的时间与频率的尺度变换，给出一个信号，保持其幅度不变，让信号的宽度发生变化，再观察其频域的变化。-Using a graphical method to display some of the properties of the Fourier transform (should include at least the time-shift the nature of the nature and scale transformation) for the signal time shift and the relationship of the spectrum, to select a signal, it shift in the time domain, size, then adjust the different time-shifting software demo Fourier transform almost no transformation in amplitude, but there will be changes in the phase. Scale transformation for the time and frequency of the signal, a signal is given, and to maintain a constant amplitude, so that the width of the signal change, and then observe the changes in the frequency domain. Platform: |
Size: 126976 |
Author:郭涯 |
Hits:
Description: 2004年关于分数傅立叶变换的文章 - The centered discrete fractional Fourier transform, properties, computation, and application to linear chirp signals-2004 article on Fractional Fourier Transform- The centered discrete fractional Fourier transform, properties, computation, and application to linear chirp signals Platform: |
Size: 4509696 |
Author:miyalu |
Hits:
Description: FT是一种FT的高效算法，称为快速傅立叶变换（fast Fourier transform），它根据离散傅氏变换的奇、偶、虚、实等特性，对离散傅立叶变换的算法进行改进获得的。(FT is an efficient algorithm for DEFT, called fast U Lie transform (fast Fourier transform). It is obtained by improving the algorithm of discrete U Lie transform according to the odd, even, virtual and real properties of the discrete Fourier transform. fast Fourier transform algorithm can be divided into time extraction algorithm and frequency extraction algorithm.First,the basic principle of FT is briefly introduced.) Platform: |
Size: 4170752 |
Author:wecol |
Hits:
Search - fourier transform properties