← Search

Oren Freifeld

23 accepted papers

2026

Cross-Instance Gaussian Splatting Registration via Geometry-Aware Feature-Guided Alignment

CVPR 2026

We present Gaussian Splatting Alignment (GSA), a novel method for aligning two independent 3D Gaussian Splatting (3DGS) models via a similarity transformation (rotation, translation, and scale), even when they are of different objects in the same category (e.g., different cars). In contrast, existin

Cited by 0SourcecodeScholar
2025

FastJAM: a Fast Joint Alignment Model for Images

NeurIPS 2025poster

Joint Alignment (JA) of images aims to align a collection of images into a unified coordinate frame, such that semantically-similar features appear at corresponding spatial locations. Most existing approaches often require long training times, large-capacity models, and extensive hyperparameter tuni…

Cited by 0SourcecodeScholar
2025

Improving the Effective Receptive Field of Message-Passing Neural Networks

ICML 2025poster

Message-Passing Neural Networks (MPNNs) have become a cornerstone for processing and analyzing graph-structured data. However, their effectiveness is often hindered by phenomena such as over-squashing, where long-range dependencies or interactions are inadequately captured and expressed in the MPNN…

2025

TimePoint: Accelerated Time Series Alignment via Self-Supervised Keypoint and Descriptor Learning

ICML 2025poster

Fast and scalable alignment of time series is a fundamental challenge in many domains. The standard solution, Dynamic Time Warping (DTW), struggles with poor scalability and sensitivity to noise. We introduce TimePoint, a self-supervised method that dramatically accelerates DTW-based alignment while…

2023

From ViT Features to Training-free Video Object Segmentation via Streaming-data Mixture Models

NeurIPS 2023poster

In the task of semi-supervised video object segmentation, the input is the binary mask of an object in the first frame, and the desired output consists of the corresponding masks of that object in the subsequent frames. Existing leading solutions have two main drawbacks: 1) an expensive and typicall…

2022

Common Failure Modes of Subcluster-based Sampling in Dirichlet Process Gaussian Mixture Models - and a Deep-learning Solution

AISTATS 2022poster

The Dirichlet Process Gaussian Mixture Model (DPGMM) is often used to cluster data when the number of clusters is unknown. One main DPGMM inference paradigm relies on sampling. Here we consider a known state-of-art sampler (proposed by Chang and Fisher III (2013) and improved by Dinari et al. (2019)…

Cited by 1SourcePDFScholar
2022

Revisiting DP-Means: fast scalable algorithms via parallelism and delayed cluster creation

UAI 2022poster

DP-means, a nonparametric generalization of K-means, extends the latter to the case where the number of clusters is unknown. Unlike K-means, however, DP-means is hard to parallelize, a limitation hindering its usage in large-scale tasks. This work bridges this practicality gap by rendering the DP-…

2022

Variational- and metric-based deep latent space for out-of-distribution detection

UAI 2022poster

One popular deep-learning approach for the task of Out-Of-Distribution (OOD) detection is based on thresholding the values of per-class Gaussian likelihood of deep features. However, two issues arise with that approach: first, the distributions are often far from being Gaussian; second, many OOD dat…

2020

JA-POLS: A Moving-Camera Background Model via Joint Alignment and Partially-Overlapping Local Subspaces

CVPR 2020poster

Background models are widely used in computer vision. While successful Static-camera Background (SCB) models exist, Moving-camera Background (MCB) models are limited. Seemingly, there is a straightforward solution: 1) align the video frames; 2) learn an SCB model; 3) warp either original or previous…

Cited by 4PDFcodeScholar
2020

Scalable and Flexible Clustering of Grouped Data via Parallel and Distributed Sampling in Versatile Hierarchical Dirichlet Processes

UAI 2020poster

Adaptive clustering of grouped data is often done via the Hierarchical Dirichlet Process Mixture Model (HDPMM). That approach, however, is limited in its flexibility and usually does not scale well. As a remedy, we propose another, but closely related, hierarchical Bayesian nonparametric framework.…

2019

Diffeomorphic Temporal Alignment Nets

NeurIPS 2019poster

Time-series analysis is confounded by nonlinear time warping of the data. Traditional methods for joint alignment do not generalize: after aligning a given signal ensemble, they lack a mechanism, that does not require solving a new optimization problem, to align previously-unseen signals. In the mul…

2016

Dreaming More Data: Class-dependent Distributions over Diffeomorphisms for Learned Data Augmentation

AISTATS 2016poster

Data augmentation is a key element in training high-dimensional models. In this approach, one synthesizes new observations by applying pre-specified transformations to the original training data; e.g. new images are formed by rotating old ones. Current augmentation schemes, however, rely on ma…

Cited by 193SourcePDFScholar
2015

A Dirichlet Process Mixture Model for Spherical Data

AISTATS 2015poster

Directional data, naturally represented as points on the unit sphere, appear in many applications. However, unlike the case of Euclidean data, flexible mixture models on the sphere that can capture correlations, handle an unknown number of components and extend readily to high-dimensional data have…

Cited by 69SourcePDFScholar
2015

Highly-Expressive Spaces of Well-Behaved Transformations: Keeping It Simple

ICCV 2015poster

We propose novel finite-dimensional spaces of R - R transformations, n [?] 1, 2, 3, derived from (continuously-defined) parametric stationary velocity fields. Particularly, we obtain these transformations, which are diffeomorphisms, by fast and highly-accurate integration of continuous piecewise-aff…

Cited by 41PDFcodeScholar