English
Related papers

Related papers: Geometric optics approximation sampling: near-fiel…

200 papers

Local learning of sparse image models has proven to be very effective to solve inverse problems in many computer vision applications. To learn such models, the data samples are often clustered using the K-means algorithm with the Euclidean…

Computer Vision and Pattern Recognition · Computer Science 2016-04-20 Julio Cesar Ferreira , Elif Vural , Christine Guillemot

Recently, 3D Gaussian Splatting (3DGS) has demonstrated excellent ability in small-scale 3D surface reconstruction. However, extending 3DGS to large-scale scenes remains a significant challenge. To address this gap, we propose a novel…

Computer Vision and Pattern Recognition · Computer Science 2024-09-24 YuanZheng Wu , Jin Liu , Shunping Ji

This paper deals with Gibbs samplers that include high dimensional conditional Gaussian distributions. It proposes an efficient algorithm that avoids the high dimensional Gaussian sampling and relies on a random excursion along a small set…

Computation · Statistics 2016-04-20 Olivier Féron , François Orieux , Jean-François Giovannelli

We present a new Bayesian non-parametric deprojection algorithm DOPING (Deprojection of Observed Photometry using and INverse Gambit), that is designed to extract 3-D luminosity density distributions $\rho$ from observed surface brightness…

Instrumentation and Methods for Astrophysics · Physics 2015-05-14 Dalia Chakrabarty

Sparse-view reconstruction with 3D Gaussian Splatting (3DGS) is fundamentally ill-posed due to insufficient geometric supervision, often leading to severe overfitting and the emergence of structural distortions and translucent haze-like…

Computer Vision and Pattern Recognition · Computer Science 2026-04-09 Hantang Li , Qiang Zhu , Xiandong Meng , Debin Zhao , Xiaopeng Fan

3D Gaussian Splatting (3DGS) has recently advanced radiance field reconstruction by offering superior capabilities for novel view synthesis and real-time rendering speed. However, its strategy of blending optimization and adaptive density…

Computer Vision and Pattern Recognition · Computer Science 2024-11-12 Rong Liu , Rui Xu , Yue Hu , Meida Chen , Andrew Feng

Fitting concentric geometric objects to digitized data is an important problem in many areas such as iris detection, autonomous navigation, and industrial robotics operations. There are two common approaches to fitting geometric shapes to…

Computer Vision and Pattern Recognition · Computer Science 2021-03-10 Ali A. Al-Sharadqah , Lorenzo Rull

3D Gaussian Splatting (3DGS) has recently emerged as a powerful explicit representation enabling fast, high-fidelity rendering, making it a promising foundation for closed-loop simulators and perception models in autonomous driving.…

Computer Vision and Pattern Recognition · Computer Science 2026-05-19 Kota Shimomura , Hidehisa Arai , Tsubasa Takahashi , Takayoshi Yamashita , Hironobu Fujiyoshi

One of the key advantages of 3D rendering is its ability to simulate intricate scenes accurately. One of the most widely used methods for this purpose is Gaussian Splatting, a novel approach that is known for its rapid training and…

Graphics · Computer Science 2024-05-31 Artur Kasymov , Bartosz Czekaj , Marcin Mazur , Jacek Tabor , Przemysław Spurek

This paper proposes a new three dimensional (3D) networking architecture enabled by aerial intelligent reflecting surface (AIRS) to achieve panoramic signal reflection from the sky. Compared to the conventional terrestrial IRS, AIRS not…

Information Theory · Computer Science 2020-01-22 Haiquan Lu , Yong Zeng , Shi Jin , Rui Zhang

The use of Gaussian processes (GPs) is supported by efficient sampling algorithms, a rich methodological literature, and strong theoretical grounding. However, due to their prohibitive computation and storage demands, the use of exact GPs…

Statistics Theory · Mathematics 2022-07-27 Kelly R. Moran , Matthew W. Wheeler

3D Gaussian Splatting showcases notable advancements in photo-realistic and real-time novel view synthesis. However, it faces challenges in modeling mirror reflections, which exhibit substantial appearance variations from different…

Computer Vision and Pattern Recognition · Computer Science 2024-05-21 Jiayue Liu , Xiao Tang , Freeman Cheng , Roy Yang , Zhihao Li , Jianzhuang Liu , Yi Huang , Jiaqi Lin , Shiyong Liu , Xiaofei Wu , Songcen Xu , Chun Yuan

Score-based diffusion models are a recently developed framework for posterior sampling in Bayesian inverse problems with a state-of-the-art performance for severely ill-posed problems by leveraging a powerful prior distribution learned from…

Graph sampling is the problem of choosing a node subset via sampling matrix $\mathbf{H} \in \{0,1\}^{K \times N}$ to collect samples $\mathbf{y} = \mathbf{H} \mathbf{x} \in \mathbb{R}^K$, $K < N$, so that the target signal $\mathbf{x} \in…

Signal Processing · Electrical Eng. & Systems 2022-10-27 Yuejiang Li , Hong Vicky Zhao , Gene Cheung

In this paper, we propose a novel computer vision-based approach to aid Reconfigurable Intelligent Surface (RIS) for dynamic beam tracking and then implement the corresponding prototype verification system. A camera is attached at the RIS…

Signal Processing · Electrical Eng. & Systems 2022-07-12 Ming Ouyang , Yucong Wang , Feifei Gao , Shun Zhang , Puchu Li , Jian Ren

We propose a novel direct sparse visual odometry formulation. It combines a fully direct probabilistic model (minimizing a photometric error) with consistent, joint optimization of all model parameters, including geometry -- represented as…

Computer Vision and Pattern Recognition · Computer Science 2016-10-10 Jakob Engel , Vladlen Koltun , Daniel Cremers

This paper considers approximate smoothing for discretely observed non-linear stochastic differential equations. The problem is tackled by developing methods for linearising stochastic differential equations with respect to an arbitrary…

Methodology · Statistics 2019-01-21 Filip Tronarp , Simo Särkkä

In this paper, we combine the positive aspects of the Gradient Sampling (GS) and bundle methods, as the most efficient methods in nonsmooth optimization, to develop a robust method for solving unconstrained nonsmooth convex optimization…

Optimization and Control · Mathematics 2019-11-26 M. Maleknia , M. Shamsi

Consider a linear regression model where the design matrix X has n rows and p columns. We assume (a) p is much large than n, (b) the coefficient vector beta is sparse in the sense that only a small fraction of its coordinates is nonzero,…

Statistics Theory · Mathematics 2014-06-16 Jiashun Jin , Cun-Hui Zhang , Qi Zhang

Differential optical absorption spectroscopy (DOAS) is a powerful tool for detecting and quantifying trace gases in atmospheric chemistry \cite{Platt_Stutz08}. DOAS spectra consist of a linear combination of complex multi-peak multi-scale…

Numerical Analysis · Mathematics 2011-09-30 Y. Sun , L. M. Wingen , B. J. Finlayson-Pitts , J. Xin
‹ Prev 1 3 4 5 6 7 10 Next ›