Phase stretch transform (PST) is a computational approach to signal and image processing. One of its utilities is for feature detection and classification. ^{[1] [2]} PST is related to time stretch dispersive Fourier transform. ^[3] It transforms the image by emulating propagation through a diffractive medium with engineered 3D dispersive property (refractive index). The operation relies on symmetry of the dispersion profile and can be understood in terms of dispersive eigenfunctions or stretch modes. ^[4] PST performs similar functionality as phase-contrast microscopy, but on digital images. PST can be applied to digital images and temporal (time series) data. It is a physics-based feature engineering algorithm. ^[5]

Operation principle

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.

Physical and mathematical foundations of phase stretch transform

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 ^[6] reduces to:

${\displaystyle E_{o}(z,t)={\frac {1}{2\pi }}\int _{-\infty }^{\infty }{\tilde {E}}_{i}(0,\omega )\cdot e^{\frac {-i\beta _{2}z\omega ^{2}}{2}}\cdot e^{i\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\varphi (\omega )}=e^{i\sum _{m=0}^{\infty }\varphi _{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^{i\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^{i\varphi (\omega )}\cdot {\tilde {L}}(\omega )\cdot e^{i\omega {t}}d\omega }$ (4)

where ${\displaystyle e^{i\varphi (\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^{i{\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^{i{\frac {2\pi }{M}}um}\cdot e^{i{\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 kernel implementation

The warped phase kernel ${\displaystyle {\tilde {K}}(u,v)}$ can be described by a nonlinear frequency dependent phase

${\displaystyle {\tilde {K}}(u,v)=e^{i\varphi (u,v)}}$

While arbitrary phase kernels can be considered for PST operation, here we study the phase kernels for which the kernel phase derivative is a linear or sublinear function with respect to frequency variables. A simple example for such phase derivative profiles is the inverse tangent function. Consider the phase profile in the polar coordinate system

${\displaystyle \varphi (u,v)=\varphi _{\text{polar}}(r,\theta )=\varphi _{\text{polar}}(r)}$

From ${\displaystyle {\frac {d\varphi (r)}{dr}}=\tan ^{-1}(r)}$ we have ${\displaystyle \varphi (r)=r\tan ^{-1}(r)-{\frac {1}{2}}\log(r^{2}+1)}$

Therefore, the PST kernel is implemented as

${\displaystyle \varphi (r)=S\cdot {\frac {(Wr)\cdot \tan ^{-1}(Wr)-{\frac {1}{2}}\log(1+(Wr)^{2})}{(Wr_{\max })\cdot \tan ^{-1}(Wr_{\max })-{\frac {1}{2}}\log(1+(Wr_{\max })^{2})}}}$

where ${\displaystyle S}$ and ${\displaystyle W}$ are real-valued numbers related to the strength and warp of the phase profile

Applications

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

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]

Open source code release

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. 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. The code was then significantly refactored and improved to support GPU acceleration. In May 2022, it became one algorithm in PhyCV: the first physics-inspired computer vision library.

See also

• Edge detection
• Feature detection (computer vision)
• Time stretch analog-to-digital converter
• Time stretch dispersive Fourier transform
• Phase-stretch Adaptive Gradient-field Extractor
• PhyCV

References

External links

• Github repository for MATLAB and python implementation for PST