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.

168,742 papers · 148 categories

Trend · papers per month

265177102 · Jun 202019922001200920172026
48 results for 360-Degree Views

Paper proposes SMFN for high-res spherical video super-resolution.

problem Super-resolution of 360-degree panoramic videos is expensive and challenging.
method Deformable convolutions, mixed attention mechanism, dual learning strategy, weighted mean square error loss function.
result The proposed SMFN method improves super-resolution of equatorial regions in 360-degree videos.

Robust detection and tracking of objects is crucial for the deployment of autonomous vehicle technology. Image based benchmark datasets have driven development in computer vision tasks such as object detection, tracking and segmentation of agents in the environment. Most autonomous vehicles, however, carry a combinatio…

2019-03-26abs ↗pdf ↗

An underlying assumption in conventional multi-view learning algorithms is that all views can be simultaneously accessed. However, due to various factors when collecting and pre-processing data from different views, the streaming view setting, in which views arrive in a streaming manner, is becoming more common. By ass…

2016-04-28abs ↗pdf ↗

New method clusters strong and weak views effectively, improving performance by up to 40%.

problem Clustering incomplete multi-view data with unbalanced incompleteness.
method View evolution scheme and weighted multi-view subspace clustering.
result Improves clustering performance by up to 40% on three metrics.

Method captures shared information across many views robustly.

problem Modeling hundreds of views per event and learning robust embeddings without view knowledge.
method View bootstrapping using multi-view correlation and matrix concentration theory.
result View bootstrapping captures shared information across many views robustly.

Traditional multi-view learning approaches suffer in the presence of view disagreement,i.e., when samples in each view do not belong to the same class due to view corruption, occlusion or other noise processes. In this paper we present a multi-view learning approach that uses a conditional entropy criterion to detect v…

2012-06-13abs ↗pdf ↗

Proposes MvLPE for better multi-view representation learning.

problem Learning representations from multi-view data with varying correlations.
method Integrates multi-view data into a centroid view while maintaining low-rank reconstruction relations.
result MvLPE outperforms existing methods on benchmark datasets.

Multi-view data are becoming common in real-world modeling tasks and many multi-view data clustering algorithms have thus been proposed. The existing algorithms usually focus on the cooperation of different views in the original space but neglect the influence of the hidden information among these different visible vie…

2019-08-12abs ↗pdf ↗

Error-robust multi-view clustering tackles noisy data across multiple sources.

problem Error in multi-view data degrades clustering performance.
method Blind clustering without error consideration is ineffective. Various approaches like sparsity, graph, subspace, and deep learning are reviewed.
result Error-robust multi-view clustering improves clustering accuracy even with corrupted data.

DEMVC improves multi-view clustering with collaborative training and deep autoencoders.

problem Existing multi-view clustering methods have high computation and space complexities or lack representation capability.
method DEMVC learns embedded representations of multiple views individually using deep autoencoders and collaboratively trains all views.
result DEMVC achieves significant improvements over state-of-the-art methods on multi-view datasets.

Proposes MANE for multi-view network embedding, improving node representations.

problem Learning low-dimensional representations from multiple views of networks.
method MANE combines diversity and collaboration, including second-order collaboration, and attention-based extension MANE+.
result MANE+ outperforms state-of-the-art approaches on real-world multi-view networks.

Proposes a deep probabilistic multi-view model for multi-view learning.

problem Learning from multiple related views with shared latent structure.
method Probabilistic Canonical Correlation Analysis (CCA) in latent space, deep generative networks, variational inference.
result Efficient variational inference approximates posterior distributions of latent multi-view layer.

Proposes KMvDA for object recognition from multi-view data.

problem Recognizing objects from different views, even when views are heterogeneous.
method Introduces kernel multi-view discriminant analysis (KMvDA) and uses random Fourier features (RFF) for large-scale learning.
result KMvDA and RFF approximation improve object recognition from multi-view data.

New method clusters multi-view data by squeezing hybrid knowledge.

problem Removal of redundant information and fusion of multi-view features.
method Low-rank subspace multi-view clustering with adaptive graph regularization.
result Our method outperforms state-of-the-art algorithms on multi-view benchmarks.

Poly-view contrastive learning improves image representation learning.

