All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Selection of Keypoints in 2D Images Using F-Transform

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61988987%3A17610%2F22%3AA2302G4A" target="_blank" >RIV/61988987:17610/22:A2302G4A - isvavai.cz</a>

  • Result on the web

    <a href="https://link.springer.com/chapter/10.1007/978-3-031-08974-9_33" target="_blank" >https://link.springer.com/chapter/10.1007/978-3-031-08974-9_33</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/978-3-031-08974-9_33" target="_blank" >10.1007/978-3-031-08974-9_33</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Selection of Keypoints in 2D Images Using F-Transform

  • Original language description

    We focus on a new fast and robust algorithm for selecting keypoints in 2D images using the following techniques: image regularization, selection of spaces with closeness, and design of the corresponding graph Laplacians. Then, the representative keypoints are local extrema in the image after the Laplacian operator is applied. The convolution kernels, used for regularization, are extracted from the uniform partition of the image domain, and the graph Laplacian is constructed using the theory of F0-transforms. Empirically, we show that sequences of F-transform kernels that correspond to different regularization levels share the property that they do not introduce new local extrema into the image under convolution. This justifies the computation of keypoints as points where local extrema are reached and allows them to be classified according to the values of the local extrema. We show that the extracted key points are representative in the sense that they allow a good approximate reconstruction of the original image from the calculated components of the F-transform taken from different convolutions. In addition, we show that the proposed algorithm is resistant to Gaussian noise.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

  • OECD FORD branch

    10102 - Applied mathematics

Result continuities

  • Project

  • Continuities

    S - Specificky vyzkum na vysokych skolach

Others

  • Publication year

    2022

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Article name in the collection

    Information Processing and Management of Uncertainty in Knowledge-Based Systems

  • ISBN

    978-3-031-08974-9

  • ISSN

  • e-ISSN

  • Number of pages

    13

  • Pages from-to

    418-430

  • Publisher name

    Springer

  • Place of publication

  • Event location

    Milano

  • Event date

    Jul 11, 2022

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article