Pattern Recognition of Noisy Sequences of Behavioural Events using Functional Combinators

Research output: Contribution to journalArticle

Abstract

Vision systems are now delivering real-time tracked and classified data from which behaviours can be inferred. Behavioural specifications of observable entities are viewed as attribute grammars with general constraints on the values of the attributes. The characteristics features of realistic input data to a behavioural recogniser are missing, inserted and noisy values. Behaviour recognition is defined in terms of a simple language which is used to express behaviour specifications. The meaning of a specification is given by a mapping to the set of observable value sequences which exhibit the specified behaviour. A computational mechanism for behaviour recognition, which is consistent with the meaning of behaviour specifications, is given using a simple functional programming language which has been enriched with non-deterministic features. The non-determinism is controlled using a simple belief mechanism.
Original languageEnglish
Pages (from-to)385-398
JournalComputer Journal
Volume37
Issue number5
DOIs
Publication statusPublished - 1 May 1994

Fingerprint

Pattern recognition
Specifications
Functional programming
Computer programming languages

Cite this

@article{ec5f8e236c2c45f6b87a53d70aecca52,
title = "Pattern Recognition of Noisy Sequences of Behavioural Events using Functional Combinators",
abstract = "Vision systems are now delivering real-time tracked and classified data from which behaviours can be inferred. Behavioural specifications of observable entities are viewed as attribute grammars with general constraints on the values of the attributes. The characteristics features of realistic input data to a behavioural recogniser are missing, inserted and noisy values. Behaviour recognition is defined in terms of a simple language which is used to express behaviour specifications. The meaning of a specification is given by a mapping to the set of observable value sequences which exhibit the specified behaviour. A computational mechanism for behaviour recognition, which is consistent with the meaning of behaviour specifications, is given using a simple functional programming language which has been enriched with non-deterministic features. The non-determinism is controlled using a simple belief mechanism.",
author = "Clark, {A. N.}",
year = "1994",
month = "5",
day = "1",
doi = "10.1093/comjnl/37.5.385",
language = "English",
volume = "37",
pages = "385--398",
journal = "Computer Journal",
issn = "0010-4620",
publisher = "Oxford University Press",
number = "5",

}

Pattern Recognition of Noisy Sequences of Behavioural Events using Functional Combinators. / Clark, A. N.

In: Computer Journal, Vol. 37, No. 5, 01.05.1994, p. 385-398.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Pattern Recognition of Noisy Sequences of Behavioural Events using Functional Combinators

AU - Clark, A. N.

PY - 1994/5/1

Y1 - 1994/5/1

N2 - Vision systems are now delivering real-time tracked and classified data from which behaviours can be inferred. Behavioural specifications of observable entities are viewed as attribute grammars with general constraints on the values of the attributes. The characteristics features of realistic input data to a behavioural recogniser are missing, inserted and noisy values. Behaviour recognition is defined in terms of a simple language which is used to express behaviour specifications. The meaning of a specification is given by a mapping to the set of observable value sequences which exhibit the specified behaviour. A computational mechanism for behaviour recognition, which is consistent with the meaning of behaviour specifications, is given using a simple functional programming language which has been enriched with non-deterministic features. The non-determinism is controlled using a simple belief mechanism.

AB - Vision systems are now delivering real-time tracked and classified data from which behaviours can be inferred. Behavioural specifications of observable entities are viewed as attribute grammars with general constraints on the values of the attributes. The characteristics features of realistic input data to a behavioural recogniser are missing, inserted and noisy values. Behaviour recognition is defined in terms of a simple language which is used to express behaviour specifications. The meaning of a specification is given by a mapping to the set of observable value sequences which exhibit the specified behaviour. A computational mechanism for behaviour recognition, which is consistent with the meaning of behaviour specifications, is given using a simple functional programming language which has been enriched with non-deterministic features. The non-determinism is controlled using a simple belief mechanism.

UR - https://academic.oup.com/comjnl/article-lookup/doi/10.1093/comjnl/37.5.385

U2 - 10.1093/comjnl/37.5.385

DO - 10.1093/comjnl/37.5.385

M3 - Article

VL - 37

SP - 385

EP - 398

JO - Computer Journal

JF - Computer Journal

SN - 0010-4620

IS - 5

ER -