4 * Copyright (C) 2008 Adam Williams <broadcast at earthling dot net>
6 * This program is free software; you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License as published by
8 * the Free Software Foundation; either version 2 of the License, or
9 * (at your option) any later version.
11 * This program is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 * GNU General Public License for more details.
16 * You should have received a copy of the GNU General Public License
17 * along with this program; if not, write to the Free Software
18 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
22 #include "bcdisplayinfo.h"
38 #define WINDOW_BORDER (window_size / 2)
39 #define SGN(x) (x<0 ? -1: 1)
42 REGISTER_PLUGIN(DenoiseEffect)
48 DenoiseEffect::DenoiseEffect(PluginServer *server)
49 : PluginAClient(server)
55 DenoiseEffect::~DenoiseEffect()
62 LOAD_CONFIGURATION_MACRO(DenoiseEffect, DenoiseConfig)
64 NEW_WINDOW_MACRO(DenoiseEffect, DenoiseWindow)
66 void DenoiseEffect::delete_dsp()
68 if(ex_coeff_d) delete ex_coeff_d;
69 if(ex_coeff_r) delete ex_coeff_r;
70 if(ex_coeff_rn) delete ex_coeff_rn;
71 if(wave_coeff_d) delete wave_coeff_d;
72 if(wave_coeff_r) delete wave_coeff_r;
73 if(decomp_filter) delete decomp_filter;
74 if(recon_filter) delete recon_filter;
75 if(input_buffer) delete [] input_buffer;
76 if(output_buffer) delete [] output_buffer;
77 if(dsp_in) delete [] dsp_in;
78 if(dsp_out) delete [] dsp_out;
79 if(dsp_iteration) delete [] dsp_iteration;
96 void DenoiseEffect::reset()
111 input_allocation = 0;
112 output_allocation = 0;
129 const char* DenoiseEffect::plugin_title() { return N_("Denoise"); }
130 int DenoiseEffect::is_realtime() { return 1; }
134 void DenoiseEffect::read_data(KeyFrame *keyframe)
137 input.set_shared_input(keyframe->get_data(), strlen(keyframe->get_data()));
142 result = input.read_tag();
146 if(input.tag.title_is("DENOISE"))
148 config.level = input.tag.get_property("LEVEL", config.level);
154 void DenoiseEffect::save_data(KeyFrame *keyframe)
157 output.set_shared_output(keyframe->get_data(), MESSAGESIZE);
159 output.tag.set_title("DENOISE");
160 output.tag.set_property("LEVEL", config.level);
162 output.append_newline();
164 output.terminate_string();
168 void DenoiseEffect::update_gui()
172 ((DenoiseWindow*)thread->window)->lock_window();
173 ((DenoiseWindow*)thread->window)->update();
174 ((DenoiseWindow*)thread->window)->unlock_window();
180 double DenoiseEffect::dot_product(double *data, double *filter, char filtlen)
186 for(i = 0; i < filtlen; i++) sum += *data-- * *filter++;
190 int DenoiseEffect::convolve_dec_2(double *input_sequence,
194 double *output_sequence)
196 // convolve the input sequence with the filter and decimate by two
197 int i, shortlen, offset;
198 int64_t lengthp4 = length + 4;
199 int64_t lengthm4 = length - 4;
200 int64_t lengthp5 = length + 5;
201 int64_t lengthp8 = length + 8;
203 for(i = 0; (i <= lengthp8) && ((i - filtlen) <= lengthp8); i += 2)
206 *output_sequence++ = dot_product(input_sequence + i, filter, i + 1);
210 offset = i - lengthm4;
211 shortlen = filtlen - offset;
212 *output_sequence++ = dot_product(input_sequence + lengthp4,
213 filter + offset, shortlen);
216 *output_sequence++ = dot_product(input_sequence + i, filter, filtlen);
221 int64_t DenoiseEffect::decompose_branches(double *in_data,
223 WaveletFilters *decomp_filter,
227 // Take input data and filters and form two branches of half the
228 // original length. Length of branches is returned.
229 convolve_dec_2(in_data, length, decomp_filter->h, decomp_filter->length, out_low);
230 convolve_dec_2(in_data, length, decomp_filter->g, decomp_filter->length, out_high);
234 int DenoiseEffect::wavelet_decomposition(double *in_data,
238 for(int i = 0; i < levels; i++)
240 in_length = decompose_branches(in_data,
244 out_data[(2 * i) + 1]);
246 in_data = out_data[2 * i];
251 int DenoiseEffect::tree_copy(double **output,
256 register int i, j, k, l, m;
258 for(i = 0, k = 1; k < levels; i++, k++)
264 for(j = 0; j < length + 5; j++)
267 output[m][j] = input[m][j];
275 for(j = 0; j < length + 5; j++)
277 output[l][j] = input[l][j];
278 output[m][j] = input[m][j];
283 int DenoiseEffect::threshold(int window_size, double gammas, int levels)
286 double threshold, cv, cvb, abs_coeff_r;
287 double *coeff_r, *coeff_l;
290 for(i = 0; i < levels; i++)
292 length = (window_size >> (i + 1)) + 5;
293 threshold = sqrt(2 * log(length) / log(2)) * gammas / sqrt(length);
295 for(j = 0; j < length; j++)
297 coeff_r = &(ex_coeff_r->values[(2 * i) + 1][j]);
298 coeff_l = &(ex_coeff_rn->values[(2 * i) + 1][j]);
301 abs_coeff_r = fabs(*coeff_r);
302 cvb = abs_coeff_r - threshold;
305 if(abs_coeff_r > threshold)
321 double DenoiseEffect::dot_product_even(double *data, double *filter, int filtlen)
327 for(i = 0; i < filtlen; i += 2) sum += *data-- * filter[i];
332 double DenoiseEffect::dot_product_odd(double *data, double *filter, int filtlen)
338 for(i = 1; i < filtlen; i += 2) sum += *data-- * filter[i];
342 int DenoiseEffect::convolve_int_2(double *input_sequence,
347 double *output_sequence)
348 // insert zeros between each element of the input sequence and
349 // convolve with the filter to interpolate the data
352 int endpoint = length + filtlen - 2;
356 // summation with previous convolution
357 // every other dot product interpolates the data
358 for(i = (filtlen / 2) - 1, j = (filtlen / 2); i < endpoint; i++, j++)
360 *output_sequence++ += dot_product_odd(input_sequence + i, filter, filtlen);
361 *output_sequence++ += dot_product_even(input_sequence + j, filter, filtlen);
364 *output_sequence++ += dot_product_odd(input_sequence + i, filter, filtlen);
368 // first convolution of pair
369 // every other dot product interpolates the data
370 for(i = (filtlen / 2) - 1, j = (filtlen / 2); i < endpoint; i++, j++)
372 *output_sequence++ = dot_product_odd(input_sequence + i, filter, filtlen);
373 *output_sequence++ = dot_product_even(input_sequence + j, filter, filtlen);
376 *output_sequence++ = dot_product_odd(input_sequence + i, filter, filtlen);
382 int64_t DenoiseEffect::reconstruct_branches(double *in_low,
385 WaveletFilters *recon_filter,
388 // take input data and filters and form two branches of half the
389 // original length. length of branches is returned
390 convolve_int_2(in_low, in_length, recon_filter->h,
391 recon_filter->length, 0, output);
392 convolve_int_2(in_high, in_length, recon_filter->g,
393 recon_filter->length, 1, output);
394 return in_length * 2;
397 int DenoiseEffect::wavelet_reconstruction(double **in_data,
404 in_length = in_length >> levels;
405 // destination of all but last branch reconstruction is the next
406 // higher intermediate approximation
407 for(i = levels - 1; i > 0; i--)
409 output = in_data[2 * (i - 1)];
410 in_length = reconstruct_branches(in_data[2 * i],
411 in_data[(2 * i) + 1],
417 // destination of the last branch reconstruction is the output data
418 reconstruct_branches(in_data[0],
427 void DenoiseEffect::process_window()
430 for(j = 0; j < iterations; j++)
432 wavelet_decomposition(dsp_in, window_size, ex_coeff_d->values);
434 tree_copy(ex_coeff_r->values, ex_coeff_d->values, window_size, levels);
435 tree_copy(ex_coeff_rn->values, ex_coeff_d->values, window_size, levels);
438 //printf("DenoiseEffect::process_window %f\n", config.level);
439 threshold(window_size, config.level * 10.0, levels);
441 wavelet_reconstruction(ex_coeff_r->values, window_size, dsp_iteration);
442 wavelet_reconstruction(ex_coeff_rn->values, window_size, dsp_in);
444 for(i = 0; i < window_size; i++)
445 dsp_out[i] += dsp_iteration[i];
452 int DenoiseEffect::process_realtime(int64_t size, Samples *input_ptr, Samples *output_ptr)
454 load_configuration();
458 int64_t size_factor = (int)(pow(2, levels));
459 dsp_in = new double[window_size * size_factor];
460 dsp_out = new double[window_size * 2];
461 dsp_iteration = new double[window_size * 2];
464 ex_coeff_d = new Tree(window_size, levels);
465 ex_coeff_r = new Tree(window_size, levels);
466 ex_coeff_rn = new Tree(window_size, levels);
467 wave_coeff_d = new WaveletCoeffs(alpha, beta);
468 wave_coeff_r = new WaveletCoeffs(alpha, beta);
469 decomp_filter = new WaveletFilters(wave_coeff_d, DECOMP);
470 recon_filter = new WaveletFilters(wave_coeff_r, RECON);
471 in_scale = 65535 / sqrt(window_size) / iterations;
472 out_scale = output_level / 65535 * sqrt(window_size);
476 // Append input buffer
477 if(input_size + size > input_allocation)
479 double *new_input = new double[input_size + size];
482 memcpy(new_input, input_buffer, sizeof(double) * input_size);
483 delete [] input_buffer;
485 input_buffer = new_input;
486 input_allocation = input_size + size;
488 memcpy(input_buffer + input_size,
489 input_ptr->get_data(),
490 size * sizeof(double));
494 // Have enough to do some windows
495 while(input_size >= window_size)
498 for(int i = 0; i < window_size; i++)
500 dsp_in[i] = input_buffer[i] * in_scale;
502 bzero(dsp_out, sizeof(double) * window_size);
509 // First window produces garbage
519 // Crossfade into the output buffer
520 int64_t new_allocation = output_size + window_size;
521 if(new_allocation > output_allocation)
523 double *new_output = new double[new_allocation];
527 memcpy(new_output, output_buffer, sizeof(double) * output_size);
528 //printf("CrossfadeFFT::process_fifo 1 %p\n", output_buffer);
529 delete [] output_buffer;
530 //printf("CrossfadeFFT::process_fifo 2\n");
532 output_buffer = new_output;
533 output_allocation = new_allocation;
536 if(output_size >= WINDOW_BORDER)
538 for(int i = 0, j = output_size - WINDOW_BORDER;
542 double src_level = (double)i / WINDOW_BORDER;
543 double dst_level = (double)(WINDOW_BORDER - i) / WINDOW_BORDER;
544 output_buffer[j] = output_buffer[j] * dst_level + out_scale * dsp_out[i] * src_level;
547 for(int i = 0; i < window_size - WINDOW_BORDER; i++)
548 output_buffer[output_size + i] = dsp_out[WINDOW_BORDER + i] * out_scale;
549 output_size += window_size - WINDOW_BORDER;
553 // First buffer has no crossfade
554 memcpy(output_buffer + output_size,
556 sizeof(double) * window_size);
557 output_size += window_size;
561 // Shift input buffer forward
562 for(int i = window_size - WINDOW_BORDER, j = 0;
565 input_buffer[j] = input_buffer[i];
566 input_size -= window_size - WINDOW_BORDER;
570 // Have enough to send to output
571 if(output_size - WINDOW_BORDER >= size)
573 memcpy(output_ptr->get_data(), output_buffer, sizeof(double) * size);
574 for(int i = size, j = 0; i < output_size; i++, j++)
575 output_buffer[j] = output_buffer[i];
580 //printf("DenoiseEffect::process_realtime 1\n");
581 bzero(output_ptr->get_data(), sizeof(double) * size);
593 Tree::Tree(int input_length, int levels)
595 this->input_length = input_length;
596 this->levels = levels;
599 // create decomposition tree
600 values = new double*[2 * levels];
602 for (i = 0; i < levels; i++)
610 values[2 * i] = new double[j + 5];
611 values[2 * i + 1] = new double[j + 5];
619 for (i = 2 * levels - 1; i >= 0; i--)
625 WaveletCoeffs::WaveletCoeffs(double alpha, double beta)
628 double tcosa = cos(alpha);
629 double tcosb = cos(beta);
630 double tsina = sin(alpha);
631 double tsinb = sin(beta);
633 // calculate first two wavelet coefficients a = a(-2) and b = a(-1)
634 values[0] = ((1.0 + tcosa + tsina) * (1.0 - tcosb - tsinb)
635 + 2.0 * tsinb * tcosa) / 4.0;
636 values[1] = ((1.0 - tcosa + tsina) * (1.0 + tcosb - tsinb)
637 - 2.0 * tsinb * tcosa) / 4.0;
639 tcosa = cos(alpha - beta);
640 tsina = sin(alpha - beta);
642 // calculate last four wavelet coefficients c = a(0), d = a(1),
643 // e = a(2), and f = a(3)
644 values[2] = (1.0 + tcosa + tsina) / 2.0;
645 values[3] = (1.0 + tcosa - tsina) / 2.0;
646 values[4] = 1 - values[0] - values[2];
647 values[5] = 1 - values[1] - values[3];
649 // zero out very small coefficient values caused by truncation error
650 for (i = 0; i < 6; i++)
652 if (fabs(values[i]) < 1.0e-15) values[i] = 0.0;
656 WaveletCoeffs::~WaveletCoeffs()
661 WaveletFilters::WaveletFilters(WaveletCoeffs *wave_coeffs, wavetype transform)
665 // find the first non-zero wavelet coefficient
667 while(wave_coeffs->values[i] == 0.0) i++;
669 // find the last non-zero wavelet coefficient
671 while(wave_coeffs->values[j] == 0.0) j--;
673 // Form the decomposition filters h~ and g~ or the reconstruction
674 // filters h and g. The division by 2 in the construction
675 // of the decomposition filters is for normalization.
677 for(k = 0; k < length; ++i, --j, ++k)
679 if (transform == DECOMP)
681 h[k] = wave_coeffs->values[j] / 2.0;
682 g[k] = (double) (((i & 0x01) * 2) - 1) * wave_coeffs->values[i] / 2.0;
686 h[k] = wave_coeffs->values[i];
687 g[k] = (double) (((j & 0x01) * 2) - 1) * wave_coeffs->values[j];
691 // clear out the additional array locations, if any
699 WaveletFilters::~WaveletFilters()
711 DenoiseConfig::DenoiseConfig()
716 void DenoiseConfig::copy_from(DenoiseConfig &that)
721 int DenoiseConfig::equivalent(DenoiseConfig &that)
723 return EQUIV(level, that.level);
726 void DenoiseConfig::interpolate(DenoiseConfig &prev,
730 int64_t current_frame)
732 double next_scale = (double)(current_frame - prev_frame) / (next_frame - prev_frame);
733 double prev_scale = (double)(next_frame - current_frame) / (next_frame - prev_frame);
734 this->level = prev.level * prev_scale + next.level * next_scale;
755 DenoiseWindow::DenoiseWindow(DenoiseEffect *plugin)
756 : PluginClientWindow(plugin,
763 this->plugin = plugin;
766 void DenoiseWindow::create_objects()
770 add_subwindow(new BC_Title(x, y, _("Level:")));
772 add_subwindow(scale = new DenoiseLevel(plugin, x, y));
779 void DenoiseWindow::update()
781 scale->update(plugin->config.level);
795 DenoiseLevel::DenoiseLevel(DenoiseEffect *plugin, int x, int y)
796 : BC_FPot(x, y, (float)plugin->config.level, 0, 1.0)
798 this->plugin = plugin;
802 int DenoiseLevel::handle_event()
804 plugin->config.level = get_value();
805 plugin->send_configure_change();