OPF-MRF: Optimum-path forest and Markov random fields for contextual-based image classification


Autoria(s): Nakamura, Rodrigo; Osaku, Daniel; Levada, Alexandre; Cappabianco, Fabio; Falcão, Alexandre; Papa, Joao
Contribuinte(s)

Universidade Estadual Paulista (UNESP)

Data(s)

27/05/2014

27/05/2014

26/09/2013

Resumo

Some machine learning methods do not exploit contextual information in the process of discovering, describing and recognizing patterns. However, spatial/temporal neighboring samples are likely to have same behavior. Here, we propose an approach which unifies a supervised learning algorithm - namely Optimum-Path Forest - together with a Markov Random Field in order to build a prior model holding a spatial smoothness assumption, which takes into account the contextual information for classification purposes. We show its robustness for brain tissue classification over some images of the well-known dataset IBSR. © 2013 Springer-Verlag.

Formato

233-240

Identificador

http://dx.doi.org/10.1007/978-3-642-40246-3_29

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), v. 8048 LNCS, n. PART 2, p. 233-240, 2013.

0302-9743

1611-3349

http://hdl.handle.net/11449/76646

10.1007/978-3-642-40246-3_29

2-s2.0-84884474442

Idioma(s)

eng

Relação

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Direitos

closedAccess

Palavras-Chave #Contextual Classification #Markov Random Fields #Optimum-Path Forest
Tipo

info:eu-repo/semantics/conferencePaper