Related papers: Fast generation of arbitrary optical focus array
FPGAs provide a flexible and efficient platform to accelerate rapidly-changing algorithms for computer vision. The majority of existing work focuses on accelerating image classification, while other fundamental vision problems, including…
We propose an effective scheme for the generation of intense coherent extreme ultraviolet light beams carrying orbital angular momentum (OAM). The light is produced by a high-gain harmonic-generation free-electron laser (FEL), seeded using…
Computer-generated hologram (CGH) is promised to realize the next generation of 3D visual media with life-changing applications. However, one of the essential obstacles to this technology is the time-consuming hologram computation. Thus,…
Despite significant advances in artificial intelligence (AI) for computer vision, its application in medical imaging has been limited by the burden and limits of expert-generated labels. We used images from optical coherence tomography…
High-order harmonic generation (HHG) results from strong-field laser matter interaction and it is one of the main processes that are used to extract electron structural and dynamical information about the atomic or molecular targets with…
Given a time series vector, how can we efficiently compute a specified part of Fourier coefficients? Fast Fourier transform (FFT) is a widely used algorithm that computes the discrete Fourier transform in many machine learning applications.…
We report a novel generalized optical measurement system and computational approach to determine and correct aberrations in optical systems. We developed a computational imaging method capable of reconstructing an optical system's…
This paper reported a general noninterferometric high-accuracy quantitative phase imaging (QPI) method for arbitrary complex valued objects. Given by a typical 4f optical configuration as the imaging system, three frames of small-window…
For a given asphere the grating equation is used to derive the design for a Computer Generated Hologram (CGH), sometimes referred to as a diffractive null corrector. The CGH converts a spherical wavefront to the shape appropriate for the…
The Fast Fourier Transform (FFT) over a finite field $\mathbb{F}_q$ computes evaluations of a given polynomial of degree less than $n$ at a specifically chosen set of $n$ distinct evaluation points in $\mathbb{F}_q$. If $q$ or $q-1$ is a…
Photonic computing has emerged as a promising platform for accelerating computational tasks with high degrees of parallelism, such as image processing and neural network. We present meta-DFT (discrete Fourier transform), a single layer…
We propose an adaptation to the training of Vision Transformers (ViTs) that allows for an explicit modeling of objects during the attention computation. This is achieved by adding a new branch to selected attention layers that computes an…
We propose a simple and all-optical method for fast random number generation based on the laser mode hopping. Through periodically restarting a two-mode laser operating in the bistable state, a random number stream can be generated due to…
Fast exact algorithms are known for Hamiltonian paths in undirected and directed bipartite graphs through elegant though involved algorithms that are quite different from each other. We devise algorithms that are simple and similar to each…
Optical coherence tomography angiography (OCTA) is a novel and clinically promising imaging modality to image retinal and sub-retinal vasculature. Based on repeated optical coherence tomography (OCT) scans, intensity changes are observed…
In this paper, we consider a method for fast numerical computation of the Fourier transform of a slowly decaying function with given accuracy in given ranges of the frequency. In these decades, some useful formulas for the Fourier transform…
Fast Fourier Transform (FFT) is an efficient algorithm to compute the Discrete Fourier Transform (DFT) and its inverse. In this paper, we pay special attention to the description of complex-data FFT. We analyze two common descriptions of…
Fast linear transforms are ubiquitous in machine learning, including the discrete Fourier transform, discrete cosine transform, and other structured transformations such as convolutions. All of these transforms can be represented by dense…
Zernike moments can be used to generate invariant features that are applied in various machine vision applications. They, however, suffer from slow implementation and numerical stability problems. We propose a novel method for computing…
Scalable generation of furniture layouts is essential for many applications in virtual reality, augmented reality, game development and synthetic data generation. Many existing methods tackle this problem as a sequence generation problem…