problem Learning representations from multiple related views in image data.
method Developed new representation learning objectives for poly-view tasks using information maximization and sufficient statistics.
result Poly-view contrastive models trained for fewer epochs and with smaller batch sizes outperform models trained for more epochs and with larger batch sizes.

Proposes a method to enhance multi-view learning by maximizing higher order correlations.

problem Losing intrinsic interconnections among multiple views in pairwise correlation maximization.
method Formulates multi-view data as a low rank approximation problem using higher order correlation tensor and solves it with the generating polynomial method.
result Consistently outperforms prior methods on real multi-view data.

Proposes a method for multi-view clustering that integrates consistent and complementary graph regularizers.

problem Multi-view clustering where views have both consistent and complementary information.
method Consistent and complementary graph-regularized multi-view subspace clustering (GRMSC).
result The proposed method outperforms state-of-the-art methods on benchmark datasets.

Multi-view clustering is a learning paradigm based on multi-view data. Since statistic properties of different views are diverse, even incompatible, few approaches implement multi-view clustering based on the concatenated features straightforward. However, feature concatenation is a natural way to combine multi-view da…

2019-01-30abs ↗pdf ↗

Proposes a method for multi-view clustering that considers local structures and feature weights.

problem Challenges in effectively exploiting complementary information across multiple views.
method Simultaneously assigns weights to different features and captures local information in view-specific feature spaces.
result Achieves state-of-the-art performance on benchmark datasets.

With the development of multimedia era, multi-view data is generated in various fields. Contrast with those single-view data, multi-view data brings more useful information and should be carefully excavated. Therefore, it is essential to fully exploit the complementary information embedded in multiple views to enhance …

2019-01-05abs ↗pdf ↗

In many real-world applications, data are often unlabeled and comprised of different representations/views which often provide information complementary to each other. Although several multi-view clustering methods have been proposed, most of them routinely assume one weight for one view of features, and thus inter-vie…

2018-10-18abs ↗pdf ↗

We present a novel cross-view classification algorithm where the gallery and probe data come from different views. A popular approach to tackle this problem is the multi-view subspace learning (MvSL) that aims to learn a latent subspace shared by multi-view data. Despite promising results obtained on some applications,…

2018-04-19abs ↗pdf ↗

Multi-view learning can provide self-supervision when different views are available of the same data. The distributional hypothesis provides another form of useful self-supervision from adjacent sentences which are plentiful in large unlabelled corpora. Motivated by the asymmetry in the two hemispheres of the human bra…

2018-05-18abs ↗pdf ↗

While neural networks for learning representation of multi-view data have been previously proposed as one of the state-of-the-art multi-view dimension reduction techniques, how to make the representation discriminative with only a small amount of labeled data is not well-studied. We introduce a semi-supervised neural n…

2018-11-11abs ↗pdf ↗

Proposes HOT method for robust multi-view learning.

problem Inability of traditional methods to handle unaligned and non-distributionally aligned views.
method Hierarchical optimal transport (HOT) method that penalizes sliced Wasserstein distances between different views.
result HOT method achieves robust performance on both synthetic and real-world tasks.

Proposes a new multi-view graph learning framework to model consistency and inconsistency.

problem Graph learning methods often neglect inconsistency across multiple views, making them vulnerable to noisy datasets.
method Proposes a unified objective function to simultaneously model consistency and inconsistency, iteratively learning consistent and unified graphs.
result Demonstrates robustness and efficiency of the proposed approach on twelve multi-view datasets.

Nowadays, multi-view clustering has attracted more and more attention. To date, almost all the previous studies assume that views are complete. However, in reality, it is often the case that each view may contain some missing instances. Such incompleteness makes it impossible to directly use traditional multi-view clus…

2019-03-07abs ↗pdf ↗

Beyond existing multi-view clustering, this paper studies a more realistic clustering scenario, referred to as incomplete multi-view clustering, where a number of data instances are missing in certain views. To tackle this problem, we explore spectral perturbation theory. In this work, we show a strong link between per…

2019-05-31abs ↗pdf ↗

Multi-view clustering has received much attention recently. Most of the existing multi-view clustering methods only focus on one-sided clustering. As the co-occurring data elements involve the counts of sample-feature co-occurrences, it is more efficient to conduct two-sided clustering along the samples and features si…

2019-05-25abs ↗pdf ↗