research
∙
09/14/2023
MC-NeRF: Muti-Camera Neural Radiance Fields for Muti-Camera Image Acquisition Systems
Neural Radiance Fields (NeRF) employ multi-view images for 3D scene repr...
share
research
∙
07/17/2023
Phase Transitions of Structured Codes of Graphs
We consider the symmetric difference of two graphs on the same vertex se...
research
∙
06/14/2023
Variance-Preserving-Based Interpolation Diffusion Models for Speech Enhancement
The goal of this study is to implement diffusion models for speech enhan...
research
∙
05/05/2023
Solution existence, uniqueness, and stability of discrete basis sinograms in multispectral CT
This work investigates conditions for quantitative image reconstruction ...
research
∙
03/26/2023
Sector Patch Embedding: An Embedding Module Conforming to The Distortion Pattern of Fisheye Image
Fisheye cameras suffer from image distortion while having a large field ...
research
∙
03/26/2023
CRRS: Concentric Rectangles Regression Strategy for Multi-point Representation on Fisheye Images
Modern object detectors take advantage of rectangular bounding boxes as ...
research
∙
01/17/2023
DR-WLC: Dimensionality Reduction cognition for object detection and pose estimation by Watching, Learning and Checking
Object detection and pose estimation are difficult tasks in robotics and...
research
∙
10/27/2022
Vetaverse: Technologies, Applications, and Visions toward the Intersection of Metaverse, Vehicles, and Transportation Systems
Since 2021, the term "Metaverse" has been the most popular one, garnerin...
research
∙
07/15/2022
FRAS: Federated Reinforcement Learning empowered Adaptive Point Cloud Video Streaming
Point cloud video transmission is challenging due to high encoding/decod...
research
∙
05/03/2022
Nested Dissection Meets IPMs: Planar Min-Cost Flow in Nearly-Linear Time
We present a nearly-linear time algorithm for finding a minimum-cost flo...
research
∙
04/04/2022
Experimental quantum adversarial learning with programmable superconducting qubits
Quantum computing promises to enhance machine learning and artificial in...
research
∙
12/01/2021
Faster Maxflow via Improved Dynamic Spectral Vertex Sparsifiers
We make several advances broadly related to the maintenance of electrica...
research
∙
09/27/2021
Unit-Weight Laplacians are Complete for Linear Systems Modulo p
In this paper, we prove that over finite fields modulo primes, solving g...
research
∙
08/17/2021
TOOD: Task-aligned One-stage Object Detection
One-stage object detection is commonly implemented by optimizing two sub...
research
∙
01/18/2021
Fully Dynamic Electrical Flows: Sparse Maxflow Faster Than Goldberg-Rao
We give an algorithm for computing exact maximum flows on graphs with m ...
research
∙
05/03/2020
A Study of Performance of Optimal Transport
We investigate the problem of efficiently computing optimal transport (O...
research
∙
03/11/2020
Channel Interaction Networks for Fine-Grained Image Categorization
Fine-grained image categorization is challenging due to the subtle inter...
research
∙
10/17/2019
A Deterministic Algorithm for Balanced Cut with Applications to Dynamic Connectivity, Flows, and Beyond
We consider the classical Minimum Balanced Cut problem: given a graph G,...
research
∙
10/17/2019
Deterministic Graph Cuts in Subquadratic Time: Sparse, Balanced, and k-Vertex
We study deterministic algorithms for computing graph cuts, with focus o...
research
∙
10/15/2019
Flowless: Extracting Densest Subgraphs Without Flow Computations
We propose a simple and computationally efficient method for dense subgr...
research
∙
06/24/2019
Fully Dynamic Spectral Vertex Sparsifiers and Applications
We study dynamic algorithms for maintaining spectral vertex sparsifiers ...
research
∙
05/06/2019
Efficient Second-Order Shape-Constrained Function Fitting
We give an algorithm to compute a one-dimensional shape-constrained func...
research
∙
05/30/2018
Graph Sparsification, Spectral Sketches, and Faster Resistance Computation, via Short Cycle Decompositions
We develop a framework for graph sparsification and sketching, based on ...
research
∙
04/11/2018