Related papers: VBMicroLensing: three algorithms for multiple lens…
Modern Earth observation satellites capture multi-exposure bursts of push-frame images that can be super-resolved via computational means. In this work, we propose a super-resolution method for such multi-exposure sequences, a problem that…
We propose a novel method to accurately reconstruct a set of images representing a single scene from few linear multi-view measurements. Each observed image is modeled as the sum of a background image and a foreground one. The background…
The Euclidean algorithm in algebra is applied to a class of gravitational lenses for which the lens equation consists of any set of coupled polynomial equations in the image position. In general, this algorithm allows us to reduce an…
This paper proposes a nonmonotone proximal quasi-Newton algorithm for unconstrained convex multiobjective composite optimization problems. To design the search direction, we minimize the max-scalarization of the variations of the Hessian…
Quantifying image distortions caused by strong gravitational lensing and estimating the corresponding matter distribution in lensing galaxies has been primarily performed by maximum likelihood modeling of observations. This is typically a…
Microlensing can be used to discover exoplanets of a wide range of masses with orbits beyond ~ 1 AU, and even free-floating planets. The WFIRST mission will use microlensing to discover approximately 1600 planets by monitoring ~100 million…
Hypergraph matching has recently become a popular approach for solving correspondence problems in computer vision as it allows to integrate higher-order geometric information. Hypergraph matching can be formulated as a third-order…
I present a new algorithm, CALCLENS, for efficiently computing weak gravitational lensing shear signals from large N-body light cone simulations over a curved sky. This new algorithm properly accounts for the sky curvature and boundary…
Realizing high-throughput aberration-corrected Scanning Transmission Electron Microscopy (STEM) exploration of atomic structures requires rapid tuning of multipole probe correctors while compensating for the inevitable drift of the optical…
The problem of minimizing a continuously differentiable convex function over an intersection of closed convex sets is ubiquitous in applied mathematics. It is particularly interesting when it is easy to project onto each separate set, but…
Microlensing light curves are typically computed either by ray-shooting maps or by contour integration via Green's theorem. We present an improved version of the second method that includes a parabolic correction in Green's line integral.…
Three point mass gravitational lens equation is a two-dimensional vector equation that can be embedded in a tenth order analytic polynomial equation of one complex variable, and we can solve the one variable equation on the source…
Since the first microlensing planet discovery in 2003, more than 200 planets have been detected with gravitational microlensing, in addition to several free-floating planet and black hole candidates. In this chapter the microlensing theory…
Astronomy depends on ever increasing computing power. Processor clock-rates have plateaued, and increased performance is now appearing in the form of additional processor cores on a single chip. This poses significant challenges to the…
Accurate real-time simulation of lens optics remains challenging due to the computational expense of full ray tracing and the limitations of existing approximations. The commonly used pinhole model and thin-lens model ignore many optical…
We focus on two central themes in this dissertation. The first one is on decomposing polytopes and polynomials in ways that allow us to perform nonlinear optimization. We start off by explaining important results on decomposing a polytope…
We introduce the \emph{submodular objectives chasing problem}, which generalizes many natural and previously-studied problems: a sequence of constrained submodular maximization problems is revealed over time, with both the objective and…
Multiresolution analysis and matrix factorization are foundational tools in computer vision. In this work, we study the interface between these two distinct topics and obtain techniques to uncover hierarchical block structure in symmetric…
We propose new algorithms for computing triangular decompositions of polynomial systems incrementally. With respect to previous works, our improvements are based on a {\em weakened} notion of a polynomial GCD modulo a regular chain, which…
We consider several problems that involve lines in three dimensions, and present improved algorithms for solving them. The problems include (i) ray shooting amid triangles in $R^3$, (ii) reporting intersections between query lines…