• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 8
  • 1
  • 1
  • 1
  • Tagged with
  • 12
  • 12
  • 7
  • 4
  • 4
  • 3
  • 2
  • 2
  • 2
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
11

An adaptive-sampling algorithm for Gabor feature based object recognition /

Alterson, Robert. January 2001 (has links)
Thesis (Ph. D.)--York University, 2001. Graduate Programme in Computer Science. / Typescript. Includes bibliographical references (leaves 132-142). Also available on the Internet. MODE OF ACCESS via web browser by entering the following URL: http://wwwlib.umi.com/cr/yorku/fullcit?pNQ66340
12

Modulation spaces, BMO and the Zak transform, and minimizing IPH functions over the unit simplex

Tinaztepe, Ramazan 07 July 2010 (has links)
This thesis consists of two parts. In the first chapter, we give some results on modulation spaces. First the relationship between the classical spaces and the modulation spaces is established. It is proved that certain modulation spaces defined on R² lie in the BMO space. Another result is that the Zak transform, a discrete time-frequency transform, maps a modulation space into a higher dimensional modulation space. And by using these results, an uncertainty principle for Gabor frames via modulation spaces is obtained. In the second part, we deal with optimization of an increasing positively homogeneous functions on the unit simplex. The class of increasing positively homogeneous functions is one of the function classes obtained via min-type functions in the context of abstract convexity. The cutting angle method is used for the minimization of this type functions. The most important step of this method is the minimization of a function which is the maximum of a number of min-type functions on the unit simplex. We propose a numerical algorithm for the minimization of such functions on the unit simplex and we mathematically prove that this algorithm finds the exact solution of the minimization problem. Some experiments have been carried out and the results of the experiments have been presented.

Page generated in 0.0517 seconds