@article {Elmouhtadi2017714,
	title = {Fingerprint identification using hierarchical matching and topological structures},
	journal = {Advances in Intelligent Systems and Computing},
	volume = {533},
	year = {2017},
	note = {cited By 0},
	pages = {714-722},
	abstract = {Fingerprint identification is one of the most popular and efficient biometric technique used for improving automatic personal identification. In this paper, we will present a new indexing based method, in the first step, on estimation of singular point considered as an important feature in the fingerprint using a directional file. In the second step, a hierarchical Delaunay triangulation was applied on the minutiae around the singular point extracted. Comparison of two fingerprints was calculated by introducing the barycenter notion so as to ensure the exact location of the similar triangles. We have performed extensive experiments and comparisons to demonstrate the effectiveness of the proposed approach using a challenging public database (i.e., FVC2000) which contains small area and low quality fingerprints. {\textcopyright} Springer International Publishing AG 2017.},
	doi = {10.1007/978-3-319-48308-5_68},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84994504482\&doi=10.1007\%2f978-3-319-48308-5_68\&partnerID=40\&md5=8c568e5df1645e23782fc831e2182b69},
	author = {Elmouhtadi, M.a and El Fkihi, S.a b and Aboutajdine, D.a}
}
@conference {Elmouhtadi2017434,
	title = {Fingerprints indexing algorithms based on multiple characteristics},
	booktitle = {Colloquium in Information Science and Technology, CIST},
	year = {2017},
	note = {cited By 0},
	pages = {434-437},
	abstract = {Fingerprint identification in large databases is a leading concern preoccupation problem since biometrics still the most reliable and secure means of identification systems. Hence the need to find an accurate and relevant system of research and identification. In this paper we present the different approaches of fingerprints indexing algorithms that have proven satisfactory results in the field, evaluated on large databases provided by FVC. {\textcopyright} 2016 IEEE.},
	doi = {10.1109/CIST.2016.7805086},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85010223948\&doi=10.1109\%2fCIST.2016.7805086\&partnerID=40\&md5=d8555e034c9089955faeed9880ac4dda},
	author = {Elmouhtadi, M.a and El Fkihi, S.b and Aboutajdine, D.a}
}
@article {Elmaroud2017,
	title = {Sensitivity analysis of FBMC-based multi-cellular networks to synchronization errors and HPA nonlinearities},
	journal = {Eurasip Journal on Advances in Signal Processing},
	volume = {2017},
	number = {1},
	year = {2017},
	note = {cited By 0},
	abstract = {In this paper, we study the performance of asynchronous and nonlinear FBMC-based multi-cellular networks. The considered system includes a reference mobile perfectly synchronized with its reference base station (BS) and K interfering BSs. Both synchronization errors and high-power amplifier (HPA) distortions will be considered and a theoretical analysis of the interference signal will be conducted. On the basis of this analysis, we will derive an accurate expression of signal-to-noise-plus-interference ratio (SINR) and bit error rate (BER) in the presence of a frequency-selective channel. In order to reduce the computational complexity of the BER expression, we applied an interesting lemma based on the moment generating function of the interference power. Finally, the proposed model is evaluated through computer simulations which show a high sensitivity of the asynchronous FBMC-based multi-cellular network to HPA nonlinear distortions. {\textcopyright} 2017, The Author(s).},
	doi = {10.1186/s13634-016-0441-0},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85008705000\&doi=10.1186\%2fs13634-016-0441-0\&partnerID=40\&md5=28ba324c5eee82072f7555fc9f1f6df0},
	author = {Elmaroud, B.a and Faqihi, A.a b and Aboutajdine, D.a}
}
@article {Assad2016469,
	title = {On the deployment quality for multi-intrusion detection in wireless sensor networks},
	journal = {Lecture Notes in Electrical Engineering},
	volume = {381},
	year = {2016},
	note = {cited By 0},
	pages = {469-478},
	abstract = {The intrusion detection in a Wireless Sensor Network is defined as a mechanism to monitor and detect any intruder in a sensing area. The sensor deployment quality is a critical issue since it reflects the cost and detection capability of a wireless sensor network. When the random deployment is required, which sensor nodes are uniformly randomly distributed over on surface area, determining the deployment quality becomes challenging. In the intrusion detection application, it is necessary to define more precise measures of sensing range and node density that impact overall system performance. To enhance the detection quality for single/multi intrusion, a probabilistic intrusion detection models are adopted, called single and multi sensing probability detection and the deployment quality issue is surveyed and analysed in term of coverage. {\textcopyright} Springer International Publishing Switzerland 2016.},
	doi = {10.1007/978-3-319-30298-0_48},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84964066188\&doi=10.1007\%2f978-3-319-30298-0_48\&partnerID=40\&md5=5dca2bc944d09de42dd56334a955161e},
	author = {Assad, N.a and Elbhiri, B.b and Faqihi, M.A.c and Ouadou, M.a and Aboutajdine, D.a}
}
@article {Assad2016991,
	title = {Efficient deployment quality analysis for intrusion detection in wireless sensor networks},
	journal = {Wireless Networks},
	volume = {22},
	number = {3},
	year = {2016},
	note = {cited By 0},
	pages = {991-1006},
	abstract = {The intrusion detection in a Wireless Sensor Network is defined as a mechanism to monitor and detect any intruder in a sensing area. The sensor deployment quality is a critical issue since it reflects the cost and detection capability of a wireless sensor network. The quality of deterministic deployment can be determined sufficiently by a rigorous analysis before the deployment. However, when random deployment is required, determining the deployment quality becomes challenging. In the intrusion detection application, it is necessary to define more precise measures of sensing range, transmission range, and node density that impact overall system performance. The major question is centred around the quality of intrusion detection in WSN, how we can guarantee that each point of the sensing area is covered by at least one sensor node, and what a sufficient condition to guarantee the network connectivity? In this paper, we propose an appropriate probabilistic model which provides the coverage and connectivity in k-sensing detection of a wireless sensor network. We have proved the capability of our approach using a geometric analysis and a probabilistic model. {\textcopyright} 2015, Springer Science+Business Media New York.},
	doi = {10.1007/s11276-015-1015-z},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84962534941\&doi=10.1007\%2fs11276-015-1015-z\&partnerID=40\&md5=6a1fff96c40ee0d1aa4f74e4d9c1a592},
	author = {Assad, N.a and Elbhiri, B.b and Faqihi, M.A.c and Ouadou, M.a and Aboutajdine, D.a}
}
@article {Jorio2016255,
	title = {Multi-hop clustering algorithm based on spectral classification for wireless sensor network},
	journal = {Lecture Notes in Electrical Engineering},
	volume = {381},
	year = {2016},
	note = {cited By 0},
	pages = {255-264},
	abstract = {A Wireless Sensor Network (WSN) is composed of a large number of autonomous and compact devices called sensor nodes. This network can be an effective tool for gathering data in a variety of environments. However, these sensor nodes have some constraints due to their limited energy, storage capacity and computing power. Clustering is a kind of a technique which is used to reduce energy consumption and to extend network lifetime. Hence, multi-hop communication is often required when the communication range of the sensor nodes is limited or the number of sensor nodes is very large in a network. In this paper, we propose a multi-hop spectral clustering algorithm to organize the sensor nodes in a WSN into clusters. Simulation results show that the proposed algorithm performs better in reducing the energy consumption of sensors and effectively improves the WSN lifetime. {\textcopyright} Springer International Publishing Switzerland 2016.},
	doi = {10.1007/978-3-319-30298-0_27},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84964091516\&doi=10.1007\%2f978-3-319-30298-0_27\&partnerID=40\&md5=9978fe8f8eb166334a20f4b43e48bf35},
	author = {Jorio, A.a and Fkihi, S.E.b and Elbhiri, B.c and Aboutajdine, D.a}
}
@article {Iazzi2016156,
	title = {A new method for fall detection of elderly based on human shape and motion variation},
	journal = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)},
	volume = {10073 LNCS},
	year = {2016},
	note = {cited By 0},
	pages = {156-167},
	abstract = {Fall detection for elderly and patient has been an active research topic due to the great demand for products and technology of fall detection in the healthcare industry. Computer vision provides a promising solution to analyze personal behavior and detect certain unusual events such as falls. In this paper, we present a new method for fall detection based on the variation of shape and motion. First, we use the CodeBook method to extract the person silhouette from the video. Then, information of rectangle, ellipse and histogram projection are used to provide features to analyze the person shape. In addition, we represent the person shape by three blocks extracted from rectangle. Then, we use optical flow to analyze the person motion within each blocks. Finally, falls are detected from normal activities using thresholding-based method. All experiments show that our fall detection system achieves very good performances in accuracy and error rate. {\textcopyright} Springer International Publishing AG 2016.},
	doi = {10.1007/978-3-319-50832-0_16},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85007364688\&doi=10.1007\%2f978-3-319-50832-0_16\&partnerID=40\&md5=4ed27ef63754e531149224bda59c8227},
	author = {Iazzi, A.a and Rziza, M.a and Thami, R.O.H.a b and Aboutajdine, D.a}
}
@article {Elmaroud201653,
	title = {Theoretical analysis of BER performance for asynchronous FBMC based multi-cellular networks with non linear distortions},
	journal = {Lecture Notes in Electrical Engineering},
	volume = {366},
	year = {2016},
	note = {cited By 0},
	pages = {53-61},
	abstract = {In this paper, we present a theoretical analysis of bit error rate (BER) for asynchronous filter bank multicarrier (FBMC) based multi-cellular networks in the presence of high power amplifiers (HPA) nonlinear distortion (NLD). A promising class of FBMCmodulation called CosineModulated Multitone (CMT) is considered and the analytical BER is derived based on the signal to interference plus noise ratio (SINR) of a cellular network consisting of one reference mobile user (MU), one reference base station (BS) and K interfering BSs. The proposed model is evaluated and it is found in very good agreement with simulation results. {\textcopyright} Springer Science+Business Media Singapore 2016.},
	doi = {10.1007/978-981-287-990-5_5},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84959166330\&doi=10.1007\%2f978-981-287-990-5_5\&partnerID=40\&md5=0544540b48d8d8ec9e084a310f5f3bea},
	author = {Elmaroud, B.a and Faqihi, A.a b and Abbad, M.a and Aboutajdine, D.a}
}
@article {Elmaroud2016345,
	title = {Theoretical analysis of SINR performance for unsynchronized and nonlinearly distorted FBMC signals},
	journal = {Lecture Notes in Electrical Engineering},
	volume = {380},
	year = {2016},
	note = {cited By 0},
	pages = {345-353},
	abstract = {In this paper, we present a theoretical analysis of the joint effect of carrier frequency offset (CFO) and high power amplifier (HPA) nonlinear distortion (NLD) on the signal to interference plus noise ratio (SINR) of filter bank multicarrier (FBMC) systems. A promising class of FBMC modulation, called Cosine Modulated Multitone (CMT), is considered and the analytical SINR is derived in the presence of both HPA NLD and CFO. The simulation results have shown a good agreement with the theoretical analysis. {\textcopyright} Springer International Publishing Switzerland 2016.},
	doi = {10.1007/978-3-319-30301-7_36},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84964514091\&doi=10.1007\%2f978-3-319-30301-7_36\&partnerID=40\&md5=01dafa56c7f8076383e3c81b63f4afbc},
	author = {Elmaroud, B.a and Faqihi, A.a b and Abbad, M.a and Aboutajdine, D.a}
}
@article {Assad2015,
	title = {Analysis of the deployment quality for intrusion detection in wireless sensor networks},
	journal = {Journal of Computer Networks and Communications},
	volume = {2015},
	year = {2015},
	note = {cited By 0},
	abstract = {The intrusion detection application in a homogeneous wireless sensor network is defined as a mechanism to detect unauthorized intrusions or anomalous moving attackers in a field of interest. The quality of deterministic sensor nodes deployment can be determined sufficiently by a rigorous analysis before the deployment. However, when random deployment is required, determining the deployment quality becomes challenging. An area may require that multiple nodes monitor each point from the sensing area; this constraint is known as k-coverage where k is the number of nodes. The deployment quality of sensor nodes depends directly on node density and sensing range; mainly a random sensor nodes deployment is required. The major question is centred around the problem of network coverage, how can we guarantee that each point of the sensing area is covered by the required number of sensor nodes and what a sufficient condition to guarantee the network coverage? To deal with this, probabilistic intrusion detection models are adopted, called single/multi-sensing detection, and the deployment quality issue is surveyed and analysed in terms of coverage. We evaluate the capability of our probabilistic model in homogeneous wireless sensor network, in terms of sensing range, node density, and intrusion distance. {\textcopyright} 2015 Noureddine Assad et al.},
	doi = {10.1155/2015/812613},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84923884883\&doi=10.1155\%2f2015\%2f812613\&partnerID=40\&md5=ad555667d0db7cbc297aef916a17e0f5},
	author = {Assad, N.a and Elbhiri, B.b and Faqihi, M.A.c and Ouadou, M.a and Aboutajdine, D.a}
}
@article {Jorio2015,
	title = {An energy-efficient clustering routing algorithm based on geographic position and residual energy for wireless sensor network},
	journal = {Journal of Computer Networks and Communications},
	volume = {2015},
	year = {2015},
	note = {cited By 4},
	abstract = {Recently wireless sensor network (WSN) has become one of the most interesting networking technologies, since it can be deployed without communication infrastructures. A sensor network is composed of a large number of sensor nodes; these nodes are responsible for supervision of the physical phenomenon and transmission of the periodical results to the base station. Therefore, improving the energy efficiency and maximizing the networking lifetime are the major challenges in this kind of networks. To deal with this, a hierarchical clustering scheme, called Location-Energy Spectral Cluster Algorithm (LESCA), is proposed in this paper. LESCA determines automatically the number of clusters in a network. It is based on spectral classification and considers both the residual energy and some properties of nodes. In fact, our approach uses the K-ways algorithm and proposes new features of the network nodes such as average energy, distance to BS, and distance to clusters centers in order to determine the clusters and to elect the cluster{\textquoteright}s heads of a WSN. The simulation results show that if the clusters are not constructed in an optimal way and/or the number of the clusters is greater or less than the optimal number of clusters, the total consumed energy of the sensor network per round is increased exponentially. {\textcopyright} 2015 Ali Jorio et al.},
	doi = {10.1155/2015/170138},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84924190502\&doi=10.1155\%2f2015\%2f170138\&partnerID=40\&md5=52a0eb2501890a83a608347ccdb9e158},
	author = {Jorio, A.a and El Fkihi, S.b and Elbhiri, B.c and Aboutajdine, D.a}
}
@conference {Elmouhtadi2015,
	title = {Fingerprint indexing based barycenter triangulation},
	booktitle = {Proceedings of 2015 IEEE World Conference on Complex Systems, WCCS 2015},
	year = {2015},
	note = {cited By 0},
	abstract = {Fingerprint indexing is an efficient technique for improving automatic fingerprint identification systems. In this paper we will present a new index method based on a hierarchical Delaunay triangulation of the minutiae points. The comparison of two fingerprints was calculated by introducing the barycenter notion so as to ensure the exact location of the similar triangles. We have performed extensive experiments and comparisons to demonstrate the effectiveness of the proposed approach using a challenging public database (i.e., FVC2000 Db1) which contains small area, low quality fingerprints. {\textcopyright} 2015 IEEE.},
	doi = {10.1109/ICoCS.2015.7483263},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84978427437\&doi=10.1109\%2fICoCS.2015.7483263\&partnerID=40\&md5=58fb933699f1e58a80089aca6885a7c3},
	author = {Elmouhtadi, M.a and Aboutajdine, D.a and El Fkihi, S.b}
}
@article {Benamar2015100,
	title = {Visual contact with catadioptric cameras},
	journal = {Robotics and Autonomous Systems},
	volume = {64},
	year = {2015},
	note = {cited By 0},
	pages = {100-119},
	abstract = {Time to contact or time to collision (TTC) is utmost important information for animals as well as for mobile robots because it enables them to avoid obstacles; it is a convenient way to analyze the surrounding environment. The problem of TTC estimation is largely discussed in perspective images. Although a lot of works have shown the interest of omnidirectional camera for robotic applications such as localization, motion, monitoring, few works use omnidirectional images to compute the TTC. In this paper, we show that TTC can be also estimated on catadioptric images. We present two approaches for TTC estimation using directly or indirectly the optical flow based on de-rotation strategy. The first, called "gradient based TTC", is simple, fast and it does not need an explicit estimation of the optical flow. Nevertheless, this method cannot provide a TTC on each pixel, valid only for para-catadioptric sensors and requires an initial segmentation of the obstacle. The second method, called "TTC map estimation based on optical flow", estimates TTC on each point on the image and provides the depth map of the environment for any obstacle in any direction and is valid for all central catadioptric sensors. Some results and comparisons in synthetic and real images will be given. {\textcopyright} 2014 Elsevier B.V. All rights reserved.},
	doi = {10.1016/j.robot.2014.09.036},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84926140754\&doi=10.1016\%2fj.robot.2014.09.036\&partnerID=40\&md5=30948376e9b031a913a35e2c865a9513},
	author = {Benamar, F.a b and Elfkihi, S.a c and Demonceaux, C.d and Mouaddib, E.b and Aboutajdine, D.a}
}
@conference {Jorio2014861,
	title = {A hierarchical clustering algorithm based on spectral classification for Wireless Sensor Networks},
	booktitle = {International Conference on Multimedia Computing and Systems -Proceedings},
	year = {2014},
	note = {cited By 1},
	pages = {861-866},
	abstract = {A Wireless Sensor Network (WSN) is composed of a large number of autonomous and compact devices called sensor nodes. This network can be an effective tool for gathering data in a variety of enviornments. However, These sensor nodes have some constraints due to their limited energy, storage capacity and computing power. Therefor, saving energy and, thus extending the WSN lifetime entails great challenges. In order to prolong the lifetime of WSN, this study presents a hierarchical clustering algorithm based on spectral classification (HCA-SC). First, to overcome the ideal distribution of clusters, HCA-SC partition the network by spectral classification algorithm. Second, for each cluster, HCA-SC selects a node as a cluster head with regard residual energy and distance from base station. Simulation results showed that our algorithm performs better in reducing the energy consumption of sensor nodes and effectively improves the lifetime of wireless sensor networks. {\textcopyright} 2014 IEEE.},
	doi = {10.1109/ICMCS.2014.6911354},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84928732445\&doi=10.1109\%2fICMCS.2014.6911354\&partnerID=40\&md5=2070584e9f01d9b450a2a4a005ba6a08},
	author = {Jorio, A.a and El Fkihi, S.b and Elbhiri, B.c and Aboutajdine, D.a}
}
@article {Elmaroud20141951,
	title = {On the impact of prototype filter length on the PAPR reduction of FBMC signals},
	journal = {International Journal of Engineering and Technology},
	volume = {6},
	number = {4},
	year = {2014},
	note = {cited By 0},
	pages = {1951-1960},
	abstract = {One of the challenging issues for Filter Bank Multicarrier (FBMC) systems is their high Peak-to-Average Power Ratio (PAPR) which leads to the saturation of the high power amplifiers and consequently increases the out of band power. In this paper, we evaluate different FBMC PAPR reduction techniques and especially analyze the impact of the prototype filter length/overlapping factor on their performances.},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84908869430\&partnerID=40\&md5=653efcab8375d7b42c7c294a7bf8e2b5},
	author = {Elmaroud, B.a and Faqihi, A.a b and Abbad, M.a and Aboutajdine, D.a}
}
@conference {Elmaroud2014,
	title = {PAPR reduction of FBMC signals by combining exponential companding and hadamard transforms},
	booktitle = {2014 International Symposium on Networks, Computers and Communications, ISNCC 2014},
	year = {2014},
	note = {cited By 0},
	abstract = {Filter Bank Multicarrier (FBMC) is an efficient multicarrier modulation characterized by its good spectral efficiency and low out of band leakage. Nevertheless, FBMC signals suffer from the high Peak-to-Average Power Ratio (PAPR). This leads nonlinear devices such as Power Amplifiers, when used, to operate in their saturation region which may severely impair system performance. In this paper, we propose a PAPR reduction technique based on the combination of Hadamard transform with the exponential companding transform. Simulation results show that the proposed scheme can offer better PAPR reduction than exponential companding and Hadamard transforms when used separately. {\textcopyright} 2014 IEEE.},
	doi = {10.1109/SNCC.2014.6866517},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84907345923\&doi=10.1109\%2fSNCC.2014.6866517\&partnerID=40\&md5=982b03a2bd8c550f85b39b1d9c441790},
	author = {Elmaroud, B.a and Faqihi, A.b and Abbad, M.a and Aboutajdine, D.a}
}
@article {Assad2014324,
	title = {Short: Intrusion detection quality analysis for homogeneous wireless sensor networks},
	journal = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)},
	volume = {8593 LNCS},
	year = {2014},
	note = {cited By 0},
	pages = {324-329},
	abstract = {In this paper we analyze the intrusion detection in a homogeneous Wireless Sensor Network that is defined as a mechanism to monitor and detect unauthorized intrusions or anomalous moving attackers in area of interest. The quality of deterministic deployment can be determined sufficiently by analysis, before the deployment. However, when random deployment is required, determining the deployment quality becomes challenging and depends directly on node density. The major question is centered on the network coverage problem, how can we guarantee that each point of the region is covered by the required number of sensors? To deal with this, probabilistic intrusion detection models are adopted, called single and multi sensing probability detection and the deployment quality issue is surveyed and analyzed in terms of coverage. We evaluate our probabilistic model in homogeneous wireless sensor network, in term of sensing range, node density, and intrusion distance. {\textcopyright} 2014 Springer International Publishing.},
	doi = {10.1007/978-3-319-09581-3_24},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84905899551\&doi=10.1007\%2f978-3-319-09581-3_24\&partnerID=40\&md5=e868b83abeca52460109a066d8ddde51},
	author = {Assad, N.a and Elbhiri, B.b and El Fkihi, S.c and Faqihi, M.A.c and Ouadou, M.a and Aboutajdine, D.a}
}
@article {Benamar2014197,
	title = {Time to collision (TTC) estimation maps based on optical flow in paracatadioptric vision [Estimation des cartes du temps de collision (TTC) bas{\'e}e sur le flot optique en vision para-catadioptrique]},
	journal = {Traitement du Signal},
	volume = {31},
	number = {1-2},
	year = {2014},
	note = {cited By 0},
	pages = {197-219},
	abstract = {The present paper deals with time to collision (TTC) for a mobile robot equipped with a catadioptric camera. This type of cameras is very useful in robotics because it provides a panoramic view field. The time to collision has been extensively studied in the case of perspective cameras. Nevertheless, the methods used are not directly applicable due to strong distortions in the images produced by the omnidirectional camera and they, therefore, need to be adapted. In this work, we propose to compute the TTC thanks to the estimation of the optical flow on omnidirectional images between the robot and the obstacle. We see that the double projection of a 3D point on the mirror and then on the camera plane leads to a new formulation of the TTC for catadioptric cameras. This formulation enables us to know, at each moment and at each pixel of the image, the TTC from the optical flow at this point. Our approach is validated on synthetic data and real experiments. Finally, we show that this calculation can detect obstacles in the motion direction of the robot. {\textcopyright} 2014 Lovoisier.},
	doi = {10.3166/ts.31.197-219},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84930250224\&doi=10.3166\%2fts.31.197-219\&partnerID=40\&md5=1ed78d09cceb5f059e5db87be3aa812f},
	author = {Benamar, F.Z.a d and Fkihi, S.E.b and Demonceaux, C.c and Mouaddib, E.M.d and Aboutajdine, D.a}
}
@conference {Benamar20135,
	title = {Gradient-based time to contact on paracatadioptric camera},
	booktitle = {2013 IEEE International Conference on Image Processing, ICIP 2013 - Proceedings},
	year = {2013},
	note = {cited By 2},
	pages = {5-9},
	abstract = {The problem of time to contact or time to collision (TTC) estimation is largely discussed in perspective images. However, a few works have dealt with images of catadioptric sensors despite of their utility in robotics applications. The objective of this paper is to develop a novel model for estimating TTC with catadioptric images relative to a planar surface, and to demonstrate that TTC can be estimated only with derivative brightness and image coordinates. This model, called {\textquoteright}gradient based time to contact{\textquoteright}, does not need high processing such as explicit estimation of optical flow and feature detection and/or tracking. The proposed method allows to estimate TTC and gives additional information about the orientation of planar surface. It was tested on simulated and real datasets. {\textcopyright} 2013 IEEE.},
	doi = {10.1109/ICIP.2013.6738002},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84897697160\&doi=10.1109\%2fICIP.2013.6738002\&partnerID=40\&md5=2d096a6f98a59c3c442f3c24ffca4bbc},
	author = {Benamar, F.a d and El Fkihi, S.a b and Demonceaux, C.c and Mouaddib, E.d and Aboutajdine, D.a}
}
@conference {Bouirouga2013422,
	title = {Neural network adult videos recognition using jointly face shape and skin feature extraction},
	booktitle = {VISAPP 2013 - Proceedings of the International Conference on Computer Vision Theory and Applications},
	volume = {1},
	year = {2013},
	note = {cited By 0},
	pages = {422-425},
	abstract = {This paper presents a novel approach for video adult detection using face shape, skin threshold technique and neural network. The goal of employing skin-color information is to select the appropriate color model that allows verifying pixels under different lighting conditions and other variations. Then, the output videos are classified by neural network. The simulation shows that this system achieved 95.4\% of the true rate.},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84878245129\&partnerID=40\&md5=efe58b6bdb1387e7884a28b2a0f6f0bb},
	author = {Bouirouga, H.a and Elfkihi, S.b and Jilbab, A.c and Aboutajdine, D.a}
}
@article {Jorio2013717,
	title = {A new clustering algorithm for wireless sensor networks},
	journal = {Journal of Theoretical and Applied Information Technology},
	volume = {49},
	number = {3},
	year = {2013},
	note = {cited By 1},
	pages = {717-724},
	abstract = {Wireless sensor networks have recently become an attractive research area. However, saving energy and, thus, extending the wireless sensor network lifetime entails great challenges. For this reason, clustering techniques are largely made use of. In this paper we propose a new algorithm based on the principle of spectral clustering methods. Especially, we use the K-ways spectral clustering algorithm. The main characteristic of our proposal is that it defines the optimal number of clusters and dynamically changes the election probabilities of the cluster heads based on their residual energy. Up on analyzing the impact of node density on the robustness of the proposed algorithm as well as on its energy and lifetime gains, simulation results show that the approach actually improves the lifetime of a whole network and presents more energy efficiency distribution compared to Low-Energy Adaptive Clustering Hierarch, Centralized Low-Energy Adaptive Clustering Hierarch, and Distance-Energy Cluster Structure approaches. {\textcopyright} 2005 - 2013 JATIT \& LLS. All rights reserved.},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84875692769\&partnerID=40\&md5=ea5125d9aa1b9b5f0b4c870cfad69e2e},
	author = {Jorio, A.a and Fkihi, S.E.b and Elbhiri, B.c and Aboutajdine, D.a}
}
