相关论文: The $N$-achromat and beyond: a unified variational…

We devise a new formulation for the vertex coloring problem. Different from other formulations, decision variables are associated with the pairs of vertices. Consequently, colors will be distinguishable. Although the objective function is…

Direct imaging of exoplanets requires very high contrast levels, which are obtained using coronagraphs. But residual quasi-static aberrations create speckles in the focal plane downstream of the coronagraph which mask the planet. This…

High contrast imaging and spectroscopy provide unique constraints for exoplanet formation models as well as for planetary atmosphere models. But this can be challenging because of the planet-to-star small angular separation and high flux…

Permutation synchronization is an important problem in computer science that constitutes the key step of many computer vision tasks. The goal is to recover $n$ latent permutations from their noisy and incomplete pairwise measurements. In…

Disordered nanostructures with correlations on the scale of visible wavelengths can show angle-independent structural colors. These materials could replace dyes in some applications because the color is tunable and resists photobleaching.…

Stimulated optical forces offer a simple and efficient method for providing optical forces far in excess of the saturated radiative force. The bichromatic force, using a counterpropagating pair of two-color beams, has so far been the most…

For structured-light range imaging, color stripes can be used for increasing the number of distinguishable light patterns compared to binary BW stripes. Therefore, an appropriate use of color patterns can reduce the number of light…

The ability of mixing colors with remarkable results had long been exclusive to the talents of master painters. By finely combining colors at different amounts on the palette intuitively, they obtain smooth gradients with any given color.…

In the Coloured Clustering problem, we wish to colour vertices of an edge coloured graph to produce as many stable edges as possible, i.e., edges with the same colour as their ends. In this paper, we reveal that the problem is in fact a…

In ground based astronomical observations, atmospheric dispersion shifts the image of the object at different wavelengths due to the wavelength-dependent index of refraction of the atmosphere. Thus, using an Atmospheric Dispersion Corrector…

We show the surprising result that colors across a change in viewing condition (changing light color, shading and camera) are related by a homography. Our homography color correction application delivers improved color fidelity compared…

Emerging universal Computational Aberration Correction (CAC) paradigms provide an inspiring solution to light-weight and high-quality imaging with a universal model trained on a lens library (LensLib) to address arbitrary lens optical…

Convolutional Neural Networks (CNN)-based approaches have shown promising results in pansharpening of satellite images in recent years. However, they still exhibit limitations in producing high-quality pansharpening outputs. To that end, we…

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…

We consider the problem of signal reconstruction for computed tomography (CT) under a nonlinear forward model that accounts for exponential signal attenuation, a polychromatic X-ray source, general measurement noise (e.g., Poisson shot…

Due to limited size and imperfect of the optical components in a spectrometer, aberration has inevitably been brought into two-dimensional multi-fiber spectrum image in LAMOST, which leads to obvious spacial variation of the point spread…

We introduce a generalization of the well known graph (vertex) coloring problem, which we call the problem of \emph{component coloring of graphs}. Given a graph, the problem is to color the vertices using minimum number of colors so that…

Color Refinement, also known as Naive Vertex Classification, is a classical method to distinguish graphs by iteratively computing a coloring of their vertices. While it is mainly used as an imperfect way to test for isomorphism, the…

An assignment of colours to the vertices of a graph is stable if any two vertices of the same colour have identically coloured neighbourhoods. The goal of colour refinement is to find a stable colouring that uses a minimum number of…

Coherent anti-Stokes Raman scattering is a widely used imaging technique that provides chemical contrast without the need for labels, making it an extremely valuable tool in physics, chemistry, and biology. In this work, we explore its…