Outlier-Robust Convex Segmentation

11/17/2014
by   Itamar Katz, et al.
0

We derive a convex optimization problem for the task of segmenting sequential data, which explicitly treats presence of outliers. We describe two algorithms for solving this problem, one exact and one a top-down novel approach, and we derive a consistency results for the case of two segments and no outliers. Robustness to outliers is evaluated on two real-world tasks related to speech segmentation. Our algorithms outperform baseline segmentation algorithms.

READ FULL TEXT
research
07/18/2022

Towards Understanding The Semidefinite Relaxations of Truncated Least-Squares in Robust Rotation Search

The rotation search problem aims to find a 3D rotation that best aligns ...
research
06/23/2019

Robust convex clustering: How does fusion penalty enhance robustness?

Convex clustering has gained popularity recently due to its desirable pe...
research
11/06/2019

Coverage-based Outlier Explanation

Outlier detection is a core task in data mining with a plethora of algor...
research
02/10/2020

Outlier Guided Optimization of Abdominal Segmentation

Abdominal multi-organ segmentation of computed tomography (CT) images ha...
research
07/05/2021

Robust Online Convex Optimization in the Presence of Outliers

We consider online convex optimization when a number k of data points ar...
research
08/03/2019

Simultaneous Semantic Segmentation and Outlier Detection in Presence of Domain Shift

Recent success on realistic road driving datasets has increased interest...
research
06/09/2011

Intelligent decision: towards interpreting the Pe Algorithm

The human intelligence lies in the algorithm, the nature of algorithm li...

Please sign up or login with your details

Forgot password? Click here to reset