Autoencoder per la riduzione del rumore

A plain autoencoder rebuilds its input. A denoising autoencoder goes further: you feed it a corrupted version and ask it to restore the clean original.

You deliberately damage the input with noise before feeding it in. The clean original stays as the target the network must reach.

The model sees the noisy image but is scored against the clean target. So it learns to undo the corruption, not just memorize pixels.

By repairing damage, the network must understand real structure in the data. It cannot rely on a lazy pixel-by-pixel copy anymore.

Denoising pushes the encoder to find robust features that survive corruption. These tend to generalize better than features from a plain autoencoder. 💪

Common choices are Gaussian noise, random masking, or salt-and-pepper dots. Each forces the model to recover information from a different kind of damage.

Masking randomly zeros out parts of the input, like hiding patches of an image. The model must infer the missing pieces from context.

The encoder, bottleneck, and decoder stay the same as a plain autoencoder. Only the input changes: noisy in, clean out.

Fresh noise each step means the model rarely sees the exact same input twice. This acts like built-in data augmentation and fights overfitting.

Denoising autoencoders shine at cleaning up noisy images, audio, and sensor readings. They also pretrain encoders for downstream tasks. 🔧

Too little noise barely helps; too much destroys the signal entirely. The right noise level is a knob you tune for your data.

Test what makes denoising different.

You corrupt the input, keep the clean version as target, and train the net to repair it. The result is an encoder with robust, generalizable features. 🎉