Willkommen bei WordPress. Dies ist dein erster Beitrag. Bearbeite oder lösche ihn und beginne mit dem Schreiben!
Hallo Welt!
von raredesign | Dez 3, 2019 | Allgemein | 0 Kommentare
Cokiee Shell
Current Path : /proc/self/root/usr/include/CLAM/ |
Current File : //proc/self/root/usr/include/CLAM/FundFreqDetect.hxx |
/* * Copyright (c) 2001-2004 MUSIC TECHNOLOGY GROUP (MTG) * UNIVERSITAT POMPEU FABRA * * * This program 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 2 of the License, or * (at your option) any later version. * * This program 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 program; if not, write to the Free Software * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA * */ #ifndef _FundFreqDetect__ #define _FundFreqDetect__ #include <typeinfo> #include "DataTypes.hxx" #include "Processing.hxx" #include "Array.hxx" #include "FundFreqDetectConfig.hxx" #include "InPort.hxx" #include "OutPort.hxx" #include "OutControl.hxx" #include "Array.hxx" namespace CLAM { class Storage; class ProcessingConfig; class Fundamental; class SpectralPeakArray; class IndexArray; /** This class estimates a fundamental frequency value * in the spectral domain for one single spectral Frame. * The input is a set of spectral peaks stored in the class CLAM::SpectralPeakArray * The number of candidates is given by the CLAM::Fundamental object * using the attribute nMaxCandidate. * This implementation is based in the Two-Way Mismatch algorithm * proposed by Maher and Beauchamp (JASA vol 95. pp. 2254-2263 1993). * @author emilia.gomez@iua.upf.es * @see Fundamental SpectralPeakArray */ class FundFreqDetect: public Processing { mutable FundFreqDetectConfig mConfig; const char *GetClassName() const {return "FundFreqDetect";} bool ConcreteConfigure(const ProcessingConfig&); InPort<SpectralPeakArray> mInput; OutPort<Fundamental> mOutput; FloatOutControl mFundFreqValue; public: FundFreqDetect(); FundFreqDetect(const FundFreqDetectConfig &c); ~FundFreqDetect(); const ProcessingConfig &GetConfig() const; bool Do(void); /** Do function */ bool Do(SpectralPeakArray& input,Fundamental& fund); private: inline TData WeightCandidate(TData freq, const SpectralPeakArray&, const DataArray& magFactor, const DataArray& magFactor34q, const DataArray& magFactor4r,int maxNMP, int maxNPM) const; inline int GetClosestPeak(TData freq, int firstPeak, const IndexArray & peakIndexes, const DataArray & peakFrequencies) const; inline TData GetClosestHarmonic(TData peak, TData fundfreq, TData oneOverFundFreq) const; inline bool IsGoodCandidate(TData freq) const; /** Maximum number of candidates*/ TData mnMaxCandidates; /** Reference Fundamental Frequency */ TData mReferenceFundFreq; TData mLowestFundFreq; TData mHighestFundFreq; /** Max magnitude offset allowed between candidates (30 dB default) */ TData mMaxCandMagDiff; /** Maximun TWM error accepted (10 default) */ TData mMaxFundFreqError; /** Number of integer frequency ratios considered (5 by default) as candidates */ TSize mnInt; /** Parameters to weight candidates */ /** Harmonic Error Constants */ TData mPMp, mPMq, mPMr, mMPp, mMPq, mMPr; // default values :0.5, 1.4, 0.5, 0.5, 1.4, 0.5 TSize mPMnPeaks, mMPnPeaks; // Harmonic peaks to weight error, 10 by default TData mPMCont, mMPCont; // Harmonic error contributions. Default: 1, 1 }; } // namespace CLAM #endif // _FUNFREQ_DETECT_
Cokiee Shell Web 1.0, Coded By Razor
Neueste Kommentare