Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

169,051 papers · 148 categories

Trend · papers per month

8.4%16.8%25.2%33.5% · Jun 202019922001200920182026
48 results for illumination algorithms

Optimizes UAV deployment for VLC-enabled UAVs considering illumination distribution.

problem Optimizing UAV deployment for VLC-enabled UAVs with illumination distribution consideration.
method Formulated as an optimization problem, solved using GRUs and Gaussian mixture model.
result Achieves up to 22.1% reduction in transmit power compared to conventional methods.

SAIL reduces design evaluations, producing diverse high-performing designs.

problem Design optimization requires many evaluations, limiting applicability.
method Surrogate-Assisted Illumination (SAIL) uses surrogate modeling.
result SAIL produces hundreds of diverse high-performing designs with fewer evaluations.

New illumination bodies defined for ball-convex shapes, proving convexity and establishing surface area measures.

problem Characterizing properties of ball-convex shapes.
method Introducing illumination bodies and weighted illumination bodies, proving convexity, and establishing surface area measures.
result Illumination bodies are convex and provide surface area measures for ball-convex shapes.

Extends illumination bodies to non-Euclidean spaces and proves their volume derivative defines surface area.

problem Defining surface area in non-Euclidean geometries.
method Generalizes illumination bodies to Riemannian spaces of constant curvature and projective Finsler geometries, proving their volume derivative defines surface area.
result Derivative of volume of illumination bodies defines surface area in non-Euclidean geometries.

Prove a generalization of Werner's formula for the volume of illumination bodies on Riemannian manifolds.

problem Prove a generalization of Werner's formula for the volume of illumination bodies on Riemannian manifolds.
method Define the δδ-illumination body and prove a generalization of Werner's formula.
result Prove a generalization of Werner's formula for the volume of illumination bodies on Riemannian manifolds.

We propose an automatic method to infer high dynamic range illumination from a single, limited field-of-view, low dynamic range photograph of an indoor scene. In contrast to previous work that relies on specialized image capture, user input, and/or simple scene models, we train an end-to-end deep neural network that di…

2017-04-01abs ↗pdf ↗

For a Veech surface (x,ω), we characterize subspaces of X^n, invariant under the diagonal action of the affine group of X. We prove that non-arithmetic Veech surfaces have only finitely many invariant subspaces of very particular shape (in any dimension). Among other consequences we find copies of (X,ω) embedded in the…

2006-02-17abs ↗pdf ↗

Efficient model for foggy scene understanding in vehicles.

problem Challenging scene understanding and segmentation under foggy conditions.
method Domain adaptation and illumination-invariant image transformation.
result Outperforms state-of-the-art models in foggy scene understanding.

Enhances 2D face recognition with 3D features using active illumination.

problem Improving robustness of 2D face recognition to spoofing attacks and low-light conditions.
method Projecting a high spatial frequency pattern onto the face to recover 3D information and a 2D image simultaneously.
result Significantly boosts face recognition performance and dramatically improves robustness to spoofing attacks.

Visual perception is a challenging problem in part due to illumination variations. A possible solution is to first estimate an illumination invariant representation before using it for recognition. The object albedo and surface normals are examples of such representations. In this paper, we introduce a multilayer gener…

2012-06-27abs ↗pdf ↗

GANPOP uses deep learning to estimate optical properties from single images, improving accuracy over existing methods.

problem Estimating optical properties from single wide-field images.
method Conditional generative adversarial networks trained on paired images and optical property maps.
result GANPOP estimates optical properties with 58% higher accuracy than single-snapshot optical property technique in human gastrointestinal specimens.

Automatic video modification to hide faces while maintaining pose, illumination, and expression.

problem Face de-identification in video to protect identities.
method A novel feed-forward encoder-decoder network architecture conditioned on facial image high-level representation.
result Fully automatic video modification at high frame rates with minimal distortion.

New approach for camera-specific color constancy using few-shot meta-learning.

problem Domain gaps and lack of generalization across different cameras.
method Formulates color constancy as few-shot meta-learning tasks, leveraging annotated samples across different cameras.
result Significant reduction in data collection time and improved generalization to new cameras.

This research classifies Teichmüller curves in genus 2, proving parity conjectures for specific cases.

problem Classifying imprimitive Teichmüller curves in $\M_2$ related to square-tiled surfaces and modular curves.
method Analyzing square-tiled surfaces and their modular curves, proving parity conjectures for specific cases.
result Established the parity conjecture for Wd2[n]W_{d^2}[n] in three cases, showing number of components does not depend on dd.

In this paper we use 3-manifold techniques to illuminate the structure of the category of tangles. In particular, we show that every idempotent morphism AA in such a category naturally splits as A=BCA=B\circ C such that CBC\circ B is an identity morphism.

2017-12-31abs ↗pdf ↗

Robust visual tracking for long video sequences is a research area that has many important applications. The main challenges include how the target image can be modeled and how this model can be updated. In this paper, we model the target using a covariance descriptor, as this descriptor is robust to problems such as p…

2013-03-24abs ↗pdf ↗

Top 8 robotic vision systems tackled lifelong object recognition challenges.

problem Lifelong learning in robotic vision for varied, dynamic environments.
method Design of a dataset with diverse conditions and rules for evaluation.
result Robotic vision systems improved over time with dynamic object appearances.

