Mohamed Tounsi

Dr. Mohamed Tounsi

Common First Year deanship, Umm Al-Qura University, Makkah, Saudi Arabia
orcid

Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
26 April 2025 in Journal of Imaging
Verified
Journal Article
Open access
PDF file
BBBilal Bataineh
Bilal Bataineh
MTMohamed Tounsi
Mohamed Tounsi
NZNuha Zamzami
Nuha Zamzami
JJJehan Janbi
Jehan Janbi
WAWaleed Abdel Karim Abu-ain
Waleed Abdel Karim Abu-ain
SEShaima abd el kader mohamed Elnazer
Shaima abd el kader mohamed Elnazer
In today’s digital age, the conversion of hardcopy documents into digital formats is widespread. This process involves electronically scanning and storing large volumes of documents. These documents come from various sources, including records and reports, camera-captured text and screen snapshots, official documents, newspapers, medical reports, music scores, and more. In the domain of document analysis techniques, an essential step is document image binarization. Its goal is to eliminate unnecessary data from images and preserve only the text. Despite the existence of multiple techniques for binarization, the presence of degradation in document images can hinder their efficacy. The objective of this work is to provide an extensive review and analysis of the document binarization field, emphasizing its importance and addressing the challenges encountered during the image binarization process. Additionally, it provides insights into techniques and methods employed for image binarization. The current paper also introduces benchmark datasets for evaluating binarization accuracy, model training, evaluation metrics, and the effectiveness of recent methods.

1 June 2013
Verified
Conference Paper
Closed access
VFVincent Filou
Vincent Filou
MMMohamed Mosbah
Mohamed Mosbah
MTMohamed Tounsi
Mohamed Tounsi
The design and the proof of distributed algorithms are difficult tasks due to the lack of knowledge of the global state and the non determinism in the execution of the processes. Formal methods can guarantee that these algorithms run as designed. In this paper, we show that the proof of complex distributed algorithms can be simplified by combining already proved sub-algorithms. To do so, we use a high level encoding of distributed algorithms in form of graph relabeling systems and we propose a formal proof methodology. The proposed methodology combines refinement and decomposition techniques and relies on the correct-by-construction paradigm used by the Event-B method.

1 June 2019
Verified
Conference Paper
Closed access
FFFaten Fakhfakh
Faten Fakhfakh
MTMohamed Tounsi
Mohamed Tounsi
MMMohamed Mosbah
Mohamed Mosbah
Vehicular ad-hoc networks (VANETs) technology has become an active research area over the last few years. It has a huge potential to improve traffic efficiency, road safety as well as comfort to both passengers and drivers. In this context, one of the most difficult challenges is to ensure that protocols used in VANETs operate properly as expected and do not cause any inconsistencies. In this paper, we follow the guidelines of systematic literature reviews (SLR) to provide a comparison of the existing approaches formally verifying the correctness of VANETs. We introduce a taxonomy of the proposed solutions and we discuss their goals, limits, verification techniques, etc. We conclude the paper with some research challenges of VANETs that still need to be addressed. So, throughout this present paper, we provide information for researchers and developers to understand the contributions and challenges of the existing studies to pave the way for improving their solution.

1 June 2013
Verified
Conference Paper
Closed access
MTMohamed Tounsi
Mohamed Tounsi
MMMohamed Mosbah
Mohamed Mosbah
DMDominique Mery
Dominique Mery
Formal proofs of distributed algorithms are long, hard and tedious. We propose a general approach, based on the formal method Event-B, to automatically generate correct programs of distributed algorithms. Our approach is implemented with a translation tool, called B2Visidia, that generates Java code from an Event-B specification related to distributed algorithms. The resulting code can be run on classical distributed computing systems. To execute the induced programs, we use a tool called Visidia that can be used for experimenting, testing and visualizing programs of distributed algorithms.

1 January 2016 in International Journal of Autonomous and Adaptive Communications Systems
Verified
Journal Article
Closed access
MTMohamed Tounsi
Mohamed Tounsi
MMMohamed Mosbah
Mohamed Mosbah
DMDominique Méry
Dominique Méry
Formal proofs of distributed algorithms are long, hard and tedious. We propose a general approach, based on the Event-B formal method, to automatically generate correct programs of distributed algorithms. Our approach is implemented with a translation tool, called B2Visidia, that generates Java code from an Event-B specification related to distributed algorithms. The resulting code can be executed on classical distributed computing systems. To execute the resulting programs, we use a tool called Visidia that can be used for experimenting, testing and visualising programs of distributed algorithms.

1 January 2011 in Lecture Notes in Computer Science
Verified
Book Chapter
Closed access
PDF file
DMDominique Méry
Dominique Méry
MMMohamed Mosbah
Mohamed Mosbah
MTMohamed Tounsi
Mohamed Tounsi