screwlisp@shinmera oh, I'm aware people have done what you're saying in particular, but I've never watched such a thing. Basically you do a discrete convolution/correlation of two arrays, the test sample, and the kernel. We expect that bins in the result exceeding some sensitivity number you choose by trial and error are detections of the kernel in the test sample. You judge your quality by the True Positive Fraction and False Positive Fraction for your chosen sensitivity.
GNU social JP is a social network, courtesy of GNU social JP管理人. It runs on GNU social, version 2.0.2-dev, available under the GNU Affero General Public License.
All GNU social JP content and data are available under the Creative Commons Attribution 3.0 license.