Главная    Ex Libris    Книги    Журналы    Статьи    Серии    Каталог    Wanted    Загрузка    ХудЛит    Справка    Поиск по индексам    Поиск    Форум   
blank
Авторизация

       
blank
Поиск по указателям

blank
blank
blank
Красота
blank
Theodoridis S., Koutroumbas K. — Pattern recognition
Theodoridis S., Koutroumbas K. — Pattern recognition



Обсудите книгу на научном форуме



Нашли опечатку?
Выделите ее мышкой и нажмите Ctrl+Enter


Название: Pattern recognition

Авторы: Theodoridis S., Koutroumbas K.

Аннотация:

Pattern recognition is a scientific discipline that is becoming increasingly important in the age of automation and information handling and retrieval. This volume's unifying treatment covers the entire spectrum of pattern recognition applications, from image analysis to speech recognition and communications. This book presents cutting-edge material on neural networks, - a set of linked microprocessors that can form associations and uses pattern recognition to "learn". A direct result of more than 10 years of teaching experience, the text was developed by the authors through use in their own classrooms.


Язык: en

Рубрика: Computer science/Обработка изображений/

Статус предметного указателя: Готов указатель с номерами страниц

ed2k: ed2k stats

Издание: 2nd edition

Год издания: 2003

Количество страниц: 689

Добавлена в каталог: 22.11.2005

