Presentation 2006-07-13
Improvement of Efficiency in Image Retrieval using Dynamic Programming
Kei HAMAOKA, Kazuaki UEDA, Yuji NAKAGAWA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) In present day, the more we register lots of images in the database, the more it takes processing time to find the image similar to the query image in the database. As a solution, we perform the perfunctory search, and then we perform detail search. This paper presents the detail search method using dynamic programming, straightness of optimum path and the concept of hereditary boundary. As a result, we can improve of efficienncy in image retrieval.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Image database / Dynamic Programming / hereditary boundary / image retrieval
Paper # DE2006-52
Date of Issue

Conference Information
Committee DE
Conference Date 2006/7/6(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Data Engineering (DE)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Improvement of Efficiency in Image Retrieval using Dynamic Programming
Sub Title (in English)
Keyword(1) Image database
Keyword(2) Dynamic Programming
Keyword(3) hereditary boundary
Keyword(4) image retrieval
1st Author's Name Kei HAMAOKA
1st Author's Affiliation Graduate School of Science and Engineering, Ehime University()
2nd Author's Name Kazuaki UEDA
2nd Author's Affiliation Graduate School of Science and Engineering, Ehime University
3rd Author's Name Yuji NAKAGAWA
3rd Author's Affiliation Center for Information Technology, Ehime university
Date 2006-07-13
Paper # DE2006-52
Volume (vol) vol.106
Number (no) 149
Page pp.pp.-
#Pages 6
Date of Issue