A non smooth, non convex regularization method is presented. The non convex regularization operator is approximated by the convex dual, and the minimization is then implemented on a Bregman iteration based algorithm. The method is simpler and provides for better models than those obtained with convex functionals like total variation, and non convex smooth regularizers.