Syntactic pattern recognition: Difference between revisions

Revision as of 14:31, 31 January 2016

Revision as of 20:22, 31 January 2016

Line 5:

An example of this would be diagnosis of the [[heart]] with [[Electrocardiogram|ECG]] measurements. ECG [[waveform]]s can be approximated with diagonal and vertical line segments. If normal and unhealthy waveforms can be described as formal grammars, measured ECG signal can be classified as healthy or unhealthy by first describing it in term of the basic line segments and then trying to parse the descriptions according to the grammars. Another example is [[tessellation]] of tiling patterns.

A second way to represent relations are [[Graph (discrete mathematics)|graphs]]{{dn|date=January 2016}}, where nodes are connected if corresponding subpatterns are related. An item can be labeled as belonging to a class if its graph representation is [[isomorphic]] with prototype graphs of the class.

Typically, patterns are constructed from simpler sub patterns in a hierarchical fashion. This helps in dividing the recognition task into easier subtask of first identifying sub patterns and only then the actual patterns.