Thesis (Ph. D.)--Virginia Polytechnic Institute and State University, 1990. / Vita. Abstract. Includes bibliographical references (leaves 186-197). Also available via the Internet.

Thesis (M. Music)--University of Tennessee, Knoxville, 2009. / Title from title page screen (viewed on Mar. 23, 2010). Thesis advisor: Leslie Gay. Vita. Includes bibliographical references.

Thesis (Ph. D.)--University of California, Los Angeles, 1997. / Vita. Includes bibliographical references (leaves 230-240).

Thesis (M.S.)--Montana State University--Bozeman, 2005. / Typescript. Chairperson, Graduate Committee: Hongwei Gao. Includes bibliographical references (leaves 63-66).

No description available.

No description available.

University of Macau / Faculty of Science and Technology / Department of Civil and Environmental Engineering

Slow-servo single-point diamond turning as well as advances in computer controlled small lap polishing enable the fabrication of freeform optics, specifically, optical surfaces for imaging applications that are not rotationally symmetric. Freeform optical elements will have a profound importance in the future of optical technology. Orthogonal polynomials added onto conic sections have been extensively used to describe optical surface shapes. The optical testing industry has chosen to represent the departure of a wavefront under test from a reference sphere in terms of orthogonal φ-polynomials, specifically Zernike polynomials. Various forms of polynomials for describing freeform optical surfaces may be considered, however, both in optical design and in support of fabrication. More recently, radial basis functions were also investigated for optical shape description. In the application of orthogonal φ-polynomials to optical freeform shape description, there are important limitations, such as the number of terms required as well as edge-ringing and ill-conditioning in representing the surface with the accuracy demanded by most stringent optics applications. The first part of this dissertation focuses upon describing freeform optical surfaces with φ-polynomials and shows their limitations when including higher orders together with possible remedies. We show that a possible remedy is to use edge-clusteredfitting grids. Provided different grid types, we furthermore compared the efficacy of using different types of φ-polynomials, namely Zernike and gradient orthogonal Q-polynomials. In the second part of this thesis, a local, efficient and accurate hybrid method is developed in order to greatly reduce the order of polynomial terms required to achieve higher level of accuracy in freeform shape description that were shown to require thousands of terms including many higher order terms under prior art. This comes at the expense of multiple sub-apertures, and as such iv computational methods may leverage parallel processing. This new method combines the assets of both radial basis functions and orthogonal phi-polynomials for freeform shape description and is uniquely applicable across any aperture shape due to its locality and stitching principles. Finally in this thesis, in order to comprehend the possible advantages of parallel computing for optical surface descriptions, the benefits of making an effective use of impressive computational power offered by multi-core platforms for the computation of φ-polynomials are investigated. The φ-polynomials, specifically Zernike and gradient orthogonal Q-polynomials, are implemented with a set of recurrence based parallel algorithms on Graphics Processing Units (GPUs). The results show that more than an order of magnitude speedup is possible in the computation of φ-polynomials over a sequential implementation if the recurrence based parallel algorithms are adopted.

Every day we recognize a numerous objects and human brain can recognize objects under many conditions. The way in which humans are able to identify an object is remarkably fast even in different size, colours or other factors. Computers or robots need computational tools to identify objects. Shape descriptors are one of the tools commonly used in image processing applications. Shape descriptors are regarded as mathematical functions employed for investigating image shape information. Various shape descriptors have been studied in the literature. The aim of this thesis is to develop new shape descriptors which provides a reasonable alternative to the existing methods or modified to improve them. Generally speaking shape descriptors can be categorized into various taxonomies based on the information they use to compute their measures. However, some descriptors may use a combination of boundary and interior points to compute their measures. A new shape descriptor, which uses both region and contour information, called centeredness measure has been defined. A new alternative ellipticity measure and sensitive family ellipticity measures are introduced. Lastly familiy of ellipticity measures, which can distinguish between ellipses whose ratio between the length of the major and minor axis differs, have been presented. These measures can be combined and applied in different image processing applications such as image retrieval and classification. This simple basis is demonstrated through several examples.

In low-level vision, the representation of scene properties such as shape, albedo, etc., are very high dimensional as they have to describe complicated structures. The approach proposed here is to let the image itself bear as much of the representational burden as possible. In many situations, scene and image are closely related and it is possible to find a functional relationship between them. The scene information can be represented in reference to the image where the functional specifies how to translate the image into the associated scene. We illustrate the use of this representation for encoding shape information. We show how this representation has appealing properties such as locality and slow variation across space and scale. These properties provide a way of improving shape estimates coming from other sources of information like stereo.