Skip to main content

OCR System for Poor Quality Images Using Chain-Code Representation

Research Abstract
Abstract The field of Optical Character Recognition (OCR) has gained more attention in the recent years because of its importance and applications. Some examples of OCR are: video indexing, references archiving, car-plate recognition, and data entry. In this work a robust system for OCR is presented. The proposed system recognizes text in poor quality images. Characters are extracted from the given poor quality image to be recognized using chain-code representation. The proposed system uses Google online spelling to suggest replacements for words which are misspelled during the recognition process. For evaluating the proposed system, the born-digital dataset ICDAR is used. The proposed system achieves 74.02 % correctly recognized word rate. The results demonstrate that the proposed system recognizes text in poor quality images efficiently.
Research Authors
Ali H. Ahmed, Mahmoud Afifi , Mostafa Korashy, Ebram K. William, Mahmoud Abd El-sattar, Zenab Hafez
Research Department
Research Journal
Advances in Intelligent Systems and Computing
Research Member
Research Pages
151-161
Research Publisher
Springer
Research Rank
3
Research Vol
Vol 407
Research Website
http://link.springer.com/chapter/10.1007/978-3-319-26690-9_14
Research Year
2015

OCR System for Poor Quality Images Using Chain-Code Representation

Research Abstract
Abstract The field of Optical Character Recognition (OCR) has gained more attention in the recent years because of its importance and applications. Some examples of OCR are: video indexing, references archiving, car-plate recognition, and data entry. In this work a robust system for OCR is presented. The proposed system recognizes text in poor quality images. Characters are extracted from the given poor quality image to be recognized using chain-code representation. The proposed system uses Google online spelling to suggest replacements for words which are misspelled during the recognition process. For evaluating the proposed system, the born-digital dataset ICDAR is used. The proposed system achieves 74.02 % correctly recognized word rate. The results demonstrate that the proposed system recognizes text in poor quality images efficiently.
Research Authors
Ali H. Ahmed, Mahmoud Afifi , Mostafa Korashy, Ebram K. William, Mahmoud Abd El-sattar, Zenab Hafez
Research Department
Research Journal
Advances in Intelligent Systems and Computing
Research Member
Research Pages
151-161
Research Publisher
Springer
Research Rank
3
Research Vol
Vol 407
Research Website
http://link.springer.com/chapter/10.1007/978-3-319-26690-9_14
Research Year
2015

OCR System for Poor Quality Images Using Chain-Code Representation

Research Abstract
Abstract The field of Optical Character Recognition (OCR) has gained more attention in the recent years because of its importance and applications. Some examples of OCR are: video indexing, references archiving, car-plate recognition, and data entry. In this work a robust system for OCR is presented. The proposed system recognizes text in poor quality images. Characters are extracted from the given poor quality image to be recognized using chain-code representation. The proposed system uses Google online spelling to suggest replacements for words which are misspelled during the recognition process. For evaluating the proposed system, the born-digital dataset ICDAR is used. The proposed system achieves 74.02 % correctly recognized word rate. The results demonstrate that the proposed system recognizes text in poor quality images efficiently.
Research Authors
Ali H. Ahmed, Mahmoud Afifi , Mostafa Korashy, Ebram K. William, Mahmoud Abd El-sattar, Zenab Hafez
Research Department
Research Journal
Advances in Intelligent Systems and Computing
Research Member
Research Pages
151-161
Research Publisher
Springer
Research Rank
3
Research Vol
Vol 407
Research Website
http://link.springer.com/chapter/10.1007/978-3-319-26690-9_14
Research Year
2015

A Secure Technique for Construction and Maintenance of a Trusted Mobile Backbone Network in MANET

