東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Feature selection in large dataset p...

Liu, Yan.

Linked to FindBook

Google Book

Amazon

博客來

Feature selection in large dataset processing, especially in the video domain.

Record Type:	Electronic resources : Monograph/item
Title/Author:	Feature selection in large dataset processing, especially in the video domain./
Author:	Liu, Yan.
Description:	183 p.
Notes:	Source: Dissertation Abstracts International, Volume: 66-05, Section: B, page: 2680.
Contained By:	Dissertation Abstracts International66-05B.
Subject:	Computer Science. -
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3174841
ISBN:	0542131560

Feature selection in large dataset processing, especially in the video domain.
Liu, Yan.

Feature selection in large dataset processing, especially in the video domain. - 183 p.

Source: Dissertation Abstracts International, Volume: 66-05, Section: B, page: 2680.

Thesis (Ph.D.)--Columbia University, 2005.

The rapid growth and wide applications of digital video data have led to a significant need for video classification. Unfortunately, the gap between high-level concepts and low-level features and the high time cost of video analysis are two important obstacles of efficient video data management. Feature selection, which can improve the prediction performance of the predictors, provide faster and more cost-effective predictors, and provide better understanding of the data, is introduced to address these two problems. But applying existing automatic feature selection algorithms to video data is impractical because of the unrealistic amount of computer time. So far, most feature selection technologies in video applications are based on researchers' intuition although human interaction can't satisfy the dramatic increase of video data and the multiple requirements of different users.

ISBN: 0542131560Subjects--Topical Terms:

626642
Computer Science.

Feature selection in large dataset processing, especially in the video domain.
LDR:03705nmm 2200289 4500 001 1818465
005 20060908145749.5
008 130610s2005 eng d
020 $a 0542131560
035 $a (UnM)AAI3174841
035 $a AAI3174841
040 $a UnM $c UnM
100 1 $a Liu, Yan. $3 1067479
245 1 0 $a Feature selection in large dataset processing, especially in the video domain.
300 $a 183 p.
500 $a Source: Dissertation Abstracts International, Volume: 66-05, Section: B, page: 2680.
500 $a Adviser: John R. Kender.
502 $a Thesis (Ph.D.)--Columbia University, 2005.
520 $a The rapid growth and wide applications of digital video data have led to a significant need for video classification. Unfortunately, the gap between high-level concepts and low-level features and the high time cost of video analysis are two important obstacles of efficient video data management. Feature selection, which can improve the prediction performance of the predictors, provide faster and more cost-effective predictors, and provide better understanding of the data, is introduced to address these two problems. But applying existing automatic feature selection algorithms to video data is impractical because of the unrealistic amount of computer time. So far, most feature selection technologies in video applications are based on researchers' intuition although human interaction can't satisfy the dramatic increase of video data and the multiple requirements of different users.
520 $a The first automatic feature selection algorithm we proposed is the Basic Sort-Merge Tree (BSMT), which is well-adapted to the characteristics of video data. The linear time cost of BSMT allows us the practical implementation of video frame categorization. To address the problem of sparse and noisy training data in video retrieval, we proposed the Complement Sort-Merge Tree (CSMT). CSMT detects complementary relationships shown in the outer wrapper model's results, in order to reduce the influence of more coarsely quantized prediction error. We provide empirical validation of this method by instructional video retrieval. Fast-converging Sort-Merge Tree (FSMT) speeds up BSMT further by setting up only a selected portion of the feature selection tree with two evaluation metrics, in order to satisfy the higher time cost requirement of on-line video retrieval. We demonstrate it with sports video shot classification. Multi-Level Feature selection (MLFS), based on the hierarchical structure of BSMT, permits a coarse-fine scene segmentation. The basic idea is to apportion different classification costs based on the classification difficulty of the different data. We demonstrate its improvement of the efficiency of video segment boundary detection compared with BSMT with instructional video scene segmentation. Based on the feature selection algorithms mentioned, we proposed a fast video retrieval system using different feature selection algorithms and lazy evaluation.
520 $a To show universality of our feature selection algorithms, we also provide some theoretical analysis. We simulate different feature selection algorithms on common synthetic datasets. The performance is compared from accuracy, efficiency and robustness. Finally, we propose the further work from two aspects: how to improve the feature selection algorithms and how to apply feature selection algorithms to different applications better.
590 $a School code: 0054.
650 4 $a Computer Science. $3 626642
690 $a 0984
710 2 0 $a Columbia University. $3 571054
773 0 $t Dissertation Abstracts International $g 66-05B.
790 1 0 $a Kender, John R., $e advisor
790 $a 0054
791 $a Ph.D.
792 $a 2005
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3174841