TESTING OF A HYPOTHESIS ON INDEPENDENCE OF TWO-DIMENSIONAL RANDOM VALUES USING A NONPARAMETRIC ALGORITHM FOR PATTERN RECOGNITION

2021 ◽  
Vol 57 (2) ◽  
pp. 41-48
Author(s):  
A.V. Lapko ◽  
V.A. Lapko
Keyword(s):  
Pattern Recognition ◽  
Two Dimensional ◽  
Nonparametric Algorithm

Comprehensive two-dimensional gas chromatography for fingerprint pattern recognition in cachaça production

Talanta ◽  
2008 ◽  
Vol 74 (4) ◽  
pp. 793-799 ◽  
Author(s):  
Z.L. Cardeal ◽  
P.P. de Souza ◽  
M.D.R. Gomes da Silva ◽  
P.J. Marriott
Keyword(s):  
Pattern Recognition ◽  
Gas Chromatography ◽  
Two Dimensional ◽  
Fingerprint Pattern

Quantitative analysis and pattern recognition of two-dimensional electrophoresis gels.

1984 ◽  
Vol 30 (12) ◽  
pp. 1919-1924 ◽  
Author(s):  
G Ridder ◽  
E VonBargen ◽  
D Burgard ◽  
H Pickrum ◽  
E Williams
Keyword(s):  
Pattern Recognition ◽  
Image Analysis ◽  
Quantitative Analysis ◽  
Data Reduction ◽  
Two Dimensional ◽  
Two Dimensional Electrophoresis ◽  
Analysis Techniques ◽  
Bacterial Cultures ◽  
Dimensional Electrophoresis ◽  
Image Analysis Techniques

Abstract We describe a system, both hardware and software, that provides quantitative analysis and data reduction of two-dimensional electrophoresis gels. Image-analysis techniques are used to determine spot intensities and to match spot patterns among many gels. A pattern-recognition program is used to extract the useful information contained in the spot lists. The application of this technology to a study of supernates from bacterial cultures is described.

Cluster analysis and multiplet pattern recognition in two-dimensional NMR spectra

1990 ◽  
Vol 89 (3) ◽  
pp. 543-552
Author(s):  
Klaus-Peter Neidig ◽  
Rainer Saffrich ◽  
Michael Lorenz ◽  
Hans Robert Kalbitzer
Keyword(s):  
Cluster Analysis ◽  
Pattern Recognition ◽  
Nmr Spectra ◽  
Two Dimensional

CHARACTERIZING THE ABILITY OF PARALLEL ARRAY GENERATORS ON REVERSIBLE PARTITIONED CELLULAR AUTOMATA

1999 ◽  
Vol 13 (04) ◽  
pp. 523-538 ◽  
Author(s):  
KENICHI MORITA ◽  
SATOSHI UENO ◽  
KATSUNOBU IMAI
Keyword(s):  
Pattern Recognition ◽  
Cellular Automata ◽  
Cellular Automaton ◽  
Inverse System ◽  
Two Dimensional ◽  
Turing Machines ◽  
Recognition Mechanism ◽  
Parallel Array ◽  
Parallel Pattern ◽  
Monotonic Constraint

A PCAAG introduced by Morita and Ueno is a parallel array generator on a partitioned cellular automaton (PCA) that generates an array language (i.e. a set of symbol arrays). A "reversible" PCAAG (RPCAAG) is a backward deterministic PCAAG, and thus parsing of two-dimensional patterns can be performed without backtracking by an "inverse" system of the RPCAAG. Hence, a parallel pattern recognition mechanism on a deterministic cellular automaton can be directly obtained from a RPCAAG that generates the pattern set. In this paper, we investigate the generating ability of RPCAAGs and their subclass. It is shown that the ability of RPCAAGs is characterized by two-dimensional deterministic Turing machines, i.e. they are universal in their generating ability. We then investigate a monotonic RPCAAG (MRPCAAG), which is a special type of an RPCAAG that satisfies monotonic constraint. We show that the generating ability of MRPCAAGs is exactly characterized by two-dimensional deterministic linear-bounded automata.

Sign in / Sign up

Export Citation Format

Share Document