Research Abstract
Mobile ad hoc network (MANET) has a distributed and uncontrolled nature in which all nodes are considered trusted and contribute in the route discovery process. Accordingly, MANET is vulnerable to many types of routing attacks. One of the most popular MANET routing protocol that is vulnerable to different attacks is ad hoc on demand distance vector (AODV) routing protocol. In this paper, a mobile backbone network of trusted nodes is proposed to enhance AODV security with minimum overhead. The proposed backbone network does not violate the MANET mobility characteristic. It is constructed from randomly moving regular MANET nodes based on their trust value, location, and power. The backbone network monitors regular nodes as well as each other to periodically estimate monitoring trust values which represent the reliability of each node in the network. The simulation results show that the backbone network is trustable, has dynamic behavior, and has good coverage.
Research Authors
Hosny M. Ibrahim, Nagwa M. Omar, Ebram K. William
Research Department
Research Journal
The 12th IEEE International Conference on Networking, Sensing and Control, ICNSC15
Research Member
Research Pages
116 - 121
Research Publisher
IEEE
Research Rank
3
Research Vol
NULL
Research Website
http://ieeexplore.ieee.org/xpl/login.jsp?tp=&arnumber=7116020&url=http%3A%2F%2Fieeexplore.ieee.org%2Fxpls%2Fabs_all.jsp%3Farnumber%3D7116020
Research Year
2015

Detection and Removal of Gray, Black and Cooperative Black Hole Attacks in AODV Technique

Research Abstract
Mobile ad hoc network (MANET) is an autonomous self-configuring infrastructure-less wireless network. MANET is vulnerable to a lot of routing security threats due to unreliability of its nodes that are highly involved in the routing process. In this paper, a new technique is proposed to enhance the security of one of the most popular MANET routing protocols that is called Ad hoc on Demand Distance Vector (AODV) with minimum routing overhead and high packet delivery ratio. The proposed technique intends to detect and remove black, gray, and cooperative black hole AODV attacks depending on a mobile backbone network constructed from randomly moving regular MANET nodes based on their trust value, location, and power. The backbone network monitors regular nodes as well as each other to periodically estimate monitoring trust values which represent the reliability of each node in the network. The drop in the monitoring trust value of any node is used as a clue to its malicious behavior. The backbone network also tries to bait the malicious nodes to reply to a request for a route to fake destination address. The proposed technique uses the control packets of the AODV to exchange its control information which highly reduces the overhead. The simulation results show that the performance of the proposed technique is more secure than AODV and the other recently introduced techniques.
Research Authors
Hosny M. Ibrahim, Nagwa M. Omar, Ebram K. William
Research Department
Research Journal
International Journal of Advanced Computer Science and Applications (IJACSA)
Research Pages
pp. 60-70
Research Publisher
The Science and Information Organization
Research Rank
1
Research Vol
Vol 6- No. 5
Research Website
http://thesai.org/Publications/ViewPaper?Volume=6&Issue=5&Code=ijacsa&SerialNo=11
Research Year
2015

Detection and Removal of Gray, Black and Cooperative Black Hole Attacks in AODV Technique

Research Abstract
Mobile ad hoc network (MANET) is an autonomous self-configuring infrastructure-less wireless network. MANET is vulnerable to a lot of routing security threats due to unreliability of its nodes that are highly involved in the routing process. In this paper, a new technique is proposed to enhance the security of one of the most popular MANET routing protocols that is called Ad hoc on Demand Distance Vector (AODV) with minimum routing overhead and high packet delivery ratio. The proposed technique intends to detect and remove black, gray, and cooperative black hole AODV attacks depending on a mobile backbone network constructed from randomly moving regular MANET nodes based on their trust value, location, and power. The backbone network monitors regular nodes as well as each other to periodically estimate monitoring trust values which represent the reliability of each node in the network. The drop in the monitoring trust value of any node is used as a clue to its malicious behavior. The backbone network also tries to bait the malicious nodes to reply to a request for a route to fake destination address. The proposed technique uses the control packets of the AODV to exchange its control information which highly reduces the overhead. The simulation results show that the performance of the proposed technique is more secure than AODV and the other recently introduced techniques.
Research Authors
Hosny M. Ibrahim, Nagwa M. Omar, Ebram K. William
Research Department
Research Journal
International Journal of Advanced Computer Science and Applications (IJACSA)
Research Member
Research Pages
pp. 60-70
Research Publisher
The Science and Information Organization
Research Rank
1
Research Vol
Vol 6- No. 5
Research Website
http://thesai.org/Publications/ViewPaper?Volume=6&Issue=5&Code=ijacsa&SerialNo=11
Research Year
2015

Using Handheld Mobile System To Address Illiteracy

