• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 352
  • 30
  • 21
  • 13
  • 12
  • 12
  • 12
  • 12
  • 12
  • 12
  • 10
  • 5
  • 1
  • 1
  • Tagged with
  • 508
  • 508
  • 508
  • 232
  • 192
  • 139
  • 112
  • 86
  • 76
  • 63
  • 58
  • 57
  • 55
  • 55
  • 49
  • 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.

Optimal algorithms for object recognition with occlusion in scale space

Rao, Zusheng. January 1999 (has links)
Thesis (M. Sc.)--York University, 1999. Graduate Programme in Computer Science. / Typescript. Includes bibliographical references (leaves 90-93). Also available on the Internet. MODE OF ACCESS via web browser by entering the following URL: http://wwwlib.umi.com/cr/yorku/fullcit?pMQ39223.

Fitting a cloth model onto a surface by energy minimization /

Yeung, Benjamin Ming Lok. January 2003 (has links)
Thesis (M. Phil.)--Hong Kong University of Science and Technology, 2003. / Includes bibliographical references (leaves 60-63). Also available in electronic version. Access restricted to campus users.

Visual hull construction, alignment and refinement for human kinematic modeling, motion tracking and rendering /

Cheung, Kong Man (German) January 1900 (has links)
Thesis (Ph. D.)--Carnegie Mellon University, 2003. / "October 2003." Includes bibliographical references.

Sequence classification and melody tracks selection /

Tang, Fung, Michael, January 2001 (has links)
Thesis (M. Phil.)--University of Hong Kong, 2002. / Includes bibliographical references (leaves 107-109).

Computer recognition of handprinted Chinese characters /

Leung, Cheung-hoi. January 1986 (has links)
Thesis--Ph. D., University of Hong Kong, 1986.

Image editing in the contour domain

Goldberg, Richard M. January 2002 (has links)
Thesis (M. Sc.)--York University, 2002. Graduate Programme in Computer Science. / Typescript. Includes bibliographical references (leaves 105-119). Also available on the Internet. MODE OF ACCESS via web browser by entering the following URL: http://wwwlib.umi.com/cr/yorku/fullcit?pMQ71638.

Investigating the use of tabu search to find near-optimal solutions in multiclassifier systems

Korycinski, Donna Kay 28 August 2008 (has links)
Not available / text

Foveated object recognition by corner search

Arnow, Thomas Louis, 1946- 29 August 2008 (has links)
Here we describe a gray scale object recognition system based on foveated corner finding, the computation of sequential fixation points, and elements of Lowe’s SIFT transform. The system achieves rotational, transformational, and limited scale invariant object recognition that produces recognition decisions using data extracted from sequential fixation points. It is broken into two logical steps. The first is to develop principles of foveated visual search and automated fixation selection to accomplish corner search. The result is a new algorithm for finding corners which is also a corner-based algorithm for aiming computed foveated visual fixations. In the algorithm, long saccades move the fovea to previously unexplored areas of the image, while short saccades improve the accuracy of putative corner locations. The system is tested on two natural scenes. As an interesting comparison study we compare fixations generated by the algorithm with those of subjects viewing the same images, whose eye movements are being recorded by an eyetracker. The comparison of fixation patterns is made using an information-theoretic measure. Results show that the algorithm is a good locator of corners, but does not correlate particularly well with human visual fixations. The second step is to use the corners located, which meet certain goodness criteria, as keypoints in a modified version of the SIFT algorithm. Two scales are implemented. This implementation creates a database of SIFT features of known objects. To recognize an unknown object, a corner is located and a feature vector created. The feature vector is compared with those in the database of known objects. The process is continued for each corner in the unknown object until enough information has been accumulated to reach a decision. The system was tested on 78 gray scale objects, hand tools and airplanes, and shown to perform well. / text

An adaptive weighting algorithm for limited dataset verification problems

Chen, Dan, 陳丹 January 2005 (has links)
published_or_final_version / abstract / Computer Science / Master / Master of Philosophy

Sequence classification and melody tracks selection

Tang, Fung, Michael, 鄧峰 January 2001 (has links)
published_or_final_version / abstract / toc / Computer Science and Information Systems / Master / Master of Philosophy

Page generated in 0.1829 seconds