Learning a discriminative histogram representation for histogram intersection kernel (HIK)히스토그램 교차 커널을 위한 분별력 있는 히스토그램 표현 학습

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 533
  • Download : 0
DC FieldValueLanguage
dc.contributor.advisorYoo, Chang-Dong-
dc.contributor.advisor유창동-
dc.contributor.authorBaek, Seung-Ryul-
dc.contributor.author백승렬-
dc.date.accessioned2011-12-14T01:37:41Z-
dc.date.available2011-12-14T01:37:41Z-
dc.date.issued2011-
dc.identifier.urihttp://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=467869&flag=dissertation-
dc.identifier.urihttp://hdl.handle.net/10203/36773-
dc.description학위논문(석사) - 한국과학기술원 : 전기 및 전자공학과, 2011.2, [ vi, 42p ]-
dc.description.abstractThis thesis studies a method to increase the performance of the image categorization based on the bag-of-visual words (BOV) model. The BOV model represents images as histograms of visual-words describing only their appearance while ignoring their spatial structure, and these histograms are classified based on the classification algorithm such as latent dirichlet allocation (LDA), probablistic latent semantic allocation (pLSA), or support vector machines (SVM). SVM using kernel functions are known to be the state-of-the-art classifier for the BOV model. Recently, the histogram intersection kernel (HIK) is introduced and known to be relatively faster and performs better for histogram features than other popular kernels. Currently, the HIK-based classifier such as intersection kernel SVM (IKSVM) is widely used for image recognition and classification tasks. The performance of the image categorization based on the BOV model mainly depends on the histogram representation and the classification algorithm. The focus of this paper is on the former. The objective of this thesis is learning a discriminative histogram representation for widely used histogram intersection kernel (HIK). The histogram feature space is modeled as the multivariate Gaussian distribution and we propose a learning criterion which can obtain a discriminative histogram representation by increasing inter-class distances of histogram features while decreasing intra-class distances of histogram features. The learning criterion is formulated as the linear programming (LP) problem, which can be optimized by the conventional linear programming solver. The original formulation are successful for binary or ternary classification problem, however, often fails to find the feasible solution and cannot complete the classification process for large database. So, we map histogram feature space into higher dimensional space by incorporating generalized HIK and exponential formulation is obtained. We show that the...eng
dc.languageeng-
dc.publisher한국과학기술원-
dc.subjectmachine learning-
dc.subjectcomputer vision-
dc.subjectbag of words model-
dc.subjectobject recognition-
dc.subjectimage categorization-
dc.subject이미지분류-
dc.subject기계학습-
dc.subject컴퓨터 시각-
dc.subject단어군집모델-
dc.subject물체인식-
dc.titleLearning a discriminative histogram representation for histogram intersection kernel (HIK)-
dc.title.alternative히스토그램 교차 커널을 위한 분별력 있는 히스토그램 표현 학습-
dc.typeThesis(Master)-
dc.identifier.CNRN467869/325007 -
dc.description.department한국과학기술원 : 전기 및 전자공학과, -
dc.identifier.uid020093235-
dc.contributor.localauthorYoo, Chang-Dong-
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