| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
All Technical Committee Conferences (Searched in: All Years)
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| ITS, IE, ITE-MMS, ITE-ME, ITE-AIT [detail] | 2024-02-19 13:30 |
Hokkaido | Hokkaido Univ. | Characteristic analysis to improve the performance of graph-based methods in approximate nearest neighbor search Tomohiro Kanaumi, Yusuke Matsui (Univ. Tokyo)  ITS2023-52 IE2023-41 |
Approximate nearest neighbor search (ANNS) is the problem of finding the nearest vector to a given query vector in a dat... [more] | ITS2023-52 IE2023-41 pp.34-39 |
| PRMU | 2018-12-13 10:30 |
Miyagi | Candidate Reduction Method Using Hierarchical Overlapping Clustering and Convolutional Neural Network for Fast Chinese Character Recognition Soichi Tashima, Hideaki Goto (Tohoku Univ.) PRMU2018-77 |
Along with the widespread of the mobile devices equipped with cameras, many applications using the camera function have ... [more] | PRMU2018-77 pp.13-18 |
|
| HCS | 2018-11-02 14:45 |
Ibaraki | Method for Detecting Near-duplicate Recipes Based on Nearest Neighbor Search for Features of Cooking Instructions and Food Images Masaki Oguni (Tsukuba Univ.), Lasguido Nio, Yu Hirate (RIT), Yohei Seki (Tsukuba Univ.) HCS2018-44 |
In user-generated recipe websites, recipes that imitated recipe elements of other recipes are posted. In this study, we ... [more] | HCS2018-44 pp.19-24 |
|
| VLD, HWS (Joint) |
2018-02-28 10:20 |
Okinawa | Okinawa Seinen Kaikan | k-Nearest Neighbor Search Hardware Using Locality Sensitive Hashing for High-Dimensional Data Yuto Arai, Shin'ichi Wakabayashi, Shinobu Nagayama, Masato Inagi (Hiroshima City Univ.) VLD2017-91 |
Recently, k-nearest neighbor search is frequently used in the field of pattern recognition, clustering,etc. However, f... [more] |
VLD2017-91 pp.13-18 |
| CQ, IMQ, MVE, IE (Joint) [detail] |
2015-03-04 11:40 |
Tokyo | Seikei Univ. | Fast Bag-of-Feature Generation Featuring Approximate Nearest Image-Patch Search Kei Ito, Toshihiko Yamasaki, Kiyoharu Aizawa (UT) IMQ2014-53 IE2014-114 MVE2014-101 |
In Bag-of-Features models, which have been widely used in object recognition, various speed-up approaches have been deve... [more] | IMQ2014-53 IE2014-114 MVE2014-101 pp.125-126 |
| CPSY, IPSJ-EMB, IPSJ-SLDM, DC [detail] | 2014-03-16 12:05 |
Okinawa | Evaluation of Simple Routing Method for Reverse k-Nearest Neighbor Queries in Spatial Networks Yusuke Gotoh (Okayama Univ.) CPSY2013-114 DC2013-101 |
In this paper, we propose and evaluate the simple routing method for reverse k-nearest neighbor queries in spatial netwo... [more] | CPSY2013-114 DC2013-101 pp.271-276 |
|
| IBISML | 2013-11-13 15:45 |
Tokyo | Tokyo Institute of Technology, Kuramae-Kaikan | [Poster Presentation]
Gaussian Sparse Hashing Koichiro Suzuki, Mitsuru Ambai, Ikuro Sato (Denso IT Labo) IBISML2013-56 |
Binary hashing has been widely used for Approximate Nearest Neighbor(ANN) search due to fast query speed and less stora... [more] |
IBISML2013-56 pp.155-160 |
| EMM, ISEC, SITE, ICSS, IPSJ-CSEC, IPSJ-SPT [detail] | 2013-07-19 12:55 |
Hokkaido | On Identification Methods for Visible-Light Paper Artifact-Metric Systems Ryosuke Suzuki, Tsutomu Matsumoto (Yokohama National Univ.) ISEC2013-41 SITE2013-36 ICSS2013-46 EMM2013-43 |
A visible-light paper artifact-metric system authenticates a piece of paper using its individual pattern of entangled fi... [more] | ISEC2013-41 SITE2013-36 ICSS2013-46 EMM2013-43 pp.289-295 |
|
| PRMU | 2013-02-21 15:30 |
Osaka | Fast and Memory Efficient Approximate Nearest Neighbor Search with Distance Estimation Based on Space Indexing Tomokazu Sato, Masakazu Iwamura, Koichi Kise (Osaka Pref Univ.) PRMU2012-142 |
(To be available after the conference date) [more] | PRMU2012-142 pp.73-78 |
|
| PRMU | 2013-02-22 10:00 |
Osaka | Grafting Trees A Nearest Neighbor Srarch Algorithm without Distance Computation Yohei Ohtani, Toshikazu Wada, Hiroshi Oike (Wakayama Univ.) PRMU2012-162 |
This report presents a nearest neighbor search algorithm without distance computation. K-D tree based nearest neighbor s... [more] | PRMU2012-162 pp.137-142 |
|
| PRMU, HIP | 2012-12-13 14:00 |
Yamagata | High-Accuracy Clustering Using LDA for Fast Japanese Character Recognition Takahiro Sasaki, Hideaki Goto (Tohoku Univ.) PRMU2012-73 HIP2012-62 |
Recognizing text in natural scene images is very important to develop various systems such as an assis- tant device for... [more] |
PRMU2012-73 HIP2012-62 pp.19-24 |
|
| PRMU, FM | 2011-12-16 14:45 |
Shizuoka | Hamamatsu Campus, Shizuoka Univ. | Example-based Generic Object Detection Using Similar-Image Search Yuki Watanabe, Hiroto Nagayoshi, Atsushi Hiroike (Hitachi Ltd.) PRMU2011-142 |
In this paper, we propose an object detection method using similar-image search, which can be applied to various categor... [more] | PRMU2011-142 pp.101-106 |
| IN, NS (Joint) |
2011-03-04 09:10 |
Okinawa | Okinawa Convention Center | An in-network spam filtering method using nearest neighbor search of edit distance Yosuke Tsukajima, Akihiro Nakao (Univ. of Tokyo) NS2010-244 |
Email has become an indispensable means for the communication in social life. However, a huge amount of spam has become ... [more] | NS2010-244 pp.449-454 |
| COMP | 2010-06-25 16:00 |
Tokyo | Tokyo Tech | A Constant Work Space Algorithm for Finding Nearest Larger Neighbors Tetsuo Asano (JAIST), Sergey Bereg (Univ. of Texas at Dallas), David Kirkpatrick (Univ. of British Columbia) COMP2010-22 |
In this report we consider a problem of finding nearest larger elements using only constant work space in addition to ... [more] |
COMP2010-22 pp.45-52 |
| PRMU | 2010-02-19 11:45 |
Tokyo | Tokyo Univ. of Agriculture and Technology | Real-Time Case-Based Recognition of Camera-Captured Characters Masakazu Iwamura, Tomohiko Tsuji, Koichi Kise (Osaka Pref. Univ.) PRMU2009-222 |
In this paper, in the recognition problem of camera-captured characters, we present how to realize quick and precise r... [more] |
PRMU2009-222 pp.87-92 |
| PRMU, SP, MVE, CQ | 2010-01-21 13:10 |
Kyoto | Kyoto Univ. | Derivation of Theoretical Formulae of Accuracy and Memory Amount on Accessing Neighboring Buckets in Hash-Based Approximate Nearest Neighbor Search Tomoyuki Muto, Masashi Tada, Masakazu Iwamura, Koichi Kise (Osaka Prefecture Univ.) CQ2009-71 PRMU2009-170 SP2009-111 MVE2009-93 |
Approximate nearest neighbor search is a technique which greatly reduces processing time and required amount of memory ... [more] |
CQ2009-71 PRMU2009-170 SP2009-111 MVE2009-93 pp.109-114 |
| PRMU | 2009-11-26 15:20 |
Ishikawa | Ishikawa Industrial Promotion Center | [Tutorial Lecture]
Specific Object Recognition Koichi Kise (Osaka Pref. Univ.) PRMU2009-104 |
Specific object recognition is a process to recognize instances of objects captured as images. In other words, it indic... [more] |
PRMU2009-104 pp.79-87 |
| PRMU | 2009-11-27 09:30 |
Ishikawa | Ishikawa Industrial Promotion Center | Approximate Nearest Neighbor Search Based on a Multi-Valued Expression of Closeness Masashi Tada, Tomoyuki Muto, Masakazu Iwamura, Koichi Kise (Osaka Pref. Univ.) PRMU2009-110 |
Approximate nearest neighbor search is a technique which greatly reduces processing time and required amount of memory ... [more] |
PRMU2009-110 pp.121-126 |
| PRMU | 2009-03-13 09:00 |
Miyagi | Tohoku Institute of Technology | Color Restoration From Saturated Images
-- Restration method up to 2 channel saturations -- Takanori Tamaki, Toshikazu Wada, Kazumasa Suzuki (Wakayama Univ.) PRMU2008-243 |
When we take a photograph，excessive light over the dynamic range of the camera can be injected by proximal lighting or l... [more] | PRMU2008-243 pp.19-24 |
| PRMU, DE | 2008-06-19 14:00 |
Hokkaido | Otaru-Shimin-Kaikan | A study on fast search of the nearest string in edit distance Hiroyuki Hanada, Mineichi Kudo (Hokkaido Univ.) DE2008-8 PRMU2008-26 |
The problem is finding the nearest string, measured by edit distance, to a query string $q$ from a set $T$ of strings. ... [more] |
DE2008-8 PRMU2008-26 pp.41-46 |
[Return to Top Page]