In this paper we use 3-manifold techniques to illuminate the structure of the string link monoid. In particular, we give a prime decomposition theorem for string links on two components as well as give necessary conditions for string links to commute under the stacking operation.

2013-08-07abs ↗pdf ↗

Mounting evidences are being gathered suggesting that income and wealth distribution in various countries or societies follow a robust pattern, close to the Gibbs distribution of energy in an ideal gas in equilibrium, but also deviating significantly for high income groups. Application of physics models seem to provide…

2007-03-21abs ↗pdf ↗

We unify f-divergences, Bregman divergences, surrogate loss bounds (regret bounds), proper scoring rules, matching losses, cost curves, ROC-curves and information. We do this by systematically studying integral and variational representations of these objects and in so doing identify their primitives which all are rela…

2009-01-05abs ↗pdf ↗

A new CNN-based algorithm improves Fourier ptychography for faster, more robust image reconstruction.

problem Slow and inefficient Fourier ptychography reconstruction under system aberrations.
method A CNN-based iterative phase retrieval algorithm trained on GPUs.
result Significantly faster and more robust image reconstruction under system aberrations.

Let K be a knot in S^3. We study the iterated Bing doubles of K, giving a new proof for the following statement: If BD_n(K) is slice for some n, then K is algebraically slice. This result was first proved by Cha and Kim using covering link calculus. We also use this tool, but our proof is substantially simpler and illu…

2009-07-28abs ↗pdf ↗

Increasingly, a huge amount of statistics have been gathered which clearly indicates that income and wealth distributions in various countries or societies follow a robust pattern, close to the Gibbs distribution of energy in an ideal gas in equilibrium. However, it also deviates in the low income and more significantl…

2007-09-11abs ↗pdf ↗

We present a simple and fast geometric method for modeling data by a union of affine subspaces. The method begins by forming a collection of local best-fit affine subspaces, i.e., subspaces approximating the data in local neighborhoods. The correct sizes of the local neighborhoods are determined automatically by the Jo…

2010-10-17abs ↗pdf ↗

The paper derives inequalities on Finsler manifolds, influenced by their curvatures.

problem Deriving inequalities on Finsler manifolds.
method Local and global geometric inequalities on Riemannian and Finsler manifolds.
result Generalized Caffarelli-Kohn-Nirenberg and Hardy type inequalities on Finsler manifolds.

Transformers can implement reinforcement learning algorithms from data without updates.

problem Training reinforcement learning algorithms from data without parameter updates.
method Design a teacher-mimicking training procedure for transformers to implement policy-improvement methods.
result Gradient flow converges to an optimal parameter manifold corresponding to the desired RL update.

Quality-Diversity algorithms explore multiple high-performing solutions in a search space.

problem Finding multiple high-performing solutions in complex optimization problems.
method Evolutionary computation approach focusing on behavioral space and holistic solution distribution.
result Quality-Diversity algorithms provide a comprehensive view of high-performing solutions in a search space.

Graph matching---aligning a pair of graphs to minimize their edge disagreements---has received wide-spread attention from both theoretical and applied communities over the past several decades, including combinatorics, computer vision, and connectomics. Its attention can be partially attributed to its computational dif…

2014-05-13abs ↗pdf ↗

Study connects curvature to graph theory and reveals differences.

problem Exploring differences between Quadratic Orthogonal Bisectional Curvature and Real Bisectional Curvature.
method Real (1,1)--forms and Weitzenböck curvature operator used to represent graph Dirichlet energy.
result Curvature differences illuminated between Quadratic Orthogonal Bisectional Curvature and Real Bisectional Curvature.

New RL algorithm gives tighter bounds without domain knowledge.

problem Improving worst-case performance bounds in reinforcement learning.
method Derives algorithm for finite horizon discrete MDPs with analysis yielding state-of-the-art worst-case regret bounds.
result Substantially tighter bounds for environments with small environmental norm, no prior knowledge required.

In recent years, random matrices have come to play a major role in computational mathematics, but most of the classical areas of random matrix theory remain the province of experts. Over the last decade, with the advent of matrix concentration inequalities, research has advanced to the point where we can conquer many (…

2015-01-07abs ↗pdf ↗

Explains differences between WL and folklore-WL formulations in graph neural networks.

problem Understanding the differences between WL and folklore-WL formulations in graph neural networks.
method Visual explanation of differences between WL and folklore-WL formulations.
result Clarifies the differences between WL and folklore-WL formulations.

Paper proposes a graph model for optimal AP deployment in indoor optical wireless networks.

problem Challenges in deploying optical wireless networks due to LoS requirement and limited range.
method Graph modeling approach to identify minimum number of APs and their optimal locations.
result Optimal deployment of APs ensures connectivity and minimizes interference in indoor environments.

Transformers can emulate various algorithms by prompting, proving universality.

problem How to emulate algorithms using fixed-weight Transformers.
method Two modes of in-context algorithm emulation: task-specific and prompt-programmable. Constructing prompts that encode algorithm parameters into token representations.
result Fixed-weight Transformers can emulate a broad class of algorithms via prompts.

Bayesian probabilistic numerical methods are a set of tools providing posterior distributions on the output of numerical methods. The use of these methods is usually motivated by the fact that they can represent our uncertainty due to incomplete/finite information about the continuous mathematical problem being approxi…

2018-01-12abs ↗pdf ↗