東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Contributions to real time shape det...

Wu, Feng.

FindBook

Google Book

Amazon

博客來

Contributions to real time shape detection with applications to face detection.

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Contributions to real time shape detection with applications to face detection./
作者:	Wu, Feng.
面頁冊數:	120 p.
附註:	Adviser: Haim Schweitzer.
Contained By:	Dissertation Abstracts International67-10B.
標題:	Computer Science. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3238615
ISBN:	9780542932892

Contributions to real time shape detection with applications to face detection.
Wu, Feng.

Contributions to real time shape detection with applications to face detection. - 120 p.

Adviser: Haim Schweitzer.

Thesis (Ph.D.)--The University of Texas at Dallas, 2006.

Shape-detection is a critical component in many computer vision systems. Large variety of shapes, lighting conditions, and the high dimensionality of image data make shape-detection a challenging problem. Our research is focused on developing techniques for improving both the accuracy and the speed of shape and object detection. We first describe contributions to the classic normalized template-matching technique. Based on the concept of integral images, we have developed an approximate normalized template-matching method, which can be much faster (100 times faster in typical applications) than the classic normalized template-matching method. In typical template-matching based shape-detection, matching needs to be performed at every possible template location in the image and at multiple image resolutions. We introduce the idea of local maxima and describe a selective template matching method. In this approach, matching values are computed only at selective locations, resulting in additional speed-up of the run time.

ISBN: 9780542932892Subjects--Topical Terms:

626642
Computer Science.

Contributions to real time shape detection with applications to face detection.
LDR:03470nam 2200289 a 45 001 974509
005 20110929
008 110929s2006 eng d
020 $a 9780542932892
035 $a (UnM)AAI3238615
035 $a AAI3238615
040 $a UnM $c UnM
100 1 $a Wu, Feng. $3 1298436
245 1 0 $a Contributions to real time shape detection with applications to face detection.
300 $a 120 p.
500 $a Adviser: Haim Schweitzer.
500 $a Source: Dissertation Abstracts International, Volume: 67-10, Section: B, page: 5867.
502 $a Thesis (Ph.D.)--The University of Texas at Dallas, 2006.
520 $a Shape-detection is a critical component in many computer vision systems. Large variety of shapes, lighting conditions, and the high dimensionality of image data make shape-detection a challenging problem. Our research is focused on developing techniques for improving both the accuracy and the speed of shape and object detection. We first describe contributions to the classic normalized template-matching technique. Based on the concept of integral images, we have developed an approximate normalized template-matching method, which can be much faster (100 times faster in typical applications) than the classic normalized template-matching method. In typical template-matching based shape-detection, matching needs to be performed at every possible template location in the image and at multiple image resolutions. We introduce the idea of local maxima and describe a selective template matching method. In this approach, matching values are computed only at selective locations, resulting in additional speed-up of the run time.
520 $a The detection and the recognition of shapes is typically performed on a small number of useful features. The selection of good features requires processing large amounts of data and is very time consuming. The standard approach to feature-selection is to compute many features from training data, and then select among them a subset that is useful for the task at hand. We have developed a fast selection method that works for linear features. Our approach is based on Principal Components dimensionality reduction on the training data. We show that it is not necessary to compute features for all the training data; instead, one needs only compute features for the principal components. Specifically, redundant features are identified using the classic QR Factorization algorithm, applied in the reduced space.
520 $a AdaBoosting is a recently developed powerful method for selecting a small set of features and constructing a classifier that uses these features. The standard AdaBoosting technique is symmetric in its treatment of the positive and the negative training examples. However, when AdaBoosting is applied in object-detection, the positive examples are significantly more important than the negative examples. For example, when AdaBoosting is applied to face detection, the positive examples are examples of human faces. It is less clear what are good examples of non-faces. We have developed an asymmetric formulation of AdaBoosting that allows a specified bias toward the positive examples that behaves better in such cases.
590 $a School code: 0382.
650 4 $a Computer Science. $3 626642
690 $a 0984
710 2 0 $a The University of Texas at Dallas. $3 1018411
773 0 $t Dissertation Abstracts International $g 67-10B.
790 $a 0382
790 1 0 $a Schweitzer, Haim, $e advisor
791 $a Ph.D.
792 $a 2006
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3238615