نتایج جستجو برای: discrete transform
تعداد نتایج: 259234 فیلتر نتایج به سال:
This paper presents the application of radial basis neural networks to the development of a novel method for the condition monitoring and fault diagnosis of synchronous generators. In the proposed scheme, flux linkage analysis is used to reach a decision. Probabilistic neural network (PNN) and discrete wavelet transform (DWT) are used in design of fault diagnosis system. PNN as main part of thi...
Network security is very important when sending confidential data through the network. Cryptography is the science of hiding information, and a combination of cryptography solutions with cognitive science starts a new branch called cognitive cryptography that guarantee the confidentiality and integrity of the data. Brain signals as a biometric indicator can convert to a binary code which can be...
Robustness is a key attribute of spread spectrum (SS) watermarking scheme. It is significantly deteriorated if one tries to achieve high embedding rate keeping other parameters unaltered. In literatures, typically various transformations like DFT, DCT, Fourier–Mellin and wavelet are used for SS multimedia watermarking but little studies have been attempted so far to see what are the possible fa...
This research work presents a new class of non-blind information hiding algorithms that are stego-secure and robust. They are based on some finite domains iterations having the Devaney’s topological chaos property. Thanks to a complete formalization of the approach we prove security against watermark-only attacks of a large class of steganographic algorithms. Finally a complete study of robustn...
Discrete Convolution First of all we need to introduce what we might call the “wraparound” convention. Because the complex numbers wj = e i 2πj N have the property wj±N = wj, which readily extends to wj+mN = wj for any integer m, and since in the discrete Fourier context we represent all N -dimensional vectors as linear combinations of the Fourier vectors Wk whose components are wkj , we make t...
image data require huge amounts of disk space and large bandwidths for transmission. hence, imagecompression is necessary to reduce the amount of data required to represent a digital image. thereforean efficient technique for image compression is highly pushed to demand. although, lots of compressiontechniques are available, but the technique which is faster, memory efficient and simple, surely...
introduction the diagnosis and separation of cancerous tumors in medical images require accuracy, experience, and time, and it has always posed itself as a major challenge to the radiologists and physicians. materials and methods we received 290 medical images composed of 120 mammographic images, ljpeg format, scanned in gray-scale with 50 microns size, 110 mri images including of t1-wighted, t...
Abstract—In digital watermarking, a watermark is embedded into a cover text in such a way that the resulting watermarked signal is robust to certain distortion caused by either standard data processing in a friendly environment or malicious attacks in an unfriendly environment. This paper presents a digital image watermarking based on two dimensional discrete cosines transform (DCT2), two dimen...
The prime-factor decomposition is a fast computational technique for many important digital signal processing operations, such as the convolution, the discrete Fourier transform, the discrete Hartley transform, and the discrete cosine transform (DCT). In this paper, we present a new prime-factor algorithm for the DCT. We also design a prime-factor algorithm for the discrete sine transform which...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید