Scene recognition using improved codebook generation and multiple kernel learning향상된 코드북 생성과 다중 커널 학습을 이용한 배경인식

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 527
  • Download : 0
DC FieldValueLanguage
dc.contributor.advisorLee, Ju-Jang-
dc.contributor.advisor이주장-
dc.contributor.authorLiong, Erin V.-
dc.contributor.authorErin B. Liong-
dc.date.accessioned2013-09-12T02:00:57Z-
dc.date.available2013-09-12T02:00:57Z-
dc.date.issued2013-
dc.identifier.urihttp://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=513385&flag=dissertation-
dc.identifier.urihttp://hdl.handle.net/10203/180963-
dc.description학위논문(석사) - 한국과학기술원 : 전기및전자공학과, 2013.2, [ vi, 40 p. ]-
dc.description.abstractn Scene Recognition, one of the commonly used approach is using the Bag-of-Words(BoW) Model. The BoW approach basically collects local features from different classes/labels and cluster them together to create visual words that best represents all the features gathered. These visual words are used to represent each image through a co-occurence histogram matrix which is used as an observation model for training and testing the classifier. One popular extension done using BoW considers the spatial information of an image. Here, a Spatial Pyramid Matching scheme is used where the co-occurrence matrix are evaluated at every region of different resolutions/pyramid levels, and are cascaded together with fixed weights. This approach has shown great results, and has been considered as state-of-the-art. In this thesis, we improve Scene Recognition in two ways. First, is to improve codebook generation by creating a novel clustering algorithm which uses label information and an underlying assumption that less entropy clusters result to discriminative codebooks. Second, is having a novel implementation of Multiple Kernel Learning in Scene Recognition by using Spatial Kernels. Two approaches of MKL are investigated particularly Incremental-MKL and Generalized MKL. In Incremental MKL, an Adaboost framework is used where we choose the best pre-defined spatial kernels at every iteration based on the weighted data. Different types of kernel-based weak classifiers were investigated as well, particularly, weakSVM and Dyadic Hypercut. In Generalized MKL, we deal with a non-convex optimization problem which is formed from extending the SVM problem and adding a regularization term. Here, $\ell1$ (sparse) and $\ell2$ (euclidean norm) cases are investigated and optimized. The proposed approach is tested and evaluated using benchmark datasets and is compared with state-of-the-art algorithms. Results shown that Incremental MKL using weak-SVM (SPBoost-SVM) and Generalized M...eng
dc.languageeng-
dc.publisher한국과학기술원-
dc.subjectScene Recognition-
dc.subjectBag-of-Words-
dc.subjectSpatial Pyramid Matching-
dc.subject배경 인식-
dc.subject단어주머니-
dc.subject국지적 피라미드 매칭-
dc.subject다중 커널 학습-
dc.subjectMultiple Kernel Learning-
dc.titleScene recognition using improved codebook generation and multiple kernel learning-
dc.title.alternative향상된 코드북 생성과 다중 커널 학습을 이용한 배경인식-
dc.typeThesis(Master)-
dc.identifier.CNRN513385/325007 -
dc.description.department한국과학기술원 : 전기및전자공학과, -
dc.identifier.uid020114275-
dc.contributor.localauthorLee, Ju-Jang-
dc.contributor.localauthor이주장-
Appears in Collection
EE-Theses_Master(석사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0