Close

1. Identity statement
Reference TypeConference Paper (Conference Proceedings)
Sitesibgrapi.sid.inpe.br
Holder Codeibi 8JMKD3MGPEW34M/46T9EHH
Identifier6qtX3pFwXQZeBBx/GA5vS
Repositorysid.inpe.br/banon/2005/06.27.15.41
Last Update2005:06.27.03.00.00 (UTC) administrator
Metadata Repositorysid.inpe.br/banon/2005/06.27.15.41.46
Metadata Last Update2022:06.20.23.31.52 (UTC) administrator
DOI10.1109/SIBGRAPI.2005.34
Citation KeyFalcãoMiraRochBerg:2005:ObDeKc
TitleObject detection by k-connected seed competition
FormatOn-line
Year2005
Access Date2024, Mar. 28
Number of Files1
Size231 KiB
2. Context
Author1 Falcão, Alexandre Xavier
2 Miranda, Paulo André Vechiatto de
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, RN, Brazil
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 ::
2022-06-20 23:31:52 :: administrator -> :: 2005
3. Content and structure
Is the master or a copy?is the master
Content Stagecompleted
Transferable1
Version Typefinaldraft
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.
Arrangement 1urlib.net > SDLA > Fonds > SIBGRAPI 2005 > Object detection by...
Arrangement 2urlib.net > SDLA > Fonds > Full Index > Object detection by...
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/6qtX3pFwXQZeBBx/GA5vS
zipped data URLhttp://urlib.net/zip/6qtX3pFwXQZeBBx/GA5vS
Languageen
Target Filefalcaoa_seedcompetition.pdf
User Groupanderson.rocha
administrator
Visibilityshown
5. Allied materials
Next Higher Units8JMKD3MGPEW34M/46R3ED5
8JMKD3MGPEW34M/4742MCS
Citing Item Listsid.inpe.br/sibgrapi/2022/05.05.04.08 3
sid.inpe.br/banon/2001/03.30.15.38.24 1
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 mirrorrepository 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