Phase stretch transform

Here the principle is described in the context of feature enhancement in digital images. The image is first filtered with a spatial kernel followed by application of a nonlinear frequency-dependent phase. The output of the transform is the phase in the spatial domain. The main step is the 2-D phase function which is typically applied in the frequency domain. The amount of phase applied to the image is frequency dependent, with higher amount of phase applied to higher frequency features of the image. Since sharp transitions, such as edges and corners, contain higher frequencies, PST emphasizes the edge information. Features can be further enhanced by applying thresholding and morphological operations. PST is a pure phase operation whereas conventional edge detection algorithms operate on amplitude.

Photonic time stretch technique can be understood by considering the propagation of an optical pulse through a dispersive fiber. By disregarding the loss and non-linearity in fiber, the non-linear Schrödinger equation governing the optical pulse propagation in fiber upon integration [5] reduces to:

${\displaystyle E_{o}(z,t)={\frac {1}{2\pi }}\int _{-\infty }^{\infty }{\tilde {E}}_{i}(0,\omega )\cdot e^{\frac {-j\beta _{2}z\omega ^{2}}{2}}\cdot e^{j\omega {t}}d\omega }$ (1)

where ${\displaystyle \beta _{2}}$ =GVD parameter, z is propagation distance, ${\displaystyle E_{o}(z,t)}$ is the reshaped output pulse at distance z and time t. The response of this dispersive element in the time-stretch system can be approximated as a phase propagator as presented in [4] ${\displaystyle H(\omega )=e^{i\phi (\omega )}=e^{i\sum _{m=0}^{\infty }\phi _{m}(\omega )}=\prod _{m=0}^{\infty }H_{m}(\omega )}$ (2)
Therefore, Eq. 1 can be written as following for a pulse that propagates through the time-stretch system and is reshaped into a temporal signal with a complex envelope given by [4]
${\displaystyle E_{o}(t)={\frac {1}{2\pi }}\int _{-\infty }^{\infty }{\tilde {E}}_{i}(\omega )\cdot H(\omega )\cdot e^{j\omega {t}}d\omega }$ (3)
The time stretch operation is formulated as generalized phase and amplitude operations,
${\displaystyle \mathbb {S} \{E_{i}(t)\}=\int _{-\infty }^{+\infty }{\mathcal {F}}\{E_{i}(t)\}\cdot e^{j\phi (\omega )}\cdot {\tilde {L}}(\omega )\cdot e^{j\omega {t}}d\omega }$ (4)

where ${\displaystyle e^{j\phi (\omega )}}$ is the phase filter and ${\displaystyle {\tilde {L}}(\omega )}$is the amplitude filter. Next the operator is converted to discrete domain,
${\displaystyle \mathbb {S} \{E_{i}[n]\}={\frac {1}{N}}\sum _{u=0}^{N-1}FFT\{E_{i}(n)\}\cdot {\tilde {K}}(u)\cdot {\tilde {L}}(u)\cdot e^{j{\frac {2\pi }{N}}un}}$ (5)
where ${\displaystyle u}$ is the discrete frequency, ${\displaystyle {\tilde {K}}(u)}$ is the phase filter, ${\displaystyle {\tilde {L}}(u)}$ is the amplitude filter and FFT is Fast Fourier Transform.

The Stretch operator ${\displaystyle \mathbb {S} \{\}}$ for a digital image is then
${\displaystyle \mathbb {S} \{E_{i}[n,m]\}={\frac {1}{MN}}\sum _{v=0}^{N-1}\sum _{u=0}^{M-1}FFT^{2}\{E_{i}(n,m)\}\cdot {\tilde {K}}(u,v)\cdot {\tilde {L}}(u,v)\cdot e^{j{\frac {2\pi }{M}}um}\cdot e^{j{\frac {2\pi }{N}}vn}}$ (6)

In the above equations, ${\displaystyle E_{i}[n,m]}$ is the input image, ${\displaystyle n}$ and ${\displaystyle m}$ are the spatial variables, ${\displaystyle FFT^{2}}$ is the two dimensional Fast Fourier Transform, and ${\displaystyle u}$ and ${\displaystyle v}$ are spatial frequency variables. The function ${\displaystyle {\tilde {K}}(u,v)}$ is the warped phase kernel and the function ${\displaystyle {\tilde {L}}(u,v)}$ is a localization kernel implemented in frequency domain. PST operator is defined as the phase of the Warped Stretch Transform output as follows

${\displaystyle PST\{E_{i}[n,m]\}\triangleq \measuredangle \{\mathbb {S} \{E_{i}[x,y]\}\}}$ (7)

where ${\displaystyle \measuredangle \{\}}$is the angle operator.

PST has been used for edge detection in biological and biomedical images as well as synthetic-aperture radar (SAR) image processing.[6][7][8] PST has also been applied to improve the point spread function for single molecule imaging in order to achieve super-resolution.[9] The transform exhibits intrinsic superior properties compared to conventional edge detectors for feature detection in low contrast visually impaired images.[10]

The PST function can also be performed on 1-D temporal waveforms in the analog domain to reveal transitions and anomalies in real time.[4]

On February 9, 2016, a UCLA Engineering research group has made public the computer code for PST algorithm that helps computers process images at high speeds and "see" them in ways that human eyes cannot. The researchers say the code could eventually be used in face, fingerprint, and iris recognition systems for high-tech security, as well as in self-driving cars' navigation systems or for inspecting industrial products. Matlab and Python implementation for PST is available for free download from our Github Repository.[11] The Matlab implementation for PST can also be downloaded from Matlab Files Exchange.[12] However, it is provided for research purposes only, and a license must be obtained for any commercial applications. The software is protected under a US patent.

• Edge detection
• Feature detection (computer vision)
• Time stretch analog-to-digital converter
• Time stretch dispersive Fourier transform