Multiscale geometric image processing
| dc.contributor.advisor | Baraniuk, Richard G. | en_US |
| dc.creator | Romberg, Justin K. | en_US |
| dc.date.accessioned | 2009-06-04T08:23:40Z | en_US |
| dc.date.available | 2009-06-04T08:23:40Z | en_US |
| dc.date.issued | 2004 | en_US |
| dc.description.abstract | Since their introduction a little more than 10 years ago, wavelets have revolutionized image processing. Wavelet based algorithms define the state-of-the-art for applications including image coding (JPEG-2000), restoration, and segmentation. Despite their success, wavelets have significant shortcomings in their treatment of edges. Wavelets do not parsimoniously capture even the simplest geometrical structure in images, and wavelet based processing algorithms often produce images with ringing around the edges. As a first step towards accounting for this structure, we will show how to explicitly capture the geometric regularity of contours in cartoon images using the wedgelet representation and a multiscale geometry model. The wedgelet representation builds up an image out of simple piecewise constant functions with linear discontinuities. We will show how the geometry model, by putting a joint distribution on the orientations of the linear discontinuities, allows us to weigh several factors when choosing the wedgelet representation: the error between the representation and the original image, the parsimony of the representation, and whether the wedgelets in the representation form "natural" geometrical structures. We will analyze a simple wedgelet coder based on these principles, and show that it has optimal asymptotic performance for simple cartoon images. Next, we turn our attention to piecewise smooth images; images that are smooth away from a smooth contour. Using a representation composed of wavelets and wedgeprints (wedgelets projected into the wavelet domain), we develop a quadtree based prototype coder whose rate-distortion performance is asymptotically near-optimal. We use these ideas to implement a full-scale image coder that outperforms JPEG-2000 both in peak signal to noise ratio (by 1--1.5dB at low bitrates) and visually. Finally, we shift our focus to building a statistical image model directly in the wavelet domain. For applications other than compression, the approximate shift-invariance and directional selectivity of the slightly redundant complex wavelet transform make it particularly well-suited for modeling singularity structure. Around edges in images, complex wavelet coefficients behave very predictably, exhibiting dependencies that we will exploit using a hidden Markov tree model. We demonstrate the effectiveness of the complex wavelet model with several applications: image denoising, multiscale segmentation, and feature extraction. | en_US |
| dc.format.extent | 114 p. | en_US |
| dc.format.mimetype | application/pdf | en_US |
| dc.identifier.callno | THESIS E.E. 2004 ROMBERG | en_US |
| dc.identifier.citation | Romberg, Justin K.. "Multiscale geometric image processing." (2004) Diss., Rice University. <a href="https://hdl.handle.net/1911/18689">https://hdl.handle.net/1911/18689</a>. | en_US |
| dc.identifier.uri | https://hdl.handle.net/1911/18689 | en_US |
| dc.language.iso | eng | en_US |
| dc.rights | Copyright is held by the author, unless otherwise indicated. Permission to reuse, publish, or reproduce the work beyond the bounds of fair use or other exemptions to copyright law must be obtained from the copyright holder. | en_US |
| dc.subject | System science | en_US |
| dc.title | Multiscale geometric image processing | en_US |
| dc.type | Thesis | en_US |
| dc.type.material | Text | en_US |
| thesis.degree.department | Electrical Engineering | en_US |
| thesis.degree.discipline | Engineering | en_US |
| thesis.degree.grantor | Rice University | en_US |
| thesis.degree.level | Doctoral | en_US |
| thesis.degree.name | Doctor of Philosophy | en_US |
Files
Original bundle
1 - 1 of 1