A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
In document analysis, information retrieval receives a lot of attention in terms of symbol and word spotting. ... In this paper, we explore different analytics of graphs constructed from words or graphical symbols, such as diffusion, shortest path, etc. to improve the performance of information retrieval methods in ... ACKNOWLEDGMENTS This work has been partially supported by the European Union's research and innovation program under the Marie Skłodowska-Curie grant agreement No. 665919, the Spanish project TIN2015-70924 ...doi:10.1109/icdar.2017.84 dblp:conf/icdar/Riba0DLF17 fatcat:idzk22jt55c5lcnqooxioz3s2q
Rothacker et al.  exploits the use of the BoW representation to feed a HMM and avoids the segmentation step by means of a patch-based framework. ... Documents are represented with a grid of HOG descriptors, and a sliding-window approach is used to locate the document regions that are most similar to the query. ... This variability is usually much higher in a multiwriter scenario. ...doi:10.1016/j.patcog.2014.06.005 fatcat:7r4a6krnubdujmjspw2g34onxi
Finally, we introduce tools to support visualisation of the extracted features in a comparative way, showing how they can best be exploited in the implementation of a content-based image retrieval (CBIR ... in terms of the deployment of feature extraction techniques and handwriting metrics. ... They also thank Dr Catherine Richardson for information provided on the documents comprising the MEMDB database. ...doi:10.1142/s0218001416530013 fatcat:x2a3jb3uvfdehd6onaszti3w7i
Vast collections of documents available in image format need to be efficiently digitized for information retrieval purposes. ... Many approaches from the document analysis and recognition research community have been proposed to alleviate the search process. ... ACKNOWLEDGEMENTS With the completion of this thesis, a large chapter of my life is coming to a close. ...doi:10.26268/heal.uoi.11485 fatcat:k453klfpmncivj33r2iggojm5y
in multiwriter cloud services is non-trivial. ... Using this we are able to show exponential extension complexity for the cut polytope of a large number of graphs, including those used in quantum information and suspensions of cubic planar graphs. ... Extension complexity of stable set polytopes of split-graph-free perfect graphs Proposed by Samuel Fiorini. ...doi:10.4230/dagrep.3.2 fatcat:xz3rq657bvb45ln5gxn34jtciq