├── Classes └── SoundFileAnalysis.sc ├── HelpSource └── Classes │ └── SoundFileAnalysis.schelp ├── LICENSE ├── README.md └── SoundFileAnalysis.quark /Classes/SoundFileAnalysis.sc: -------------------------------------------------------------------------------- 1 | SoundFileAnalysis { 2 | 3 | classvar verbose = false; 4 | var = maxDataPoints) { 200 | "analysis exceeded maxDataPoints (%)".format(maxDataPoints).warn; 201 | }; 202 | // now the rest of the data 203 | dataFile.readData(data = FloatArray.newClear(numDataPoints)); 204 | dataFile.close; 205 | //("sound file read successful" + resultpath).postln; 206 | } { 207 | ("sound file read failed" + resultpath).postln; 208 | }; 209 | numOutputChannels = dataFile.numChannels; 210 | if(numOutputChannels.notNil and: { numOutputChannels != 1 }) { 211 | data = data.clump(numOutputChannels) 212 | }; 213 | result.put(which.at(i), data); 214 | File.delete(resultpath); 215 | } 216 | 217 | } 218 | 219 | *initAnalysisMethods { 220 | basicAnalysisMethods = ( 221 | // ugenFunc receives signal and soundfile as arguments 222 | // ugenFunc should return [trig, ... value], any number of values. 223 | // on trigger, all values (UGen outputs) will be written. 224 | // if the value is nil and only trig is returned, the current time in frames will be used 225 | // no demand rate support 226 | trig:{ |sig, ugenFunc, numChannels, soundfile, server, maxDataPoints| 227 | var trig, value, i, numOutputChannels, resultbuf; 228 | #trig ... value = ugenFunc.value(sig, soundfile).asArray; 229 | if(value.isEmpty) { value = [Phasor.ar(0, 1, 0, inf)] }; // then use frame count 230 | numOutputChannels = value.size; 231 | // we make the buffer two points larger, one for numDataPoints, one for the overrun: 232 | resultbuf = Buffer.new(server, maxDataPoints + 2, 1); 233 | value.do { |val, j| 234 | if(val.rate == \audio) { 235 | if(trig.rate != \audio) { trig = T2A.ar(trig) }; 236 | i = PulseCount.ar(trig); 237 | BufWr.ar(val, resultbuf, i - 1 * numOutputChannels + j + 1, loop: 0); // 'i' must be audio-rate for BufWr.ar 238 | if(j == 0) { BufWr.ar(i * numOutputChannels, resultbuf, DC.ar(0), loop: 0) }; // number of total points in index 0, just once 239 | } { 240 | if(trig.rate != \control) { trig = T2K.kr(trig) }; 241 | i = PulseCount.kr(trig); 242 | BufWr.kr(val, resultbuf, i - 1 * numOutputChannels + j + 1, loop: 0); // 'i' must be audio-rate for BufWr.ar 243 | if(j == 0) { BufWr.kr(i * numOutputChannels, resultbuf, DC.kr(0), loop: 0) }; // number of total points in index 0, just once 244 | } 245 | }; 246 | resultbuf 247 | }, 248 | // ugenFunc receives signal and soundfile as arguments 249 | // ugenFunc should return a continuous value, or an array of values (UGen output), which will be averaged over 250 | // no demand rate support 251 | average: { |sig, ugenFunc, numChannels, soundfile, server, maxDataPoints| 252 | var value, avg, numOutputChannels, resultbuf; 253 | value = ugenFunc.value(sig, soundfile).asArray; 254 | numOutputChannels = value.size; 255 | // we make the buffer two points larger, one for numDataPoints, one for the overrun: 256 | resultbuf = Buffer.new(server, maxDataPoints + 2, 1); 257 | value.do { |val, j| 258 | if(val.rate == \audio) { 259 | avg = Integrator.ar(val) * (1 / soundfile.numFrames); 260 | BufWr.ar(avg, resultbuf, DC.ar(j + 1), loop: 0); 261 | } { 262 | if(value.rate != \control) { value = DC.kr(val) }; 263 | avg = Integrator.kr(val) * (server.options.blockSize / soundfile.numFrames); 264 | BufWr.kr(avg, resultbuf, DC.kr(j + 1), loop: 0); 265 | }; 266 | }; 267 | BufWr.kr(numOutputChannels, resultbuf, DC.kr(0), loop: 0); // number of points in index 0: numOutputChannels. 268 | resultbuf 269 | }, 270 | // ugenFunc receives signal and soundfile as arguments 271 | // ugenFunc should return a continuous value, or an array of values (UGen output), which will be recorded frame by frame 272 | // no demand rate support 273 | direct: { |sig, ugenFunc, numChannels, soundfile, server, maxDataPoints| 274 | var value, numDataPoints, i, numOutputChannels, resultbuf; 275 | value = ugenFunc.value(sig, soundfile).asArray; 276 | numOutputChannels = value.size; 277 | 278 | numDataPoints = min(maxDataPoints, numOutputChannels * soundfile.numFrames); 279 | if(value.at(0).rate != \audio) { 280 | numDataPoints = numDataPoints / server.options.blockSize; 281 | }; 282 | // we make the buffer two points larger, one for numDataPoints, one for the overrun: 283 | resultbuf = Buffer.new(server, maxDataPoints + 2, 1); 284 | value.do { |val, j| 285 | if(val.rate == \audio) { 286 | i = Phasor.ar(0, numOutputChannels, j + 1, inf); // let this one overrun, cut off when reading file 287 | DetectSilence.ar(i <= (maxDataPoints + 2), doneAction:2); 288 | BufWr.ar(val, resultbuf, phase: i, loop: 0); 289 | } { 290 | i = Phasor.kr(0, numOutputChannels, j + 1, inf); // let this one overrun, cut off when reading file 291 | FreeSelf.kr(i > (maxDataPoints + 2)); 292 | if(value.rate != \control) { value = DC.kr(val) }; 293 | BufWr.kr(val, resultbuf, phase: i, loop: 0); 294 | }; 295 | }; 296 | BufWr.kr(numDataPoints, resultbuf, DC.kr(0), loop: 0); 297 | resultbuf 298 | } 299 | // todo: FFT / pvCalc version. 300 | ); 301 | } 302 | 303 | 304 | } 305 | -------------------------------------------------------------------------------- /HelpSource/Classes/SoundFileAnalysis.schelp: -------------------------------------------------------------------------------- 1 | TITLE:: SoundFileAnalysis 2 | summary:: A simple system for non realtime soundfile analysis 3 | categories::Non-Realtime, Files 4 | 5 | 6 | DESCRIPTION:: 7 | This class provides a relatively simple way to do custom non realtime signal analysis. Using live recorded buffers, it can do the processing in the background while the recording continues. Its input is a soundfile, its output is a dataset formatted as an event. 8 | 9 | (be aware that by default sound files are only analysed for n*serverOptions.blockSize 0.6; // amp exceeds threshold 20 | var avg = TrigAvg.kr(amp, trig); 21 | [trig, avg] // records always the average before the peak 22 | }); 23 | 24 | x = a.analyzeFile(Platform.resourceDir +/+ "sounds/a11wlk01.wav", callback: { "analysis completed".postln; }); 25 | ) 26 | 27 | x[\amplitude].plot; // plot the average amplitudes 28 | :: 29 | 30 | 31 | 32 | CLASSMETHODS:: 33 | 34 | 35 | METHOD::verbose 36 | 37 | Post what's going on (default: false). 38 | 39 | METHOD::new 40 | 41 | Return a new link::Classes/SoundFileAnalysis:: Object 42 | 43 | METHOD::initAnalysisMethods 44 | 45 | Return a function with a dictionary of basic analysis methods (trig, average, direct). 46 | 47 | METHOD::basicAnalysisMethods 48 | A dictionary with the tree keys: \trig, \average, \direct. 49 | This dictionary (basicAnalysisMethods) can be extended. 50 | 51 | definitionlist:: 52 | ## trig 53 | || Write a value on receiveing a trigger 54 | 55 | ## average 56 | || Average all values in the file 57 | 58 | 59 | ## direct 60 | || Write a value on each frame 61 | 62 | :: 63 | 64 | 65 | 66 | 67 | INSTANCEMETHODS:: 68 | 69 | METHOD::add 70 | 71 | Add a new analysis method 72 | 73 | ARGUMENT::name 74 | 75 | Name for the method (a link::Classes/Symbol::) 76 | 77 | ARGUMENT::type 78 | 79 | One of currently three types: 80 | 81 | definitionlist:: 82 | ## trig 83 | || Write one or more values on receiveing a trigger 84 | 85 | ## direct 86 | || Write a value on each frame 87 | 88 | ## average 89 | || Average all values in the file 90 | 91 | :: 92 | 93 | 94 | ARGUMENT::ugenFunc 95 | 96 | A function that returns a UGen graph. It takes the sound signal and the soundfile object as arguments. 97 | 98 | METHOD::analysisMethods 99 | 100 | Returns a dictionary of functions of currently defined methods. 101 | 102 | 103 | 104 | METHOD::analyzeFile 105 | 106 | Analyze a sound file, using the defined analysis methods. This method returns an link::Classes/Event:: with the following information: 107 | definitionlist:: 108 | ## ~fileName, ~path, ~fileNumChannels 109 | || path and sound file information 110 | 111 | ## ~analysisStart, ~analysisDuration 112 | || What part of the file was analyzed 113 | 114 | ## ~dataDimensions 115 | || The results, each resulting from an analysis method (an link::Classes/Event::) 116 | 117 | ## ~dataTable 118 | || The above results ordered as a multidimensional array 119 | 120 | :: 121 | 122 | 123 | ARGUMENT::path 124 | 125 | Path to the soundfile 126 | 127 | ARGUMENT::start 128 | 129 | Start frame index for analysis 130 | 131 | ARGUMENT::duration 132 | 133 | Analysis duration in seconds 134 | 135 | ARGUMENT::which 136 | 137 | Which methods to use (an array of names as symbols). If none is given, use all. 138 | 139 | ARGUMENT::callback 140 | 141 | A function that is called when analysis is completed. It takes the result (an event) as argument. 142 | 143 | ARGUMENT::maxDataPoints 144 | 145 | A limit on the number of points added to the data. 146 | 147 | ARGUMENT::trimDuration 148 | 149 | When code::trimDuration:: is unspecified, the duration is no longer than the length of the file. Because only full blocks are written to the buffer, usually the last samples of a file are not analysed. Setting code::trimDuration:: allows you to specify what is supposed to happen with the last block or leaves the duration be as specified in the argument. (see example below) 150 | 151 | \roundDown analyses the file until the full last block. 152 | 153 | \roundUp analyses the file and adds silence to fill the last block. 154 | 155 | nil leaves the duration as given in the argument. 156 | 157 | ARGUMENT::serverOptions 158 | 159 | link::Classes/ServerOptions:: for the NRT server. A way to deal with the last half block problem is to set the blockSize to 1. (see example below) 160 | 161 | 162 | 163 | METHOD::analyzeAll 164 | 165 | Analyze all files given, returning a link::Classes/List:: of link::Classes/Event::s. 166 | 167 | ARGUMENT::paths 168 | 169 | A list of paths 170 | 171 | 172 | 173 | 174 | 175 | EXAMPLES:: 176 | CODE:: 177 | s.boot; 178 | 179 | // record a sound into a buffer 180 | b = Buffer.alloc(s, s.sampleRate * 3, 1, bufnum: 1000); 181 | 182 | ( 183 | SynthDef(\record, {|out| 184 | var in, rec; 185 | in = RLPF.ar(LFSaw.ar(300 * SinOsc.kr(0.4).range(0.5, 5)), Line.kr(12000, 100, 3)); 186 | rec = RecordBuf.ar(in, b.bufnum, loop: 0, doneAction: 2); 187 | Out.ar(out, in); 188 | }; 189 | ).add 190 | ) 191 | 192 | Synth(\record); 193 | 194 | // write the file to analyze later 195 | b.write("~/soundFileAnalysisExample.aiff".standardizePath,"aiff", "int24"); 196 | 197 | b.play; // maybe check if something is there 198 | 199 | // initialize analysis 200 | ( 201 | a = SoundFileAnalysis.new; 202 | 203 | a.add(\centroid, \trig, {|sig| 204 | var fft = FFT(LocalBuf(2048, 1), sig); 205 | var x = SpecCentroid.kr(fft); 206 | [Impulse.kr(5), x] 207 | }); 208 | a.add(\crest, \average, {|sig, soundfile| Crest.kr(sig, soundfile.numFrames) }); 209 | a.add(\amplitude, \direct, {|sig| Amplitude.kr(sig); }); 210 | ) 211 | 212 | // analyze the sound 213 | 214 | x = a.analyzeFile("~/soundFileAnalysisExample.aiff".standardizePath, duration: 3, maxDataPoints: 3000, callback: {"done!".postln;}); 215 | 216 | // look at the data 217 | x[\centroid].postcs; 218 | x[\crest].postcs; 219 | x[\amplitude].postcs; 220 | 221 | 222 | // BONUS: how to tweak the analysis methods 223 | ( 224 | Ndef(\centroid, { 225 | var sig = RLPF.ar( LFSaw.ar(300 * SinOsc.kr(0.4).range(0.5, 5)), Line.kr(12000, 300, 3)); 226 | var fft = FFT(LocalBuf(2048, 1), sig); 227 | var x = SpecCentroid.kr(fft); 228 | x.poll(10); 229 | sig; 230 | }).play; 231 | ) 232 | :: 233 | 234 | SECTION::Live audio analysis 235 | CODE:: 236 | 237 | 238 | 239 | ( 240 | 241 | ~sfa = SoundFileAnalysis.new; 242 | 243 | ~sfa.add(\onsets, \trig, {|sig| 244 | var fft = FFT(LocalBuf(2048, 1), sig); 245 | var x = Onsets.kr(fft); // if needed, adjust analysis 246 | var currentTime = Sweep.kr(1, 1); // time in seconds 247 | [x, currentTime] 248 | }); 249 | 250 | ~analyzed = (); // a dictionary to keep several analysis data sets 251 | ~dur = 4; 252 | 253 | SynthDef(\playchunk, { |out, bufnum, sustain = 1, amp = 0.1, rate = 1, onset = 0| 254 | var startPos = onset * BufSampleRate.kr(bufnum); // convert from seconds to frames 255 | var env = EnvGen.kr(Env.linen(0.001, sustain / rate, 0.02), doneAction:2); 256 | Out.ar(out, 257 | PlayBuf.ar(2, bufnum, rate, startPos:startPos) 258 | ) 259 | }).add; 260 | 261 | ~liveBuffer = Buffer.alloc(s, s.sampleRate * ~dur, 2); 262 | 263 | ~analyze = { |name = 0| 264 | var path; 265 | fork { 266 | path = "~/analysis_%.aiff".format(name).standardizePath; 267 | ~liveBuffer.write(path); // write soundfile as a copy 268 | s.sync; 269 | x = ~sfa.analyzeFile(path, callback: { "analysed buffer, saved in index %".format(name).postln;}); 270 | x[\buffer] = Buffer.read(s, path); // read soundfile 271 | ~analyzed[name] = x; 272 | 273 | }; 274 | }; 275 | 276 | ~makeEvents = { |name, func| 277 | var analysis = ~analyzed[name], buffer, onsets, durations, events; 278 | if(analysis.isNil) { "analysis file not found".postln } { 279 | buffer = analysis[\buffer]; 280 | onsets = analysis[\onsets]; 281 | durations = onsets.differentiate.drop(1); 282 | durations = durations.add(buffer.duration - onsets.last); 283 | events = onsets.collect { |time, i| 284 | ( 285 | onset:time, 286 | bufnum: buffer, 287 | dur: durations[i], 288 | sustain: durations[i], 289 | rate: 1, 290 | instrument:\playchunk 291 | ) 292 | }; 293 | }; 294 | 295 | 296 | }; 297 | ~freeAllBuffers = { 298 | ~analyzed.do { |x| x[\buffer].free }; 299 | }; 300 | ~writeToFiles = { |name, path| 301 | ~makeEvents.value(name).do { |x, i| 302 | var buffer = x[\bufnum]; 303 | var filepath = format("%_%_%.aiff", path, name, i).standardizePath; 304 | buffer.write(filepath, numFrames:x[\sustain] * buffer.sampleRate, startFrame:x[\onset] * buffer.sampleRate) 305 | } 306 | }; 307 | ) 308 | 309 | 310 | 311 | // record into a 4 second live buffer 312 | Ndef(\rec, { RecordBuf.ar(SoundIn.ar([0, 1]), ~liveBuffer, loop:1) }); 313 | 314 | // hit cmd-period to stop recording, or Ndef(\rec).free; 315 | // for restarting the recording, call Ndef(\rec).send; 316 | 317 | 318 | 319 | ~analyze.value; 320 | 321 | ~analyzed[0].buffer.play; // something there? 322 | ~analyzed[0][\onsets]; // post onsets 323 | ~events = ~makeEvents.(0); // generate events 324 | ~events.size; // how many? 325 | ~events.choose.play; // play a random one 326 | 327 | 328 | // play back as a pattern 329 | Pbindf(Pseq(~events.copy.scramble, inf), \rate, 1).play; 330 | Pbindf(Pseq(~events.copy.scramble, inf), \rate, 2, \dur, 1.4).play; 331 | 332 | 333 | // if you need, write to files 334 | ~writeToFiles.(0, "~/test"); 335 | 336 | // free all 337 | ~freeAllBuffers.value; 338 | 339 | :: 340 | 341 | 342 | 343 | 344 | 345 | SECTION::Tests 346 | CODE:: 347 | ( 348 | a = SoundFileAnalysis.new; 349 | 350 | a.add(\onsets, \trig, { |sig| 351 | var fft = FFT(LocalBuf(512, 1), sig); 352 | Onsets.kr(fft) 353 | }); 354 | a.add(\fftcrest, \average, { |sig| 355 | FFTCrest.kr(FFT(LocalBuf(2048, 1), sig)) 356 | }); 357 | 358 | a.add(\slope, \average, { |sig| 359 | FFTSlope.kr(FFT(LocalBuf(2048, 1), sig)) 360 | }); 361 | a.add(\amplitude, \average, { |sig| 362 | Amplitude.kr(sig) 363 | }); 364 | 365 | a.add(\test, \trig, { |sig| 366 | [Impulse.kr(2), 1, 2, 3] 367 | }); 368 | 369 | a.add(\test2, \direct, { |sig| 370 | //DC.kr([10, 20, 30]) 371 | Phasor.kr(0, 1, 1, inf); 372 | }); 373 | 374 | a.add(\test3, \direct, { |sig| 375 | Phasor.ar(0, [10, 1], 1, inf); 376 | }); 377 | ); 378 | 379 | // analyze single files 380 | x = a.analyzeFile(Platform.resourceDir +/+ "sounds/a11wlk01.wav", callback: { "analysis completed".postln }, maxDataPoints: 6000); 381 | x.postcs;""; 382 | x[\test]; 383 | x[\test2].cs; 384 | x[\test3].cs; 385 | x[\test].as(Array).shape 386 | x[\crest]; 387 | x[\onsets]; 388 | 389 | 390 | :: 391 | 392 | 393 | Example of three ways about how to deal with the last block problem. 394 | 395 | In the following example the number of zerocrossing in a file is written in the last block of the calculation. 396 | 397 | code:: 398 | ( 399 | p = Platform.resourceDir +/+ "sounds/a11wlk01.wav"; 400 | f = SoundFile.openRead(p); 401 | n = f.numFrames; 402 | f.close; 403 | a=SoundFileAnalysis(); 404 | a.add(\pn, \trig, { |sig| 405 | var zc = (sig > 0) & (Delay1.ar(sig) <= 0); 406 | var count = PulseCount.ar(zc); 407 | var trig = Phasor.ar(0,1,0,n) - n + 2; 408 | [trig, count]}); 409 | ) 410 | :: 411 | 412 | With the default values the result will be empty: 413 | 414 | code:: 415 | x=a.analyzeFile(p, callback: {x.pn.postln}); 416 | :: 417 | 418 | Only if the last block is included by setting the trimDuration to \roundUp the result is printed: 419 | 420 | code:: 421 | x=a.analyzeFile(p, callback: {x.pn.postln}, trimDuration: \roundUp); 422 | :: 423 | 424 | It is not enough to provide a duration that is the amount of samples longer to fill the last block. because by default the duration is trimmed to the sample length: 425 | 426 | code:: 427 | x=a.analyzeFile(p, duration: (n/44100).roundUp(64 / 44100), callback: {x.pn.postln}); 428 | :: 429 | 430 | One can freely set the duration if one set trimDuration to nil: 431 | 432 | code:: 433 | x=a.analyzeFile(p, duration: (n/44100).roundUp(64 / 44100), callback: {x.pn.postln}, trimDuration: nil); 434 | :: 435 | 436 | 437 | Or one can use a server with the blockSize of 1. But this is less efficient. 438 | 439 | code:: 440 | x=a.analyzeFile(p, callback: {x.pn.postln}, serverOptions: ServerOptions().blockSize_(1).verbosity_(-1)); 441 | :: 442 | -------------------------------------------------------------------------------- /LICENSE: -------------------------------------------------------------------------------- 1 | GNU GENERAL PUBLIC LICENSE 2 | Version 2, June 1991 3 | 4 | Copyright (C) 1989, 1991 Free Software Foundation, Inc., 5 | 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA 6 | Everyone is permitted to copy and distribute verbatim copies 7 | of this license document, but changing it is not allowed. 8 | 9 | Preamble 10 | 11 | The licenses for most software are designed to take away your 12 | freedom to share and change it. By contrast, the GNU General Public 13 | License is intended to guarantee your freedom to share and change free 14 | software--to make sure the software is free for all its users. This 15 | General Public License applies to most of the Free Software 16 | Foundation's software and to any other program whose authors commit to 17 | using it. (Some other Free Software Foundation software is covered by 18 | the GNU Lesser General Public License instead.) You can apply it to 19 | your programs, too. 20 | 21 | When we speak of free software, we are referring to freedom, not 22 | price. Our General Public Licenses are designed to make sure that you 23 | have the freedom to distribute copies of free software (and charge for 24 | this service if you wish), that you receive source code or can get it 25 | if you want it, that you can change the software or use pieces of it 26 | in new free programs; and that you know you can do these things. 27 | 28 | To protect your rights, we need to make restrictions that forbid 29 | anyone to deny you these rights or to ask you to surrender the rights. 30 | These restrictions translate to certain responsibilities for you if you 31 | distribute copies of the software, or if you modify it. 32 | 33 | For example, if you distribute copies of such a program, whether 34 | gratis or for a fee, you must give the recipients all the rights that 35 | you have. You must make sure that they, too, receive or can get the 36 | source code. And you must show them these terms so they know their 37 | rights. 38 | 39 | We protect your rights with two steps: (1) copyright the software, and 40 | (2) offer you this license which gives you legal permission to copy, 41 | distribute and/or modify the software. 42 | 43 | Also, for each author's protection and ours, we want to make certain 44 | that everyone understands that there is no warranty for this free 45 | software. If the software is modified by someone else and passed on, we 46 | want its recipients to know that what they have is not the original, so 47 | that any problems introduced by others will not reflect on the original 48 | authors' reputations. 49 | 50 | Finally, any free program is threatened constantly by software 51 | patents. We wish to avoid the danger that redistributors of a free 52 | program will individually obtain patent licenses, in effect making the 53 | program proprietary. To prevent this, we have made it clear that any 54 | patent must be licensed for everyone's free use or not licensed at all. 55 | 56 | The precise terms and conditions for copying, distribution and 57 | modification follow. 58 | 59 | GNU GENERAL PUBLIC LICENSE 60 | TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION 61 | 62 | 0. This License applies to any program or other work which contains 63 | a notice placed by the copyright holder saying it may be distributed 64 | under the terms of this General Public License. The "Program", below, 65 | refers to any such program or work, and a "work based on the Program" 66 | means either the Program or any derivative work under copyright law: 67 | that is to say, a work containing the Program or a portion of it, 68 | either verbatim or with modifications and/or translated into another 69 | language. (Hereinafter, translation is included without limitation in 70 | the term "modification".) Each licensee is addressed as "you". 71 | 72 | Activities other than copying, distribution and modification are not 73 | covered by this License; they are outside its scope. The act of 74 | running the Program is not restricted, and the output from the Program 75 | is covered only if its contents constitute a work based on the 76 | Program (independent of having been made by running the Program). 77 | Whether that is true depends on what the Program does. 78 | 79 | 1. You may copy and distribute verbatim copies of the Program's 80 | source code as you receive it, in any medium, provided that you 81 | conspicuously and appropriately publish on each copy an appropriate 82 | copyright notice and disclaimer of warranty; keep intact all the 83 | notices that refer to this License and to the absence of any warranty; 84 | and give any other recipients of the Program a copy of this License 85 | along with the Program. 86 | 87 | You may charge a fee for the physical act of transferring a copy, and 88 | you may at your option offer warranty protection in exchange for a fee. 89 | 90 | 2. You may modify your copy or copies of the Program or any portion 91 | of it, thus forming a work based on the Program, and copy and 92 | distribute such modifications or work under the terms of Section 1 93 | above, provided that you also meet all of these conditions: 94 | 95 | a) You must cause the modified files to carry prominent notices 96 | stating that you changed the files and the date of any change. 97 | 98 | b) You must cause any work that you distribute or publish, that in 99 | whole or in part contains or is derived from the Program or any 100 | part thereof, to be licensed as a whole at no charge to all third 101 | parties under the terms of this License. 102 | 103 | c) If the modified program normally reads commands interactively 104 | when run, you must cause it, when started running for such 105 | interactive use in the most ordinary way, to print or display an 106 | announcement including an appropriate copyright notice and a 107 | notice that there is no warranty (or else, saying that you provide 108 | a warranty) and that users may redistribute the program under 109 | these conditions, and telling the user how to view a copy of this 110 | License. (Exception: if the Program itself is interactive but 111 | does not normally print such an announcement, your work based on 112 | the Program is not required to print an announcement.) 113 | 114 | These requirements apply to the modified work as a whole. If 115 | identifiable sections of that work are not derived from the Program, 116 | and can be reasonably considered independent and separate works in 117 | themselves, then this License, and its terms, do not apply to those 118 | sections when you distribute them as separate works. But when you 119 | distribute the same sections as part of a whole which is a work based 120 | on the Program, the distribution of the whole must be on the terms of 121 | this License, whose permissions for other licensees extend to the 122 | entire whole, and thus to each and every part regardless of who wrote it. 123 | 124 | Thus, it is not the intent of this section to claim rights or contest 125 | your rights to work written entirely by you; rather, the intent is to 126 | exercise the right to control the distribution of derivative or 127 | collective works based on the Program. 128 | 129 | In addition, mere aggregation of another work not based on the Program 130 | with the Program (or with a work based on the Program) on a volume of 131 | a storage or distribution medium does not bring the other work under 132 | the scope of this License. 133 | 134 | 3. You may copy and distribute the Program (or a work based on it, 135 | under Section 2) in object code or executable form under the terms of 136 | Sections 1 and 2 above provided that you also do one of the following: 137 | 138 | a) Accompany it with the complete corresponding machine-readable 139 | source code, which must be distributed under the terms of Sections 140 | 1 and 2 above on a medium customarily used for software interchange; or, 141 | 142 | b) Accompany it with a written offer, valid for at least three 143 | years, to give any third party, for a charge no more than your 144 | cost of physically performing source distribution, a complete 145 | machine-readable copy of the corresponding source code, to be 146 | distributed under the terms of Sections 1 and 2 above on a medium 147 | customarily used for software interchange; or, 148 | 149 | c) Accompany it with the information you received as to the offer 150 | to distribute corresponding source code. (This alternative is 151 | allowed only for noncommercial distribution and only if you 152 | received the program in object code or executable form with such 153 | an offer, in accord with Subsection b above.) 154 | 155 | The source code for a work means the preferred form of the work for 156 | making modifications to it. For an executable work, complete source 157 | code means all the source code for all modules it contains, plus any 158 | associated interface definition files, plus the scripts used to 159 | control compilation and installation of the executable. However, as a 160 | special exception, the source code distributed need not include 161 | anything that is normally distributed (in either source or binary 162 | form) with the major components (compiler, kernel, and so on) of the 163 | operating system on which the executable runs, unless that component 164 | itself accompanies the executable. 165 | 166 | If distribution of executable or object code is made by offering 167 | access to copy from a designated place, then offering equivalent 168 | access to copy the source code from the same place counts as 169 | distribution of the source code, even though third parties are not 170 | compelled to copy the source along with the object code. 171 | 172 | 4. You may not copy, modify, sublicense, or distribute the Program 173 | except as expressly provided under this License. Any attempt 174 | otherwise to copy, modify, sublicense or distribute the Program is 175 | void, and will automatically terminate your rights under this License. 176 | However, parties who have received copies, or rights, from you under 177 | this License will not have their licenses terminated so long as such 178 | parties remain in full compliance. 179 | 180 | 5. You are not required to accept this License, since you have not 181 | signed it. However, nothing else grants you permission to modify or 182 | distribute the Program or its derivative works. These actions are 183 | prohibited by law if you do not accept this License. Therefore, by 184 | modifying or distributing the Program (or any work based on the 185 | Program), you indicate your acceptance of this License to do so, and 186 | all its terms and conditions for copying, distributing or modifying 187 | the Program or works based on it. 188 | 189 | 6. Each time you redistribute the Program (or any work based on the 190 | Program), the recipient automatically receives a license from the 191 | original licensor to copy, distribute or modify the Program subject to 192 | these terms and conditions. You may not impose any further 193 | restrictions on the recipients' exercise of the rights granted herein. 194 | You are not responsible for enforcing compliance by third parties to 195 | this License. 196 | 197 | 7. If, as a consequence of a court judgment or allegation of patent 198 | infringement or for any other reason (not limited to patent issues), 199 | conditions are imposed on you (whether by court order, agreement or 200 | otherwise) that contradict the conditions of this License, they do not 201 | excuse you from the conditions of this License. If you cannot 202 | distribute so as to satisfy simultaneously your obligations under this 203 | License and any other pertinent obligations, then as a consequence you 204 | may not distribute the Program at all. For example, if a patent 205 | license would not permit royalty-free redistribution of the Program by 206 | all those who receive copies directly or indirectly through you, then 207 | the only way you could satisfy both it and this License would be to 208 | refrain entirely from distribution of the Program. 209 | 210 | If any portion of this section is held invalid or unenforceable under 211 | any particular circumstance, the balance of the section is intended to 212 | apply and the section as a whole is intended to apply in other 213 | circumstances. 214 | 215 | It is not the purpose of this section to induce you to infringe any 216 | patents or other property right claims or to contest validity of any 217 | such claims; this section has the sole purpose of protecting the 218 | integrity of the free software distribution system, which is 219 | implemented by public license practices. Many people have made 220 | generous contributions to the wide range of software distributed 221 | through that system in reliance on consistent application of that 222 | system; it is up to the author/donor to decide if he or she is willing 223 | to distribute software through any other system and a licensee cannot 224 | impose that choice. 225 | 226 | This section is intended to make thoroughly clear what is believed to 227 | be a consequence of the rest of this License. 228 | 229 | 8. If the distribution and/or use of the Program is restricted in 230 | certain countries either by patents or by copyrighted interfaces, the 231 | original copyright holder who places the Program under this License 232 | may add an explicit geographical distribution limitation excluding 233 | those countries, so that distribution is permitted only in or among 234 | countries not thus excluded. In such case, this License incorporates 235 | the limitation as if written in the body of this License. 236 | 237 | 9. The Free Software Foundation may publish revised and/or new versions 238 | of the General Public License from time to time. Such new versions will 239 | be similar in spirit to the present version, but may differ in detail to 240 | address new problems or concerns. 241 | 242 | Each version is given a distinguishing version number. If the Program 243 | specifies a version number of this License which applies to it and "any 244 | later version", you have the option of following the terms and conditions 245 | either of that version or of any later version published by the Free 246 | Software Foundation. If the Program does not specify a version number of 247 | this License, you may choose any version ever published by the Free Software 248 | Foundation. 249 | 250 | 10. If you wish to incorporate parts of the Program into other free 251 | programs whose distribution conditions are different, write to the author 252 | to ask for permission. For software which is copyrighted by the Free 253 | Software Foundation, write to the Free Software Foundation; we sometimes 254 | make exceptions for this. Our decision will be guided by the two goals 255 | of preserving the free status of all derivatives of our free software and 256 | of promoting the sharing and reuse of software generally. 257 | 258 | NO WARRANTY 259 | 260 | 11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY 261 | FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN 262 | OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES 263 | PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED 264 | OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF 265 | MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS 266 | TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE 267 | PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, 268 | REPAIR OR CORRECTION. 269 | 270 | 12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 271 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR 272 | REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, 273 | INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING 274 | OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED 275 | TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY 276 | YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER 277 | PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE 278 | POSSIBILITY OF SUCH DAMAGES. 279 | 280 | END OF TERMS AND CONDITIONS 281 | 282 | How to Apply These Terms to Your New Programs 283 | 284 | If you develop a new program, and you want it to be of the greatest 285 | possible use to the public, the best way to achieve this is to make it 286 | free software which everyone can redistribute and change under these terms. 287 | 288 | To do so, attach the following notices to the program. It is safest 289 | to attach them to the start of each source file to most effectively 290 | convey the exclusion of warranty; and each file should have at least 291 | the "copyright" line and a pointer to where the full notice is found. 292 | 293 | {description} 294 | Copyright (C) {year} {fullname} 295 | 296 | This program is free software; you can redistribute it and/or modify 297 | it under the terms of the GNU General Public License as published by 298 | the Free Software Foundation; either version 2 of the License, or 299 | (at your option) any later version. 300 | 301 | This program is distributed in the hope that it will be useful, 302 | but WITHOUT ANY WARRANTY; without even the implied warranty of 303 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 304 | GNU General Public License for more details. 305 | 306 | You should have received a copy of the GNU General Public License along 307 | with this program; if not, write to the Free Software Foundation, Inc., 308 | 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA. 309 | 310 | Also add information on how to contact you by electronic and paper mail. 311 | 312 | If the program is interactive, make it output a short notice like this 313 | when it starts in an interactive mode: 314 | 315 | Gnomovision version 69, Copyright (C) year name of author 316 | Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'. 317 | This is free software, and you are welcome to redistribute it 318 | under certain conditions; type `show c' for details. 319 | 320 | The hypothetical commands `show w' and `show c' should show the appropriate 321 | parts of the General Public License. Of course, the commands you use may 322 | be called something other than `show w' and `show c'; they could even be 323 | mouse-clicks or menu items--whatever suits your program. 324 | 325 | You should also get your employer (if you work as a programmer) or your 326 | school, if any, to sign a "copyright disclaimer" for the program, if 327 | necessary. Here is a sample; alter the names: 328 | 329 | Yoyodyne, Inc., hereby disclaims all copyright interest in the program 330 | `Gnomovision' (which makes passes at compilers) written by James Hacker. 331 | 332 | {signature of Ty Coon}, 1 April 1989 333 | Ty Coon, President of Vice 334 | 335 | This General Public License does not permit incorporating your program into 336 | proprietary programs. If your program is a subroutine library, you may 337 | consider it more useful to permit linking proprietary applications with the 338 | library. If this is what you want to do, use the GNU Lesser General 339 | Public License instead of this License. 340 | 341 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # SoundFileAnalysis 2 | A simple system for custom non realtime soundfile analysis in SuperCollider 3 | 4 | a simple example: 5 | 6 | ```` 7 | ( 8 | var analysis, path; 9 | analysis = SoundFileAnalysis.new; 10 | // add some custom sound analysis method 11 | analysis.add(\my_trig_amps, \trig, { |sig| 12 | var amp = Amplitude.kr(sig); 13 | var trig = amp > 0.6; // amp exceeds threshold 14 | var avg = TrigAvg.kr(amp, trig); 15 | [trig, avg] // records always the average before the peak 16 | }); 17 | 18 | path = Platform.resourceDir +/+ "sounds/a11wlk01.wav"; 19 | x = analysis.analyzeFile(path, callback: { "analysis completed".postln; }); 20 | ) 21 | 22 | x[\my_trig_amps].plot; // plot the average amplitudes 23 | ```` 24 | -------------------------------------------------------------------------------- /SoundFileAnalysis.quark: -------------------------------------------------------------------------------- 1 | ( 2 | \name: "SoundFileAnalysis", 3 | \summary: "A simple system for non realtime soundfile analysis", 4 | \author: "Julian Rohrhuber, Florian Zeeh, Raffael Seyfried und Hans W. Koch", 5 | \organization: "Institute for Music and Media Duesseldorf", 6 | \country: "Germany", 7 | \since: "2014" 8 | ) --------------------------------------------------------------------------------