12 results on '"Linear canonical transforms"'
Search Results
2. A metaplectic perspective of uncertainty principles in the linear canonical transform domain.
- Author
-
Dias, Nuno Costa, de Gosson, Maurice, and Prata, João Nuno
- Subjects
- *
HEISENBERG uncertainty principle , *PHASE space , *SYMPLECTIC spaces , *GEOMETRIC quantization , *WIGNER distribution , *MARGINAL distributions , *RADON transforms - Abstract
We derive Heisenberg uncertainty principles for pairs of Linear Canonical Transforms of a given function, by resorting to the fact that these transforms are just metaplectic operators associated with free symplectic matrices. The results obtained synthesize and generalize previous results found in the literature, because they apply to all signals, in arbitrary dimension and any metaplectic operator (which includes Linear Canonical Transforms as particular cases). Moreover, we also obtain a generalization of the Robertson-Schrödinger uncertainty principle for Linear Canonical Transforms. We also propose a new quadratic phase-space distribution, which represents a signal along two intermediate directions in the time-frequency plane. The marginal distributions are always non-negative and permit a simple interpretation in terms of the Radon transform. We also give a geometric interpretation of this quadratic phase-space representation as a Wigner distribution obtained upon Weyl quantization on a non-standard symplectic vector space. Finally, we derive the multidimensional version of the Hardy uncertainty principle for metaplectic operators and the Paley-Wiener theorem for Linear Canonical Transforms. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
3. A framework of linear canonical Hankel transform pairs in distribution spaces and their applications.
- Author
-
Srivastava, H. M., Kumar, Manish, and Pradhan, Tusharakanta
- Abstract
The motivation of this article stems from the fact that weak solutions of some partial differential equations exist in a distributional sense, even when there are no strong solutions in spaces of continuous functions with the derivatives understood in the classical sense. For 1 ≦ p < ∞ and s ∈ R , we have introduced a new definition for each of the following Sobolev-type spaces: W 1 , μ , ν , α , β s , p , M (I) and W 2 , μ , ν , α , β s , p , M (I)
as subspaces of H 1 , μ , ν , α , β ′ M (I) and H 2 , μ , ν , α , β ′ M (I) ,
respectively, by using a linear canonical Hankel transform pair, where μ , ν , α and β are real parameters and M is a 2 × 2 real (or complex) matrix with determinant equal to 1. Any f ∈ H 1 , μ , ν , α , β ′ M (I) and g ∈ H 2 , μ , ν , α , β ′ M (I) with compact support are shown to be an element of the spaces: W 1 , μ , ν , α , β s , p , M (I) and W 2 , μ , ν , α , β s , p , M (I) ,
respectively, for the large negative value of s. Examples in these spaces are constructed and the corresponding solutions are obtained. We have shown that these spaces turn out to be Hilbert spaces with respect to a certain norm with the dual spaces: W 1 , μ , ν , α , β - s , p , M (I) and W 2 , μ , ν , α , β - s , p , M (I) ,
respectively. Further, if f ∈ W 1 , μ , ν , α , β s , p , M (I) , then x - ν μ + α - 2 ν + 1 f (x) is shown to be bounded. Similarly, if g ∈ W 2 , μ , ν , α , β s , p , M (I) , then x - ν μ - α g (x) is also shown to be bounded. Furthermore, some applications of linear canonical Hankel transform pairs are provided in order to solve some generalized non-homogeneous partial differential equations. Finally, in the concluding section, some motivations and directions are indicated for further researches related to the areas which are considered and discussed in this article. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
4. Sparse representation of two- and three-dimensional images with fractional Fourier, Hartley, linear canonical, and Haar wavelet transforms.
- Author
-
Koç, Aykut, Bartan, Burak, Gundogdu, Erhan, Çukur, Tolga, and Ozaktas, Haldun M.
- Subjects
- *
LINEAR systems , *THREE-dimensional imaging , *WAVELET transforms , *SET theory , *GENERALIZATION - Abstract
Sparse recovery aims to reconstruct signals that are sparse in a linear transform domain from a heavily underdetermined set of measurements. The success of sparse recovery relies critically on the knowledge of transform domains that give compressible representations of the signal of interest. Here we consider two- and three-dimensional images, and investigate various multi-dimensional transforms in terms of the compressibility of the resultant coefficients. Specifically, we compare the fractional Fourier (FRT) and linear canonical transforms (LCT), which are generalized versions of the Fourier transform (FT), as well as Hartley and simplified fractional Hartley transforms, which differ from corresponding Fourier transforms in that they produce real outputs for real inputs. We also examine a cascade approach to improve transform-domain sparsity, where the Haar wavelet transform is applied following an initial Hartley transform. To compare the various methods, images are recovered from a subset of coefficients in the respective transform domains. The number of coefficients that are retained in the subset are varied systematically to examine the level of signal sparsity in each transform domain. Recovery performance is assessed via the structural similarity index (SSIM) and mean squared error (MSE) in reference to original images. Our analyses show that FRT and LCT transform yield the most sparse representations among the tested transforms as dictated by the improved quality of the recovered images. Furthermore, the cascade approach improves transform-domain sparsity among techniques applied on small image patches. [ABSTRACT FROM AUTHOR]
- Published
- 2017
- Full Text
- View/download PDF
5. Optical image encryption based on linear canonical transform with sparse representation.
- Author
-
Qasim, Israa M. and Mohammed, Emad A.
- Subjects
- *
OPTICAL images , *IMAGE encryption , *DATA security , *DATA reduction , *PHASE coding , *SECURITY systems - Abstract
We propose optical image encryption and authentication in the linear canonical transform (LCT) method by using a sparse representation technique. The linearity in the LCT based double random phase encryption (DRPE) system caused the vulnerability of the system. Not only the linearity in the LCT -DRPE system causes the vulnerability of the system but also the LCT order parameter may cause this weakness. Therefore, the encrypted data of double random phase encoding based on LCT is integrated with sparse representation to overcome this weakness. Unlike the traditional DRPE method, only sparse data from the encrypted data is kept for decryption. The numerical simulation proved that the correct authentication results are satisfied despite the use of partially encrypted data. The randomly selective sparse encrypted data reinforces the security of amplitude encoding of DRPE-LCT. Thus, the proposed method added an additional layer to optical security systems. The attacks analysis is implemented in order to show the robustness of the proposed security. In addition, this method has fulfilled the transmission and storage requirements owing to the high reduction of information data. • We propose optical image encryption and authentication method based on LCT. • The sparse strategy was integrated with encryption process to overcome weakness in this method. • The proposed method be able to resist attacks in spite of the use of partially encrypted data. • The method was fulfilled the transmission and storage requirements for reduction of information data. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
6. Independent simultaneous discoveries visualized through network analysis: the case of linear canonical transforms.
- Author
-
Liberman, Sofia and Wolf, Kurt
- Abstract
We describe the structural dynamics of two groups of scientists in relation to the independent simultaneous discovery (i.e., definition and application) of linear canonical transforms. This mathematical construct was built as the transfer kernel of paraxial optical systems by Prof. Stuart A. Collins, working in the ElectroScience Laboratory in Ohio State University. At roughly the same time, it was established as the integral kernel that represents the preservation of uncertainty in quantum mechanics by Prof. Marcos Moshinsky and his postdoctoral associate, Dr. Christiane Quesne, at the Instituto de Física of the Universidad Nacional Autónoma de México. We are interested in the birth and parallel development of the two follower groups that have formed around the two seminal articles, which for more than two decades did not know and acknowledge each other. Each group had different motivations, purposes and applications, and worked in distinct professional environments. As we will show, Moshinsky-Quesne had been highly cited by his associates and students in Mexico and Europe when the importance of his work started to permeate various other mostly theoretical fields; Collins' paper took more time to be referenced, but later originated a vast following notably among Chinese applied optical scientists. Through social network analysis we visualize the structure and development of these two major coauthoring groups, whose community dynamics shows two distinct patterns of communication that illustrate the disparity in the diffusion of theoretical and technological research. [ABSTRACT FROM AUTHOR]
- Published
- 2015
- Full Text
- View/download PDF
7. Sampling theorems for signals periodic in the linear canonical transform domain
- Author
-
Xiao, Li and Sun, Wenchang
- Subjects
- *
SAMPLING theorem , *SIGNALS & signaling , *LINEAR models (Communication) , *CONTACT transformations , *OPTICAL communications , *PERIODIC functions - Abstract
Abstract: In [E. Margolis, Y.C. Eldar, IEEE Trans. Signal Process. 56 (2008) 2728–2745], the authors derived a practical reconstruction formula for bandlimited periodic signals. It was shown that every bandlimited periodic signal can be perfectly reconstructed from finitely many nonuniformly spaced samples taken over a period. In this paper, we generalize this result in a broader sense. We obtain a similar reconstruction formula for a large class of signals, whose linear canonical transforms are bandlimited periodic functions. [Copyright &y& Elsevier]
- Published
- 2013
- Full Text
- View/download PDF
8. Chaos based multiple image encryption using multiple canonical transforms
- Author
-
Singh, Narendra and Sinha, Aloka
- Subjects
- *
CHAOS theory , *DATA encryption , *IMAGE processing , *FOURIER transforms , *MATHEMATICAL mappings , *STOCHASTIC processes , *SIGNAL-to-noise ratio , *SIMULATION methods & models - Abstract
Abstract: We propose a new method for multiple image encryption using linear canonical transforms and chaotic maps. Three linear canonical transforms and three chaotic maps are used in the proposed technique. The three linear canonical transforms that have been used are the fractional Fourier transform, the extended fractional Fourier transform and the Fresnel transform. The three chaotic maps that have been used are the tent map, the Kaplan–Yorke map and the Ikeda map. These chaotic maps are used to generate the random phase masks and these random phase masks are known as chaotic random phase masks. The mean square error and the signal to noise ratio have been calculated. Robustness of the proposed technique to blind decryption has been evaluated. Optical implementation of the technique has been proposed. Experimental and simulations results are presented to verify the validity of the proposed technique. [Copyright &y& Elsevier]
- Published
- 2010
- Full Text
- View/download PDF
9. Unitary Algorithm for Nonseparable Linear Canonical Transforms Applied to Iterative Phase Retrieval
- Author
-
Liang Zhao, John T. Sheridan, and John J. Healy
- Subjects
02 engineering and technology ,Unitary transformation ,01 natural sciences ,Unitary state ,Image (mathematics) ,Image reconstruction techniques ,010309 optics ,symbols.namesake ,0103 physical sciences ,0202 electrical engineering, electronic engineering, information engineering ,Linear canonical transforms ,Discrete transform ,Electrical and Electronic Engineering ,Mathematics ,Phase retrieval ,Applied Mathematics ,020206 networking & telecommunications ,Fractional Fourier transform ,Fourier transform ,Signal Processing ,symbols ,Fourier optics and signal processing ,Algorithm ,Personal sensing ,Interpolation - Abstract
Phase retrieval is an important tool with broad applications in optics. The GerchbergSaxton algorithm has been a workhorse in this area for many years. The algorithm extracts phase information from intensities captured in two planes related by a Fourier transform. The ability to capture the two intensities in domains other than the image and Fourier plains adds flexibility; various authors have extended the algorithm to extract phase from intensities captured in two planes related by other optical transforms, e.g., by free space propagation or a fractional Fourier transform. These generalizations are relatively simple once a unitary discrete transform is available to propagate back and forth between the two measurement planes. In the absence of such a unitary transform, errors accumulate quickly as the algorithm propagates back and forth between the two planes. Unitary transforms are available for many separable systems, but there has been limited work reported on nonseparable systems other than the gyrator transform. In this letter, we simulate a nonseparable system in a unitary way by choosing an advantageous sampling rate related to the system parameters. We demonstrate a simulation of phase retrieval from intensities in the image domain and a second domain related to the image domain by a nonseparable linear canonical transform. This work may permit the use of nonseparable systems in many design problems. Science Foundation Ireland Insight Research Centre
- Published
- 2017
10. Fast and accurate algorithms for quadratic phase integrals in optics and signal processing
- Author
-
Aykut Koc, Haldun M. Ozaktas, and Lambertus Hesselink
- Subjects
Signal processing ,Computer science ,Image processing ,Image encryptions ,Digital computation ,Encryption ,Space-bandwidth product ,Signal ,Image (mathematics) ,Linear canonical transform ,Fast algorithms ,Optics ,Bandwidth ,Sampling (signal processing) ,Design and analysis ,Imaging systems ,Visualization ,Transform theory ,Continuous function ,business.industry ,Bandwidth (signal processing) ,Sampling (statistics) ,Filter (signal processing) ,Linear Canonical Transforms ,Transforms ,Fast and accurate algorithms ,Transformation (function) ,Continuous functions ,Mathematical transformations ,ABCD optics ,business ,Quadratic-Phase Systems ,Algorithm ,Algorithms - Abstract
Conference name: Proceedings of SPIE, Three-Dimensional Imaging, Visualization, and Display 2011 Date of Conference: 27–28 April 2011 The class of two-dimensional non-separable linear canonical transforms is the most general family of linear canonical transforms, which are important in both signal/image processing and optics. Application areas include noise filtering, image encryption, design and analysis of ABCD systems, etc. To facilitate these applications, one need to obtain a digital computation method and a fast algorithm to calculate the input-output relationships of these transforms. We derive an algorithm of NlogN time, N being the space-bandwidth product. The algorithm controls the space-bandwidth products, to achieve information theoretically sufficient, but not redundant, sampling required for the reconstruction of the underlying continuous functions. © 2011 SPIE.
- Published
- 2011
11. Paley–Wiener criterion in linear canonical transform domains
- Author
-
Sharma, K. K., Sharma, Lokesh, and Sharma, Shobha
- Published
- 2015
- Full Text
- View/download PDF
12. Tek bileşenli işaretler için en iyi kısa-zaman Fourier dönüşümü
- Author
-
H.E. Guven
- Subjects
Signal processing ,Mathematical optimization ,Monocomponent signals ,Frequency estimators ,Short-time Fourier transform ,Integration ,Instantaneous phase ,Fractional Fourier transform ,Discrete Fourier transform ,Fourier transforms ,Adaptive filter ,symbols.namesake ,Fourier transform ,Bandwidth ,symbols ,Linear canonical transforms ,Mathematical transformations ,Set theory ,Harmonic wavelet transform ,Algorithm ,Theorem proving ,Mathematics - Abstract
Date of Conference: 28-30 April 2004 Conference Name: 12th Signal Processing and Communications Applications Conference, IEEE 2004 New methods of improving the short-time Fourier transform representation of signals have recently emerged. These methods use linear canonical transforms to bring the signal into a minimal time-bandwidth product form. Here we show that linear canonical transforms are not sufficient to achieve the minimum time-bandwidth product for high-order modulated mono-component signals. Therefore we propose a novel short-time Fourier transform method which requires an adaptive window, making use of an initial instantaneous frequency estimator. The new approach is able to achieve the highest possible resolution for monocomponent signals. Finally, we discuss the benefits of the proposed method.
- Published
- 2004
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.