Chris@164: /* -*- c-basic-offset: 4 indent-tabs-mode: nil -*-  vi:set ts=8 sts=4 sw=4: */
Chris@164: 
Chris@165: /*
Chris@165:     QM DSP Library
Chris@165: 
Chris@165:     Centre for Digital Music, Queen Mary, University of London.
Chris@165:     This file Copyright 2010 Chris Cannam.
Chris@165: 
Chris@165:     This program is free software; you can redistribute it and/or
Chris@165:     modify it under the terms of the GNU General Public License as
Chris@165:     published by the Free Software Foundation; either version 2 of the
Chris@165:     License, or (at your option) any later version.  See the file
Chris@165:     COPYING included with this distribution for more information.
Chris@165: */
Chris@165: 
Chris@164: #ifndef MEDIAN_FILTER_H
Chris@164: #define MEDIAN_FILTER_H
Chris@164: 
Chris@164: #include <algorithm>
Chris@164: #include <cassert>
Chris@164: #include <cmath>
Chris@164: #include <iostream>
Chris@167: #include <vector>
Chris@164: 
Chris@164: template <typename T>
Chris@164: class MedianFilter
Chris@164: {
Chris@164: public:
Chris@164:     MedianFilter(int size, float percentile = 50.f) :
Chris@164: 	m_size(size),
Chris@164: 	m_frame(new T[size]),
Chris@164: 	m_sorted(new T[size]),
Chris@164: 	m_sortend(m_sorted + size - 1) {
Chris@164:         setPercentile(percentile);
Chris@164: 	reset();
Chris@164:     }
Chris@164: 
Chris@164:     ~MedianFilter() { 
Chris@164: 	delete[] m_frame;
Chris@164: 	delete[] m_sorted;
Chris@164:     }
Chris@164: 
Chris@164:     void setPercentile(float p) {
Chris@164:         m_index = int((m_size * p) / 100.f);
Chris@164:         if (m_index >= m_size) m_index = m_size-1;
Chris@164:         if (m_index < 0) m_index = 0;
Chris@164:     }
Chris@164: 
Chris@164:     void push(T value) {
Chris@169:         if (value != value) {
Chris@169:             std::cerr << "WARNING: MedianFilter::push: attempt to push NaN" << std::endl;
Chris@169:             return; // nan
Chris@169:         }
Chris@164: 	drop(m_frame[0]);
Chris@164: 	const int sz1 = m_size-1;
Chris@164: 	for (int i = 0; i < sz1; ++i) m_frame[i] = m_frame[i+1];
Chris@164: 	m_frame[m_size-1] = value;
Chris@164: 	put(value);
Chris@164:     }
Chris@164: 
Chris@164:     T get() const {
Chris@164: 	return m_sorted[m_index];
Chris@164:     }
Chris@164: 
Chris@168:     int getSize() const {
Chris@168:         return m_size; 
Chris@168:     }
Chris@168: 
Chris@164:     T getAt(float percentile) {
Chris@164: 	int ix = int((m_size * percentile) / 100.f);
Chris@164:         if (ix >= m_size) ix = m_size-1;
Chris@164:         if (ix < 0) ix = 0;
Chris@164: 	return m_sorted[ix];
Chris@164:     }
Chris@164: 
Chris@164:     void reset() {
Chris@164: 	for (int i = 0; i < m_size; ++i) m_frame[i] = 0;
Chris@164: 	for (int i = 0; i < m_size; ++i) m_sorted[i] = 0;
Chris@164:     }
Chris@164: 
Chris@167:     static std::vector<T> filter(int size, const std::vector<T> &in) {
Chris@167:         std::vector<T> out;
Chris@167:         MedianFilter<T> f(size);
Chris@167:         for (int i = 0; i < int(in.size()); ++i) {
Chris@167:             f.push(in[i]);
Chris@167:             T median = f.get();
Chris@167:             if (i >= size/2) out.push_back(median);
Chris@167:         }
Chris@167:         while (out.size() < in.size()) {
Chris@167:             f.push(T());
Chris@167:             out.push_back(f.get());
Chris@167:         }
Chris@167:         return out;
Chris@167:     }
Chris@167: 
Chris@164: private:
Chris@164:     const int m_size;
Chris@164:     T *const m_frame;
Chris@164:     T *const m_sorted;
Chris@164:     T *const m_sortend;
Chris@164:     int m_index;
Chris@164: 
Chris@164:     void put(T value) {
Chris@164: 	// precondition: m_sorted contains m_size-1 values, packed at start
Chris@164: 	// postcondition: m_sorted contains m_size values, one of which is value
Chris@164: 	T *point = std::lower_bound(m_sorted, m_sortend, value);
Chris@164: 	const int n = m_sortend - point;
Chris@164: 	for (int i = n; i > 0; --i) point[i] = point[i-1];
Chris@164: 	*point = value;
Chris@164:     }
Chris@164: 
Chris@164:     void drop(T value) {
Chris@164: 	// precondition: m_sorted contains m_size values, one of which is value
Chris@164: 	// postcondition: m_sorted contains m_size-1 values, packed at start
Chris@164: 	T *point = std::lower_bound(m_sorted, m_sortend + 1, value);
Chris@164: 	if (*point != value) {
Chris@164: 	    std::cerr << "WARNING: MedianFilter::drop: *point is " << *point
Chris@164: 		      << ", expected " << value << std::endl;
Chris@164: 	}
Chris@164: 	const int n = m_sortend - point;
Chris@164: 	for (int i = 0; i < n; ++i) point[i] = point[i+1];
Chris@164: 	*m_sortend = T(0);
Chris@164:     }
Chris@165: 
Chris@165:     MedianFilter(const MedianFilter &); // not provided
Chris@165:     MedianFilter &operator=(const MedianFilter &); // not provided
Chris@164: };
Chris@164: 
Chris@164: #endif
Chris@164: