Close
Metadata

1. Identity statement
Reference TypeConference Paper (Conference Proceedings)
Sitesibgrapi.sid.inpe.br
Holder Codeibi 8JMKD3MGPEW34M/46T9EHH
Identifier8JMKD3MGPBW34M/3EF6B9E
Repositorysid.inpe.br/sibgrapi/2013/07.14.21.20
Last Update2013:07.14.21.20.45 (UTC) administrator
Metadata Repositorysid.inpe.br/sibgrapi/2013/07.14.21.20.45
Metadata Last Update2022:06.14.00.07.56 (UTC) administrator
DOI10.1109/SIBGRAPI.2013.55
Citation KeyAlvesMoriCastHash:2013:ExNuRe
TitleExtraction of numerical residues in families of levelings
FormatOn-line.
Year2013
Access Date2025, July 10
Number of Files1
Size2375 KiB
2. Context
Author1 Alves, Wonder Alexandre Luz
2 Morimitsu, Alexandre
3 Castro, Joel Sánchez
4 Hashimoto, Ronaldo Fumio
Affiliation1 Institute of Mathematics and Statistics, University of São Paulo
2 Institute of Mathematics and Statistics, University of São Paulo
3 Institute of Mathematics and Statistics, University of São Paulo
4 Institute of Mathematics and Statistics, University of São Paulo
EditorBoyer, Kim
Hirata, Nina
Nedel, Luciana
Silva, Claudio
e-Mail Addresswonder@ime.usp.br
Conference NameConference on Graphics, Patterns and Images, 26 (SIBGRAPI)
Conference LocationArequipa, Peru
Date5-8 Aug. 2013
PublisherIEEE Computer Society
Publisher CityLos Alamitos
Book TitleProceedings
Tertiary TypeFull Paper
History (UTC)2013-07-14 21:20:45 :: wonder@ime.usp.br -> administrator ::
2022-06-14 00:07:56 :: administrator -> :: 2013
3. Content and structure
Is the master or a copy?is the master
Content Stagecompleted
Transferable1
Version Typefinaldraft
Keywordsresidual morphological operator
ultimate attribute opening
ultimate attribute closing
ultimate attribute leveling
AbstractThis work introduces a residual operator called ultimate attribute leveling. We also present an efficient algorithm for ultimate attribute leveling computation by using a structure called tree of shapes. Our algorithm for computating ultimate attribute leveling is based on the fact (proved in this work) that levelings can be obtained by pruning nodes from the tree of shapes. This is a novel result, since so far it is known that levelings can be obtained from component trees. Finally, we propose the use of ultimate attribute leveling with shape information to extract contrast using a priori knowledge of an application. Experimental results applied to text location show the potentiality of using ultimate attribute leveling with shape information for solving problems in image processing area.
Arrangement 1urlib.net > SDLA > Fonds > SIBGRAPI 2013 > Extraction of numerical...
Arrangement 2urlib.net > SDLA > Fonds > Full Index > Extraction of numerical...
doc Directory Contentaccess
source Directory Contentthere are no files
agreement Directory Content
agreement.html 14/07/2013 18:20 0.7 KiB 
4. Conditions of access and use
data URLhttp://urlib.net/ibi/8JMKD3MGPBW34M/3EF6B9E
zipped data URLhttp://urlib.net/zip/8JMKD3MGPBW34M/3EF6B9E
Languageen
Target Filepaper_revisao_v4.pdf
User Groupwonder@ime.usp.br
Visibilityshown
5. Allied materials
Mirror Repositorysid.inpe.br/banon/2001/03.30.15.38.24
Next Higher Units8JMKD3MGPEW34M/46SLB4P
8JMKD3MGPEW34M/4742MCS
Citing Item Listsid.inpe.br/sibgrapi/2022/05.15.04.02 36
sid.inpe.br/sibgrapi/2022/06.10.21.49 5
Host Collectionsid.inpe.br/banon/2001/03.30.15.38
6. Notes
Empty Fieldsarchivingpolicy archivist area callnumber contenttype copyholder copyright creatorhistory descriptionlevel dissemination documentstage edition electronicmailaddress group isbn issn label lineage mark nextedition notes numberofvolumes orcid organization pages parameterlist parentrepositories previousedition previouslowerunit progress project readergroup readpermission resumeid rightsholder schedulinginformation secondarydate secondarykey secondarymark secondarytype serieseditor session shorttitle sponsor subject tertiarymark type url volume


Close