Close
Metadata

Identity statement area
Reference TypeConference Paper (Conference Proceedings)
Sitesibgrapi.sid.inpe.br
Identifier6qtX3pFwXQZeBBx/GA5vS
Repositorysid.inpe.br/banon/2005/06.27.15.41
Last Update2005:06.27.03.00.00 (UTC) administrator
Metadatasid.inpe.br/banon/2005/06.27.15.41.46
Metadata Last Update2020:02.19.03.19.05 (UTC) administrator
Citation KeyFalcãoMiraRochBerg:2005:ObDeKc
TitleObject detection by k-connected seed competition
FormatOn-line
Year2005
Access Date2021, Nov. 27
Number of Files1
Size231 KiB
Context area
Author1 Falcão, Alexandre Xavier
2 Miranda, Paulo André Vechiatto
3 Rocha, Anderson
4 Bergo, Felipe P. G.
Affiliation1 State University of Campinas
EditorRodrigues, Maria Andréia Formico
Frery, Alejandro César
e-Mail Addressanderson.rocha@ic.unicamp.br
Conference NameBrazilian Symposium on Computer Graphics and Image Processing, 18 (SIBGRAPI)
Conference LocationNatal
Date9-12 Oct. 2005
PublisherIEEE Computer Society
Publisher CityLos Alamitos
Book TitleProceedings
Tertiary TypeFull Paper
History (UTC)2005-06-27 15:41:47 :: anderson.rocha -> banon ::
2005-07-04 12:08:02 :: banon -> anderson.rocha ::
2008-07-17 14:10:58 :: anderson.rocha -> banon ::
2008-08-26 15:17:00 :: banon -> administrator ::
2009-08-13 20:37:41 :: administrator -> banon ::
2010-08-28 20:01:16 :: banon -> administrator ::
2020-02-19 03:19:05 :: administrator -> :: 2005
Content and structure area
Is the master or a copy?is the master
Content Stagecompleted
Transferable1
Content TypeExternal Contribution
KeywordsKappa connectednes
seed competition
image segmentation
AbstractThe notion of Âstrength of connectedness between pixels has been successfully used in image segmentation. We present an extension to these works, which can considerably increase the efficiency of object definition tasks. A set of pixels is said a k-connected component with respect to a seed pixel when the strength of connectedness of any pixel in that set with respect to the seed is higher than or equal to a threshold. While the previous approaches either assume no competition with a single threshold for all seeds or eliminate the threshold for seed competition, we found that seed competition with different thresholds can reduce the number of seeds and the need for user interaction during segmentation. We also propose automatic and user-friendly interactive methods for determining the thresholds. The improvements are demonstrated through several segmentation experiments involving medical images.
doc Directory Contentaccess
source Directory Contentthere are no files
agreement Directory Contentthere are no files
Conditions of access and use area
data URLhttp://urlib.net/ibi/6qtX3pFwXQZeBBx/GA5vS
zipped data URLhttp://urlib.net/zip/6qtX3pFwXQZeBBx/GA5vS
Languageen
Target Filefalcaoa_seedcompetition.pdf
User Groupanderson.rocha
administrator
Visibilityshown
Allied materials area
Host Collectionsid.inpe.br/banon/2001/03.30.15.38
Notes area
Empty Fieldsaccessionnumber archivingpolicy archivist area callnumber copyholder copyright creatorhistory descriptionlevel dissemination documentstage doi edition electronicmailaddress group holdercode isbn issn label lineage mark mirrorrepository nextedition nexthigherunit 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

Close