Library

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Integrated text and line-art extraction from a topographic map (2000)
    Springer
    International journal on document analysis and recognition 2 (2000), S. 177-185 
    Details
    ISSN: 1433-2825
    Keywords: Key words:Graphics recognition – Map processing – Text-graphics segmentation – Geographic information systems – Character recognition – Cooperative processing – Interactive processing – Adaptation – Form processing
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract. Our proposed approach to text and line-art extraction requires accurately locating a text-string box and identifying external line vectors incident on the box. The results of extrapolating these vectors inside the box are passed to an experimental single-font optical character reader (OCR) program, specifically trained for the font used for street labels. In the first evaluation experiment, automated techniques are used to identify the boxes and the line vectors. In the second, more comprehensive, experiment an operator marks these using a graphical user interface. OCR results on 544 instances of overlapped street-name boxes show the following improvements due to the integrated processing: the error rate is reduced from 4.1% to 2.0% for characters and from 11.8% to 6.4% for words.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/s100320050004
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    Parallel consistent labeling algorithms (1987)
    Springer
    International journal of parallel programming 16 (1987), S. 341-364 
    Details
    ISSN: 1573-7640
    Keywords: Arc consistency ; parallel algorithms ; constraint satisfaction ; inherent parallelism
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Mackworth and Freuder have analyzed the time complexity of several constraint satisfaction algorithms.(1) Mohr and Henderson have given new algorithms, AC-4 and PC-3, for arc and path consistency, respectively, and have shown that the arc consistency algorithm is optimal in time complexity and of the same order space complexity as the earlier algorithms.(2) In this paper, we give parallel algorithms for solving node and arc consistency. We show that any parallel algorithm for enforcing are consistency in the worst case must have O(na) sequential steps, wheren is number of nodes, anda is the number of labels per node. We give several parallel algorithms to do arc consistency. It is also shown that they all have optimal time complexity. The results of running the parallel algorithms on a BBN Butterfly multiprocessor are also presented.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01407901
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...