Anamorphic stretch transform

From Wikipedia, the free encyclopedia
  (Redirected from Anamorphic Stretch Transform)
Jump to: navigation, search

An anamorphic stretch transform (AST) also referred to as warped stretch transform is a physics-inspired signal transform that emerged from time stretch dispersive Fourier transform. The transform can be applied to analog temporal signals such as communication signals, or to digital spatial data such as images.[1][2] The transform reshapes the data in such a way that its output has properties conducive for data compression and analytics. The reshaping consists of warped stretching in Fourier domain. The name “Anamorphic” is used because of the metaphoric analogy between the warped stretch operation and warping of images in anamorphosis[3] and surrealist artworks.[4]

Operation principle[edit]

An anamorphic stretch transform (AST)[5][6] is a mathematical transformation in which analog or digital data is stretched and warped in a context-aware manner, such that it results in nonuniform Fourier domain sampling. The transformation is defined as:

where is the input optical spectrum, is the spectral phase added by AST ( being the AST warp kernel), and and denote the optical and envelope modulation frequencies, respectively. The detailed of the reshaping depends on the sparsity and redundancy of the input signal and can be obtained by a mathematical function, which is called "stretched modulation distribution" or "modulation intensity distribution" (not to be confused with a different function of the same name used in mechanical diagnostics).

The stretched modulation distribution is a 3D representation of a type of bilinear time–frequency distribution similar, but not the same, as other time-frequency distributions.[7][8][9][10] One can interpret the added phasor term to represent the effect of a time-shift on of the spectral autocorrelation of the signal. As a result, the distribution can be used to show the effects of the AST spectral phase on the temporal duration and intensity envelope bandwidth of the output signal, which is useful in visualizing the time-bandwidth product of the signal.[11]

Sparsity requirement[edit]

AST applies a tailored group dispersion to different spectral features.[11][12][13][14] By matching the group delay dispersion to the spectrum of the particular signal of interest, it performs frequency to time mapping in a tailored fashion. Information rich portions of the spectrum are stretched in time more than sparse regions of the spectrum making them easier to capture with a real-time analog to digital converter (ADC), similar to the methodology used in time-stretch ADC technology. This property has been called "self-adaptive stretching". Because the operation is specific to the spectrum of the signal, it does not require knowledge about the instantaneous time domain behavior of the signal. Hence no real-time adaptive control is needed. The parameters of AST are designed using the statistical spectral (not instantaneous) property of signal family of interest in the target application.[15] Once the parameters are designed, they do not need to respond to the instantaneous value of the signal. The resulting non-uniform sampling, where information rich portions of the signal are sampled at a higher rate than the sparse regions, can be exploited for data compression. As any other data compression method, the maximum compression that can be achieved using AST is signal dependent.[14]

Limitations and Challenges[edit]

The reconstruction accuracy and lossy nature of this compression method have been analyzed previously.[14] The system reshapes the spectro-temporal structure of the signal such that nearly all the signal energy is within the bandwidth of the real-time digitizer of the acquisition system. Because of the limited bandwidth and the limited resolution of the digitizer, as measured by its effective number of bits (ENOB), the reconstruction will never be ideal, and therefore, this is a lossy compression method. Because of this, only modest amount of compression can be achieved in practice.

Alternatively, the reconstruction process can be greatly simplified if the information desired is encoded in the spectral envelope of the input signal instead of the temporal envelope. In such a scenario, the true output can be reconstructed simply by directly de-warping the measured output given the designed warp kernel. This has been achieved experimentally for optical image compression.[16]

Digital Implementation[edit]

In the digital implementation of AST (DAST) that is performed in 2D and applied to digital images, an appropriately designed warp kernel stretches the input in a way that reduces the overall spatial bandwidth and hence the sampling requirement. The previous equation for AST can be rewritten in discrete form for DAST as:


where is the digital version of the warp kernel. Similar to the case of 1-D temporal waveforms, the warped waveform can then be sampled at a lower rate than what was previously possible with naïve uniform downsampling. This property, known as "feature-selective stretching", can be used for digital image compression. There are two challenges in DAST, (1) image reconstruction, and (2) design the warping kernel. The warped mapping is typically performed in the frequency domain. Reconstruction (inverse mapping) of the spatial image via Fourier transform require knowledge of phase in addition to amplitude of the warped image. In the original AST[5] and DAST papers,[17] ideal phase recovery was assumed to show the useful impact of warp transformation. However, as mentioned above, it has also been shown that phase recovery and signal reconstruction depends on the signal to noise ratio (SNR).[14] Finite SNR will compromise the quality of phase recovery and data compression. Because of this challenge, practical implementation of anamorphic data compression is not achieved yet. With respect to the challenge of finding the right kernel, an algorithm has recently been reported.[15]

Similar to the simplified reconstruction approach above mentioned above, a digital implementation for image compression which uses direct warping has also been recently reported.[18] In this alternative data compression method, information-rich portions of the data are dilated in a process that emulates the effect of group velocity dispersion on temporal signals. With this coding operation, the data can be downsampled at a lower rate than without it, even when considering the overhead in transmitting the warping information. In contrast to previous implementation of the warped stretch compression, here the decoding can be performed without the need of phase recovery.

