Mathematics – Optimization and Control
Scientific paper
2012-04-17
Mathematics
Optimization and Control
Scientific paper
This work combines three paradigms of image processing: i) the total variation approach to denoising, ii) the superior structure of hexagonal lattices, and iii) fast and exact graph cut optimization techniques. Although isotropic in theory, numerical implementations of the $BV$ seminorm invariably show anisotropic behaviour. Discretization of the image domain into a hexagonal grid seems perfectly suitable to mitigate this undesirable effect. To this end, we recast the continuous problem as a finite-dimensional one on an arbitrary lattice, before focussing on the comparison of Cartesian and hexagonal structures. Minimization is performed with well-established graph cut algorithms, which are easily adapted to new spatial discretizations. Apart from producing minimizers that are closer in the $\ell^1$ sense to the clean image for sufficiently high degrees of regularization, our experiments suggest that the hexagonal lattice also allows for a more effective reduction of two major drawbacks of existing techniques: metrication artefacts and staircasing. For the sake of practical relevance we address the difficulties that naturally arise when dealing with non-standard images.
No associations
LandOfFree
Total Variation Denoising on Hexagonal Grids does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Total Variation Denoising on Hexagonal Grids, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Total Variation Denoising on Hexagonal Grids will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-290470