GnuRadio/gr-jay/lib/peak_detect_impl.h

/* -*- c++ -*- */
/* 
 * Copyright 2019 Jay Arrowfield.
 * 
 * This is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation; either version 3, or (at your option)
 * any later version.
 * 
 * This software is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 * 
 * You should have received a copy of the GNU General Public License
 * along with this software; see the file COPYING.  If not, write to
 * the Free Software Foundation, Inc., 51 Franklin Street,
 * Boston, MA 02110-1301, USA.
 */

#ifndef INCLUDED_JAY_PEAK_DETECT_IMPL_H
#define INCLUDED_JAY_PEAK_DETECT_IMPL_H

#include <jay/peak_detect.h>

namespace gr {
namespace jay {

    class peak_detect_impl : public peak_detect
    {
		struct Peak
		{
			Peak()
			: Peak(0, 0, 0, 0.0, 0.0)
			{
				
			}
			Peak(uint64_t _id, int _pos)
			: Peak(_id, _pos, 0, 0.0, 0.0)
			{
				
			}
			Peak(uint64_t _id, int _pos, int _pbh, float _height_rel, float _height_abs)
			: id(_id)
			, pos(_pos)
			, pbh(_pbh)
			, height_rel(_height_rel)
			, height_abs(_height_abs)
			{
				
			}
			uint64_t id;
			int pos;
			int pbh;
			float height_rel;
			float height_abs;
			
			bool isInRange(const Peak &other) const
			{
				return (other.pos >= left()) and (other.pos <= right());
			}
			
			bool isIntersect(const Peak &other) const
			{
				return (right() >= other.left()) and (other.right() >= left());
			}
			
			void heightUpdate_rel(float const *pData, int length)
			{
				float newHeight = -100.f;
				for (int i=left(); i <= right(); i++)
				{
					newHeight = std::max(newHeight, pData[i]);
				}
				height_rel = newHeight;
			}
			
			void heightUpdate_abs(float const *pData, int length)
			{
				float newHeight = -100.f;
				for (int i=left(); i <= right(); i++)
				{
					newHeight = std::max(newHeight, pData[i]);
				}
				height_abs = newHeight;
			}

			bool makeBox(int pbh_min, int pbh_max, float const *pData, int length)
			{
				pbh = 0;
				int left = pos;
				int right = pos;
				float nom = 10;
				int left_found = 0;
				int right_found = 0;
				while(!(left_found & right_found))
				{
					// Determine peak width left from center (pos)
					if (pData[left] > nom)
					{
						if (left > 0)
						{
							left--;
						}
						else
						{
							break;
						}
					}
					else
					{
						left_found = 1;
					}
					
					// Determine peak width right from center (pos)
					if (pData[right] > nom)
					{
						if (right < (length-1))
						{
							right++;
						}
						else
						{
							break;
						}
					}
					else
					{
						right_found = 1;
					}
					
					int pbh_left = pos - left;
					int pbh_right = right - pos;

					// Take larger peak width
					pbh = std::max(pbh_left, pbh_right);

					// Ensure peak box is at least pb_min
					pbh = std::max(pbh, pbh_min);
					
					if (pbh > pbh_max)
					{
						pbh = 0;
						break;
					}
				}
				return pbh > 0;
			}
			
			const Peak& merge(const Peak &other)
			{
				float beta = 0.5f;
				float alpha = (1.f-beta);
				float pos_f = alpha*(float)pos + beta*(float)other.pos;
				float pbh_f = alpha*(float)pbh + beta*(float)other.pbh;
				pos = (int)(pos_f + 0.5f);
				pbh = (int)(pbh_f + 0.5f);
				height_rel = other.height_rel;
				height_abs = other.height_abs;
				return *this;
			}
			
			int left() const
			{
				return pos - pbh;
			}
			
			int right() const
			{
				return pos + pbh;
			}
		};
		
	private:
		void set_msg(pmt::pmt_t msg)
		{
			if (pmt::is_dict(msg))
			{
				fprintf(stderr, "Is dictionary\n!");
			}
			else
			{
				fprintf(stderr, "Sym: %s\n", pmt::symbol_to_string(msg).c_str());
			}
		}
		
		Peak peakCheck(float const *pData, Peak const &peak, float thresh)
		{
			Peak result;
			
	
			return result;
		}
		
		bool addToListByPos(std::vector<Peak>&list, Peak peak)
		{
			bool found = false;
			for (std::vector<Peak>::iterator it = list.begin(); it != list.end(); it++)
			{
				if (it->pos == peak.pos)
				{
					found = true;
					break;
				}
			}
			
			if (!found)
			{
				list.push_back(peak);
			}
			return !found;
		}
		
		float m_framerate;
		float m_peak_height_min;
		int m_peak_width_min;
		int m_peak_width_max;
		float m_alpha_s;
		float m_alpha_m;
		float *m_pX;
		float *m_pXs;
		float *m_pXm;
		float *m_pXd;
		float *m_pXds;
		float *m_pPeakBox_rel;
		float *m_pPeakBox_abs;
		uint64_t m_frameCount;
		pmt::pmt_t m_tag_id;
		std::vector<Peak> m_peakList;
		std::vector<Peak> m_peakHistory;
		std::vector<Peak> temp;
		uint64_t m_peak_id;
		pmt::pmt_t m_msg_port_in;
		pmt::pmt_t m_msg_port_out;
		
	public:
		peak_detect_impl(int vlen, float framerate, float peak_height_min, int peak_width_min, int peak_width_max, float alpha_s, float alpha_m);
		~peak_detect_impl();

		// Where all the action really happens
		int work(int noutput_items, gr_vector_const_void_star &input_items, gr_vector_void_star &output_items);
	private:
		void fill(float *pDst, int length, float value);
		float mean(float *pSrc, int length);
		std::vector<int> findPeakPos(float* pSrc, int length, float thresh);
		
		void sort(std::vector<Peak>&peaks)
		{
			int n = peaks.size();
			do
			{
				int newn = 1;
				for (int i=0; i < (n-1); i++)
				{
					if (peaks[i].height_rel < peaks[i+1].height_rel)
					{
						Peak temp = peaks[i+1];
						peaks[i+1] = peaks[i];
						peaks[i] = temp;
						newn = i+1;
					} // ende if
				} // ende for
				n = newn;
			} while (n > 1);
		}
		
		
    };

} // namespace jay
} // namespace gr

#endif /* INCLUDED_JAY_PEAK_DETECT_IMPL_H */