This step is necessary to get greedy dictionary learning to work efficiently with dicodile from alphacsc.
the core idea is to find the patch with shape (n_channels, *atoms_support) with the largest reconstruction error from the current reconstruction.
The distributed algorithm would be:
In each worker, find the largest error patch using something similar to get_max_error_dict for alphacsc but adapted with 2D convolutions.
Return the value of the max error as well as the patch associated to this to the main process.
Select and return the patch extracted from the worker which has the worst reconstruction error.
This step is necessary to get
greedydictionary learning to work efficiently withdicodilefromalphacsc. the core idea is to find the patch with shape(n_channels, *atoms_support)with the largest reconstruction error from the current reconstruction.The distributed algorithm would be:
get_max_error_dictforalphacscbut adapted with 2D convolutions.