Pattern matching by sequential subdivision of transformation space

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

3 Citations (Scopus)

Abstract

Pattern matching is a well-known pattern recognition technique. This paper proposes a novel pattern matching algorithm that searches transformation space by sequential subdivision. The algorithm subdivides the transformation space in depth-first manner by conducting boolean operations on the constraint sets that are defined by pairs of template points and target points. For constrained polynomial transformations that have no more than two parameters on each coordinate, a constraint set can be represented as a 2D polygon or a Cartesian product of 2D polygons. Then, the boolean operations can be computed through generic polygon clipping algorithms. Preliminary experiments on randomly generated point patterns show that the algorithm is effective and efficient under practical conditions.

Original languageEnglish (US)
Title of host publicationProceedings of the 17th International Conference on Pattern Recognition, ICPR 2004
EditorsJ. Kittler, M. Petrou, M. Nixon
Pages145-148
Number of pages4
DOIs
StatePublished - Dec 17 2004
EventProceedings of the 17th International Conference on Pattern Recognition, ICPR 2004 - Cambridge, United Kingdom
Duration: Aug 23 2004Aug 26 2004

Publication series

NameProceedings - International Conference on Pattern Recognition
Volume2
ISSN (Print)1051-4651

Conference

ConferenceProceedings of the 17th International Conference on Pattern Recognition, ICPR 2004
CountryUnited Kingdom
CityCambridge
Period8/23/048/26/04

Fingerprint

Pattern matching
Pattern recognition
Polynomials
Experiments

ASJC Scopus subject areas

  • Computer Vision and Pattern Recognition

Cite this

Ni, M., & Reichenbach, S. E. (2004). Pattern matching by sequential subdivision of transformation space. In J. Kittler, M. Petrou, & M. Nixon (Eds.), Proceedings of the 17th International Conference on Pattern Recognition, ICPR 2004 (pp. 145-148). (Proceedings - International Conference on Pattern Recognition; Vol. 2). https://doi.org/10.1109/ICPR.2004.1334082

Pattern matching by sequential subdivision of transformation space. / Ni, Mingtian; Reichenbach, Stephen E.

Proceedings of the 17th International Conference on Pattern Recognition, ICPR 2004. ed. / J. Kittler; M. Petrou; M. Nixon. 2004. p. 145-148 (Proceedings - International Conference on Pattern Recognition; Vol. 2).

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

Ni, M & Reichenbach, SE 2004, Pattern matching by sequential subdivision of transformation space. in J Kittler, M Petrou & M Nixon (eds), Proceedings of the 17th International Conference on Pattern Recognition, ICPR 2004. Proceedings - International Conference on Pattern Recognition, vol. 2, pp. 145-148, Proceedings of the 17th International Conference on Pattern Recognition, ICPR 2004, Cambridge, United Kingdom, 8/23/04. https://doi.org/10.1109/ICPR.2004.1334082
Ni M, Reichenbach SE. Pattern matching by sequential subdivision of transformation space. In Kittler J, Petrou M, Nixon M, editors, Proceedings of the 17th International Conference on Pattern Recognition, ICPR 2004. 2004. p. 145-148. (Proceedings - International Conference on Pattern Recognition). https://doi.org/10.1109/ICPR.2004.1334082
Ni, Mingtian ; Reichenbach, Stephen E. / Pattern matching by sequential subdivision of transformation space. Proceedings of the 17th International Conference on Pattern Recognition, ICPR 2004. editor / J. Kittler ; M. Petrou ; M. Nixon. 2004. pp. 145-148 (Proceedings - International Conference on Pattern Recognition).
@inproceedings{682f24462e3f408eac19952ef2c6ffda,
title = "Pattern matching by sequential subdivision of transformation space",
abstract = "Pattern matching is a well-known pattern recognition technique. This paper proposes a novel pattern matching algorithm that searches transformation space by sequential subdivision. The algorithm subdivides the transformation space in depth-first manner by conducting boolean operations on the constraint sets that are defined by pairs of template points and target points. For constrained polynomial transformations that have no more than two parameters on each coordinate, a constraint set can be represented as a 2D polygon or a Cartesian product of 2D polygons. Then, the boolean operations can be computed through generic polygon clipping algorithms. Preliminary experiments on randomly generated point patterns show that the algorithm is effective and efficient under practical conditions.",
author = "Mingtian Ni and Reichenbach, {Stephen E}",
year = "2004",
month = "12",
day = "17",
doi = "10.1109/ICPR.2004.1334082",
language = "English (US)",
isbn = "0769521282",
series = "Proceedings - International Conference on Pattern Recognition",
pages = "145--148",
editor = "J. Kittler and M. Petrou and M. Nixon",
booktitle = "Proceedings of the 17th International Conference on Pattern Recognition, ICPR 2004",

}

TY - GEN

T1 - Pattern matching by sequential subdivision of transformation space

AU - Ni, Mingtian

AU - Reichenbach, Stephen E

PY - 2004/12/17

Y1 - 2004/12/17

N2 - Pattern matching is a well-known pattern recognition technique. This paper proposes a novel pattern matching algorithm that searches transformation space by sequential subdivision. The algorithm subdivides the transformation space in depth-first manner by conducting boolean operations on the constraint sets that are defined by pairs of template points and target points. For constrained polynomial transformations that have no more than two parameters on each coordinate, a constraint set can be represented as a 2D polygon or a Cartesian product of 2D polygons. Then, the boolean operations can be computed through generic polygon clipping algorithms. Preliminary experiments on randomly generated point patterns show that the algorithm is effective and efficient under practical conditions.

AB - Pattern matching is a well-known pattern recognition technique. This paper proposes a novel pattern matching algorithm that searches transformation space by sequential subdivision. The algorithm subdivides the transformation space in depth-first manner by conducting boolean operations on the constraint sets that are defined by pairs of template points and target points. For constrained polynomial transformations that have no more than two parameters on each coordinate, a constraint set can be represented as a 2D polygon or a Cartesian product of 2D polygons. Then, the boolean operations can be computed through generic polygon clipping algorithms. Preliminary experiments on randomly generated point patterns show that the algorithm is effective and efficient under practical conditions.

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

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

U2 - 10.1109/ICPR.2004.1334082

DO - 10.1109/ICPR.2004.1334082

M3 - Conference contribution

SN - 0769521282

T3 - Proceedings - International Conference on Pattern Recognition

SP - 145

EP - 148

BT - Proceedings of the 17th International Conference on Pattern Recognition, ICPR 2004

A2 - Kittler, J.

A2 - Petrou, M.

A2 - Nixon, M.

ER -