ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

feed icon rss

Your email was sent successfully. Check your inbox.

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

Proceed reservation?

Export
Filter
  • 1970-1974  (2)
Collection
Publisher
Years
Year
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    International journal of parallel programming 1 (1972), S. 43-65 
    ISSN: 1573-7640
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Automatic recognition of handwritten alphanumeric characters is designed by making use of topological feature extraction and multi-level decision making. By properly specifying a set of easily detectable topological features, it is possible to convert automatically the handwritten characters into stylized forms and to classify them into primary categories. Each category contains one or several character pattern classes with similar topological configurations. Final recognition is accomplished by a secondary stage which performs local analysis on the characters in each primary category. The recognition system consists of two stages, global recognition followed by local recognition. Automatic character stylization results in pattern clustering which simplifies the classification tasks considerably, while allowing a high degree of generality in the acceptable writing format. Simulation of this scheme on a digital computer has shown only 2% misrecognition.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    International journal of parallel programming 2 (1973), S. 257-268 
    ISSN: 1573-7640
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract The notion of cliques is the logical starting point for a broad class of clustering problems. Algorithms for the identification of the cliques of a graph are of great importance in automatic classification by computer. This paper presents an approach which proceeds recursively from the given graph downward through a chain of subgraphs. The proposed approach permits the removal of more than a single point in the progression from one subgraph to the next, thus reducing the number of iterations required for completion.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...