lnu.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Image Segmentation with the Aid of the p-Adic Metrics
Linnaeus University, Faculty of Technology, Department of Mathematics.ORCID iD: 0000-0002-9857-0938
Institute of System Analysis of Russian Academy of Science, Russia.
2017 (English)In: New Trends and Advanced Methods in Interdisciplinary Mathematical Sciences / [ed] Bourama Toni, Springer, 2017, p. 143-154Chapter in book (Refereed)
Abstract [en]

We present the results of numerical simulation for image segmentation based on the chain distance clustering algorithm. The key issue is the use of the p-adic metric, where p > 1 is a prime number, at the scale of levels of brightness (pixel wise). In previous studies the p-adic metric was used mainly in combination with spectral methods. In this paper this metric is explored directly, without preparatory transformations of images. The main distinguishing feature of the p-adic metric is that it reflects the hierarchic structure of information presented in an image. Different classes of images match with in general different prime p (although the choice p = 2 works on average). Therefore the presented image segmentation procedure has to be combined with a kind of learning to select the prime p corresponding to the class of images under consideration.

Place, publisher, year, edition, pages
Springer, 2017. p. 143-154
Series
STEAM-H: Science, Technology, Engineering, Agriculture, Mathematics & Health, ISSN 2520-193X
Keywords [en]
Image segmentation; p-adic metric; Clustering; Clustering algorithm
National Category
Other Mathematics
Research subject
Mathematics, Mathematics
Identifiers
URN: urn:nbn:se:lnu:diva-72076DOI: 10.1007/978-3-319-55612-3ISBN: 978-3-319-55611-6 (print)ISBN: 978-3-319-55612-3 (electronic)OAI: oai:DiVA.org:lnu-72076DiVA, id: diva2:1194667
Available from: 2018-04-03 Created: 2018-04-03 Last updated: 2018-04-05Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full text

Authority records BETA

Khrennikov, Andrei

Search in DiVA

By author/editor
Khrennikov, Andrei
By organisation
Department of Mathematics
Other Mathematics

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 7 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf