paper-with-me

홈 › Papers

Fitting Flats to Flats

2024-01-01 · CVPR 2024 1 · Gabriel Dogadov, Ugo Finnendahl, Marc Alexa

Affine subspaces of Euclidean spaces are also referred to as flats. A standard task in computer vision or more generally in engineering and applied sciences is fitting a flat to a set of points which is commonly solved using the PCA. We generalize this technique to enable fitting a flat to a set of other flats possibly of varying dimensions based on representing the flats as squared distance fields. Compared to previous approaches such as Riemannian centers of mass in the manifold of affine Grassmannians our approach is conceptually much simpler and computationally more efficient yet offers desirable properties such as respecting symmetries and being equivariant to rigid transformations leading to more intuitive and useful results in practice. We demonstrate these claims in a number of synthetic experiments and a multi-view reconstruction task of line-like objects.

📄 PDF Abstract BibTeX

Code (0)

등록된 구현이 없습니다.

Methods 이 논문이 사용한 방법론

SET Dynamic Sparse Training method where weight mask is updated randomly periodically
PCA Principle Components Analysis (PCA) is an unsupervised method primary used for dimensionality reduction within machine learning. PCA is calculated via a singular value…

Similar Papers 제목 키워드 기반

FLatS: Principled Out-of-Distribution Detection with Feature-Based Likelihood Ratio Score

2023-10-08 · Haowei Lin, Yuntian Gu

Detecting out-of-distribution (OOD) instances is crucial for NLP models in practical applications. Although numerous OOD detection methods exist, most of them are empirical. Backed by theoretical analysis, this paper adv…

Out-of-Distribution Detection

Unifying lower bounds on prediction dimension of convex surrogates

2021-05-21 · NeurIPS 2021 12 · Jessica Finocchiaro, Rafael Frongillo, Bo Waggoner

The convex consistency dimension of a supervised learning task is the lowest prediction dimension $d$ such that there exists a convex surrogate $L : \mathbb{R}^d \times \mathcal Y \to \mathbb R$ that is consistent for t…

Open-Ended Question AnsweringPrediction

Flatsomatic: A Method for Compression of Somatic Mutation Profiles in Cancer

2019-11-27 · Geoffroy Dubourg-Felonneau, Yasmeen Kussad, Dominic Kirkham, John W Cassidy 외

In this study, we present Flatsomatic - a Variational Auto Encoder (VAE) optimized to compress somatic mutations that allow for unbiased data compression whilst maintaining the signal. We compared two different neural ne…

ClusteringData Compression

Robust Smart Home Face Recognition under Starving Federated Data

2022-11-10 · Jaechul Roh, Yajun Fang

Over the past few years, the field of adversarial attack received numerous attention from various researchers with the help of successful attack success rate against well-known deep neural networks that were acknowledged…

Adversarial AttackFace RecognitionFederated Learning

Benchmarking Single-Factor Physical Video-to-Audio Generation

2026-05-28 · Tingle Li, Siddharth Gururani, Kevin J. Shih, Gantavya Bhatt 외 arxiv

Generative video-to-audio (V2A) models produce highly plausible soundtracks, but it remains unclear whether they capture the underlying physical processes. Existing evaluations emphasize perceptual realism and overlook p…

Audio Generation