Graph Attention Networks improve image classification with superpixels.
problem Classifying images with irregular shapes and edges.
method Transform images into superpixel graphs, then apply GATs.
result GATs outperform other GNN models in image classification.
Deep learning predicts VR head movements for better 360-degree videos.
problem Predicting head movements in 360-degree VR videos.
method Deep learning network using position data and video content for long-term prediction.
result 16.1% improvement in prediction accuracy compared to baseline.
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…
New deep architecture improves head motion prediction in 360° videos.
problem Predicting user head motion in 360-degree videos using past positions and video content.
method Re-examined existing deep-learning approaches, identified flaws, and designed a new TRACK architecture.
result TRACK achieves state-of-the-art performance, outperforming competitors by up to 20 percent.
Improved credit scoring model with explainability.
problem Making financial decisions based on loan applications.
method Extreme Gradient Boosting (XGBoost) model with 360-degree explanation framework.
result Model achieves state-of-the-art performance and provides understandable explanations.
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…
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…
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.
This paper proposes multi-view attack strategies for deep models.
problem Vulnerability of multi-view deep models to adversarial attacks.
method Two multi-view attack strategies: two-stage attack (TSA) and end-to-end attack (ETEA).
result Proposed multi-view attack strategies are effective on multi-view deep models.
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…
Proposes WM-NMF for better multi-view clustering.
problem Learning multi-view data with unequal view information content.
method Introduces a weighted multi-view NMF algorithm to learn view-specific and observation-specific weights.
result Achieves better clustering performance and handles noisy data.
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.
Random Forest proximity measures for multi-view classification.
problem Combining multiple heterogeneous data views for classification.
method Building dissimilarity representations for each view, fusing them dynamically.
result Dynamic View Selection improves multi-view classification performance.
ANN clusters multi-view data by agglomerating subviews and avoiding postprocessing.
problem Challenges in multi-view clustering, especially subview agglomeration.
method Agglomerative Neural Network (ANN) using Constrained Laplacian Rank.
result ANN outperforms state-of-the-art methods in multi-view clustering.
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 spectral clustering, which aims at yielding an agreement or consensus data objects grouping across multi-views with their graph laplacian matrices, is a fundamental clustering problem. Among the existing methods, Low-Rank Representation (LRR) based method is quite superior in terms of its effectiveness, intu…
Study improves deep learning chest X-ray models by incorporating lateral views.
problem Lack of lateral views in training datasets limits deep learning performance.
method Used PadChest dataset with multiple views to explore merging methods.
result Incorporating lateral views increases model performance for 32 labels.
A novel method for clustering multi-view data using dual representations.
problem Clustering multi-view data with consistent and unique information.
method One-step multi-view clustering method exploiting dual representations.
result The proposed method improves clustering performance on benchmark datasets.
Paper proposes Adversarial CCA for multi-view alignment and generation.
problem Aligning multiple views in cross-view data analysis problems.
method Bayesian perspective, adversarial training for consistent latent encodings.
result ACCA model achieves superior performance in multi-view alignment and generation.
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…
We propose to jointly learn multi-view geometry and warping between views of the same object instances for robust cross-view object detection. What makes multi-view object instance detection difficult are strong changes in viewpoint, lighting conditions, high similarity of neighbouring objects, and strong variability i…
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 …
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…
Enhances robustness of multi-view clustering via partition fusion.
problem Dealing with noises and inconsistency in multi-view data.
method Generates multiple partitions, integrates them, and co-evolves graph learning, partition generation, and view weight learning.
result Empirical results verify the effectiveness and robustness of the proposed approach.
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,…
Proposes CVKT to complete missing kernel matrices across multiple views.
problem Missing data in multiple views of kernel matrices.
method Cross-View Kernel Transfer (CVKT) with kernel alignment.
result Predicts missing values in kernel matrices using other views' data.
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…
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…
Study converts echocardiography views using adversarial models.
problem Limited information sharing among echocardiography views.
method Adversarial generative models trained with LSGAN, PatchGAN, and cGAN.
result Generated views correlate with real views in LV area and length.
Learning distributed node representations in networks has been attracting increasing attention recently due to its effectiveness in a variety of applications. Existing approaches usually study networks with a single type of proximity between nodes, which defines a single view of a network. However, in reality there usu…
This paper proposes a multi-view learning framework for dimension reduction.
problem Challenges in learning low-dimensional spaces from multiple heterogeneous features.
method Similarity-consensus regularized multi-view learning framework.
result The proposed method achieves comparable performance to previous multi-view learning approaches.
In biomedical research, many different types of patient data can be collected, such as various types of omics data and medical imaging modalities. Applying multi-view learning to these different sources of information can increase the accuracy of medical classification models compared with single-view procedures. Howev…
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…
One of the core tasks in multi-view learning is to capture relations among views. For sequential data, the relations not only span across views, but also extend throughout the view length to form long-term intra-view and inter-view interactions. In this paper, we present a new memory augmented neural network model that…
In this paper we examine data fusion methods for multi-view data classification. We present a decision concept which explicitly takes into account the input multi-view structure, where for each case there is a different subset of relevant views. This data fusion concept, which we dub Mixture of Views, is implemented by…