Mahdi Amani

• Survarachakan, Shanmugapriya; Johansen, Jenny Stange; Pedersen, Mathias Aarseth; Amani, Mahdi & Lindseth, Frank (2020). Capsule nets for complex medical image segmentation tasks. CEUR Workshop Proceedings. 2688. Fulltekst i vitenarkiv
• Amani, Mahdi; Falk, Håvard Hagen; Jensen, Oliver Damsgaard; Vartdal, Gunnar; Aune, Anders & Lindseth, Frank (2019). Color Calibration on Human Skin Images. Lecture Notes in Computer Science (LNCS). ISSN 0302-9743. 11754 LNCS, s. 211–223. doi: 10.1007/978-3-030-34995-0_20. Fulltekst i vitenarkiv Vis sammendrag

  Many recent medical developments rely on image analysis, however, it is not convenient nor cost-efficient to use professional image acquisition tools in every clinic or laboratory. Hence, a reliable color calibration is necessary; color calibration refers to adjusting the pixel colors to a standard color space. During a real-life project on neonatal jaundice disease detection, we faced a problem to perform skin color calibration on already taken images of neonatal babies. These images were captured with a smartphone (Samsung Galaxy S7, equipped with a 12 Mega Pixel camera to capture 4032 × 3024 resolution images) in the presence of a specific calibration pattern. This post-processing image analysis deprived us from calibrating the camera itself. There is currently no comprehensive study on color calibration methods applied to human skin images, particularly when using amateur cameras (e.g. smartphones). We made a comprehensive study and we proposed a novel approach for color calibration, Gaussian process regression (GPR), a machine learning model that adapts to environmental variables. The results show that the GPR achieves equal results to state-of-the-art color calibration techniques, while also creating more general models.

• Amani, Mahdi & Nowzari-Dalini, A (2019). Efficient Generation, Ranking, and Unranking of (k, m)-Ary Trees in B-Order. Bulletin of the Iranian Mathematical Society (BIMS). ISSN 1018-6301. 45(4), s. 1145–1158. doi: 10.1007/s41980-018-0190-y. Fulltekst i vitenarkiv Vis sammendrag

  In this paper, we present a new generation algorithm with corresponding ranking and unranking algorithms for (k, m)-ary trees in B-order. (k, m)-ary tree is introduced by Du and Liu. A (k, m)-ary tree is a generalization of k-ary tree, whose every node of even level of the tree has degree k and odd level of the tree has degree 0 or m. Up to our knowledge no generation, ranking or unranking algorithms are given in the literature for this family of trees. We use Zaks’ encoding for representing (k, m)-ary trees and to generate them in B-order. We also prove that, to generate (k, m)-ary trees in B-order using this encoding, the corresponding codewords should be generated in reverse-lexicographical ordering. The presented generation algorithm has a constant average time and O(n) time complexity in the worst case. Due to the given encoding, both ranking and unranking algorithms are also presented taking O(n) and

• Amani, Mahdi (2018). Gap terminology and related combinatorial properties for AVL trees and Fibonacci-isomorphic trees. AKCE International Journal of Graphs and Combinatorics. ISSN 0972-8600. 15, s. 14–21. doi: 10.1016/j.akcej.2018.01.019. Fulltekst i vitenarkiv Vis sammendrag

  We introduce gaps that are edges or external pointers in AVL trees such that the height difference between the subtrees rooted at their two endpoints is equal to 2. Using gaps we prove the Basic-Theorem that illustrates how the size of an AVL tree (and its subtrees) can be represented by a series of powers of 2 of the heights of the gaps, this theorem is the first such simple formula to characterize the number of nodes in an AVL tree. Then, we study the extreme case of AVL trees, the perfectly unbalanced AVL trees, by introducing Fibonacci-isomorphic trees that are isomorphic to Fibonacci trees of the same height and showing that they have the maximum number of gaps in AVL trees. Note that two ordered trees (such as AVL trees) are isomorphic iff there exists a one-to-one correspondence between their nodes that preserves not only adjacency relations in the trees, but also the roots. In the rest of the paper, we study combinatorial properties of Fibonacci-isomorphic trees.

Se alle arbeider i NVA

• Amani, Mahdi (2023). Regional development, including talent attraction. Fulltekst i vitenarkiv
• Amani, Mahdi (2023). Nordic Regional Battery Visit. Fulltekst i vitenarkiv

Se alle arbeider i NVA