ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

Your email was sent successfully. Check your inbox.

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

Proceed reservation?

Export
Filter
  • Articles  (23)
  • Matching
  • pattern recognition
  • Springer  (23)
  • Annual Reviews
  • Elsevier
  • Institute of Physics
  • Oxford University Press
  • Springer Nature
  • Thomas Telford
  • Wiley
  • 2005-2009
  • 1990-1994  (13)
  • 1980-1984  (10)
  • Computer Science  (23)
  • Architecture, Civil Engineering, Surveying
Collection
  • Articles  (23)
Publisher
  • Springer  (23)
  • Annual Reviews
  • Elsevier
  • Institute of Physics
  • Oxford University Press
  • +
Years
Year
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 22 (1982), S. 12-38 
    ISSN: 1436-4646
    Keywords: Graph ; Matching ; Branching ; Linear Programming ; Polyhedron
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Matching forests generalize branchings in a directed graph and matchings in an undirected graph. We present an efficient algorithm, the PMF Algorithm, for the problem: given a mixed graphG and a real weight on each of its edges, find a perfect matching forest of maximum weight-sum. The PMF Algorithm proves the sufficiency of a linear system which definesP = (G) andP(G), the convex hull of incidence vectors of perfect matching forests and matching forests respectively ofG. The algorithm also provides a generalization of Tutte's theorem on the existence of perfect matchings in an undirected graph.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 22 (1982), S. 1-11 
    ISSN: 1436-4646
    Keywords: Graph ; Matching ; Branching ; Linear Programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We introduce the concept of matching forests as a generalization of branchings in a directed graph and matchings in an undirected graph. Given special weights on the edges of a mixed graph, we present an efficient algorithm for finding an optimum weight-sum matching forest. The algorithm is a careful application of known branching and matching algorithms. The maximum cardinality matching forest problem is solved as a special case.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 22 (1982), S. 52-70 
    ISSN: 1436-4646
    Keywords: Duality ; Graph ; Matching ; Polytope
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract The matching polytope is the convex hull of the incidence vectors of all (not necessarily perfect) matchings of a graphG. We consider here the problem of computing the dimension of the face of this polytope which contains the maximum cardinality matchings ofG and give a good characterization of this quantity, in terms of the cyclomatic number of the graph and families of odd subsets of the nodes which are always nearly perfectly matched by every maximum matching. This is equivalent to finding a maximum number of linearly independent representative vectors of maximum matchings ofG; the size of such a set is called thematching rank ofG. We also give in the last section a way of computing that rank independently of those parameters. Note that this gives us a good lower bound on the number of those matchings.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 65 (1994), S. 139-150 
    ISSN: 1436-4646
    Keywords: Combinatorial optimization ; Polyhedra ; Matching ; Matchable set ; Separation algorithm ; Augmenting path
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract A matchable set of a graph is a set of vertices joined in pairs by disjoint edges. Balas and Pulleyblank gave a linear-inequality description of the convex hull of matchable sets. We give a polynomial-time combinatorial algorithm for the separation problem for this polytope, and a min—max theorem characterizing the maximum violation by a given point of an inequality of the system.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 5
    Electronic Resource
    Electronic Resource
    Springer
    Computing 33 (1984), S. 237-245 
    ISSN: 1436-5057
    Keywords: Mellin-Transformation ; numerical integration ; sampling theorem ; pattern recognition
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract A method of streamlining the digital Mellin transform is presented, which may enhance the utility of the transform in scale-invariant pattern recognition. For Fourier-bandlimited functions the Mellin integral is transformed into a fast convergent series by means of a basistransformation of the Mellin kernel.
    Notes: Zusammenfassung Um den Nutzen der Mellin-Transformation für maßstabsinvariante Mustererkennung zu erhöhen, wird ein schnelles Verfahren zur numerischen Durchführung der Transformation entwickelt. Für Fourier-bandbegrenzte Funktionen wird das Mellin-Integral über eine Basistransformation des Mellin-Kerns in eine schnell konvergente Reihe übergeführt.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 6
    Electronic Resource
    Electronic Resource
    Springer
    Minds and machines 2 (1992), S. 379-400 
    ISSN: 1572-8641
    Keywords: Music recognition ; connectionism ; neural networks ; pattern recognition ; features ; computer simulation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Philosophy
    Notes: Abstract Current artificial neural network or connectionist models of music cognition embody feature-extraction and feature-weighting principles. This paper reports two experiments which seek evidence for similar processes mediating recognition of short musical compositions by musically trained and untrained listeners. The experiments are cast within a pattern recognition framework based on the vision-audition analogue wherein music is considered an auditory pattern consisting of local and global features. Local features such as inter-note interval, and global features such as melodic contour, are derived from a two-dimensional matrix in which music is represented as a series of frequencies plotted over time. Manipulation of inter-note interval affected accuracy and reaction time measures in a discrimination task, whereas the same variables were affected by manipulation of melodic contour in a classification task. Musical training is thought of as a form of practice in musical pattern recognition and, as predicted, accuracy and reaction time measures of musically trained subjects were significantly better than those of untrained subjects. Given the evidence for feature-extraction and weighting processes in music recognition tasks, two connectionist models are discussed. The first is a single-layer perceptron which has been trained to discriminate between compositions according to inter-note interval. A second network, using the back-propagation algorithm and sequential input of patterns, is also discussed.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 7
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 22 (1982), S. 39-51 
    ISSN: 1436-4646
    Keywords: Graph ; Matching ; Branching ; Polyhedron ; Facet
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract In [3] we presented a linear system which definesP(G), the convex hull of incidence vectors of matching forests of a mixed graphG. However, many of the inequalities of this system may be redundant. Here we describe the dimension of the facets ofP(G) obtained by setting one inequality of the defining system forP(G) to an equation. This leads to a presentation of a minimal defining linear system forP(G), i.e., to a presentation of the facets ofP(G). This generalizes earlier characterizations of facets of 1-matching polyhedra and of branching polyhedra.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 8
    Electronic Resource
    Electronic Resource
    Springer
    Computing 32 (1984), S. 279-295 
    ISSN: 1436-5057
    Keywords: 68 G 10 ; Image processing ; quadtrees ; three-dimensional border ; pattern recognition
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Eine neue Methode zur 3D-Objektgrenzen-Bestimmung wird präsentiert: sie beginnt mit der 3D-Objektdarstellung in „linear octtree form”, gefolgt von einer Eliminierung interner Grenzen zwischen Knoten („nodes”) gleicher Größe und einer Löschung interner Knoten. Das Verfahren endet mit der Feststellung, daß nur mehr „border voxels” vorliegen. Der Algorithmus führt grundsätzlich eine Abbildung eines 3D-Objektes in seinen eigenen Grenzen durch, wobei es sich sowohl bei „input” als auch bei „output” um „linear octtrees” handelt. Es wird gezeigt, daß die Exekutionszeit des Algorithmus von der Ordnungkn(N+M) ist, worink die maximale Knotenzusammenfassung undN die Anzahl der Knoten des ursprünglichen „octtrees” bedeuten.n ist die Genauigkeit des Binärbildes („bilevel image”) undM ist die Anzahl der „border voxels”. Der Anwendungsbereich des vorgeschlagenen Algorithmus ist ziemlich groß: er bestimmt die äußeren Grenzen eines einfach zusammenhängenden Gebietes genauso wie die äußeren und inneren Grenzen eines Satzes mehrfach zusammenhängender Objekte.
    Notes: Abstract A novel approach to the 3D border determination is presented: it starts by representing the 3D object in linear octtree form, proceeds by eliminating internal boundaries between nodes of the same size while deleting internal nodes and terminates when only border voxels remain. The algorithm basically performs a mapping of the 3D object into its own border, with both input and output being represented as linear octtrees. The algorithm is shown to be executable inO(kn(N+M)) time, wherek andN are the maximum node grouping and number of nodes (respectively) of the initial linear octtree,n is the resolution of the bilevel image andM is the number of border voxels. The range of applicability of the proposed algorithm is quite wide: it can determine the external border of a simply connected region as well as the external and internal borders of a set of multiply connected objects, all at the same time.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 9
    Electronic Resource
    Electronic Resource
    Springer
    Journal of intelligent and robotic systems 4 (1991), S. 129-143 
    ISSN: 1573-0409
    Keywords: CAD/CAM ; off-line programming ; industrial vision ; pattern recognition ; simulation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics
    Notes: Abstract CAD/CAM tools are essential components of the computer-integrated factory. Up to now, they have been used for tasks such as the simulation and path programming of numerically controlled machine tools, and sometimes industrial robots. The CAD-vision interconnection described here enables us to program parts learning on the workstation, to download piece features in the vision system for inspection on the production line, to simulate the recognition process on a set of parts stored in the computer, and to update vision files after modifications in the CAD system database.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 10
    Electronic Resource
    Electronic Resource
    Springer
    Journal of intelligent and robotic systems 3 (1990), S. 305-319 
    ISSN: 1573-0409
    Keywords: Neural nets ; nonlinear filtering ; Kalman filters ; parameter estimation ; learning systems ; pattern recognition
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics
    Notes: Abstract Based on various approaches, several different learing algorithms have been given in the literature for neural networks. Almost all algorithms have constant learning rates or constant accelerative parameters, though they have been shown to be effective for some practical applications. The learning procedure of neural networks can be regarded as a problem of estimating (or identifying) constant parameters (i.e. connection weights of network) with a nonlinear or linear observation equation. Making use of the Kalman filtering, we derive a new back-propagation algorithm whose learning rate is computed by a time-varying Riccati difference equation. Perceptron-like and correlational learning algorithms are also obtained as special cases. Furthermore, a self-organising algorithm of feature maps is constructed within a similar framework.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 11
    Electronic Resource
    Electronic Resource
    Springer
    Algorithmica 5 (1990), S. 383-406 
    ISSN: 1432-0541
    Keywords: Matching ; Distributed algorithms ; Graph algorithms ; Combinatorial optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We present a distributed algorithm for maximum cardinality matching in general graphs. On a general graph withn vertices, our algorithm requiresO(n 5/2) messages in the worst case. On trees, our algorithm computes a maximum matching usingO(n) messages after the election of a leader.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 12
    Electronic Resource
    Electronic Resource
    Springer
    Algorithmica 8 (1992), S. 89-101 
    ISSN: 1432-0541
    Keywords: Algorithm ; Bottleneck ; Graphs ; Matching ; Paths ; Trees
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract The notion of matching in graphs is generalized in this paper to a set of paths rather than to a set of edges. The generalized problem, which we call thepath-matching problem, is to pair the vertices of an undirected weighted graph such that the paths connecting each pair are subject to certain objectives and/or constraints. This paper concentrates on the case where the paths are required to be edge-disjoint and the objective is to minimize the maximal cost of a path in the matching (i.e., the bottleneck version). Other variations of the problem are also mentioned. Two algorithms are presented to find the best matching under the constraints listed above for trees. Their worst-case running times areO(n logd logw), whered is the maximal degree of a vertex,w is the maximal cost of an edge, andn is the size of the tree, andO(n 2), respectively. The problem is shown to be NP-complete for general graphs. Applications of these problems are also discussed.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 13
    Electronic Resource
    Electronic Resource
    Springer
    Algorithmica 8 (1992), S. 177-194 
    ISSN: 1432-0541
    Keywords: Matching ; Computational geometry ; Bottleneck optimization problem ; Relative neighborhood graph
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Given a set of pointsV in the plane, the Euclidean bottleneck matching problem is to match each point with some other point such that the longest Euclidean distance between matched points, resulting from this matching, is minimized. To solve this problem, we definek-relative neighborhood graphs, (kRNG) which are derived from Toussaint's relative neighborhood graphs (RNG). Two points are calledk-relative neighbors if and only if there are less thank points ofV which are closer to both of the two points than the two points are to each other. AkRNG is an undirected graph (V,E r k ) whereE r k is the set of pairs of points ofV which arek-relative neighbors. We prove that there exists an optimal solution of the Euclidean bottleneck matching problem which is a subset ofE r 17 . We also prove that ¦E r k ¦ 〈 18kn wheren is the number of points in setV. Our algorithm would construct a 17RNG first. This takesO(n 2) time. We then use Gabow and Tarjan's bottleneck maximum cardinality matching algorithm for general graphs whose time-complexity isO((n logn)0.5 m), wherem is the number of edges in the graph, to solve the bottleneck maximum cardinality matching problem in the 17RNG. This takesO(n 1.5 log0.5 n) time. The total time-complexity of our algorithm for the Euclidean bottleneck matching problem isO(n 2 +n 1.5 log0.5 n).
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 14
    Electronic Resource
    Electronic Resource
    Springer
    Machine learning 15 (1994), S. 169-199 
    ISSN: 0885-6125
    Keywords: distortion invariant ; pattern recognition ; neural networks ; higher-order ; three-dimensional ; two-dimensional
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract A higher-order neural network (HONN) can be designed to be invariant to geometric transformations such as scale, translation, and in-plane rotation. Invariances are built directly into the architecture of a HONN and do not need to be learned. Thus, for 2D object recognition, the network needs to be trained on just one view of each object class, not numerous scaled, translated, and rotated views. Because the 2D object recognition task is a component of the 3D object recognition task, built-in 2D invariance also decreases the size of the training set required for 3D object recognition. We present results for 2D object recognition both in simulation and within a robotic vision experiment and for 3D object recognition in simulation. We also compare our method to other approaches and show that HONNs have distinct advantages for position, scale, and rotation-invariant object recognition. The major drawback of HONNs is that the size of the input field is limited due to the memory required for the large number of interconnections in a fully connected network. We present partial connectivity strategies and a coarse-coding technique for overcoming this limitation and increasing the input field to that required by practical object recognition problems.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 15
    Electronic Resource
    Electronic Resource
    Springer
    Machine learning 15 (1994), S. 169-199 
    ISSN: 0885-6125
    Keywords: distortion invariant ; pattern recognition ; neural networks ; higher-order ; three-dimensional ; two-dimensional
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract A higher-order neural network (HONN) can be designed to be invariant to geometric transformations such as scale, translation, and in-plane rotation. Invariances are built directly into the architecture of a HONN and do not need to be learned. Thus, for 2D object recognition, the network needs to be trained on just one view of each object class, not numerous scaled, translated, and rotated views. Because the 2D object recognition task is a component of the 3D object recognition task, built-in 2D invariance also decreases the size of the training set required for 3D object recognition. We present results for 2D object recognition both in simulation and within a robotic vision experiment and for 3D object recognition in simulation. We also compare our method to other approaches and show that HONNs have distinct advantages for position, scale, and rotation-invariant object recognition. The major drawback of HONNs is that the size of the input field is limited due to the memory required for the large number of interconnections in a fully connected network. We present partial connectivity strategies and a coarse-coding technique for overcoming this limitation and increasing the input field to that required by practical object recognition problems.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 16
    ISSN: 1573-7497
    Keywords: PID control ; fuzzy logic ; pattern recognition ; expert system
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract This article proposes a scheme for the on-line adjustment of three mode controller settings based on experimental measurements of closed-loop performance. It uses a recently developed heuristic tuning procedure to identify estimated process parameters. This method may give rise to conflicting estimates. Fuzzy Set theory is applied to manage the situation in terms of a fuzzy conjunction to combine the various estimates. PID control was chosen because of its wide use in the industrial environment due to driving simplicity and robustness. The article shows design, development, and computer simulation aspects.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 17
    Electronic Resource
    Electronic Resource
    Springer
    International journal of parallel programming 11 (1982), S. 341-356 
    ISSN: 1573-7640
    Keywords: Artificial intelligence ; automatic classification ; cluster analysis ; fuzzy sets ; inductive reasoning ; learning algorithms ; measurement theory ; pattern recognition ; tolerance theory
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract We investigate in this paper approximate operations on sets, approximate equality of sets, and approximate inclusion of sets. The presented approach may be considered as an alternative to fuzzy sets theory and tolerance theory. Some applications are outlined.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 18
    Electronic Resource
    Electronic Resource
    Springer
    International journal of parallel programming 11 (1982), S. 409-415 
    ISSN: 1573-7640
    Keywords: Kleene closure ; regular expression matrices ; fuzzy regular expression matrices ; automata theory ; pattern recognition
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract An efficient algorithm for finding the Kleene closure of regular expressions matrices or fuzzy regular expression matrices is presented and illustrated by examples. Properties of Kleene closure are also investigated. The results may have useful applications in automata theory, pattern recognition, and pictorial information systems.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 19
    Electronic Resource
    Electronic Resource
    Springer
    International journal of parallel programming 11 (1982), S. 75-100 
    ISSN: 1573-7640
    Keywords: Attributes ; attributed grammars ; automata ; features ; formal languages ; grammatical inferrence ; linguistic ; pattern recognition ; probabilistic systems ; semantics ; stochastic systems ; structure ; syntax ; syntactic
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract This paper surveys some of the contemporary work in syntactic/semantic pattern recognition, with emphasis on four topics that are active research areas. These areas-grammatical inferrence, probabilistic models, syntactic errorcorrection, and grammars with attributes-present challenging questions both as to theory and as to practice.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 20
    Electronic Resource
    Electronic Resource
    Springer
    International journal of parallel programming 13 (1984), S. 197-217 
    ISSN: 1573-7640
    Keywords: Unimodality ; convexity ; polygons ; algorithms ; closer-pair problem ; diameter ; all-nearest-neighbor problem ; all-furthest-neighbor problem ; geometric complexity ; computational geometry ; pattern recognition ; artificial intelligence
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract A class of polygons termedunimodal is introduced. LetP = P1,p 2,...,p n be a simplen-vertex polygon. Given a fixed vertex or edge, several definitions of the distance between the fixed vertex or edge and any other vertex or edge are considered. For a fixed vertex (edge), a distance measure defines a distance function as the remaining vertices (edges) are traversed in order. If for every vertex (edge) ofP a specified distance function is unimodal thenP is a unimodal polygon in the corresponding sense. Relationships between unimodal polygons, in several senses, andconvex polygons are established. Several properties are derived for unimodal polygons when the distance measure is the euclidean distance between vertices of the polygons. These properties lead to very simple 0(n) algorithms for solving a variety of problems that occur in computational geometry and pattern recognition. Furthermore, these algorithms establish that convexity is not the key factor in obtaining linear-time-complexity for solving these problems. The paper closes with several open questions in this area.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 21
    Electronic Resource
    Electronic Resource
    Springer
    Statistics and computing 2 (1992), S. 191-202 
    ISSN: 1573-1375
    Keywords: Boltzmann machines ; neural networks ; pattern recognition ; Shewhart control charts ; simulated annealing
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Boltzmann machines (BM), a type of neural networking algorithm, have been proven to be useful in pattern recognition. Patterns on quality control charts have long been recognized as providing useful information for correcting process performance problems. In computer-integrated manufacturing environments, where the control charts are monitored by computer algorithms, the potential for using pattern-recognition algorithms is considerable. The main purpose of this paper is to formulate a Boltzmann machine pattern recognizer (BMPR) and demonstrate its utility in control chart pattern recognition. It is not the intent of this paper to make comparisons between existing related algorithms. A factorial design of experiments was conducted to study the effects of numerous factors on the convergence behavior and performance of these BMPRs. These factors include the number of hidden nodes used in the network and the annealing schedule. Simulations indicate that the temperature level of the annealing schedule significantly affects the convergence behavior of the training process and that, to achieve a balanced performance of these BMPRs, a medium to high level of annealing temperatures is recommended. Numerical results for cyclical and stratification patterns illustrate that the classification capability of these BMPRs is quite powerful.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 22
    Electronic Resource
    Electronic Resource
    Springer
    Statistics and computing 4 (1994), S. 113-129 
    ISSN: 1573-1375
    Keywords: Evolutionary programming ; machine intelligence ; pattern recognition
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Evolutionary programming was originally proposed in 1962 as an alternative method for generating machine intelligence. This paper reviews some of the early development of the method and focuses on three current avenues of research: pattern discovery, system identification and automatic control. Recent efforts along these lines are described. In addition, the application of evolutionary algorithms to autonomous system design on parallel processing computers is briefly discussed.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 23
    Electronic Resource
    Electronic Resource
    Springer
    Statistics and computing 4 (1994), S. 161-171 
    ISSN: 1573-1375
    Keywords: Automation ; chromosome ; classification ; karyotype ; neural network ; pattern recognition ; review
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Computer-aided imaging systems are now widely used in cytogenetic laboratories to reduce the tedium and labour-intensiveness of traditional methods of chromosome analysis. Automatic chromosome classification is an essential component of such systems, and we review here the statistical techniques that have contributed towards it. Although completely error-free classification has not been, nor is ever likely to be, achieved, error rates have been reduced to levels that are acceptable for many routine purposes. Further reductions are likely to be achieved through advances in basic biology rather than in statistical methodology. Nevertheless, the subject remains of interest to those involved in statistical classification, because of its intrinsic challenges and because of the large body of existing results with which to compare new approaches. Also, the existence of very large databases of correctly-classified chromosomes provides a valuable resource for empirical investigations of the statistical properties of classifiers.
    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...