<?xml version="1.0" encoding="UTF-8"?>
<feed xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns="http://www.w3.org/2005/Atom">
<title>vol. 4, nº 1, september 2016</title>
<link href="https://reunir.unir.net/handle/123456789/11564" rel="alternate"/>
<subtitle/>
<id>https://reunir.unir.net/handle/123456789/11564</id>
<updated>2024-11-08T12:23:11Z</updated>
<dc:date>2024-11-08T12:23:11Z</dc:date>
<entry>
<title>Comparison between Famous Game Engines and Eminent Games</title>
<link href="https://reunir.unir.net/handle/123456789/11616" rel="alternate"/>
<author>
<name>Mishra, Prerna</name>
</author>
<author>
<name>Shrawankar, Urmila</name>
</author>
<id>https://reunir.unir.net/handle/123456789/11616</id>
<updated>2021-07-15T09:07:34Z</updated>
<summary type="text">Comparison between Famous Game Engines and Eminent Games
Mishra, Prerna; Shrawankar, Urmila
Nowadays game engines are imperative for building 3D applications and games. This is for the reason that the engines appreciably reduce resources for employing obligatory but intricate utilities. This paper elucidates about a game engine, popular games developed by these engines and its foremost elements. It portrays a number of special kinds of contemporary game developed by engines in the way of their aspects, procedure and deliberates their stipulations with comparison.
Submitted by Susana Figueroa Navarro (susana.figueroa.n@unir.net) on 2021-07-15T09:07:34Z
No. of bitstreams: 1
ijimai20164_1_13_pdf_63301.pdf: 1739519 bytes, checksum: 5c2c79aedf439d880ec344e9f946a3d3 (MD5); Made available in DSpace on 2021-07-15T09:07:34Z (GMT). No. of bitstreams: 1
ijimai20164_1_13_pdf_63301.pdf: 1739519 bytes, checksum: 5c2c79aedf439d880ec344e9f946a3d3 (MD5)
</summary>
</entry>
<entry>
<title>Correlation Between Coupling Metrics Values and Number of Classes in Multimedia Java Projects: A Case Study</title>
<link href="https://reunir.unir.net/handle/123456789/11614" rel="alternate"/>
<author>
<name>Bivde, V S</name>
</author>
<author>
<name>Sarasu, P</name>
</author>
<id>https://reunir.unir.net/handle/123456789/11614</id>
<updated>2021-07-14T12:34:03Z</updated>
<summary type="text">Correlation Between Coupling Metrics Values and Number of Classes in Multimedia Java Projects: A Case Study
Bivde, V S; Sarasu, P
Coupling is an interdependence relationship between the modules of object-oriented software. It is a property with the most influence on quality attributes of the object-oriented software. Coupling with high values results in complex software design hence software professionals try to keep the coupling as low as possible. The values of coupling metrics are dependent on the type of input source code. Reusability is the main feature of object-oriented languages, so coupling occurs due to reuse of code modules. This paper investigates a correlation between the values of coupling metrics and the number of classes in the multimedia Java code. Here, a case study of a banking multimedia Java project with its forty different versions is conducted to comments on this correlation. The analysis of the results shows that, if the input source code is with a large number of classes then it results in high coupling values.
Submitted by Susana Figueroa Navarro (susana.figueroa.n@unir.net) on 2021-07-14T12:34:03Z
No. of bitstreams: 0; Made available in DSpace on 2021-07-14T12:34:03Z (GMT). No. of bitstreams: 0
</summary>
</entry>
<entry>
<title>Evaluating the Emotional State of a User Using a Webcam</title>
<link href="https://reunir.unir.net/handle/123456789/11613" rel="alternate"/>
<author>
<name>Magdin, Martin</name>
</author>
<author>
<name>Turcani, Milan</name>
</author>
<author>
<name>Hudec, Lukas</name>
</author>
<id>https://reunir.unir.net/handle/123456789/11613</id>
<updated>2021-07-14T12:24:01Z</updated>
<summary type="text">Evaluating the Emotional State of a User Using a Webcam
Magdin, Martin; Turcani, Milan; Hudec, Lukas
In online learning is more difficult for teachers identify to see how individual students behave. Student’s emotions like self-esteem, motivation, commitment, and others that are believed to be determinant in student’s performance can not be ignored, as they are known (affective states and also learning styles) to greatly influence student’s learning. The ability of the computer to evaluate the emotional state of the user is getting bigger attention. By evaluating the emotional state, there is an attempt to overcome the barrier between man and non-emotional machine. Recognition of a real time emotion in e-learning by using webcams is research area in the last decade. Improving learning through webcams and microphones offers relevant feedback based upon learner’s facial expressions and verbalizations. The majority of current software does not work in real time – scans face and progressively evaluates its features. The designed software works by the use neural networks in real time which enable to apply the software into various fields of our lives and thus actively influence its quality. Validation of face emotion recognition software was annotated by using various experts. These expert findings were contrasted with the software results. An overall accuracy of our software based on the requested emotions and the recognized emotions is 78%. Online evaluation of emotions is an appropriate technology for enhancing the quality and efficacy of e-learning by including the learner´s emotional states.
Submitted by Susana Figueroa Navarro (susana.figueroa.n@unir.net) on 2021-07-14T12:24:01Z
No. of bitstreams: 1
ijimai20164_1_12_pdf_20682.pdf: 574723 bytes, checksum: 6754097ab397e538598834b8a217dd14 (MD5); Made available in DSpace on 2021-07-14T12:24:01Z (GMT). No. of bitstreams: 1
ijimai20164_1_12_pdf_20682.pdf: 574723 bytes, checksum: 6754097ab397e538598834b8a217dd14 (MD5)
</summary>
</entry>
<entry>
<title>IJIMAI Editor's Note - Vol. 4 Issue 1</title>
<link href="https://reunir.unir.net/handle/123456789/11612" rel="alternate"/>
<author>
<name>Bahaj, Mohamed</name>
</author>
<id>https://reunir.unir.net/handle/123456789/11612</id>
<updated>2021-07-14T12:09:00Z</updated>
<summary type="text">IJIMAI Editor's Note - Vol. 4 Issue 1
Bahaj, Mohamed
The research works presented in this issue are based on various topics of interest, among which are included: Pattern Recognition, Multimedia Information Retrieval, Knowledge extraction and knowledge mining, Data mining, Intelligent Systems &amp; Artificial Intelligence, Wireless Technology, Network Telecommunication, Security &amp; Network Management, Advanced Network Technologies.
Submitted by Susana Figueroa Navarro (susana.figueroa.n@unir.net) on 2021-07-14T12:09:00Z
No. of bitstreams: 1
ijimai20164_1_0_pdf_95835.pdf: 145706 bytes, checksum: 8fafdd96430bbebd399d73497e3fa642 (MD5); Made available in DSpace on 2021-07-14T12:09:00Z (GMT). No. of bitstreams: 1
ijimai20164_1_0_pdf_95835.pdf: 145706 bytes, checksum: 8fafdd96430bbebd399d73497e3fa642 (MD5)
</summary>
</entry>
<entry>
<title>Solving the Weighted Constraint Satisfaction Problems Via the Neural Network Approach</title>
<link href="https://reunir.unir.net/handle/123456789/11611" rel="alternate"/>
<author>
<name>Ettaouil, Mohamed</name>
</author>
<author>
<name>Haddouch, Khalid</name>
</author>
<author>
<name>Elmoutaoukil, Karim</name>
</author>
<id>https://reunir.unir.net/handle/123456789/11611</id>
<updated>2021-07-14T11:34:23Z</updated>
<summary type="text">Solving the Weighted Constraint Satisfaction Problems Via the Neural Network Approach
Ettaouil, Mohamed; Haddouch, Khalid; Elmoutaoukil, Karim
A wide variety of real world optimization problems&#13;
can be modelled as Weighted Constraint Satisfaction Problems&#13;
(WCSPs). In this paper, we model this problem in terms of in&#13;
original 0-1 quadratic programming subject to leaner constraints.&#13;
View it performance, we use the continuous Hopfield network to&#13;
solve the obtained model basing on original energy function. To&#13;
validate our model, we solve several instance of benchmarking&#13;
WCSP. In this regard, our approach recognizes the optimal&#13;
solution of the said instances.
Submitted by Susana Figueroa Navarro (susana.figueroa.n@unir.net) on 2021-07-14T11:34:23Z
No. of bitstreams: 1
ijimai20164_1_11_pdf_42425.pdf: 1161738 bytes, checksum: a4a814ec90a8a9fa881788f7c869b1d6 (MD5); Made available in DSpace on 2021-07-14T11:34:23Z (GMT). No. of bitstreams: 1
ijimai20164_1_11_pdf_42425.pdf: 1161738 bytes, checksum: a4a814ec90a8a9fa881788f7c869b1d6 (MD5)
</summary>
</entry>
<entry>
<title>PI Stabilization for Congestion Control of AQM Routers with Tuning Parameter Optimization</title>
<link href="https://reunir.unir.net/handle/123456789/11610" rel="alternate"/>
<author>
<name>Chebli, S</name>
</author>
<author>
<name>El Akkary, Ahmed</name>
</author>
<id>https://reunir.unir.net/handle/123456789/11610</id>
<updated>2021-07-14T10:50:24Z</updated>
<summary type="text">PI Stabilization for Congestion Control of AQM Routers with Tuning Parameter Optimization
Chebli, S; El Akkary, Ahmed
In this paper, we consider the problem of stabilizing network using a new proportional- integral (PI) based congestion controller in active queue management (AQM) router; with appropriate model approximation in the first order delay systems, we seek a stability region of the controller by using the Hermite- Biehler theorem, which isapplicable to quasipolynomials. A Genetic Algorithm technique is employed to derive optimal or near optimal PI controller parameters.
Submitted by Susana Figueroa Navarro (susana.figueroa.n@unir.net) on 2021-07-14T10:50:24Z
No. of bitstreams: 1
ijimai20164_1_10_pdf_18562.pdf: 2282480 bytes, checksum: f9682b7011573900517e96c73e1a0373 (MD5); Made available in DSpace on 2021-07-14T10:50:24Z (GMT). No. of bitstreams: 1
ijimai20164_1_10_pdf_18562.pdf: 2282480 bytes, checksum: f9682b7011573900517e96c73e1a0373 (MD5)
</summary>
</entry>
<entry>
<title>Statistical Comparisons of the Top 10 Algorithms in Data Mining for Classification Task</title>
<link href="https://reunir.unir.net/handle/123456789/11573" rel="alternate"/>
<author>
<name>Settouti, Nesma</name>
</author>
<author>
<name>El Amine Bechar, Mohammed</name>
</author>
<author>
<name>Amine Chikh, Mohammed</name>
</author>
<id>https://reunir.unir.net/handle/123456789/11573</id>
<updated>2021-07-07T12:30:51Z</updated>
<summary type="text">Statistical Comparisons of the Top 10 Algorithms in Data Mining for Classification Task
Settouti, Nesma; El Amine Bechar, Mohammed; Amine Chikh, Mohammed
This work is builds on the study of the 10 top data mining algorithms identified by the IEEE International Conference on Data Mining (ICDM) community in December 2006. We address the same study, but with the application of statistical tests to establish, a more appropriate and justified ranking classifier for classification tasks. Current studies and practices on theoretical and empirical comparison of several methods, approaches, advocated tests that are more appropriate. Thereby, recent studies recommend a set of simple and robust non-parametric tests for statistical comparisons classifiers. In this paper, we propose to perform non-parametric statistical tests by the Friedman test with post-hoc tests corresponding to the comparison of several classifiers on multiple data sets. The tests provide a better judge for the relevance of these algorithms.
Submitted by Susana Figueroa Navarro (susana.figueroa.n@unir.net) on 2021-07-07T12:30:51Z
No. of bitstreams: 1
ijimai20164_1_9_pdf_19943.pdf: 791619 bytes, checksum: 692cbe571e5c46d528cd66fb1a5d2e2b (MD5); Made available in DSpace on 2021-07-07T12:30:51Z (GMT). No. of bitstreams: 1
ijimai20164_1_9_pdf_19943.pdf: 791619 bytes, checksum: 692cbe571e5c46d528cd66fb1a5d2e2b (MD5)
</summary>
</entry>
<entry>
<title>A Distributed Intelligent System for Emergency Convoy</title>
<link href="https://reunir.unir.net/handle/123456789/11572" rel="alternate"/>
<author>
<name>Benalla, Mohammed</name>
</author>
<author>
<name>Achchab, Boujemâa</name>
</author>
<author>
<name>Hrimech, Hamid</name>
</author>
<id>https://reunir.unir.net/handle/123456789/11572</id>
<updated>2021-07-07T12:02:53Z</updated>
<summary type="text">A Distributed Intelligent System for Emergency Convoy
Benalla, Mohammed; Achchab, Boujemâa; Hrimech, Hamid
The general problem that guides this research is the ability to design a distributed intelligent system for guiding the emergency convoys; a solution that will be based on a group of agents and on the analysis of traffic in order to generate collective functional response. It fits into the broader issue of Distributed Artificial System (DAI), which is to operate a cooperatively computer agent into multi-agents system (MAS). This article describes conceptually two fundamental questions of emergency convoys. The first question is dedicated to find a response to the traffic situation (i.e. fluid way), while the second is devoted to the convoy orientation; while putting the point on the distributed and cooperative resolution for the general problem.
Submitted by Susana Figueroa Navarro (susana.figueroa.n@unir.net) on 2021-07-07T12:02:53Z
No. of bitstreams: 1
ijimai20164_1_8_pdf_22976.pdf: 1051032 bytes, checksum: 59275d1c104b9e34ad38f85c61b490ff (MD5); Made available in DSpace on 2021-07-07T12:02:53Z (GMT). No. of bitstreams: 1
ijimai20164_1_8_pdf_22976.pdf: 1051032 bytes, checksum: 59275d1c104b9e34ad38f85c61b490ff (MD5)
</summary>
</entry>
<entry>
<title>MaxHopCount: A New Drop Policy to Optimize Messages Delivery Rate in Delay Tolerant Networks</title>
<link href="https://reunir.unir.net/handle/123456789/11571" rel="alternate"/>
<author>
<name>Harrati, Youssef</name>
</author>
<author>
<name>Abdali, Abdelmounaim</name>
</author>
<id>https://reunir.unir.net/handle/123456789/11571</id>
<updated>2021-07-07T11:20:28Z</updated>
<summary type="text">MaxHopCount: A New Drop Policy to Optimize Messages Delivery Rate in Delay Tolerant Networks
Harrati, Youssef; Abdali, Abdelmounaim
Communication has become a necessity, not only between every point on the earth, but also on the globe. That includes hard topography, highlands, underwater areas, and also space- crafts on other planets. However, the classic wired internet cannot be implemented in such areas, hence, researchers have invented wireless networks. The big challenge for wireless networking nowadays, is maintaining nodes connected in some difficult conditions, such as intermittent connectivity, power failure, and lot of obstacles for the interplanetary networks. In these challenging circumstances, a new networking model arises; it is Delay Tolerant networking which is based on the Store-Carry-and-Forward mechanism. Thus, a node may keep a message in its buffer for long periods of time; until a delivery or forward chance arises then it transmit it to other nodes. One of the big issues that confront this mechanism is the congestion of nodes buffer due to the big number of messages and the limited buffer size. Here, researchers have proposed buffer management algorithms in order to deal with the buffer overload problem, and they called it Drop Policies. In our present work, we propose a new Drop policy which we have compared to other existing policies in different conditions and with different routing protocols, and it always shows good result in term of number of delivered messages, network overhead and also average of latency.
Submitted by Susana Figueroa Navarro (susana.figueroa.n@unir.net) on 2021-07-07T11:20:28Z
No. of bitstreams: 1
ijimai20164_1_7_pdf_15922.pdf: 1094550 bytes, checksum: 6ebe3e875ad2ec225b61eb3edec39c74 (MD5); Made available in DSpace on 2021-07-07T11:20:28Z (GMT). No. of bitstreams: 1
ijimai20164_1_7_pdf_15922.pdf: 1094550 bytes, checksum: 6ebe3e875ad2ec225b61eb3edec39c74 (MD5)
</summary>
</entry>
<entry>
<title>Detection of Text Lines of Handwritten Arabic Manuscripts using Markov Decision Processes</title>
<link href="https://reunir.unir.net/handle/123456789/11570" rel="alternate"/>
<author>
<name>Boulid, Youssef</name>
</author>
<author>
<name>Souhar, Abdelghani</name>
</author>
<author>
<name>Elyoussfi Elkettani, Mohamed</name>
</author>
<id>https://reunir.unir.net/handle/123456789/11570</id>
<updated>2021-07-07T11:02:10Z</updated>
<summary type="text">Detection of Text Lines of Handwritten Arabic Manuscripts using Markov Decision Processes
Boulid, Youssef; Souhar, Abdelghani; Elyoussfi Elkettani, Mohamed
In a character recognition systems, the segmentation phase is critical since the accuracy of the recognition depend strongly on it. In this paper we present an approach based on Markov Decision Processes to extract text lines from binary images of Arabic handwritten documents. The proposed approach detects the connected components belonging to the same line by making use of knowledge about features and arrangement of those components. The initial results show that the system is promising for extracting Arabic handwritten lines.
Submitted by Susana Figueroa Navarro (susana.figueroa.n@unir.net) on 2021-07-07T11:02:10Z
No. of bitstreams: 1
ijimai20164_1_6_pdf_34205.pdf: 1472159 bytes, checksum: d6ff52a2433f187fb0050fb9d5cfbefe (MD5); Made available in DSpace on 2021-07-07T11:02:10Z (GMT). No. of bitstreams: 1
ijimai20164_1_6_pdf_34205.pdf: 1472159 bytes, checksum: d6ff52a2433f187fb0050fb9d5cfbefe (MD5)
</summary>
</entry>
<entry>
<title>Multilayer Perceptron: Architecture Optimization and Training</title>
<link href="https://reunir.unir.net/handle/123456789/11569" rel="alternate"/>
<author>
<name>Ramchoun, Hassan</name>
</author>
<author>
<name>Ghanou, Youssef</name>
</author>
<author>
<name>Ettaouil, Mohamed</name>
</author>
<author>
<name>Janati Idrissi, Mohammed Amine</name>
</author>
<id>https://reunir.unir.net/handle/123456789/11569</id>
<updated>2021-07-07T10:37:59Z</updated>
<summary type="text">Multilayer Perceptron: Architecture Optimization and Training
Ramchoun, Hassan; Ghanou, Youssef; Ettaouil, Mohamed; Janati Idrissi, Mohammed Amine
The multilayer perceptron has a large wide of classification and regression applications in many fields: pattern recognition, voice and classification problems. But the architecture choice has a great impact on the convergence of these networks. In the present paper we introduce a new approach to optimize the network architecture, for solving the obtained model we use the genetic algorithm and we train the network with a back-propagation algorithm. The numerical results assess the effectiveness of the theoretical results shown in this paper, and the advantages of the new modeling compared to the previous model in the literature.
Submitted by Susana Figueroa Navarro (susana.figueroa.n@unir.net) on 2021-07-07T10:37:59Z
No. of bitstreams: 1
ijimai20164_1_5_pdf_30533.pdf: 1396853 bytes, checksum: 86a1788f74a4d54fa0daf8990c74723b (MD5); Made available in DSpace on 2021-07-07T10:37:59Z (GMT). No. of bitstreams: 1
ijimai20164_1_5_pdf_30533.pdf: 1396853 bytes, checksum: 86a1788f74a4d54fa0daf8990c74723b (MD5)
</summary>
</entry>
<entry>
<title>A Self-Calibration Method of Zooming Camera</title>
<link href="https://reunir.unir.net/handle/123456789/11568" rel="alternate"/>
<author>
<name>El Batteoui, Ismail</name>
</author>
<author>
<name>Saaidi, Abderrahim</name>
</author>
<author>
<name>Satori, Khalid</name>
</author>
<id>https://reunir.unir.net/handle/123456789/11568</id>
<updated>2021-07-07T09:48:28Z</updated>
<summary type="text">A Self-Calibration Method of Zooming Camera
El Batteoui, Ismail; Saaidi, Abderrahim; Satori, Khalid
In this article we proposed a novel approach to self- calibrate a camera with variable focal length. We show that the estimation of camera’s intrinsic parameters is possible from only two points of an unknown planar scene. The projection of these points by using the projection matrices in two images only permit us to obtain a system of equations according to the camera’s intrinsic parameters . From this system we formulated a nonlinear cost function which its minimization allows us to estimate the camera’s intrinsic parameters in each view. The results on synthetic and real data justify the robustness of our method in term of reliability and convergence.
Submitted by Susana Figueroa Navarro (susana.figueroa.n@unir.net) on 2021-07-07T09:48:28Z
No. of bitstreams: 1
ijimai20164_1_4_pdf_94156.pdf: 1459478 bytes, checksum: 40f444fd2dbb2363fc3be783e7b98399 (MD5); Made available in DSpace on 2021-07-07T09:48:28Z (GMT). No. of bitstreams: 1
ijimai20164_1_4_pdf_94156.pdf: 1459478 bytes, checksum: 40f444fd2dbb2363fc3be783e7b98399 (MD5)
</summary>
</entry>
<entry>
<title>Golden Ball Algorithm for solving Flow Shop Scheduling Problem</title>
<link href="https://reunir.unir.net/handle/123456789/11567" rel="alternate"/>
<author>
<name>Sayoti, Fatima</name>
</author>
<author>
<name>Essaid Riffi, Mohammed</name>
</author>
<id>https://reunir.unir.net/handle/123456789/11567</id>
<updated>2021-07-07T09:38:36Z</updated>
<summary type="text">Golden Ball Algorithm for solving Flow Shop Scheduling Problem
Sayoti, Fatima; Essaid Riffi, Mohammed
The Flow Shop Scheduling Problem (FSSP) is notoriously NP-hard combinatorial optimization problem. The goal is to find a schedule that minimizes the makespan. This paper proposes an adaptation of a new approach called Golden Ball Algorithm (GBA). The proposed algorithm has been never tested with FSSP; it’s based on soccer concept to obtain the optimal solution. Numerical results are presented for 22 instances of OR- Library. The computational results indicate that this approach is practical for small OR-Library instances.
Submitted by Susana Figueroa Navarro (susana.figueroa.n@unir.net) on 2021-07-07T09:38:36Z
No. of bitstreams: 1
ijimai20164_1_3_pdf_32338.pdf: 776822 bytes, checksum: 58fdd873a689174d44ca4486a8b45861 (MD5); Made available in DSpace on 2021-07-07T09:38:36Z (GMT). No. of bitstreams: 1
ijimai20164_1_3_pdf_32338.pdf: 776822 bytes, checksum: 58fdd873a689174d44ca4486a8b45861 (MD5)
</summary>
</entry>
<entry>
<title>Offline Face Recognition System Based on GaborFisher Descriptors and Hidden Markov Models</title>
<link href="https://reunir.unir.net/handle/123456789/11566" rel="alternate"/>
<author>
<name>Elgarrai, Zineb</name>
</author>
<author>
<name>Elmeslouhi, Othmane</name>
</author>
<author>
<name>Kardouchi, Mustapha</name>
</author>
<author>
<name>Allali, Hakim</name>
</author>
<author>
<name>Selouani, Sid-Ahmed</name>
</author>
<id>https://reunir.unir.net/handle/123456789/11566</id>
<updated>2021-07-07T09:29:22Z</updated>
<summary type="text">Offline Face Recognition System Based on GaborFisher Descriptors and Hidden Markov Models
Elgarrai, Zineb; Elmeslouhi, Othmane; Kardouchi, Mustapha; Allali, Hakim; Selouani, Sid-Ahmed
This paper presents a new offline face recognition system. The proposed system is built on one dimensional left-to- right Hidden Markov Models (1D-HMMs). Facial image features are extracted using Gabor wavelets. The dimensionality of these features is reduced using the Fisher’s Discriminant Analysis method to keep only the most relevant information. Unlike existing techniques using 1D-HMMs, in classification step, the proposed system employs 1D-HMMs to find the relationship between reduced features components directly without any additional segmentation step of interest regions in the face image. The performance evaluation of the proposed method was performed with AR database and the proposed method showed a high recognition rate for this database.
Submitted by Susana Figueroa Navarro (susana.figueroa.n@unir.net) on 2021-07-07T09:29:22Z
No. of bitstreams: 1
ijimai20164_1_2_pdf_27472.pdf: 1109380 bytes, checksum: 103a2581b15386f95d5275d2dc31ae67 (MD5); Made available in DSpace on 2021-07-07T09:29:22Z (GMT). No. of bitstreams: 1
ijimai20164_1_2_pdf_27472.pdf: 1109380 bytes, checksum: 103a2581b15386f95d5275d2dc31ae67 (MD5)
</summary>
</entry>
<entry>
<title>Segmentation-free Word Spotting for Handwritten Arabic Documents</title>
<link href="https://reunir.unir.net/handle/123456789/11565" rel="alternate"/>
<author>
<name>Khaissidi, Ghizlane</name>
</author>
<author>
<name>Elfakir, Youssef</name>
</author>
<author>
<name>Mrabti, Mostafa</name>
</author>
<author>
<name>El Yacoubi, Mounîm</name>
</author>
<author>
<name>Chenouni, Driss</name>
</author>
<id>https://reunir.unir.net/handle/123456789/11565</id>
<updated>2021-07-07T09:18:45Z</updated>
<summary type="text">Segmentation-free Word Spotting for Handwritten Arabic Documents
Khaissidi, Ghizlane; Elfakir, Youssef; Mrabti, Mostafa; El Yacoubi, Mounîm; Chenouni, Driss
In this paper we present an unsupervised segmentation-free method for spotting and searching query, especially, for images documents in handwritten Arabic, for this, Histograms of Oriented Gradients (HOGs) are used as the feature vectors to represent the query and documents image. Then, we compress the descriptors with the product quantization method. Finally, a better representation of the query is obtained by using the Support Vector Machines (SVM).
Submitted by Susana Figueroa Navarro (susana.figueroa.n@unir.net) on 2021-07-07T09:18:45Z
No. of bitstreams: 1
ijimai20164_1_1_pdf_95245.pdf: 1694903 bytes, checksum: 08127b4ffd49d73236de8faf6cc1fa9d (MD5); Made available in DSpace on 2021-07-07T09:18:45Z (GMT). No. of bitstreams: 1
ijimai20164_1_1_pdf_95245.pdf: 1694903 bytes, checksum: 08127b4ffd49d73236de8faf6cc1fa9d (MD5)
</summary>
</entry>
</feed>
