Related papers: Autofocusing Optimal Search Algorithm for a Telesc…
The process of identifying stars is integral toward stellar based orientation determination in spacecraft. Star identification involves matching points in an image of the sky with stars in an astronomical catalog. A unified framework for…
Adaptive Optics is a prime example of how progress in observational astronomy can be driven by technological developments. At many observatories it is now considered to be part of a standard instrumentation suite, enabling ground-based…
A quantum algorithm is a set of instructions for a quantum computer, however, unlike algorithms in classical computer science their results cannot be guaranteed. Quantum search algorithm can be described as the rotation of state vectors in…
Many computer vision problems are formulated as the optimization of a cost function. This approach faces two main challenges: (i) designing a cost function with a local optimum at an acceptable solution, and (ii) developing an efficient…
While building up a catalog of Earth orbiting objects, if the available optical observations are sparse, not deliberate follow ups of specific objects, no orbit determination is possible without previous correlation of observations obtained…
We describe the optical alignment method for the Prime-focus Infrared Microlensing Experiment (PRIME) telescope which is a prime-focus near-infrared (NIR) telescope with a wide field of view for the microlensing planet survey toward the…
This work presents a method for determining the accuracy of a source finder algorithm for spectral line radio astronomy data and the Source Finder Accuracy Evaluator (SFAE), a program that implements this method. The accuracy of a source…
We are developing automated systems to provide homogeneous calibration meta-data for heterogeneous imaging data, using the pixel content of the image alone where necessary. Standardized and complete calibration meta-data permit generative…
This paper suggests a new method for determining the search area for a motion estimation algorithm based on block matching. The search area is adaptively found in the proposed method for each frame block. This search area is similar to that…
A quantum control landscape is defined as the expectation value of a target observable $\Theta$ as a function of the control variables. In this work control landscapes for open quantum systems governed by Kraus map evolution are analyzed.…
We present the results of our study of astrometric stability of 200-in Hale (Mt. Palomar) and 10-m Keck II (Mauna Kea) telescopes, both with Adaptive Optics (AO) facilities. A group of nearby visual binaries and multiples was observed in…
In complex plasmas, the behavior of freely floating micrometer sized particles is studied. The particles can be directly visualized and recorded by digital video cameras. To analyze the dynamics of single particles, reliable algorithms are…
A crucial step in planet hunting surveys is to select the best candidates for follow up observations, given limited telescope resources. This is often performed by human `eyeballing', a time consuming and statistically awkward process. Here…
In this paper, we study the following robust optimization problem. Given an independence system and candidate objective functions, we choose an independent set, and then an adversary chooses one objective function, knowing our choice. Our…
Automation of alignment tasks can provide improved efficiency and greatly increase the flexibility of an optical system. Current optical systems with automated alignment capabilities are typically designed to include a dedicated wavefront…
State-of-the-art object detection systems rely on an accurate set of region proposals. Several recent methods use a neural network architecture to hypothesize promising object locations. While these approaches are computationally efficient,…
Large multi-object spectroscopic surveys require automated algorithms to optimise their observing strategy. One of the most ambitious upcoming spectroscopic surveys is the 4MOST survey. The 4MOST survey facility is a fibre-fed spectroscopic…
An informative measurement is the most efficient way to gain information about an unknown state. We present a first-principles derivation of a general-purpose dynamic programming algorithm that returns an optimal sequence of informative…
This paper proposes a new framework for providing approximation guarantees of local search algorithms. Local search is a basic algorithm design technique and is widely used for various combinatorial optimization problems. To analyze local…
Accurate localization in diverse environments is a fundamental challenge in computer vision and robotics. The task involves determining a sensor's precise position and orientation, typically a camera, within a given space. Traditional…