Text line Segmentation in Compressed Representation of Handwritten Document using Tunneling Algorithm
AbstractOperating directly on the compressed document images without decompression would be an additional advantage for storage and transmission. In this research work, we perform text line segmentation directly in compressed representation of an unconstraint handwritten document image using tunneling algorithm. In this relation, we make use of text line terminal point which is the current state-of-the-art that enables text line segmentation. The terminal points spotted along both margins (left and right) of a document image for every text line are considered as source and target respectively. The effort in spotting the terminal positions is performed directly in the compressed domain. The tunneling algorithm uses a single agent to identify the coordinate positions in the compressed representation to perform text-line segmentation of the document. The agent starts at a source point and progressively tunnels a path routing in between two adjacent text lines and reaches the probable target. The agent’s navigation path from source to the target bypassing obstacles, if any, results in segregating the two adjacent text lines. However, the target point would be known only when the agent reaches destination; this is applicable for all source points and henceforth we could analyze the correspondence between source and target nodes. In compressed representation of a document image, the continuous pixel values in a spatial domain are available in the form of batches known as white-runs (background) and black-runs (foreground). These batches are considered as features of a document image represented in a Grid map. Performing text-line segmentation using these features makes the system inexpensive compared to spatial domain processing. Artificial Intelligence in Expert systems with dynamic programming and greedy strategies is employed for every search space for tunneling. An exhaustive experimentation is carried out on various benchmark datasets including ICDAR13 and the performances are reported.
Adjeroh D, Bell T, Mukherjee A (2013) Pattern matching in compressed texts and images. Now Publishers.
Andrés Cano, Manuel Gómez-Olmedo, Serafín Moral, Joaquín Abellán: Hill-climbing and branch-and-bound algorithms for exact and approximate inference in credal networks. Int. J. Approx. Reasoning 44(3): 261-280 (2007)
Amarnath R & P. Nagabhushan. (2017). Spotting Separator points at Line terminals in Compressed Document Images for Text-line Segmentation, International Journal of Computer Applications, Volume 172 – Number 4
Alireza Alaei, P. Nagabhushan, Umapada Pal, Fumitaka Kimura, "An Effcient Skew Estimation Technique for Scanned Documents:An Application of Piece-wise Painting Algorithm", Journal of Pattern Recognition Research (JPRR), Vol 11, No 1 doi:10.13176/11.635 (2016).
Ahmed R, Al-Khatib WG, Mahmoud S (2017) A survey on handwritten documents word spotting. Int J Multimed Inf Retr 6(1):31–47
Breuel TM (2008) Binary morphology and related operations on run-length representations. In: International conference on computer vision theory and applications - VISAPP, pp 159–166
Cvision Technologies (2015). Reduce tiff file size (http://www.cvisiontech.com/file-formats/tiff/reduce-tifffile-size.html)
Gonzalez RC, Woods RE (2009) Digital Image Processing, 3rd edn. Pearson, New Delhi
Hinds S, Fisher J, D’Amato D (1990) A document skew detection method using run-length encoding and the hough transform. In: Proceedings of 10th international conference on pattern recognition, vol 1, pp 464–468
Kia O (1997) Document compression and analysis. PhD thesis, Institute for Advanced Computer Studies, University of Maryland
Mukhopadhyay J (2011) Image and video processing in compressed domain. Chapman and Hall/CRC, Boca Raton
Miano J (1999) Compressed image file formats: JPEG, PNG, GIF, XBM, BMP. ACM Press, New York
Mohammed Javed, Krishnanand S.H, P. Nagabhushan, & B. B. Chaudhuri. (2016). Visualizing CCITT Group 3 and Group 4 TIFF Documents and Transforming to Run-Length Compressed Format Enabling Direct Processing in Compressed Domain International Conference on Computational Modeling and Security (CMS 2016) Procedia Computer Science 85 (2016) 213 – 221. Elsevier.
Mohammed Javed, P. Nagabhushan & Bidyut B. Chaudhuri. (2017). A review on document image analysis techniques directly in the compressed domain. Artif Intell Rev. s10462-017-9551-9. Springer Science+Business Media Dordrecht 2017.
Nazih Ouwayed, Abdel Bela¨ıd. Multi-Oriented Text Line Extraction from Handwritten Arabic Documents. 8th IAPR International Workshop on Document Analysis Systems - DAS’08, Sep 2008, Nara, Japan. pp.339-346, 2008.
Nikolaos Stamatopoulos, Basilis Gatos, Georgios Louloudis, Umapada Pal, & Alireza Alaei Proceeding. (2013). ICDAR '13 Proceedings of the 2013 12th International Conference on Document Analysis and Recognition Pages 1402-1406
N. Arvanitopoulos Darginis and S. Süsstrunk. Seam Carving for Text Line Extraction on Color and Grayscale Historical Manuscripts. 14th International Conference on Frontiers in Handwriting Recognition (ICFHR), Crete, Greece, 2014.
Peter Norvig. Paradigms of Artificial Intelligence Programming 1st Edition. Case Studies in Common Lisp.28th June 2014
Rath TM, Manmatha R (2007) Word spotting for historical documents. IJDAR 9(2–4):139–152
Ronse C, Devijver P (1984) Connected components in binary images: the detection problem. Research Studies Press, Letchworth
Shima Y, Kashioka S, Higashino J (1989) A high-speed rotationmethod for binary images based on coordinate operation of run data. Syst Comput Jpn 20(6):91–102
ShimaY, Kashioka S, Higashino J (1990) A high-speed algorithm for propagation-type labeling based on block sorting of runs in binary images. In: Proceedings of 10th international conference on pattern recognition (ICPR), vol 1, pp 655–658
Sayood K (2012) Introduction to data compression, 4th edn. Morgan Kaufmann, Burlington
Salomon D, Motta G, Bryant D (2010) Handbook of data compression. Springer, London
T.4-Recommedation (1985) Standardization of group 3 facsimile apparatus for document transmission, terminal equipments and protocols for telematic services, vol. vii, fascicle, vii. 3, Geneva. Technical report
T.6-Recommendation (1985) Standardization of group 4 facsimile apparatus for document transmission, terminal equipments and protocols for telematic services, vol. vii, fascicle, vii. 3, Geneva. Technical report
Wshah S, Kumar G, Govindaraju V (2012a). Multilingual word spotting in offline handwritten documents. In: ICPR, pp 310–313
Wshah S, Kumar G, Govindaraju V(2012b) Script independent word spotting in offline handwritten documents based on hidden markov models. In: ICFHR, pp 14–19
Yong X, Guangri Q, Yongdong X, Yushan S (2010) Keyword spotting in degraded document using mixed ocr and word shape coding. In: IEEE international conference on intelligent computing and intelligent systems, pp 411–414
Zeyad Abd Algfoor, Mohd Shahrizal Sunar, & Afnizanfaizal Abdullah. (2017). A new weighted pathfinding algorithm to reduce the search time on grid maps. Expert Systems with Applications: An International Journal archive Volume 71 Issue C, April 2017. Pages 319-331
Zhayida Simayijiang & Stefanie Grimm “Segmentation Graph-Cut”.
Copyright (c) 2018 International Journal of Intelligent Systems and Applications in Engineering
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
All papers should be submitted electronically. All submitted manuscripts must be original work that is not under submission at another journal or under consideration for publication in another form, such as a monograph or chapter of a book. Authors of submitted papers are obligated not to submit their paper for publication elsewhere until an editorial decision is rendered on their submission. Further, authors of accepted papers are prohibited from publishing the results in other publications that appear before the paper is published in the Journal unless they receive approval for doing so from the Editor-In-Chief.
IJISAE open access articles are licensed under a Creative Commons Attribution-ShareAlike 4.0 International License. This license lets the audience to give appropriate credit, provide a link to the license, and indicate if changes were made and if they remix, transform, or build upon the material, they must distribute contributions under the same license as the original.