Research Abstract
Handheld device systems have been used as tools for teaching people with special needs due to cognitive function enhancement by utility of multimedia, attractive graphics and user-friendly navigation. Can a handheld device system, such as cellular phone, be used for teaching illiterate people? This paper explores and exploits the possibility of the development of an educational mobile system to help the illiterate people in Egypt.
Research Authors
M. Samir Abou El-Seoud, AbdelGhani Karkar, Amal Dandashi, Islam Taj-Eddin, Jihad Al Ja’am
Research Department
Research Journal
International Journal of Computer Science and Information Security (IJCSIS)
Research Pages
77-84
Research Publisher
International Journal of Computer Science and Information Security (IJCSIS), ISSN 1947-5500 © IJCSIS, USA
Research Rank
1
Research Vol
volume 13, Number 6
Research Website
http://sites.google.com/site/ijcsis/
Research Year
2015

Additive Preconditioning in Matrix Computations

Research Abstract
We combine our novel SVD-free additive preconditioning with aggregation and other relevant techniques to facilitate the solution of a linear system of equations and other fundamental matrix computations. Our analysis and experiments show the power of our algorithms, guide us in selecting most effective policies of preconditioning and aggregation, and provide some new insights into these and related subjects. Compared to the popular SVD-based multiplicative preconditioners, our additive preconditioners are generated more readily and for a much larger class of matrices. Furthermore, they better preserve matrix structure and sparseness and have a wider range of applications (e.g., they facilitate the solution of a consistent singular linear system of equations and of the eigen-problem).
Research Authors
V. Pan, B. Murphy, R. Rosholt, D. Ivolgin, G. Qian , I. Taj-Eddin, Y. Tang, X. Yan
Research Department
Research Journal
Proceedings in Applied Mathematics and Mechanics, Published Online: Dec-12-2008.doi:10.1002/pamm.200701105
Research Pages
1021201-1021202
Research Publisher
Wiley Online Library
Research Rank
3
Research Vol
Volume 7, Number 1
Research Website
http://onlinelibrary.wiley.com/doi/10.1002/pamm.200710001/abstract
Research Year
2007

Additive Preconditioning and Aggregation in Matrix Computations

Research Abstract
We combine our novel SVD-free additive preconditioning with aggregation and other relevant techniques to facilitate the solution of a linear system of equations and other fundamental matrix computations. Our analysis and experiments show the power of our algorithms, guide us in selecting most effective policies of preconditioning and aggregation, and provide some new insights into these and related subjects. Compared to the popular SVD-based multiplicative preconditioners, our additive preconditioners are generated more readily and for a much larger class of matrices. Furthermore, they better preserve matrix structure and sparseness and have a wider range of applications (e.g., they facilitate the solution of a consistent singular linear system of equations and of the eigenproblem).
Research Authors
V. Pan, D. Ivolgin, B. Murphy, R. Rosholt, I. Taj-Eddin, Y. Tang, X. Yan



Research Department
Research Journal
Computers and Mathematics with Applications, ISSN 0898-1221, doi:10.1016/j.camwa.2004.03.022
Research Pages
1870-1886
Research Publisher
Elsevier B.V.
Research Rank
1
Research Vol
Volume 55, Number 8
Research Website
http://www.journals.elsevier.com/computers-and-mathematics-with-applications/
Research Year
2008

Dynamic Video Content Streaming

Research Abstract
Streaming video applications on the Internet generally have very high bandwidth requirements and yet are often unresponsive to network congestion. In order to avoid congestion collapse and improve video quality, these applications need to respond to congestion in the network by deploying mechanisms to reduce their bandwidth requirements under conditions of heavy load. Unfortunately current video applications scale to fit the available bandwidth without regard to the video content. In this paper a dynamic content-aware scaling mechanism will be presented that reduces the bandwidth occupied by an application. This has been achieved by dropping frames (temporal scaling) and by reducing the quality of the frames transmitted (quality scaling). Based on internet connection speed of the client, a streaming video client and server that is capable of scaling MPEG stream using temporal and quality scaling have been designed.
Research Authors
Adnan Shaout, Samir A El-seoud, Islam Taj-Eddin and Kamel H.shafa’amri




Research Department
Research Journal
International Journal of Computer Applications (IJCA), ISBN-(973-93-80869-40-8), Doi:10.5120/7669-0950



Research Pages
8-16
Research Publisher
Published by Foundation of Computer Science (FCS), New York, USA
Research Rank
1
Research Vol
Volume 49, Number 11
Research Website
http://www.ijcaonline.org/
Research Year
2012
Subscribe to