Close

1. Identity statement
Reference TypeSlides (Audiovisual Material)
Sitemtc-m21b.sid.inpe.br
Holder Codeisadg {BR SPINPE} ibi 8JMKD3MGPCW/3DT298S
Identifier83LX3pFwXQZ3qyBY/RL3kk
Repositorydpi.inpe.br/ismm@80/2007/10.14.17.43
Last Update2007:10.14.17.43.32 (UTC) administrator
Metadata Repositorydpi.inpe.br/ismm@80/2007/10.14.17.43.33
Metadata Last Update2021:09.16.02.55.17 (UTC) administrator
Citation KeyPapaFalMirSuzMas:2007:DeRoPa
TitleDesign of robust pattern classifiers based on optimum-path forests
Short TitleSlides
FormatPrinted, On-line.
Year2007
Access Date2024, May 19
Secondary TypeCI
Number of Files1
Size528 KiB
2. Context
Author1 Papa, João Paulo
2 Falcão, Alexandre X.
3 Miranda, Paulo A. V.
4 Suzuki, Celso T. N.
5 Mascarenhas, Nelson D. A.
e-Mail Addressafalcao@ic.unicamp.br
Conference NameInternational Symposium on Mathematical Morphology, 8 (ISMM).
Conference LocationRio de Janeiro
DateOct. 2007
PublisherInstituto Nacional de Pesquisas Espaciais (INPE)
Publisher CitySão José dos Campos
Tertiary TypeFull Paper
ProgressCamera-ready paper submission
History (UTC)2021-09-16 02:55:17 :: administrator -> afalcao@ic.unicamp.br :: 2007
3. Content and structure
Is the master or a copy?is the master
Content Stagecompleted
Transferable1
Keywordssupervised classifiers
image foresting transform
image analysis
pattern recognition
AbstractWe present a supervised pattern classifier based on optimum path forest. The samples in a training set are nodes of a complete graph, whose arcs are weighted by the distances between sample feature vectors. The training builds a classifier from key samples (prototypes) of all classes, where each prototype defines an optimum path tree whose nodes are its strongest connected samples. The optimum paths are also considered to label unseen test samples with the classes of their strongest connected prototypes. We show how to find prototypes with none classification errors in the training set and propose a learning algorithm to improve accuracy over an evaluation set. The method is robust to outliers, handles non-separable classes, and can outperform support vector machines.
AreaSRE
SubjectMorphological pattern recognition
Sessionincluding
TypeWatershed segmentation
ArrangementDesign of robust... > Slides
doc Directory Contentaccess
source Directory Contentthere are no files
agreement Directory Contentthere are no files
4. Conditions of access and use
data URLhttp://urlib.net/ibi/83LX3pFwXQZ3qyBY/RL3kk
zipped data URLhttp://urlib.net/zip/83LX3pFwXQZ3qyBY/RL3kk
Languageen
Target Filepapa_opf.pdf
User Groupafalcao@ic.unicamp.br
administrator
Visibilityshown
5. Allied materials
Mirror Repositoryiconet.com.br/banon/2007/01.10.09.37
Next Higher Units83LX3pFwXQZ3qyBY/PKn22
Host Collectiondpi.inpe.br/hermes2@80/2006/05.03.12.24
sid.inpe.br/mtc-m21b/2013/09.26.14.25.20
6. Notes
Mark1
Empty Fieldsaffiliation archivingpolicy archivist booktitle callnumber contenttype copyholder copyright creatorhistory descriptionlevel dissemination documentstage doi electronicmailaddress group isbn issn label lineage nextedition notes numberofslides orcid parameterlist parentrepositories previousedition previouslowerunit project readergroup readpermission resumeid rightsholder schedulinginformation secondarydate secondarykey secondarymark sponsor tertiarymark url versiontype volume


Close