Identity statement area
Reference TypeConference Paper (Conference Proceedings)
Last Update2015: (UTC)
Metadata Last Update2020: (UTC) administrator
Citation KeyDornellesHira:2015:SeWiWo
TitleSelection of windows for W-operator combination from entropy based ranking
Access Date2022, Jan. 28
Number of Files1
Size990 KiB
Context area
Author1 Dornelles, Marta Magda
2 Hirata, Nina Sumiko Tomita
Affiliation1 Department of Exact and Technological Sciences, Universidade Estadual de Santa Cruz
2 Institute of Mathematics and Statistics, University of So Paulo
EditorPapa, Joo Paulo
Sander, Pedro Vieira
Marroquim, Ricardo Guerra
Farrell, Ryan
Conference NameConference on Graphics, Patterns and Images, 28 (SIBGRAPI)
Conference LocationSalvador
DateAug. 26-29, 2015
PublisherIEEE Computer Society
Publisher CityLos Alamitos
Book TitleProceedings
Tertiary TypeFull Paper
History (UTC)2015-06-25 16:35:35 :: -> administrator ::
2020-02-19 02:14:04 :: administrator -> :: 2015
Content and structure area
Is the master or a copy?is the master
Content Stagecompleted
Content TypeExternal Contribution
Keywordsbinary image
morphological operator design
W-operator combination
conditional entropy
sequential forward selection
AbstractWhen training morphological operators that are locally defined with respect to a neighborhood window, one must deal with the tradeoff between window size and statistical precision of the learned operator. More precisely, too small windows result in large restriction errors due to the constrained operator space and, on the other hand, too large windows result in large variance error due to often insufficient number of samples. A two-level training method that combines a number of operators designed on distinct windows of moderate size is an effective way to mitigate this issue. However, in order to train combined operators, one must specify not only how many operators will be combined, but also the windows for each of them. To date, a genetic algorithm that searches for window combinations has produced the best results for this problem. In this work we propose an alternative approach that is computationally much more efficient. The proposed method consists in efficiently reducing the search space by ranking windows of a collection according to an entropy based measure estimated from input- output joint probabilities. Computational efficiency comes from the fact that only few operators need to be trained. Experimental results show that this method produces results that outperform the best results obtained with manually selected combinations and are competitive with results obtained with the genetic algorithm based solution. The proposed approach is, thus, a promising step towards fully automating the process of binary morphological operator design. > SDLA > SIBGRAPI 2015 > Selection of windows...
doc Directory Contentaccess
source Directory Contentthere are no files
agreement Directory Content
agreement.html 25/06/2015 13:35 0.7 KiB 
Conditions of access and use area
data URL
zipped data URL
Target FilePID3771543.pdf
Update Permissionnot transferred
Allied materials area
Next Higher Units8JMKD3MGPBW34M/3K24PF8
Notes area
Empty Fieldsaccessionnumber archivingpolicy archivist area callnumber copyholder copyright creatorhistory descriptionlevel dissemination doi edition electronicmailaddress group holdercode isbn issn label lineage mark nextedition notes numberofvolumes orcid organization pages parameterlist parentrepositories previousedition previouslowerunit progress project readergroup readpermission resumeid rightsholder secondarydate secondarykey secondarymark secondarytype serieseditor session shorttitle sponsor subject tertiarymark type url versiontype volume