Spotting Separator Points at Line Terminals in Compressed Document Images for Text-line Segmentation
Line separators are used to segregate text-lines from one another in document image analysis. Finding the separator points at every line terminal in a document image would enable text-line segmentation. In particular, identifying the separators in handwritten text could be a thrilling exercise. Obviously it would be challenging to perform this in the compressed version of a document image and that is the proposed objective in this research. Such an effort would prevent the computational burden of decompressing a document for text-line segmentation. Since document images are generally compressed using run length encoding (RLE) technique as per the CCITT standards, the first column in the RLE will be a white column. The value (depth) in the white column is very low when a particular line is a text line and the depth could be larger at the point of text line separation. A longer consecutive sequence of such larger depth should indicate the gap between the text lines, which provides the separator region. In case of over separation and under separation issues, corrective actions such as deletion and insertion are suggested respectively. An extensive experimentation is conducted on the compressed images of the benchmark datasets of ICDAR13 and Alireza et al [17] to demonstrate the efficacy.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Compressed Domain Prior-Guided Video Super-Resolution for Cloud Gaming Content
Cloud gaming is an advanced form of Internet service that necessitates local terminals to decode within limited resources and time latency. Super-Resolution (SR) techniques are often employed on these terminals as an eff…
QuantizationSuper-ResolutionVideo Super-ResolutionSmall-Footprint Keyword Spotting with Multi-Scale Temporal Convolution
Keyword Spotting (KWS) plays a vital role in human-computer interaction for smart on-device terminals and service robots. It remains challenging to achieve the trade-off between small footprint and high accuracy for KWS …
Efficient Neural NetworkKeyword SpottingSmall-Footprint Keyword SpottingComputing all-vs-all MEMs in grammar-compressed text
We describe a compression-aware method to compute all-vs-all maximal exact matches (MEM) among strings of a repetitive collection $\mathcal{T}$. The key concept in our work is the construction of a fully-balanced grammar…
AllMulti-Target Cooperative Visible Light Positioning: A Compressed Sensing Based Framework
In this paper, a compressed sensing (CS) based framework of multi-target cooperative visible light positioning (VLP) is formulated to realize simultaneous highaccuracy localization of multiple targets. The light emitting…
compressed sensingA Scalable Heuristic for Fastest-Path Computation on Very Large Road Maps
Fastest-path queries between two points in a very large road map is an increasingly important primitive in modern transportation and navigation systems, thus very efficient computation of these paths is critical for syst…