Relation to Phase Stretch Transform[edit]

The Phase Stretch Transform or PST is a computational approach to signal and image processing. One of its utilities is for feature detection and classification. Both Phase Stretch Transform and AST transform the image by emulating propagation through a diffractive medium with engineered 3D dispersive property (refractive index). The difference between the two mathematical operations is that AST uses the magnitude of the complex amplitude after transformation but Phase Stretch Transform employs the phase of the complex amplitude after transformation. Also, the details of the filter kernel are different in the two cases.


Image compression[edit]

Anamorphic (warped) stretch transform is a physics-based mathematical operation that reduces the signal bandwidth without proportionally increasing the size of the signal, thus providing space-bandwidth product compression. Its digital implementation emulates the physical effect by a non-uniform allocation of pixel density. This compression mechanism can be used as a pre-processing operation than may enhance conventional image compression techniques.[19]

Time domain signals[edit]

The technology makes it possible to not only capture and digitize signals that are faster than the speed of the sensor and the digitizer, but also to minimize the volume of the data generated in the process. The transformation causes the signal to be reshaped is such a way that sharp features are stretched (in Fourier domain) more than coarse features. Upon subsequent uniform sampling this causes more digital samples to be allocated to sharp spectral features where they are needed the most, and fewer to sparse portions of the spectrum where they would be redundant.

See also[edit]


  1. ^ Matthew Chin. "New data compression method reduces big-data bottleneck; outperforms, enhances JPEG". UCLA Newsroom. 
  2. ^ "‘Warping’ Compresses Big Data". 30 December 2013. 
  3. ^ J. L. Hunt, B. G. Nickel, and C. Gigault, "Anamorphic images", American Journal of Physics 68, 232–237 (2000).
  4. ^ Editors of Phaidon Press (2001). "The 20th-Century art book." (Reprinted. ed.). London: Phaidon Press. ISBN 0714835420.
  5. ^ a b M. H. Asghari and B. Jalali, "Anamorphic transformation and its application to time-bandwidth compression", Applied Optics, Vol. 52, pp. 6735-6743 (2013). [1]
  6. ^ M. H. Asghari and B. Jalali, "Demonstration of analog time-bandwidth compression using anamorphic stretch transform", Frontiers in Optics (FIO 2013), Paper: FW6A.2, Orlando, USA. [2]
  7. ^ L. Cohen, Time-Frequency Analysis, Prentice-Hall, New York, 1995. ISBN 978-0135945322
  8. ^ B. Boashash, ed., “Time-Frequency Signal Analysis and Processing – A Comprehensive Reference”, Elsevier Science, Oxford, 2003.
  9. ^ S. Qian and D. Chen, Joint Time-Frequency Analysis: Methods and Applications, Chap. 5, Prentice Hall, N.J., 1996.
  10. ^ J. W. Goodman, that describes the dependence of intensity or power on the frequency and time duration of the modulation. It provides insight on how information bandwidth and signal duration are modified upon nonlinear dispersion in the time domain, or upon nonlinear diffraction in the spatial domain. "Introduction to Fourier Optics", McGraw-Hill Book Co (1968).
  11. ^ a b B. Jalali, J. Chan, and M. H. Asghari, “Time–bandwidth engineering,” Optica 1, 23-31 (2014).
  12. ^ M. H. Asghari and B. Jalali, “Anamorphic transformation and its application to time–bandwidth compression,” Appl. Opt. 52, 6735 (2013).
  13. ^ M. H. Asghari and B. Jalali, “Experimental demonstration of optical real-time data compression”, Appl. Phys. Lett. 104, 111101 (2014).
  14. ^ a b c d J. Chan, A. Mahjoubfar, M. H. Asghari, and B. Jalali, “Reconstruction in time-bandwidth compression systems,” Applied Physics Letters journal, Vol. 105, 221105 (2014).
  15. ^ a b A. Mahjoubfar, C. Lifan Chen, and B. Jalali, "Design of Warped Stretch Transform," Scientific Report 2015; 5: 17148.
  16. ^ Chen, Claire Lifan; Mahjoubfar, Ata; Jalali, Bahram (2015-04-23). "Optical Data Compression in Time Stretch Imaging". PLOS ONE. 10 (4): e0125106. ISSN 1932-6203. PMC 4408077Freely accessible. PMID 25906244. doi:10.1371/journal.pone.0125106. 
  17. ^ M. H. Asghari and B. Jalali, “Discrete Anamorphic transform for image compression,” IEEE Signal Processing Letters, Vol. 21, pp. 829-833 (2014).
  18. ^ Chan, Jacky C. K.; Mahjoubfar, Ata; Chen, Claire L.; Jalali, Bahram (2016-07-01). "Context-Aware Image Compression". PLOS ONE. 11 (7): e0158201. ISSN 1932-6203. PMC 4930214Freely accessible. PMID 27367904. doi:10.1371/journal.pone.0158201. 
  19. ^ M. H. Asghari and B. Jalali, "Image compression using the feature-selective stretch transform", 13th IEEE International Symposium on Signal Processing and Information Technology (ISSPIT 2013), Athens, Greece.