Операции: Положить на полку | Скопировать ссылку для форума | Скопировать ID
blank
Предметный указатель
Levinson's algorithm      288
Lexicographic ordering      208
Lifetime of a cluster      480
Likelihood function      20 28
Likelihood ratio      18
Likelihood ratio test      44
Linear classifiers      55
Linear dichotomies      129
Lloyd's algorithm      535
LMS algorithm      68
Local constraints      325 334
Local feature extractor      279
Logarithmic search      340
Logistic function      104
Long run emphasis      278
Loss matrix      17
Machine vision      1
Mahalanobis distance      26
Markov chain      352
Markov model      352
Markov random fields      292 375
Matching score generator      443
Matrix updating algorithmic scheme (MUAS)      455
Maximally complete subgraph      465
Maximally connected subgraph      465
Maximum a posteriori probability estimation      31
Maximum entropy estimation      34
Maximum likelihood      28
Maxnet      443 444
Mean center      421
Mean square error estimation      65
Mean square error regression      72
Mean vector      420
Median center      421
Mellin transforms      339
Membership functions      403
Merging procedure      441
Minimum description length (MDL)      614
Minimum distance classifier      25
Minimum Spanning Tree (MST)      546 611 613 628 630
Minimum variance algorithm      458 (See
Minkowski distance      505
Minmax duality      672
Mixture decomposition      490
Mixture models      35
Mixture scatter matrix      180
Mode-seeking property      526
Modified BSAS      437
Modified fuzzy C quadric shells (FCQS) algorithm      515
Modified Hubert $\Gamma$ statistic      608
Moments      270
Moments of Hu      283
Momentum factor      112
Monothetic algorithms      479
Monotonicity      334 461
Monte Carlo techniques      593
Morphological operations      565—568
Morphological operations dilation      566
Morphological operations erosion      566
Morphological operations opening      568
Morphological operations translation      566
Morphological operations, closing      568
Motion compensation      337
Motion estimation      337
Mountain method      583
Multiresolution analysis      251
Multiresolution decomposition      238
Multiresolution interpretation      250
Multispectral remote sensing      7
Mutual information      223 372 647
Natural gradient      225
Nearest neighbor condition      534
Nearest neighbor distances tests      629
Nearest Neighbor rule      44
Nested clusterings      449
Network      126
Neural networks      373
Newton's algorithm      663
Neyman — Scott procedure      626
Noble identity      236 245
Node connectivity      466
Node degree      467
Node impurity      146
Normalization      565
Normalized $\Gamma$ statistic      598
Normalized central moments      282
Normalized radial distance      510 (See
Null hypothesis      166 592 594
Octave-band filter banks      247
One-dimensional DFT      227
One-tailed statistical test      593
One-tailed statistical test left-tailed statistical test      594
One-tailed statistical test right-tailed statistical test      594
Opening      567
Optical character recognition (OCR)      294
Optimization      659
Ordinal proximity matrices      621 622
Orientation      301
Outliers      498 522 524
Overtraining      119
P statistic      632
Packing density      627
Paraunitary      244
Partial clusterings      561
Partition algorithmic schemes      526
Partition coefficient (PC)      619
Partition density (PD) index      619
Partition entropy (PE)      615 619
Partition shell density      620
Parzen windows      41 577
Path of a graph      464
Pattern mode algorithm      553
Perceptron      61
Perceptron algorithm      57
Perceptron cost      57
Perfect reconstruction      242
Perpendicular distance      508 (See
pFCM      506
Pocket algorithm      63
Poisson distribution      626
Poisson process      626
Polynomial classifiers      131
Polythetic algorithms      479
Possibilistic algorithms      432
Power function of a test      592
Prediction based on groups      401
Principle Component Analysis (PCA)      See "Karhunen — Loeve transform"
Probabilistic clustering algorithms      432
Projection pursuit      220
Proximity dendrogram      453
Proximity function between a point and a set average proximity function      419
Proximity function between a point and a set maximum proximity function      419
Proximity function between a point and a set minimum proximity function      419
Proximity function between two sets average proximity function      424
Proximity function between two sets maximum proximity function      424
Proximity function between two sets mean proximity function      424
Proximity function between two sets minimum proximity function      424
Proximity graph      466 621
Proximity graph dissimilarity graph      466
Proximity graph similarity graph      466
Proximity matrix      451
Proximity measure      399
Pruning techniques      120
Pseudolikelihood function      378
Quadrat analysis      628
Quadric surface      507
Quadric surface hyperellipses      507
Quadric surface hyperparabolas      507
Quickprop      114
Radial basis function networks      133
Radial distance      509 (See
Rand statistic      598
Random field      286
Random graph hypothesis      595
Random label hypothesis      596
Random position hypothesis      595
Randomness hypothesis      595 624
Ratio scaled proximity matrices      622
Reassignment procedure      442
Receiver operating characteristics curve      173
Recognition      1
Recognition of handwritten      256
Regions of influence      549
Regularity hypothesis      624
Relative criteria      605—619
Relative edge consistence      549
Relative Neighborhood Graph (RNG)      611 613
Representatives hyperplane      517
Representatives point      505—506
Representatives quadratic surfaces      507
Reproduction set      534
Reproduction vector      533
Resubstitution method      387
Reward and punishment      61
Right-tailed statistical test      594
Risk or loss      17
Robbins — Monro iteration      556
Roundness ratio      302
Run length nonuniformity      278
Run percentage      279
Sakoe and Chiba      335
Saliency      122
Sampling frame      625
Sampling window      624
Scan test      628
Scatter matrices      179
Second moment structure      628
Segment modeling      372
Self-affine      307
Self-organizing maps (SOM)      559
Self-similarity      303
Sequential backward selection      184
Sequential clustering algorithms      431 433—440
Sequential decomposition      630
Sequential forward selection      185
Shape characterization      294
Shell hypervolume      620
Shell partition density      620
Short run emphasis      278
Short-Time Fourier Transform      251
Sigmoid functions      104
Significance level      167
Similarity matrix      451
Similarity measure between points      405
Similarity measure between sets      406
Simple sequential inhibition (SSI)      627
Simulated annealing      579—580
Simulated annealing for clustering      579—580
Simulated annealing sweep      579
Sine transforms      230
Single link      455 467
Singular value decomposition      216
skewness      271
Softmax activation      152
Spanning tree      473
Sparse decomposition technique      630—634
Spatial dependence matrix      273
Speaker-dependent recognition      329
Speaker-independent recognition      329
Spectral representation      216
Speech recognition      560
Statistic      592
Stirling numbers of the second kind      430
Stochastic approximation      68
Stochastic relaxation methods      432
String patterns      322
Structural graph tests      628
Structural risk minimization      196
Subgraph      464 465
Subgraph, complete      464
Subgraph, connected      464
Subsampling      235
Subspace classification      214
Sum of error squares estimation      70
Supervised learning vector quantization      560
Support vector machines      77 136 139 199
Surface density criterion      623
System evaluation      385
t-distribution      170
T-squared sampling tests      630
t-test      171
Tabu search method      187 583
Tanimoto measure for discrete valued      412
Template matching      321
Templates      321
Test statistic      166
Texture      259 270
Threshold dendrogram      471
Threshold graph      465
Tied-mixture densities      372
Tiling algorithm      102
Topological ordering      560
Total fuzzy average shell thickness      620
Total variation      617
Touching clusters      547
Translation      566
Tree-structured filter bank      238
Triangular inequality      405
Two-dimensional AR models      289
Two-dimensional DFT      229
Two-tailed statistical test      593
Two-threshold sequential algorithmic scheme      439
Uncertainty principle      261
Undirected graphs      464
Universal approximators      137
Unsupervised learning      397
Unweighted graphs      464
Unweighted pair group method average (UPGMA)      457
Unweighted pair group method centroid (UPGMC)      457
Validation of clustering results      399
Valley-seeking algorithms      433 576
Vapnik — Chernovenkis learning theory      193
Variational similarity      326
Vector quantization      533
Vector quantizer      534
Vector quantizer decoder      535
Vector quantizer encoder      534
Video coding      321
Viterbi algorithm      353
Viterbi reestimation      369
Voronoi tessellation      46
Ward's algorithm      459
Wavelet packets      252
Weight sharing      126
Weighted graphs      464
Weighted pair group method average (WPGMA)      457
Weighted pair group method centroid (WPGMC)      458
Well-formed functions      115
Within scatter matrix      532
Within-class scatter matrix      179
Xie — Beni (XB) index      617
XOR problem      93
Zernike moments      284
1 2
blank
Реклама
blank
blank
HR
@Mail.ru
       © Электронная библиотека попечительского совета мехмата МГУ, 2004-2025
Электронная библиотека мехмата МГУ | Valid HTML 4.01! | Valid CSS! О проекте