ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

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
    A segmentation-free approach to text recognition with application to Arabic text (1998)
    Springer
    International journal on document analysis and recognition 1 (1998), S. 147-166 
    Details
    ISSN: 1433-2825
    Keywords: Key words:Arabic characters – Optical character recognition – Segmentation – Cursive script – Degraded text recognition
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract. In recognizing cursive scripts, a major undertaking is segmenting cursive words into characters and isolating merged characters. The segmentation is usually the pivotal stage in the system to which a sizable portion of processing is devoted and a considerable share of recognition errors is attributed. The most notable feature of Arabic writing is its cursiveness. Compared to other features, the cursiveness of Arabic words poses the most difficult problem for recognition algorithms. In this work, we describe the design and implementation of an Arabic word recognition system. To recognize a word, the system does not segment it into characters in advance; rather, it recognizes the input word by detecting a set of “shape primitives” on the word. It then matches the regions of the word (represented by the detected primitives) with a set of symbol models. A spatial arrangement of symbol models that are matched to regions of the word, then, becomes the description of the recognized word. Since the number of potential arrangements of all symbol models is combinatorially large, the system imposes a set of constraints that pertain to word structure and spatial consistency. The system searches the space made up of the arrangements that satisfy the constraints, and tries to maximize the a posteriori\/ probability of the arrangement of symbol models. We measure the accuracy of the system not only on words but on isolated characters as well. For isolated characters, it has a recognition rate of 99.7% for synthetically degraded symbols and 94.1% for scanned symbols. For isolated words the system has a recognition rate of 99.4% for noise-free words, 95.6% for synthetically degraded words, and 73% for scanned words.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/s100320050014
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    Performance assessment of near-perfect machines (1989)
    Springer
    Machine vision and applications 2 (1989), S. 1-16 
    Details
    ISSN: 1432-1769
    Keywords: performance assessment ; error rate ; acceptance rate ; rejection rate ; performance testing
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract This is a short, practical note which provides some reference operating curves of false acceptance rate versus missed acceptance rate as a function ofN, the number of test samples andf 0, the specified machine error rate requirement. The only important statistical assumption made is the statistical independence of the samples in the test. The analysis shows that, to equalize the false acceptance rate with the missed acceptance rate, the machine acceptance test must use a thresholdK *=Nf 0 − 1. If there areK * or fewer failures, then the machine acceptance test is passed. Otherwise, it fails. Furthermore, with such an acceptance test, the probability that the test is accurate depends only on the productNf 0. WhenNf 0 = 10, the probability that the test is accurate is 0.875. WhenNf 0 = 20, the probability that the test is accurate is 0.912. These results indicate the necessity of large sample sizes when performing acceptance testing of near-perfect machines whose required error ratef 0 is very close to zero.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01214393
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    Error propagation in machine vision (1994)
    Springer
    Machine vision and applications 7 (1994), S. 93-114 
    Details
    ISSN: 1432-1769
    Keywords: Error propagation ; Measurement ; Edge perturbation ; Noise ; Inspection ; Analysis of variance
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Machine vision systems that perform inspection tasks must be capable of making measurements. A vision system measures an image to determine a measurement of the object being viewed. The image measurement depends on several factors, including sensing, image processing, and feature extraction. We consider the error that can occur in measuring the distance between two corner points of the 2D image. We analyze the propagation of the uncertainty in edge point position to the 2D measurements made by the vision system, from 2D curve extraction, through point determination, to measurement. We extend earlier work on the relationship between random perturbation of edge point position and variance of the least squares estimate of line parameters and analyze the relationship between the variance of 2D points.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01215805
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 4
    Electronic Resource
    Electronic Resource
    Machine vision in the 1990s: Applications and how to get there (1991)
    Springer
    Machine vision and applications 4 (1991), S. 113-126 
    Details
    ISSN: 1432-1769
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01257826
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 5
    Electronic Resource
    Electronic Resource
    MUSER: A prototype musical score recognition system using mathematical morphology (1993)
    Springer
    Machine vision and applications 6 (1993), S. 140-150 
    Details
    ISSN: 1432-1769
    Keywords: Mathematical morphology ; Low-level vision ; Feature extraction ; Connected components ; Music notation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Music representation utilizes a fairly rich repertoire of symbols. These symbols appear on a score sheet with relatively little shape distortion, differing from the prototype symbol shapes mainly by a positional translation and scale change. The prototype system we describe in this article is aimed at recognizing printed music notation from digitized music score images. The recognition system is composed of two parts: a low-level vision module that uses morphological algorithms for symbol detection and a high-level module that utilizes prior knowledge of music notation to reason about spatial positions and spatial sequences of these symbols. The high-level module also employs verification procedures to check the veracity of the output of the morphological symbol recognizer. The system produces an ASCII representation of music scores that can be input to a music-editing system. Mathematical morphology provides us the theory and the tools to analyze shapes. This characteristic of mathematical morphology lends itself well to analyzing and subsequently recognizing music scores that are rich in well-defined musical symbols. Since morphological operations can be efficiently implemented in machine vision systems that have special hardware support, the recognition task can be performed in near real-time. The system achieves accuracy in excess of 95% on the sample scores processed so far with a peak accuracy of 99.7% for the quarter and eighth notes, demonstrating the efficacy of morphological techniques for shape extraction.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01211937
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 6
    Electronic Resource
    Electronic Resource
    Random perturbation models for boundary extraction sequence (1997)
    Springer
    Machine vision and applications 9 (1997), S. 229-239 
    Details
    ISSN: 1432-1769
    Keywords: Key words: Random perturbation models – Boundary extraction sequence – Computer vision algorithms – Performance characterization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract. Computer vision algorithms are composed of different sub-algorithms often applied in sequence. Determination of the performance of a total computer vision algorithm is possible if the performance of each of the sub-algorithm constituents is given. The performance characterization of an algorithm has to do with establishing the correspondence between the random variations and imperfections in the output data and the random variations and imperfections in the input data. In this paper we illustrate how random perturbation models can be set up for a vision algorithm sequence involving edge finding, edge linking, and gap filling. By starting with an appropriate noise model for the input data we derive random perturbation models for the output data at each stage of our example sequence. By utilizing the perturbation model for edge detector output derived, we illustrate how pixel noise can be successively propagated to derive an error model for the boundary extraction output. It is shown that the fragmentation of an ideal boundary can be described by an alternating renewal process and that the parameters of the renewal process are related to the probability of correct detection and grouping at the edge linking step. It is also shown that the characteristics of random segments generated due to gray-level noise are functions of the probability of false alarm of the edge detector. Theoretical results are validated through systematic experiments.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/s001380050044
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 7
    Electronic Resource
    Electronic Resource
    Proteus: A reconfigurable computational network for computer vision (1995)
    Springer
    Machine vision and applications 8 (1995), S. 85-100 
    Details
    ISSN: 1432-1769
    Keywords: Proteus ; INSIGHT ; Reconfigurable computational network ; MIMD ; Enhanced hypercube ; Parallel computing
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract The Proteus architecture is a highly parallel, multiple instruction, multiple data machine (MIMD) optimized for large granularity tasks such as machine vision and image processing. The system can achieve 20 gigaflops (80 gigaflops peak). It accepts data via multiple serial links at a rate of up to 640 MB/S. The system employs a hierarchical reconfigurable interconnection network with the highest level being a circuit-switchedenhanced hypercube, serial interconnection network for internal data transfers. The system is designed to use 256 to 1024 RISC processors. The processors use 1-MB externalread/write allocating caches for reduced multiprocessor contention. The system detects, locates, and replaces faulty subsystems using redundant hardware to facilitatefault tolerance. The parallelism is directly controllable through an advanced software system for partitioning, scheduling, and development. System software includes a translator for the INSIGHT language, a parallel debugger, lowand high-level simulators, and a message-passing system for all control needs. Image-processing application software includes a variety of point operators, neighborhood operators, convolution, and the mathematical morphology operations of binary and gray-scale dilation, erosion, opening, and closing.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01213474
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 8
    Electronic Resource
    Electronic Resource
    Pipeline architectures for morphologie image analysis (1988)
    Springer
    Machine vision and applications 1 (1988), S. 23-40 
    Details
    ISSN: 1432-1769
    Keywords: image analysis ; morphology ; pipeline architectures ; parallel processing ; programmable delay memories
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract The concepts of mathematical morphology provide some very powerful tools with which low-level image analysis can be performed. Low-level analysis, by its very nature, involves repeated computations over large, regular data structures. Parallelism appears to be a necessary attribute of a hardware system which can efficiently perform such image-analysis tasks, and there is a variety of forms that this parallelism can take. This paper gives a tutorial description of the basic morphological transformations and demonstrates how the basic morphological transformations can be implemented in the pipeline processing form of parallelism. Correspondingly, plausible designs for pipeline architectures are developed.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01212310
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 9
    Electronic Resource
    Electronic Resource
    A probabilistic matching algorithm for computer vision (1994)
    Springer
    Annals of mathematics and artificial intelligence 10 (1994), S. 85-124 
    Details
    ISSN: 1573-7470
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract A model-based vision system attempts to find correspondences between features of an object model and features detected in an image for purposes of recognition, localization, or inspection. In this paper we pose the relational matching problem as a special case of the pattern complex recognition problem and propose a probabilistic model to describe the images of an object. This Bayesian approach allows us to make explicit statements of how an image is formed from a model, and hence define a natural matching cost that can be used to guide a heuristic search in finding the best observation mapping. Furthermore, we show that even though the nature of the feature matching problem is exponential, the use of the proposed algorithm keeps the size of the problem under control, by efficiently reducing the search space.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01530945
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 10
    Electronic Resource
    Electronic Resource
    Vector-space solution for a morphological shape-decomposition problem (1992)
    Springer
    Journal of mathematical imaging and vision 2 (1992), S. 51-82 
    Details
    ISSN: 1573-7683
    Keywords: mathematical morphology ; decomposition ; vector space
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract We define a restricted domain as the discrete set of points representing any convex, four-connected, filled polygon whose (i) vertices lie on the lattice points, (ii) interior angles are multiples of 45°, and (iii) number of sides are at most eight. We describe the boundary code and discrete half-plane representation and use them for representing restricted domains. Morphological operations of dilation and n-fold dilation on the restricted domains with structuring elements that are also restricted domains are expressed in terms of the above representations. We give algorithms for these operations and prove that they are of O(1) complexity and hence are independent of the size of the objects. We prove that there is a set of 13 restricted domains {K 1, K 2, ..., K 13} such that any given restricted domain K is expressible as % MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr% 4rNCHbGeaGqiVu0Je9sqqrpepC0xbbL8F4rqqrFfpeea0xe9Lq-Jc9% vqaqpepm0xbba9pwe9Q8fs0-yqaqpepae9pg0FirpepeKkFr0xfr-x% fr-xb9adbaqaaeGaciGaaiaabeqaamaabaabaaGcbaGaam4saiabg2% da9iaadUeadaWgaaWcbaGaaGimaaqabaGccqGHvksXdaqadeqaamaa% xababaGaeyyLIumaleaacaWGRbWaaSbaaWqaaiaaigdaaeqaaaWcbe% aakiaadUeadaWgaaWcbaGaaGymaaqabaaakiaawIcacaGLPaaacqGH% vksXdaqadeqaamaaxababaGaeyyLIumaleaacaWGRbWaaSbaaWqaai% aaikdaaeqaaaWcbeaakiaadUeadaWgaaWcbaGaaGymaaqabaaakiaa% wIcacaGLPaaacqGHvksXcaGGUaGaaiOlaiaac6cacqGHvksXdaqade% qaamaaxababaGaeyyLIumaleaacaWGRbWaaSbaaWqaaiaaigdacaaI% ZaaabeaaaSqabaGccaWGlbWaaSbaaSqaaiaaigdacaaIZaaabeaaaO% GaayjkaiaawMcaaaaa!5B9E!\[K = K_0 \oplus \left( {\mathop \oplus \limits_{k_1 } K_1 } \right) \oplus \left( {\mathop \oplus \limits_{k_2 } K_1 } \right) \oplus ... \oplus \left( {\mathop \oplus \limits_{k_{13} } K_{13} } \right)\] where % MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr% 4rNCHbGeaGqiVu0Je9sqqrpepC0xbbL8F4rqqrFfpeea0xe9Lq-Jc9% vqaqpepm0xbba9pwe9Q8fs0-yqaqpepae9pg0FirpepeKkFr0xfr-x% fr-xb9adbaqaaeGaciGaaiaabeqaamaabaabaaGcbaWaaeWabeaada% WfqaqaaiabgwPifdWcbaGaam4AamaaBaaameaacaWGPbaabeaaaSqa% baGccaWGlbWaaSbaaSqaaiaadMgaaeqaaaGccaGLOaGaayzkaaaaaa!3DCB!\[\left( {\mathop \oplus \limits_{k_i } K_i } \right)\] represents the k i -fold dilation of K i and K 0 is a translation. We show that this entails a linear transformation from a 13-dimensional space in which restricted domains are represented in terms of n-fold dilations of the 13 basis structuring elements, to an eight-dimensional space in which restricted domains are represented in terms of their eight side lengths. Furthermore, we show that any particular decomposition forms a particular solution of this transformation and that finding all possible dilation decompositions of a restricted domain is equivalent to finding the general solution of this transformation. Finally, we derive a finite-step algorithm for finding a particular decomposition and then give an algorithm for finding all possible decompositions.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF00123881
    Location Call Number Expected 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...