Detecting repeated patterns using partly locality sensitive hashing

Koichi Ogawara, Yasufumi Tanabe, Ryo Kurazume, Tsutomu Hasegawa

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Repeated patterns are useful clues to learn previously unknown events in an unsupervised way. This paper presents a novel method that detects relatively long variable-length unknown repeated patterns in a motion sequence efficiently. The major contribution of the paper is two-fold: (1) Partly Locality Sensitive Hashing (PLSH) [1] is employed to find repeated patterns efficiently and (2) the problem of finding consecutive time frames that have a large number of repeated patterns is formulated as a combinatorial optimization problem which is solved via Dynamic Programming (DP) in polynomial time O(N1+1/α) thanks to PLSH where N is the total amount of data. The proposed method was evaluated by detecting repeated interactions between objects in everyday manipulation tasks and outperformed previous methods in terms of accuracy or computational time.

Original languageEnglish
Title of host publicationIEEE/RSJ 2010 International Conference on Intelligent Robots and Systems, IROS 2010 - Conference Proceedings
Pages1353-1358
Number of pages6
DOIs
Publication statusPublished - Dec 1 2010
Event23rd IEEE/RSJ 2010 International Conference on Intelligent Robots and Systems, IROS 2010 - Taipei, Taiwan, Province of China
Duration: Oct 18 2010Oct 22 2010

Other

Other23rd IEEE/RSJ 2010 International Conference on Intelligent Robots and Systems, IROS 2010
CountryTaiwan, Province of China
CityTaipei
Period10/18/1010/22/10

Fingerprint

Combinatorial optimization
Dynamic programming
Polynomials

All Science Journal Classification (ASJC) codes

  • Artificial Intelligence
  • Human-Computer Interaction
  • Control and Systems Engineering

Cite this

Ogawara, K., Tanabe, Y., Kurazume, R., & Hasegawa, T. (2010). Detecting repeated patterns using partly locality sensitive hashing. In IEEE/RSJ 2010 International Conference on Intelligent Robots and Systems, IROS 2010 - Conference Proceedings (pp. 1353-1358). [5649836] https://doi.org/10.1109/IROS.2010.5649836

Detecting repeated patterns using partly locality sensitive hashing. / Ogawara, Koichi; Tanabe, Yasufumi; Kurazume, Ryo; Hasegawa, Tsutomu.

IEEE/RSJ 2010 International Conference on Intelligent Robots and Systems, IROS 2010 - Conference Proceedings. 2010. p. 1353-1358 5649836.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Ogawara, K, Tanabe, Y, Kurazume, R & Hasegawa, T 2010, Detecting repeated patterns using partly locality sensitive hashing. in IEEE/RSJ 2010 International Conference on Intelligent Robots and Systems, IROS 2010 - Conference Proceedings., 5649836, pp. 1353-1358, 23rd IEEE/RSJ 2010 International Conference on Intelligent Robots and Systems, IROS 2010, Taipei, Taiwan, Province of China, 10/18/10. https://doi.org/10.1109/IROS.2010.5649836
Ogawara K, Tanabe Y, Kurazume R, Hasegawa T. Detecting repeated patterns using partly locality sensitive hashing. In IEEE/RSJ 2010 International Conference on Intelligent Robots and Systems, IROS 2010 - Conference Proceedings. 2010. p. 1353-1358. 5649836 https://doi.org/10.1109/IROS.2010.5649836
Ogawara, Koichi ; Tanabe, Yasufumi ; Kurazume, Ryo ; Hasegawa, Tsutomu. / Detecting repeated patterns using partly locality sensitive hashing. IEEE/RSJ 2010 International Conference on Intelligent Robots and Systems, IROS 2010 - Conference Proceedings. 2010. pp. 1353-1358
@inproceedings{af169e90ca24409fb7cf1cab7bf534f4,
title = "Detecting repeated patterns using partly locality sensitive hashing",
abstract = "Repeated patterns are useful clues to learn previously unknown events in an unsupervised way. This paper presents a novel method that detects relatively long variable-length unknown repeated patterns in a motion sequence efficiently. The major contribution of the paper is two-fold: (1) Partly Locality Sensitive Hashing (PLSH) [1] is employed to find repeated patterns efficiently and (2) the problem of finding consecutive time frames that have a large number of repeated patterns is formulated as a combinatorial optimization problem which is solved via Dynamic Programming (DP) in polynomial time O(N1+1/α) thanks to PLSH where N is the total amount of data. The proposed method was evaluated by detecting repeated interactions between objects in everyday manipulation tasks and outperformed previous methods in terms of accuracy or computational time.",
author = "Koichi Ogawara and Yasufumi Tanabe and Ryo Kurazume and Tsutomu Hasegawa",
year = "2010",
month = "12",
day = "1",
doi = "10.1109/IROS.2010.5649836",
language = "English",
isbn = "9781424466757",
pages = "1353--1358",
booktitle = "IEEE/RSJ 2010 International Conference on Intelligent Robots and Systems, IROS 2010 - Conference Proceedings",

}

TY - GEN

T1 - Detecting repeated patterns using partly locality sensitive hashing

AU - Ogawara, Koichi

AU - Tanabe, Yasufumi

AU - Kurazume, Ryo

AU - Hasegawa, Tsutomu

PY - 2010/12/1

Y1 - 2010/12/1

N2 - Repeated patterns are useful clues to learn previously unknown events in an unsupervised way. This paper presents a novel method that detects relatively long variable-length unknown repeated patterns in a motion sequence efficiently. The major contribution of the paper is two-fold: (1) Partly Locality Sensitive Hashing (PLSH) [1] is employed to find repeated patterns efficiently and (2) the problem of finding consecutive time frames that have a large number of repeated patterns is formulated as a combinatorial optimization problem which is solved via Dynamic Programming (DP) in polynomial time O(N1+1/α) thanks to PLSH where N is the total amount of data. The proposed method was evaluated by detecting repeated interactions between objects in everyday manipulation tasks and outperformed previous methods in terms of accuracy or computational time.

AB - Repeated patterns are useful clues to learn previously unknown events in an unsupervised way. This paper presents a novel method that detects relatively long variable-length unknown repeated patterns in a motion sequence efficiently. The major contribution of the paper is two-fold: (1) Partly Locality Sensitive Hashing (PLSH) [1] is employed to find repeated patterns efficiently and (2) the problem of finding consecutive time frames that have a large number of repeated patterns is formulated as a combinatorial optimization problem which is solved via Dynamic Programming (DP) in polynomial time O(N1+1/α) thanks to PLSH where N is the total amount of data. The proposed method was evaluated by detecting repeated interactions between objects in everyday manipulation tasks and outperformed previous methods in terms of accuracy or computational time.

UR - http://www.scopus.com/inward/record.url?scp=78651488187&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=78651488187&partnerID=8YFLogxK

U2 - 10.1109/IROS.2010.5649836

DO - 10.1109/IROS.2010.5649836

M3 - Conference contribution

SN - 9781424466757

SP - 1353

EP - 1358

BT - IEEE/RSJ 2010 International Conference on Intelligent Robots and Systems, IROS 2010 - Conference Proceedings

ER -