The new non-parametric approach to unsegmented text recognition builds two bipartite graphs that result from the feature-level and lexical comparisons of the same word against a reference string which need not include the query word. The lexical graph preserves the relative order of edges in the feature graph corresponding to correctly recognized features. This observation leads to a subgraph-matching formulation of the recognition problem. An initial implementation proves the robustness of the approach for up-to 20% noise introduced in the feature-level graph.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Indirect Symbolic Correlation Approach to Unsegmented Text Recognition


    Beteiligte:
    Nagy, G. (Autor:in) / Seth, S. C. (Autor:in) / Mehta, S. K. (Autor:in) / Lin, Y. (Autor:in)


    Erscheinungsdatum :

    2003-06-01


    Format / Umfang :

    132763 byte





    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    Indirect method estimates of correlation function

    В.П. Денисюк / А.А. Світлична | DOAJ | 2005

    Freier Zugriff

    Segmentation Free Approach for Printed Arabic Text Recognition

    Tolba, M. F. / Moty, G. A. / Mahmoud, A. | British Library Online Contents | 2003


    A Symbolic Traffic Control Approach

    Boulmakoul, A. / Sellam, S. / IFAC | British Library Conference Proceedings | 1995


    Symbolic road marking recognition using convolutional neural networks

    Ahmad, Touqeer / Ilstrup, David / Emami, Ebrahim et al. | IEEE | 2017


    OBJECT RECOGNITION VIA INDIRECT SIGNAL REFLECTION

    STILLER JOHANNES / ZIEGLER EUGEN | Europäisches Patentamt | 2020

    Freier Zugriff