Pattern recognition using Markov random field models
In this paper, we propose Markov random field models for pattern recognition, which provide a flexible and natural framework for modelling the interactions between spatially related random variables in their neighbourhood systems. The proposed approach is superior to conventional approaches in many aspects. This paper introduces the concept of states into Markov random filed models, presents a theoretic analysis of the approach, discusses issues of designing neighbourhood system and cliques, and analyses properties of the models. We have applied our method to the recognition of unconstrained handwritten numerals. The experimental results show that the proposed approach can achieve high performance.
Impact and interest:
Citation counts are sourced monthly from and citation databases.
Citations counts from theindexing service can be viewed at the linked Google Scholar™ search.
Full-text downloads displays the total number of times this work’s files (e.g., a PDF) have been downloaded from QUT ePrints as well as the number of downloads in the previous 365 days. The count includes downloads for all files if a work has more than one.
|Item Type:||Journal Article|
|Keywords:||Pattern recognition, Markov random field, Neighbourhood system, Handwritten numerical recognition|
|Subjects:||Australian and New Zealand Standard Research Classification > INFORMATION AND COMPUTING SCIENCES (080000) > ARTIFICIAL INTELLIGENCE AND IMAGE PROCESSING (080100) > Pattern Recognition and Data Mining (080109)|
|Divisions:||Past > QUT Faculties & Divisions > Faculty of Science and Technology|
|Copyright Owner:||Copyright 2002 Elsevier|
|Copyright Statement:||Reproduced in accordance with the copyright policy of the publisher.|
|Deposited On:||16 Jul 2007|
|Last Modified:||09 Jun 2010 12:42|
Repository Staff Only: item control page