Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
EMM |
2023-03-02 13:00 |
Nagasaki |
Fukue culture hall (Primary: On-site, Secondary: Online) |
[Poster Presentation]
A Video Data Hiding Scheme Using Dynamic Programming on Feature Sequences Tamaki Yonemaru, Tetsuya Kojima, Raito Matsuzaki, Akira Tanaka (NIT, Tokyo College) EMM2022-73 |
A video data hiding scheme based on the differences between two successive frames has been proposed. In this scheme, a w... [more] |
EMM2022-73 pp.34-37 |
IE, ITS, ITE-MMS, ITE-ME, ITE-AIT [detail] |
2023-02-22 15:20 |
Hokkaido |
Hokkaido Univ. |
Train localization using the sensor-built-in smartphone fixed to the train
-- Performance comparisons in various situations -- Masaya Nishigaki, Takaaki Hasegawa (Saitama Univ.) ITS2022-75 IE2022-92 |
In this paper, with the purpose of achieving low-cost and highly accurate railway localization using a commodity smartph... [more] |
ITS2022-75 IE2022-92 pp.186-191 |
COMP, IPSJ-AL |
2021-05-08 11:00 |
Online |
Online |
An Extension of Cartesian Tree Matching Based-on Subsequences Takeshi Kai, Kenta Mitsuyoshi, Isamu Furuya, Hiroki Arimura (Hokkaido Univ.) COMP2021-6 |
In this paper, we consider the Cartesian tree matching problem, originally introduced by Park et al. in 2019. Despite of... [more] |
COMP2021-6 pp.39-45 |
ITS, IPSJ-ITS, IEE-ITS |
2017-09-04 13:50 |
Toyama |
Toyama Institute of Information Systems |
A Fast Map-matching algorithm based on Global Optimization
-- Dynamic Programming and a fast link connectivity verification -- Tatsuya Hamaoka (Fujitsu Ten), Masato Mizu, Takayoshi Yokota (Tottori Univ.) ITS2017-8 |
The location data from positioning devices, such as GPS, provides vital information for the probe car systems aiming at... [more] |
ITS2017-8 pp.17-22 |
COMP |
2016-03-14 13:30 |
Fukuoka |
|
Longest Common Subsequence Problem for Numerical Sequences by using Order-Isomorphic-Substrings Masatoshi Kurihara, Kazuyuki Narisawa, Ayumi Shinohara (Tohoku Univ.) COMP2015-38 |
The order-isomorphism can be used as a criteria for the similarity of numerical sequences. The order-preserving matching... [more] |
COMP2015-38 pp.11-20 |
MoNA, ASN, IPSJ-MBL, IPSJ-UBI (Joint) [detail] |
2015-03-02 11:00 |
Tokyo |
Shibaura Institute of Technology(Toyosu Campus) |
Cloud-based ECG Monitoring System for Mobile Users Mohamad Sabri Bin Sinal, Eiji Kamioka (SIT) MoNA2014-94 |
Nowadays, new wireless technologies have been well-established and high capabilities of wearable biomedical sensor devic... [more] |
MoNA2014-94 pp.43-48 |
CAS, SIP, MSS, VLD, SIS [detail] |
2014-07-09 13:40 |
Hokkaido |
Hokkaido University |
Weighted Dominating Sets and Induced Matchings in Orthogonal Ray Graphs Asahi Takaoka, Satoshi Tayu, Shuichi Ueno (Tokyo Inst. of Tech.) CAS2014-10 VLD2014-19 SIP2014-31 MSS2014-10 SIS2014-10 |
An orthogonal ray graph is an intersection graph of horizontal rays (closed half-lines) and vertical rays in the plane. ... [more] |
CAS2014-10 VLD2014-19 SIP2014-31 MSS2014-10 SIS2014-10 pp.45-48 |
PRMU |
2013-02-22 14:30 |
Osaka |
|
Sequence Number-free Detection of Similar Sequences Among Multiple Sequences
-- Proposal of Circle Continuous Dynamic Programming -- Ryuichi Oka (Aizu Univ.) PRMU2012-172 |
We propose a method called Circle Continuous Dynamic Programming (CCDP) for sequence number-free detection of similar se... [more] |
PRMU2012-172 pp.197-202 |
MI |
2013-01-25 09:15 |
Okinawa |
Bunka Tenbusu Kan |
Anatomical landmark-based local deformation method for medical registration Keiko Morita, Atsushi Imiya (Chiba Univ.), Tomoya Sakai (Nagasaki Univ.), Yoshitaka Masutani (Dept. of Radiology, The Univ. of Tokyo Hospital), Hidekata Hontani (Naitech) MI2012-93 |
In this paper, we develop a method for constructing the mean boundary curve of anatomical objects by using anatomical la... [more] |
MI2012-93 pp.161-166 |
SIS |
2012-12-13 12:30 |
Chiba |
Nihon University Tsudanuma Campus |
[Tutorial Lecture]
Robust and Fast Search Algorithm for Lyric Search Covering Erroneous Queries due to Mishearing Xin Xu, Tsuneo Kato (KDDI R&D Laboratories, Inc.) SIS2012-33 |
This paper proposes a robust and fast lyric search method for music information retrieval (MIR). The effectiveness of ly... [more] |
SIS2012-33 p.23 |
COMP |
2012-06-21 11:00 |
Hokkaido |
Hokkaido University |
Efficient Exponential Time Algorithms for Edit Distance between Unordered Trees Tatsuya Akutsu, Takeyuki Tamura (Kyoto Univ.), Daiji Fukagawa (Doshisha Univ.), Atsuhiro Takasu (NII) COMP2012-15 |
This report presents efficient exponential time algorithms for the unordered tree edit distance problem, which is known ... [more] |
COMP2012-15 pp.25-31 |
IBISML, PRMU, IPSJ-CVIM [detail] |
2010-09-06 16:30 |
Fukuoka |
Fukuoka Univ. |
General Scheme of Continuous Dynamic Programming
-- Optimal Full Pixel Matching for Spotting Image -- Ryuichi Oka, Yuichi Yaguchi, Shinya Nizoe (Aizu Univ) PRMU2010-87 IBISML2010-59 |
Two-dimensional Continuous Dynamic Programming (2DCDP) for optimal full pixel matching is discussed. There is a family o... [more] |
PRMU2010-87 IBISML2010-59 pp.245-252 |
PRMU |
2010-02-19 16:00 |
Tokyo |
Tokyo Univ. of Agriculture and Technology |
Handwritten Digit Recognition by Analytical DP Matching Satoshi Hokahori, Yaokai Feng, Seiichi Uchida (Kyshu Univ.) PRMU2009-232 |
Elastic matching is one of the promising tequniques for handwritten character recognition. In this
tequnique, an input ... [more] |
PRMU2009-232 pp.147-152 |
PRMU, TL |
2006-02-23 10:30 |
Ibaraki |
|
Analytical DP matching and its application to pattern recognition Seiichi Uchida, Hiroaki Sakoe (Kyushu Univ.) |
DP (dynamic programming) matching is one of the most fundamental techniques for
various pattern recognition and image ... [more] |
TL2005-56 PRMU2005-191 pp.43-48 |