@article {Elmouhtadi2018435,
	title = {Fingerprint identification based on hierarchical triangulation},
	journal = {Journal of Information Processing Systems},
	volume = {14},
	number = {2},
	year = {2018},
	pages = {435-447},
	doi = {10.3745/JIPS.02.0084},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85046883308\&doi=10.3745\%2fJIPS.02.0084\&partnerID=40\&md5=98878a4e67240c4ddadb744f90dab887},
	author = {Elmouhtadi, M. and El Fkihi, S. and Aboutajdine, D.}
}
@article {Elmouhtadi2018393,
	title = {Fingerprint identification using hierarchical matching and topological structures},
	journal = {Studies in Computational Intelligence},
	volume = {730},
	year = {2018},
	pages = {393-408},
	doi = {10.1007/978-3-319-63754-9_18},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85032002757\&doi=10.1007\%2f978-3-319-63754-9_18\&partnerID=40\&md5=e4d45320fd26c5982556a97c07bc754d},
	author = {Elmouhtadi, M. and El Fkihi, S. and Aboutajdine, D.}
}
@article {Elmouhtadi2018393,
	title = {Fingerprint identification using hierarchical matching and topological structures},
	journal = {Studies in Computational Intelligence},
	volume = {730},
	year = {2018},
	note = {cited By 0},
	pages = {393-408},
	abstract = {Fingerprint identification is one of the most popular and efficient biometric techniques used for improving automatic personal identification. In this paper, we will present a new indexing method, based on estimation of singular point considered as an important feature in the fingerprint by using the directional file. On the other hand, a hierarchical Delaunay triangulation is applied on the minutiae around the extracted singular point. Two fingerprints calculated by introducing the barycenter notion to ensure the exact location of the similar triangles is compared. 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 2018.},
	doi = {10.1007/978-3-319-63754-9_18},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85032002757\&doi=10.1007\%2f978-3-319-63754-9_18\&partnerID=40\&md5=e4d45320fd26c5982556a97c07bc754d},
	author = {Elmouhtadi, M. and El Fkihi, S. and Aboutajdine, D.}
}
@conference {Elmaroud2017,
	title = {BER analysis of FBMC based multi-cellular networks in the presence of synchronization errors and HPA NLD},
	booktitle = {IEEE Vehicular Technology Conference},
	year = {2017},
	note = {cited By 1},
	abstract = {In this paper, we study the performance of asynchronous and non linear FBMC based multi-cellular networks. The considered system consists of a reference mobile user perfectly synchronized with its reference base station (BS) and K interfering BSS. We have considered both synchronization errors and high power amplifiers (HPA) non linear distortions (NLD). We analyzed first the signal to noise plus interference ratio (SINR). On the basis of this analysis, derived an accurate of 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 non linear distortions. {\textcopyright} 2016 IEEE.},
	doi = {10.1109/VTCFall.2016.7880922},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85016936548\&doi=10.1109\%2fVTCFall.2016.7880922\&partnerID=40\&md5=170d934dcec5039d0265f9b0310630c6},
	author = {Elmaroud, B. and Faqihi, M.A. and Abbad, M. and Aboutajdine, D.}
}
@conference {Abouyahya201746,
	title = {Features extraction for facial expressions recognition},
	booktitle = {International Conference on Multimedia Computing and Systems -Proceedings},
	year = {2017},
	note = {cited By 0},
	pages = {46-49},
	abstract = {The recognition of an expression seems obvious and easy when classified by the human brain. However, it is clearly difficult for a computer to detect human face, extract all of the components characterizing the facial expression and then determine its classification from a single image. Moreover, based on videos, the process becomes even more complex because it must take simultaneously into account the temporal and spatial information available. Also, It should be noted that facial features have an important fact to developing a robust face representation because it aims to select the best of features and reduce dimensionality of features set by finding a new set which contains most of the face features information. For those reasons, this paper present several features extraction approaches for facial expressions recognition as state-of-the-art review. {\textcopyright} 2016 IEEE.},
	doi = {10.1109/ICMCS.2016.7905642},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85019146665\&doi=10.1109\%2fICMCS.2016.7905642\&partnerID=40\&md5=9a7be9980a63d7021cf8136fdf05dfd5},
	author = {Abouyahya, A. and El Fkihi, S. and Thami, R.O.H. and Aboutajdine, D.}
}
@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 1},
	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. and El Fkihi, S. and Aboutajdine, D.}
}
@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. and El Fkihi, S. and Aboutajdine, D.}
}
@article {Elmaroud2017550,
	title = {Performance analysis of asynchronous and non linear FBMC systems},
	journal = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)},
	volume = {10542 LNCS},
	year = {2017},
	note = {cited By 0},
	pages = {550-561},
	abstract = {This paper provides a theoretical analysis of the joint effect of synchronization errors and High Power Amplifiers (HPA) non linear distortions on filter bank based multicarrier (FBMC) systems. A promising class of FBMC modulation called Cosine Modulated Multitone (CMT) will be considered. For the studied system, analytical expressions of the signal to interference ratio (SIR) and bit error rate (BER) will be derived in the presence of HPA distortions, timing errors and carrier frequency offset (CFO). To this end, we have developed a closed-form expression of interference and useful signal powers using some acceptable approximations. The proposed model is compared with existing models designed for the considered system or for other multicarrier systems like SMT (Staggered Modulated Multitone) or OFDM. {\textcopyright} Springer International Publishing AG 2017.},
	doi = {10.1007/978-3-319-68179-5_48},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85034587110\&doi=10.1007\%2f978-3-319-68179-5_48\&partnerID=40\&md5=6d16308c4170297309c0b8c954bb39aa},
	author = {Elmaroud, B. and Faqihi, A. and Aboutajdine, D.}
}
@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 1},
	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. and Faqihi, A. and Aboutajdine, D.}
}
@article { ISI:000348881600008,
	title = {Visual contact with catadioptric cameras},
	journal = {ROBOTICS AND AUTONOMOUS SYSTEMS},
	volume = {64},
	year = {2015},
	month = {FEB},
	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 {\textquoteleft}{\textquoteleft}gradient based TTC{{\textquoteright}{\textquoteright}}, 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 {\textquoteleft}{\textquoteleft}TTC map estimation based on optical flow{{\textquoteright}{\textquoteright}}, 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. (C) 2014 Elsevier B.V. All rights reserved.},
	issn = {0921-8890},
	doi = {10.1016/j.robot.2014.09.036},
	author = {Benamar, F. and Elfkihi, S. and Demonceaux, C. and Mouaddib, E. and Aboutajdine, D.}
}
@conference { ISI:000351597600002,
	title = {GRADIENT-BASED TIME TO CONTACT ON PARACATADIOPTRIC CAMERA},
	booktitle = {2013 20TH IEEE INTERNATIONAL CONFERENCE ON IMAGE PROCESSING (ICIP 2013)},
	series = {IEEE International Conference on Image Processing ICIP},
	year = {2013},
	note = {20th IEEE International Conference on Image Processing (ICIP), Melbourne, AUSTRALIA, SEP 15-18, 2013},
	pages = {5-9},
	publisher = {Inst Elect \& Elect Engineers; IEEE Signal Proc Soc},
	organization = {Inst Elect \& Elect Engineers; IEEE Signal Proc Soc},
	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 {\textquoteleft}{\textquoteleft}gradient based time to contact{{\textquoteright}{\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.},
	isbn = {978-1-4799-2341-0},
	issn = {1522-4880},
	author = {Benamar, F. and El Fkihi, S. and Demonceaux, C. and Mouaddib, E. and Aboutajdine, D.}
}
@article {Anoual201227,
	title = {A novel texture-based algorithm for localizing vehicle license plates},
	journal = {Journal of Theoretical and Applied Information Technology},
	volume = {45},
	number = {1},
	year = {2012},
	note = {cited By 1},
	pages = {27-32},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84874531292\&partnerID=40\&md5=58ad16d91d008ad97e88e70a9234486f},
	author = {Anoual, H. and Fkihi, S.E. and Jilbab, A. and Aboutajdine, D.}
}
@conference {Benamar20123602,
	title = {Time to contact estimation on paracatadioptric cameras},
	booktitle = {Proceedings - International Conference on Pattern Recognition},
	year = {2012},
	note = {cited By 2},
	pages = {3602-3605},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84874558961\&partnerID=40\&md5=ed024edcf33e2e2b82c2adf2ecc505f3},
	author = {Benamar, F. and Demonceaux, C. and Fkihi, S.E. and Mouaddib, E. and Aboutajdine, D.}
}
@conference {Bouirouga2011,
	title = {Recognition of adult video by combining skin detection features with motion information},
	booktitle = {International Conference on Multimedia Computing and Systems -Proceedings},
	year = {2011},
	note = {cited By 1},
	doi = {10.1109/ICMCS.2011.5945570},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-79961239374\&doi=10.1109\%2fICMCS.2011.5945570\&partnerID=40\&md5=96e36065eca2afa2f2e3a18e0d2b4fe5},
	author = {Bouirouga, H. and Lrit, S.E. and Jilbab, A. and Aboutajdine, D.}
}
@conference {Elbhiri2011,
	title = {UWB based maximizing network liftime with route selection strategies for wireless sensor networks},
	booktitle = {International Conference on Multimedia Computing and Systems -Proceedings},
	year = {2011},
	note = {cited By 0},
	doi = {10.1109/ICMCS.2011.5945636},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-79961216854\&doi=10.1109\%2fICMCS.2011.5945636\&partnerID=40\&md5=3640a80cc17beb1f99c1d6741aece8e9},
	author = {Elbhiri, B. and Saadane, R. and Fkihi, S.E. and Aboutajdine, D. and Wahbi, M.}
}
@conference {Anoual2011,
	title = {Vehicle license plate detection in images},
	booktitle = {International Conference on Multimedia Computing and Systems -Proceedings},
	year = {2011},
	note = {cited By 3},
	doi = {10.1109/ICMCS.2011.5945680},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-79961227182\&doi=10.1109\%2fICMCS.2011.5945680\&partnerID=40\&md5=0640cc288461c0ff15b817b0c5d2a10b},
	author = {Anoual, H. and Fkihi, S.E. and Jilbab, A. and Aboutajdine, D.}
}
@conference {Elbhiri2010,
	title = {Clustering in Wireless Sensor Networks based on near Optimal bi-partitions},
	booktitle = {6th Euro NF Conference on Next Generation Internet, NGI 2010 - Proceedings},
	year = {2010},
	note = {cited By 10},
	doi = {10.1109/NGI.2010.5534469},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-77956440742\&doi=10.1109\%2fNGI.2010.5534469\&partnerID=40\&md5=bdb3af7a0347d03735950c66675c8253},
	author = {Elbhiri, B. and Fkihi, S.E. and Saadane, R. and Aboutajdine, D.}
}
@conference {Elbhiri2010,
	title = {Developed Distributed Energy-Efficient Clustering (DDEEC) for heterogeneous wireless sensor networks},
	booktitle = {2010 5th International Symposium on I/V Communications and Mobile Networks, ISIVC 2010},
	year = {2010},
	note = {cited By 2},
	doi = {10.1109/ISVC.2010.5656252},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-78651495359\&doi=10.1109\%2fISVC.2010.5656252\&partnerID=40\&md5=04c6f29644071a785006aab6b93c9c27},
	author = {Elbhiri, B. and Rachid, S. and El Fkihi, S. and Aboutajdine, D.}
}
@conference {Anoual2010,
	title = {Features extraction for text detection and localization},
	booktitle = {2010 5th International Symposium on I/V Communications and Mobile Networks, ISIVC 2010},
	year = {2010},
	note = {cited By 1},
	doi = {10.1109/ISVC.2010.5656284},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-78651516449\&doi=10.1109\%2fISVC.2010.5656284\&partnerID=40\&md5=7432f9409c4d2e3bd7a3aa3a78c5865a},
	author = {Anoual, H. and Aboutajdine, D. and Elfkihi, S. and Jilbab, A.}
}
@article {Anoual2010157,
	title = {New approach based on texture and geometric features for text detection},
	journal = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)},
	volume = {6134 LNCS},
	year = {2010},
	note = {cited By 0},
	pages = {157-164},
	doi = {10.1007/978-3-642-13681-8_19},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-79956278929\&doi=10.1007\%2f978-3-642-13681-8_19\&partnerID=40\&md5=c16c63472198a6944f7f472697a0cc7c},
	author = {Anoual, H. and El Fkihi, S. and Jilbab, A. and Aboutajdine, D.}
}
@conference {Rouijel2010,
	title = {A new approach for wireless communication systems based on IDMA technique},
	booktitle = {2010 5th International Symposium on I/V Communications and Mobile Networks, ISIVC 2010},
	year = {2010},
	note = {cited By 0},
	doi = {10.1109/ISVC.2010.5656727},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-78651500725\&doi=10.1109\%2fISVC.2010.5656727\&partnerID=40\&md5=b456d23b9a760f866b87f12544c1ba42},
	author = {Rouijel, A. and Nsiri, B. and Faqihi, A. and Aboutajdine, D.}
}
@conference {Asmaa2009171,
	title = {WiebMat, a new information extraction systemen},
	booktitle = {Proceedings of the IADIS European Conference on Data Mining 2009, ECDM{\textquoteright}09 Part of the IADIS Multi Conference on Computer Science and Information Systems, MCCSIS 2009},
	year = {2009},
	note = {cited By 0},
	pages = {171-173},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-77955642240\&partnerID=40\&md5=814746990e197f7a2b9c287d94affb40},
	author = {Asmaa, E.O. and Aboutajdine, D. and Aziz, D.}
}
@article { ISI:000208118700002,
	title = {Adjustable SAD matching algorithm using frequency domain},
	journal = {JOURNAL OF REAL-TIME IMAGE PROCESSING},
	volume = {1},
	number = {4},
	year = {2007},
	month = {JUL},
	pages = {257-265},
	abstract = {Fast Fourier transforms (FFTs) which are O(N logN) algorithms to compute a discrete Fourier transform (DFT) of size N have been called one of the ten most important algorithms of the twentieth century. However, even though many algorithms have been developed to speed up the computation the sum of absolute difference (SAD) matching, they are exclusively designed in the spatial domain. In this paper, we propose a fast frequency algorithm to speed up the process of (SAD) matching. We use a new approach to approximate the SAD metric by cosine series which can be expressed in correlation terms. These latter can be computed using FFT algorithms. Experimental results demonstrate the effectiveness of our method when using only the first correlation terms for block and template matching in terms of accuracy and speed. The proposed algorithm is suitable for software implementations and has a deterministic execution time unlike the existing fast algorithms for SAD matching.},
	issn = {1861-8200},
	doi = {10.1007/s11554-007-0026-0},
	author = {Essannouni, F. and Haj Thami, R. Oulad and Aboutajdine, D. and Salam, A.}
}
@article { ISI:000256074600006,
	title = {Fast exhaustive block-based motion vector estimation algorithm using FFT},
	journal = {ARABIAN JOURNAL FOR SCIENCE AND ENGINEERING},
	volume = {32},
	number = {2C},
	year = {2007},
	note = {18th International Conference on Microelectronics (ICM 2006), King Fahd Univ Petr \& Minerals, Dhahran, SAUDI ARABIA, DEC 16-18, 2006},
	month = {DEC},
	pages = {61-74},
	abstract = {In video processing, block motion estimation represents a CPU-intensive task. For this reason, many fast algorithms have been developed to improve searching and matching phases. These methods however work generally in the spatial domain. In this paper we propose to benefit from speed of the available FFT algorithms. The proposed algorithm computes the motion vector for two blocks using simultaneous two-dimensional cross correlations and use again the FFT to compute the sum square blocks in the frequency domain. Simulation results show that the proposed algorithm gives an optimal SSD (sum square differences) full search results while having a computational cost inferior to the classical fast block matching algorithms.},
	issn = {1319-8025},
	author = {Essannouni, F. and Thami, R. Oulad Haj and Aboutajdine, D. and Salam, A.}
}
@article { ISI:000246875600015,
	title = {Fast L4 template matching using frequency domain},
	journal = {ELECTRONICS LETTERS},
	volume = {43},
	number = {9},
	year = {2007},
	month = {APR 26},
	pages = {507-508},
	abstract = {Fast and simple L4 norm computation for translational template matching is presented. The proposed method is based on expressing the L4 norm in terms of two cross-correlations. Speed is obtained from computing the correlations in the frequency domain using FFT algorithms.},
	issn = {0013-5194},
	doi = {10.1049/el:20070793},
	author = {Essannouni, F. and Thami, R. Oulad Haj and Aboutajdine, D. and Salam, A.}
}
@article {2489083820070426,
	title = {Fast L4 template matching using frequency domain.},
	journal = {Electronics Letters},
	volume = {43},
	number = {9},
	year = {2007},
	pages = {507 - 508},
	abstract = {Fast and simple L4 norm computation for translational template matching is presented. The proposed method is based on expressing the L4 norm in terms of two cross-correlations. Speed is obtained from computing the correlations in the frequency domain using FFT algorithms. [ABSTRACT FROM AUTHOR]},
	keywords = {Algebra, Algorithms, Correlation (Statistics), Mathematical statistics, Pattern recognition systems},
	issn = {00135194},
	url = {http://search.ebscohost.com/login.aspx?direct=true\&db=iih\&AN=24890838\&site=ehost-live},
	author = {Essannouni, F. and Oulad Haj Thami, R. and Aboutajdine, D. and Salam, A.}
}
@article { ISI:000251549200037,
	title = {Simple noncircular correlation method for exhaustive sum square difference matching},
	journal = {OPTICAL ENGINEERING},
	volume = {46},
	number = {10},
	year = {2007},
	month = {OCT},
	abstract = {We propose a new algorithm to calculate the sum square difference (SSD) metric for estimating translational motion. Using some substitutions and complex arithmetics, computation of the SSD is derived to be a correlation function of two substituting functions. The former can be computed using the fast Fourier transform (FFT) approach, which is less computationally expensive than the direct computation of the SSD. Zero padding of the block is useful both to avoid the circular character of the FFT and to computes the SSD function at once. We prove the existence of a simple and optimal correlation method for noncircular SSD matching. (c) 2007 Society of Photo-Optical Instrumentation Engineers.},
	issn = {0091-3286},
	doi = {10.1117/1.2786469},
	author = {Essannouni, F. and Thami, R. Oulad Haj and Aboutajdine, D. and Salam, A.}
}
@conference { ISI:000245384800059,
	title = {An optimal and statistically robust correlation technique for block based motion estimation},
	booktitle = {2006 IEEE INTERNATIONAL CONFERENCE ON MULTIMEDIA AND EXPO - ICME 2006, VOLS 1-5, PROCEEDINGS},
	year = {2006},
	note = {IEEE International Conference on Multimedia and Expo (ICME 2006), Toronto, CANADA, JUL 09-12, 2006},
	pages = {233+},
	publisher = {IEEE; IEEE Circuits \& Syst Soc; IEEE Commun Soc; IEEE Comp Soc; IEEE Signal Proc Soc},
	organization = {IEEE; IEEE Circuits \& Syst Soc; IEEE Commun Soc; IEEE Comp Soc; IEEE Signal Proc Soc},
	abstract = {In this paper we propose an optimal and robust correlation technique for the local motion estimation purposes. It is based on the maximization of a statistical robust matching function, which is computed in the frequency domain and therefore can be implemented by fast transformation algorithms. We show that our method achieves a significant speed up and robustness over the full search block-matching algorithm. We also present a comparative performance analysis, which shows that the proposed method greatly outperforms the state-of-the-art in correlation motion estimation.},
	isbn = {978-1-4244-0366-0},
	doi = {10.1109/ICME.2006.262425},
	author = {Essannouni, F. and Thami, R. Oulad Haj and Salam, A. and Aboutajdine, D.}
}
