Edge detection using fractal imaging
Summary: Many direct approaches to edge detection appear in the literature. Typical approaches approximate gradients or second-order derivatives in images with the goal of finding curves along which there is a sharp transition in intensity. In fractal image compression, one seeks to approximate a target image by the fixed point of a contractive operator called a local iterated function system with grey-level maps (LIFSM). These map parent blocks in an image to smaller child blocks; grey-level maps adjust the shading of shrunken blocks. The fixed point of this operator approximates the target image. We outline an edge detection technique by introducing changes to LIFSM, allowing for overlapping child blocks and multiple parent blocks. The edge detector takes into account two different criteria: clustering of parent blocks, and values of grey-level map parameters. We show that this approach to edge detection can give results comparable to established edge detection techniques.
- An edge detection algorithm based on fractal features and mathematical morphology
- Some new methods to fractal image compression
- Fractal image compression
- An edge property-based neighborhood region search strategy for fractal image compression
- Fractal image compression algorithms based on possibility theory
This page was built for publication: Edge detection using fractal imaging
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1934492)
