untitled
<OAI-PMH schemaLocation=http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd> <responseDate>2018-01-15T18:29:02Z</responseDate> <request identifier=oai:HAL:lirmm-01168371v1 verb=GetRecord metadataPrefix=oai_dc>http://api.archives-ouvertes.fr/oai/hal/</request> <GetRecord> <record> <header> <identifier>oai:HAL:lirmm-01168371v1</identifier> <datestamp>2018-01-11</datestamp> <setSpec>type:COMM</setSpec> <setSpec>subject:info</setSpec> <setSpec>collection:CNRS</setSpec> <setSpec>collection:UNIV-AG</setSpec> <setSpec>collection:BNRMI</setSpec> <setSpec>collection:ICARLIRMM</setSpec> <setSpec>collection:CEREGMIA</setSpec> <setSpec>collection:LIRMM</setSpec> <setSpec>collection:MIPS</setSpec> <setSpec>collection:UNIV-MONTPELLIER</setSpec> </header> <metadata><dc> <publisher>HAL CCSD</publisher> <title lang=en>Image segmentation using a generic, fast and non-parametric approach</title> <creator>Fiorio, Christophe</creator> <creator>Nock, Richard</creator> <contributor>Image & Interaction (ICAR) ; Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM) ; Université de Montpellier (UM) - Centre National de la Recherche Scientifique (CNRS) - Université de Montpellier (UM) - Centre National de la Recherche Scientifique (CNRS)</contributor> <contributor>Centre de Recherche en Economie, Gestion, Modélisation et Informatique Appliquée (CEREGMIA) ; Université des Antilles et de la Guyane (UAG)</contributor> <description>International audience</description> <source>10th IEEE International Conference on Tools with Artificial Intelligence</source> <source>ICTAI: International Conference on Tools with Artificial Intelligence</source> <coverage>Taipei, Taiwan</coverage> <identifier>lirmm-01168371</identifier> <identifier>https://hal-lirmm.ccsd.cnrs.fr/lirmm-01168371</identifier> <identifier>https://hal-lirmm.ccsd.cnrs.fr/lirmm-01168371/document</identifier> <identifier>https://hal-lirmm.ccsd.cnrs.fr/lirmm-01168371/file/FioNocICTAI98_Image%20Segmentation%20Using.pdf</identifier> <source>https://hal-lirmm.ccsd.cnrs.fr/lirmm-01168371</source> <source>ICTAI: International Conference on Tools with Artificial Intelligence, Nov 1998, Taipei, Taiwan. 10th IEEE International Conference on Tools with Artificial Intelligence, pp.450-458, 1998, 〈10.1109/TAI.1998.744885〉</source> <identifier>DOI : 10.1109/TAI.1998.744885</identifier> <relation>info:eu-repo/semantics/altIdentifier/doi/10.1109/TAI.1998.744885</relation> <language>en</language> <subject lang=en>Region segmentation criterion</subject> <subject lang=en>Image analysis</subject> <subject lang=en>Image processing algorithm</subject> <subject lang=en>Region segmentation</subject> <subject lang=en>Statistical image analysis</subject> <subject>[INFO.INFO-TI] Computer Science [cs]/Image Processing</subject> <type>info:eu-repo/semantics/conferenceObject</type> <type>Conference papers</type> <description lang=en>In this paper, we investigate image segmentation by region merging. Given any similarity measure between regions , satisfying some weak constraints, we give a general predicate for answering if two regions are to be merged or not during the segmentation process. Our predicate is generic and has six properties. The first one is its inde-pendance with respect to the similarity measure, that leads to a user-independant and adaptative predicate. Second, it is non-parametric, and does not rely on any assumption concerning the image. Third, due to its weak constraints, knowledge may be included in the predicate to fit better to the user's behaviour. Fourth, provided the similarity is well-chosen by the user, we are able to upperbound one type of error made during the image segmentation. Fifth, it does not rely on a particular segmentation algorithm and can be used with almost all region-merging algorithms in various application domains. Sixth, it is calculated quickly, and can lead with appropriated algorithms to very efficient segmentation.</description> <date>1998-11-10</date> </dc> </metadata> </record> </GetRecord> </OAI-PMH>