Published on Thu Oct 31 2019

Multivariate Medians for Image and Shape Analysis

Martin Welk

Multivariate median concepts are being used to construct robust and efficient denoising filters for multivariate images such as colour images but also matrix-valued images.

4
0
0
Abstract

Having been studied since long by statisticians, multivariate median concepts found their way into the image processing literature in the course of the last decades, being used to construct robust and efficient denoising filters for multivariate images such as colour images but also matrix-valued images. Based on the similarities between image and geometric data as results of the sampling of continuous physical quantities, it can be expected that the understanding of multivariate median filters for images provides a starting point for the development of shape processing techniques. This paper presents an overview of multivariate median concepts relevant for image and shape processing. It focusses on their mathematical principles and discusses important properties especially in the context of image processing.

Mon Oct 29 2018
Computer Vision
Geometric Median Shapes
The median finding problem is formulated as an optimization over distances. It is solved directly using the watershed method as an optimizer. We show that computing the geometric median of shapes is robust in the presence of outliers.
0
0
0
Sun Sep 27 2015
Computer Vision
Multivariate Median Filters and Partial Differential Equations
Multivariate median filters have been proposed as generalisations of the well-established median filter for grey-value images to multi-channel images. Most of the recent approaches use the median, which is the minimiser of an objective function that is the sum of distances to all input points.
0
0
0
Thu Jul 12 2012
Computer Vision
Non-Local Euclidean Medians
Non-Local Means (NLM) can be improved by replacing the mean by the Euclidean median. NLEM can be efficiently implemented using iteratively reweighted least squares. Its computational complexity is comparable to that of NLM.
0
0
0
Mon Mar 02 2015
Machine Learning
A review of mean-shift algorithms for clustering
A natural way to characterize the cluster structure of a dataset is by finding regions containing a high density of data. This can be done in a nonparametric way with a kernel density estimate. We describe the theory and practice behind clustering based on kernel density estimates and mean-shift algorithms.
0
0
0
Sun Nov 18 2012
Computer Vision
Non-Local Patch Regression: Robust Image Denoising in Patch Space
The Euclidean mean and median can be put into a common regression framework. The natural question then is what happens if we consider l_p (0
0
0
0
Mon Feb 11 2019
Artificial Intelligence
Nearest Neighbor Median Shift Clustering for Binary Data
BinNNMS is based on the nearest neighbor median shift. The median shift is an extension of the well-known mean shift to handle binary data.
0
0
0