Preserving Relative Dimension Rankings in the Presence of Noise Using the Box-Counting Algorithm

dc.contributor.advisorPhillips, Joshua
dc.contributor.authorMurphy, Michael Colin
dc.contributor.committeememberSeo, Suk
dc.contributor.committeememberGreen, Lisa
dc.contributor.departmentComputer Scienceen_US
dc.date.accessioned2016-08-15T15:06:30Z
dc.date.available2016-08-15T15:06:30Z
dc.date.issued2016-06-23
dc.description.abstractFractal dimension is a number that describes the degree of self-similarity, or "complexity", of a particular geometry. In digital image processing, fractal dimension is often used to provide quantitative comparisons between digital images. The Box-Counting Algorithm is one of the more widely used methods for estimating fractal dimension, although it has been shown to be highly sensitive to digital filtering and noise. This research investigates the variability in fractal dimension estimates obtained from the Box-Counting Algorithm as noise is applied to an image. In the case of increasing uniform noise, three distinct relationships emerge between dimensional estimates and their variability. It is then shown how these relationships may be leveraged to improve relative rankings among dimensional estimates when using the Box-Counting Algorithm.
dc.description.degreeM.S.
dc.identifier.urihttp://jewlscholar.mtsu.edu/handle/mtsu/5022
dc.publisherMiddle Tennessee State University
dc.subjectBox-Counting
dc.subjectDimension
dc.subjectFractal
dc.subjectImage
dc.subjectNoise
dc.subjectRanking
dc.subject.umiComputer science
dc.thesis.degreegrantorMiddle Tennessee State University
dc.thesis.degreelevelMasters
dc.titlePreserving Relative Dimension Rankings in the Presence of Noise Using the Box-Counting Algorithm
dc.typeThesis

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Murphy_mtsu_0170N_10645.pdf
Size:
5.93 MB
Format:
Adobe Portable Document Format

Collections