Karim Kalti
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Karim Kalti has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
- Asma Touil
Université de Sousse, Ecole Nationale d’Ingénieurs de Sousse, LATIS-Laboratory of Advanced Technology and Intelligent Systems, Sousse, Tunisia
4 shared publications - Mohamed Ali Mahjoub
Sousse University
4 shared publications - Hamza Gbada
University of Sousse
3 shared publications - Basel Solaiman
IMT Atlantique Plouzané France
2 shared publications - Pierre-Henri Conze
LaTIM UMR 1101, Inserm, Brest, France
2 shared publications Bassel Soulaiman
1 shared publication
Latest Publications
- 11 September 2024
- Published by Springer Nature
- p. 248-263
Information Extraction from Visually Rich Documents Using Directed Weighted Graph Neural Network
- 11 September 2024
- Published by Springer Nature
- p. 248-263
Information Extraction from Visually Rich Documents Using Directed Weighted Graph Neural Network
- 5 January 2024
- Published by Elsevier in Neurocomputing
- Vol. 573, 127223
Multimodal weighted graph representation for information extraction from visually rich documents
- 5 January 2024
- Published by Elsevier in Neurocomputing
- Vol. 573, 127223
Multimodal weighted graph representation for information extraction from visually rich documents
- 9 August 2023
- Published by Springer Nature in Journal of Classification
- Vol. 40 (3) , 488-512
A Robust Contextual Fuzzy C-Means Clustering Algorithm for Noisy Image Segmentation
- 9 August 2023
- Published by Springer Nature in Journal of Classification
- Vol. 40 (3) , 488-512
A Robust Contextual Fuzzy C-Means Clustering Algorithm for Noisy Image Segmentation
- 1 August 2022
- Published by Springer Nature in Journal of Digital Imaging
- Vol. 35 (6) , 1560-1575
A New Collaborative Classification Process for Microcalcification Detection Based on Graphs and Knowledge Propagation
In this paper, we propose a new collaborative process that aims to detect macrocalcifications from mammographic images while minimizing false negative detections. This process is made up of three main phases: suspicious area detection, candidate object identification, and collaborative classification. The main concept is to operate on the entire image divided into homogenous regions called superpixels which are used to identify both suspicious areas and candidate objects. The collaborative classification phase consists in making the initial results of different microcalcification detectors collaborate in order to produce a new common decision and reduce their initial disagreements. The detectors share the information about their detected objects and associated labels in order to refine their initial decisions based on those of the other collaborators. This refinement consists of iteratively updating the candidate object labels of each detector following local and contextual analyses based on prior knowledge about the links between super pixels and macrocalcifications. This process iteratively reduces the disagreement between different detectors and estimates local reliability terms for each super pixel. The final result is obtained by a conjunctive combination of the new detector decisions reached by the collaborative process. The proposed approach is evaluated on the publicly available INBreast dataset. Experimental results show the benefits gained in terms of improving microcalcification detection performances compared to existing detectors as well as ordinary fusion operators.
- 1 August 2022
- Published by Springer Nature in Journal of Digital Imaging
- Vol. 35 (6) , 1560-1575
A New Collaborative Classification Process for Microcalcification Detection Based on Graphs and Knowledge Propagation
In this paper, we propose a new collaborative process that aims to detect macrocalcifications from mammographic images while minimizing false negative detections. This process is made up of three main phases: suspicious area detection, candidate object identification, and collaborative classification. The main concept is to operate on the entire image divided into homogenous regions called superpixels which are used to identify both suspicious areas and candidate objects. The collaborative classification phase consists in making the initial results of different microcalcification detectors collaborate in order to produce a new common decision and reduce their initial disagreements. The detectors share the information about their detected objects and associated labels in order to refine their initial decisions based on those of the other collaborators. This refinement consists of iteratively updating the candidate object labels of each detector following local and contextual analyses based on prior knowledge about the links between super pixels and macrocalcifications. This process iteratively reduces the disagreement between different detectors and estimates local reliability terms for each super pixel. The final result is obtained by a conjunctive combination of the new detector decisions reached by the collaborative process. The proposed approach is evaluated on the publicly available INBreast dataset. Experimental results show the benefits gained in terms of improving microcalcification detection performances compared to existing detectors as well as ordinary fusion operators.
- 24 July 2021
- Published by Springer Nature in Medical & Biological Engineering & Computing
- Vol. 59 (9) , 1795-1814
A new conditional region growing approach for microcalcification delineation in mammograms
Microcalcifications (MCs) are considered as the first indicator of breast cancer development. Their morphology, in terms of shape and size, is considered as the most important criterion that determines their malignity degrees. Therefore, the accurate delineation of MC is a cornerstone step in their automatic diagnosis process. In this paper, we propose a new conditional region growing (CRG) approach with the ability of finding the accurate MC boundaries starting from selected seed points. The starting seed points are determined based on regional maxima detection and superpixel analysis. The region growing step is controlled by a set of criteria that are adapted to MC detection in terms of contrast and shape variation. These criteria are derived from prior knowledge to characterize MCs and can be divided into two categories. The first one concerns the neighbourhood searching size. The second one deals with the analysis of gradient information and shape evolution within the growing process. In order to prove the effectiveness and the reliability in terms of MC detection and delineation, several experiments have been carried out on MCs of various types, with both qualitative and quantitative analysis. The comparison of the proposed approach with state-of-the art proves the importance of the used criteria in the context of MC delineation, towards a better management of breast cancer. Flowchart of the proposed approach
- 24 July 2021
- Published by Springer Nature in Medical & Biological Engineering & Computing
- Vol. 59 (9) , 1795-1814
A new conditional region growing approach for microcalcification delineation in mammograms
Microcalcifications (MCs) are considered as the first indicator of breast cancer development. Their morphology, in terms of shape and size, is considered as the most important criterion that determines their malignity degrees. Therefore, the accurate delineation of MC is a cornerstone step in their automatic diagnosis process. In this paper, we propose a new conditional region growing (CRG) approach with the ability of finding the accurate MC boundaries starting from selected seed points. The starting seed points are determined based on regional maxima detection and superpixel analysis. The region growing step is controlled by a set of criteria that are adapted to MC detection in terms of contrast and shape variation. These criteria are derived from prior knowledge to characterize MCs and can be divided into two categories. The first one concerns the neighbourhood searching size. The second one deals with the analysis of gradient information and shape evolution within the growing process. In order to prove the effectiveness and the reliability in terms of MC detection and delineation, several experiments have been carried out on MCs of various types, with both qualitative and quantitative analysis. The comparison of the proposed approach with state-of-the art proves the importance of the used criteria in the context of MC delineation, towards a better management of breast cancer. Flowchart of the proposed approach
- 30 June 2021
- Published by Springer Nature in Soft Computing
- Vol. 25 (15) , 10181-10204
Image segmentation using MRF model optimized by a hybrid ACO-ICM algorithm
- 30 June 2021
- Published by Springer Nature in Soft Computing
- Vol. 25 (15) , 10181-10204
Image segmentation using MRF model optimized by a hybrid ACO-ICM algorithm
- Open Access
- 1 August 2018
- Published by MDPI AG in Journal of Imaging
- Vol. 4 (8) , 97
A Comparative Study of Two State-of-the-Art Feature Selection Algorithms for Texture-Based Pixel-Labeling Task of Ancient Documents
Recently, texture features have been widely used for historical document image analysis. However, few studies have focused exclusively on feature selection algorithms for historical document image analysis. Indeed, an important need has emerged to use a feature selection algorithm in data mining and machine learning tasks, since it helps to reduce the data dimensionality and to increase the algorithm performance such as a pixel classification algorithm. Therefore, in this paper we propose a comparative study of two conventional feature selection algorithms, genetic algorithm and ReliefF algorithm, using a classical pixel-labeling scheme based on analyzing and selecting texture features. The two assessed feature selection algorithms in this study have been applied on a training set of the HBR dataset in order to deduce the most selected texture features of each analyzed texture-based feature set. The evaluated feature sets in this study consist of numerous state-of-the-art texture features (Tamura, local binary patterns, gray-level run-length matrix, auto-correlation function, gray-level co-occurrence matrix, Gabor filters, Three-level Haar wavelet transform, three-level wavelet transform using 3-tap Daubechies filter and three-level wavelet transform using 4-tap Daubechies filter). In our experiments, a public corpus of historical document images provided in the context of the historical book recognition contest (HBR2013 dataset: PRImA, Salford, UK) has been used. Qualitative and numerical experiments are given in this study in order to provide a set of comprehensive guidelines on the strengths and the weaknesses of each assessed feature selection algorithm according to the used texture feature set.
- 1 August 2018
- Published by MDPI AG in Journal of Imaging
- Vol. 4 (8) , 97
Open AccessA Comparative Study of Two State-of-the-Art Feature Selection Algorithms for Texture-Based Pixel-Labeling Task of Ancient Documents
Recently, texture features have been widely used for historical document image analysis. However, few studies have focused exclusively on feature selection algorithms for historical document image analysis. Indeed, an important need has emerged to use a feature selection algorithm in data mining and machine learning tasks, since it helps to reduce the data dimensionality and to increase the algorithm performance such as a pixel classification algorithm. Therefore, in this paper we propose a comparative study of two conventional feature selection algorithms, genetic algorithm and ReliefF algorithm, using a classical pixel-labeling scheme based on analyzing and selecting texture features. The two assessed feature selection algorithms in this study have been applied on a training set of the HBR dataset in order to deduce the most selected texture features of each analyzed texture-based feature set. The evaluated feature sets in this study consist of numerous state-of-the-art texture features (Tamura, local binary patterns, gray-level run-length matrix, auto-correlation function, gray-level co-occurrence matrix, Gabor filters, Three-level Haar wavelet transform, three-level wavelet transform using 3-tap Daubechies filter and three-level wavelet transform using 4-tap Daubechies filter). In our experiments, a public corpus of historical document images provided in the context of the historical book recognition contest (HBR2013 dataset: PRImA, Salford, UK) has been used. Qualitative and numerical experiments are given in this study in order to provide a set of comprehensive guidelines on the strengths and the weaknesses of each assessed feature selection algorithm according to the used texture feature set.
- Open Access
A combined Approach Based on Fuzzy Classification and Contextual Region Growing to Image Segmentation
We present in this paper an image segmentation approach that combines a fuzzy semantic region classification and a context based region-growing. Input image is first over-segmented. Then, prior domain knowledge is used to perform a fuzzy classification of these regions to provide a fuzzy semantic labeling. This allows the proposed approach to operate at high level instead of using low-level features and consequently to remedy to the problem of the semantic gap. Each over-segmented region is represented by a vector giving its corresponding membership degrees to the different thematic labels and the whole image is therefore represented by a Regions Partition Matrix. The segmentation is achieved on this matrix instead of the image pixels through two main phases: focusing and propagation. The focusing aims at selecting seeds regions from which information propagation will be performed. Thepropagation phase allows to spread toward others regions and using fuzzy contextual information the needed knowledge ensuring the semantic segmentation. An application of the proposed approach on mammograms shows promising results
Open AccessA combined Approach Based on Fuzzy Classification and Contextual Region Growing to Image Segmentation
We present in this paper an image segmentation approach that combines a fuzzy semantic region classification and a context based region-growing. Input image is first over-segmented. Then, prior domain knowledge is used to perform a fuzzy classification of these regions to provide a fuzzy semantic labeling. This allows the proposed approach to operate at high level instead of using low-level features and consequently to remedy to the problem of the semantic gap. Each over-segmented region is represented by a vector giving its corresponding membership degrees to the different thematic labels and the whole image is therefore represented by a Regions Partition Matrix. The segmentation is achieved on this matrix instead of the image pixels through two main phases: focusing and propagation. The focusing aims at selecting seeds regions from which information propagation will be performed. Thepropagation phase allows to spread toward others regions and using fuzzy contextual information the needed knowledge ensuring the semantic segmentation. An application of the proposed approach on mammograms shows promising results
- 1 August 2016
- Published by Elsevier in Computer Methods and Programs in Biomedicine
- Vol. 132, 137-147
Iterative fuzzy segmentation for an accurate delimitation of the breast region
- 1 August 2016
- Published by Elsevier in Computer Methods and Programs in Biomedicine
- Vol. 132, 137-147
Iterative fuzzy segmentation for an accurate delimitation of the breast region