Výsledky vyhledávání

Improved AdaBoost-based image retrieval with relevance feedback via paired feature learning

Autor: Qi-Jiunn Wu, Shang-Hong Lai, Szu-Hao Huang

Publikováno v: Multimedia Systems. 12:14-26

Boost learning algorithm, such as AdaBoost, has been widely used in a variety of applications in multimedia and computer vision. Relevance feedback-based image retrieval has been formulated as a classification problem with a small number of training

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::40f71afeff3e369cee6b79ef0cb33ef5
https://doi.org/10.1007/s00530-006-0028-y

Zobrazit plný text záznamu

Intelligent home video management system

Autor: Shang-Hong Lai, Yu-Sheng Tsai, Qi-Jiunn Wu, Guan-Rong Chen, Wen-Hao Wang, Szu-Hao Huang, KaiYeuh Chang, Hsin-Cheang Lin, Chia-Lun Chen

Publikováno v: ITRE

An integrated intelligent home video management system was proposed in this paper. Five different types of multimedia representative features were computed as the basis of the home video management system. With the aid of some machine learning techni

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::77678966c98c7f5e6b860291ded1e96c
https://doi.org/10.1109/itre.2005.1503094

Zobrazit plný text záznamu

Improved AdaBoost-Based Image Retrieval with Relevance Feedback via Paired Feature Learning

Autor: Qi-Jiunn Wu, Shang-Hong Lai, Szu-Hao Huang

Publikováno v: Lecture Notes in Computer Science ISBN: 9783540278580
CIVR

In this paper, we propose a novel paired feature learning system for relevance feedback based image retrieval. To facilitate density estimation in our feature learning system, we employ an ID3-like balance tree quantization method to preserve most di

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::206a27d97b59de191a3abbb31c666a1e
https://doi.org/10.1007/11526346_69

Zobrazit plný text záznamu

An Approximate Algorithm for the Weighted Hamiltonian Path Completion Problem on a Tree

Autor: Richard C. T. Lee, Qi-Jiunn Wu, Chin Lung Lu

Publikováno v: Algorithms and Computation ISBN: 9783540412557
ISAAC

Given a graph, the Hamiltonian path completion problem is to find an augmenting edge set such that the augmented graph has a Hamiltonian path. In this paper, we show that the Hamiltonian path completion problem will unlikely have any constant ratio a

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::92f19024de746e002550bcf45b6097fc
https://doi.org/10.1007/3-540-40996-3_14

Zobrazit plný text záznamu