Ãëàâíàÿ    Ex Libris    Êíèãè    Æóðíàëû    Ñòàòüè    Ñåðèè    Êàòàëîã    Wanted    Çàãðóçêà    ÕóäËèò    Ñïðàâêà    Ïîèñê ïî èíäåêñàì    Ïîèñê    Ôîðóì   
blank
Àâòîðèçàöèÿ

       
blank
Ïîèñê ïî óêàçàòåëÿì

blank
blank
blank
Êðàñîòà
blank
Ballard D.H., Brown C.M. — Computer vision
Ballard D.H., Brown C.M. — Computer vision



Îáñóäèòå êíèãó íà íàó÷íîì ôîðóìå



Íàøëè îïå÷àòêó?
Âûäåëèòå åå ìûøêîé è íàæìèòå Ctrl+Enter


Íàçâàíèå: Computer vision

Àâòîðû: Ballard D.H., Brown C.M.

Àííîòàöèÿ:

The book is organized into four parts, based on descriptions of objects at four different levels of abstraction.
1. Generalized images—images and image-likeentities.
2. Segmented images—images organized into subimagcs that are likely to
correspond to "interesting objects."
3. Geometric structures—quantitative models of imageand world structures.
4. Relational structures—complex symbolic descriptions of image and world
structures.


ßçûê: en

Ðóáðèêà: Computer science/Îáðàáîòêà èçîáðàæåíèé/

Ñòàòóñ ïðåäìåòíîãî óêàçàòåëÿ: Ãîòîâ óêàçàòåëü ñ íîìåðàìè ñòðàíèö

ed2k: ed2k stats

Ãîä èçäàíèÿ: 1982

Êîëè÷åñòâî ñòðàíèö: 523

Äîáàâëåíà â êàòàëîã: 09.11.2005

Îïåðàöèè: Ïîëîæèòü íà ïîëêó | Ñêîïèðîâàòü ññûëêó äëÿ ôîðóìà | Ñêîïèðîâàòü ID
blank
Ïðåäìåòíûé óêàçàòåëü
Fourier, filtering      65
Fourier, transform      24—30 490—492
Frame, problem      395 444
Frame, system theory      334—335
Frenet frame and formulae      276
Function, image      18—19
Function, Logic      385
Function, Skolcm      387
G — Hough algorithm      128
Gamma, film      45
Gaussian sphere      101 270
Generalized, clipping      284
Generalized, cone      274—280
Generalized, cylinder      (see Generalized cone)
Generalized, image      6 14 320
Generalized, matching to data      278 372—375
Geodesic tesselation      271 493
Geometric, matching      354
Geometric, operations in location networks      336
Geometric, relations and propositions      332
Geometric, representations      8 227—311
Geometric, structures and matching      354
Geometric, transformations      477—481
Geometry theorem prover      322
Gestalt psychology      116
Goal achievement      319 346—347 438—439
Goodness of fit      273
Gradient use in Hough algorithm      124
Gradient, edge operator      76—80
Gradient, space      95 301
Gradient, techniques      355
Gradient, texture      168 189—193
Grammar on pyramid      179
Grammar, ambiguous      172
Grammar, array      178—181
Grammar, shape      173—174
Grammar, stochastic      172
Grammar, texture      172—181
Grammar, tree      175—178
Graph      131
Graph, adjacency for regions      159
Graph, algorithms, complexity      359
Graph, association      358 365—369
Graph, dual      159
Graph, isomorphism      357—359 364
Graph, matching      355
Graph, r-connected component      369 380
Gray level      18 23 35
Gray level, dependence matrices for texture      186—188
Grazing incidence      111
HAD carve      44
Heart volume      273
Heterarchical control      341—346 499
Heuristic search, boundaries      131—133
Heuristic search, dynamic programming      143
Heuristic search, region growing      157
hierarchical      (see also Pyramid)
Hierarchical, abstractions      505
Hierarchical, control      341—346
Hierarchical, textures      170
High-level, models      317
High-level, motion detection      196—199
High-level, vision      2—6
Hill-climbing and matching      355
histogram      70
Histogram, colorspace      153—155
Histogram, equalization and transformation      70
Histogram, splitting for thresholds      152
Homogeneous, coordinatesystem      467
Homogeneous, regions      150
Homogeneous, texture      188
Hough algorithm      123—131
Hough algorithm, generalized      128—131
Hough algorithm, gradient      76—80
Hough algorithm, Kirsch      79
Hough algorithm, Laplacian      76—79
Hough algorithm, operator      64 75—88
Hough algorithm, performance      77 83—84
Hough algorithm, refinements      124
Hough algorithm, relaxation      85—88
Hough algorithm, representation for surfaces      266
Hough algorithm, strength in evaluation function      133
Hough algorithm, templates      79 3
Hough algorithm, thresholding      80
Hough algorithm, vanishing points      191
Human body for motion understanding      214—219
Hungry monkey planning problem      445
Hypotheses      343 384 422
Hypotheses, active knowledge      431
Hypothetical worlds      432 440
Iconic structures aad matching      353
icosahedron      492
IHS color basis      33
Image      (see also Imaging)
Image, aerial      1 335
Image, CAT      1 56—59
Image, connectivity      36
Image, digital      35—42
Image, digitizers      45
Image, distance on raster      36
Image, edges      75—88
Image, ERTSorLANDSAT      46
Image, formation      17
Image, function      18—19
Image, generalized      6 14 320
Image, histogram      70
Image, intrinsic      7 14 63
Image, irradiance      23 73
Image, orthicon      47
Image, plane      19
Image, processing      2 17 25
Image, range      52—56 64 88
Image, sampling      18 35
Image, scquencc understanding      207—222
Image, segmented      7
Image, ultrasound      54
Image, variance      69
Imaging, active      14
Imaging, deviccs      42—59
Imaging, geometry      19—21
Imaging, light stripe      22
Imaging, model      17—42
Imaging, monocular and binocular      19—22
Imaging, stereo      20—22 52—54 88—93 98
Inconsistent labeling      410 (see also Labeling)
Indexing property of semantic nets      324
Inequalities in linear programming      422 427
Inference      314 319—321 383
Inference in semantic nets      327
Inference syllogistic      321
Inference systems, formal and informal      390
Inference, bottom-up and top-down      392
Inference, extended      315 319 322 383 395
Inference, rules of      388
Infinity, point at      20
Informal inference system      390
Inheritance of properties in knowledge representation      330 335
Inhibitory local evidence in line drawings      295
Intensional concepts in knowledge representation      328
Interaction graph for dynamic programming      143
Interest operator      69 208
Interior operator      282
Interpolation      489—490
Interpretation, matching      352
Interpretation, region-growing      160—164
Interpreter, production system      398—399
Interpreter, semantic net      326 339
Intersection of strip trees      244
Interval, sampling      35
Intrinsic, image      7 14 63
Intrinsic, parameters      63
Inverse, perspective      (see Projection)
Inverse, relations      331
Irradiance, image      23 73
Isomorphism, graph and subgraph      357—359 364
Iterative region merging with semantics      163
Job queue      502—504
Knowledge representation, analogical and propositional      9 314 319—322
Knowledge, base      317 318—323
Knowledge, chunking      334
Knowledge, engineering      407
Krf-tree      281 287
Labeling      296—301 408—420
Labeling, compatibilities      415
Labeling, consistent, inconsistent, optimal      408 410
Labeling, discrete      410—415
Labeling, interpretation      315 353 383 408
Labeling, lines      296—301
Labeling, scene      408—430
Labeling, tree search      412
Lambertian surfaces      94
LANDSAT imagery      46
Laplacian operator      76—79
Laser rangefindcrs      54 (see also Image range)
Learning      315
Least-squared error fitting      484—488
Legendre polynomial      272
Light, fiux      22
Light, stripe imaging      22
Light, structured      52—54
Line, detection. Hough algorithm      123
Line, drawing understanding      265 291—307
Line, drawings for motion understanding      220—222
Line, equation      475
Line, fitting      484—487
Line, labeling      296—301
Line, labeling by relaxation      416—421 428
Line, representations      474—476
Line, segment      232
Line, transformation      480
Linear programming for relaxation      420—430
Linear, structure matching      378—380
Linear, transformation      473
Linking edges      (see Edge linking)
Local evidence in line drawings      294
Location networks      335—340
Logarithmic filtering      73
Logic      (see Predicate logic)
Long-term memory      400
Low-level, motion detection      196
Low-level, vision      3—6
Manhattan mrtric      36
Mass properties      285
Matched filtering and Hough algorithm      124
Matching      315 352 398
Matching, blocks world structures      370—372
Matching, clique-finding      366—369 375
Matching, complexity      359
Matching, examples      369—380
Matching, expectation-driven      353
Matching, generalized cylinders      372—375
Matching, geometric structures      354
Matching, graphs      355
Matching, iconic structures      353
Matching, knowledge representation      319
Matching, line drawings to primitives      293
Matching, linear structures      378—380
Matching, metrical in line drawing understanding      294
Matching, metrics      360—362 375 378
Matching, nondeterministic algorithm      359
Matching, optic Row      208
Matching, optimization      354
Matching, pattern      (see Pattern matching
Matching, relational structures      353 355 365—372
Matching, rules in production system      399—400
Matching, templates and springs      360—362
Matching, topological, for line drawings      293
Matrix algebra      471—474
Matte reflectivity      23
Maximal clique      366
Medial axis transform      252—253
Membership array for region      248
Memory, long-term and short-term      400
Merging, branches for backtracking improvement      364
Merging, curve segmentation      233
Merging, regions      155—160
Message-passing      (see Modules and messages)
Metric, distance on raster      36
Metric, matching      360—362 375 378
Minimum, cost search for boundaries      132
Minimum, spanning tree for clustering      217
Model in knowledge representation      9 317
Model, analogical and propositional      319
Model, human body for motion      217—219
Model-driven control      342
Modules and messages      300—502
Modus Ponens and Modus Tollens      388
Moment of inertia      255 286 473 484
Monocular imaging      (see Imaging)
Motion      195 (see also Optic flow)
Motion, adjacency and collision detection      201
Motion, body model      214—219
Motion, common in sequence      199 208
Motion, consistent match      199
Motion, continuity      197
Motion, depth      201
Motion, human body      214—219
Motion, image sequences      207—222
Motion, maximum velocity      198
Motion, modal sensor      453—459
Motion, moving light displays      214—217
Motion, observer      206
Motion, resolution images      100 110
Motion, rigid bodies      197 210—214
Motion, surface orientation and edge detection      202
Multi-dimensional histograms      153—155
Nearest-neighbor dusMring      183
Network, interpreter      326
Network, representation      391 (see also Semantic nets)
Newton — Raphson      493
Node types in semantic nets      324—329
Noise      65
Nondausal form      385—387 (see also Predicate logic)
Nondeterministk algorithms      359
Nonrigid, body motion understanding      214—217
Nonrigid, solids      264
Nonstandard, control structures      499—507 (see also Control)
Nonstandard, inference      (see Extended inference)
Normalized correlation      68—70
NP-completeness      359
NTSC.      34
Occluding, contour      101
Occluding, line label      296
Oct-tree      281 287
Office scene understanding      453—459
Operator      (see Edge Interest Closure Planning etc.)
Opponent processes      33
Optic flow      65 102—105 196 199—206
Optical system analysis      23
Optimal labeling      410
Optimization, linear programming      424—425
Optimization, matching      354
Origami world      300
Orthicon, image      47
Orthographic projection      (see Projection)
Parallel, computation      64 341 360
Parallel, iterative refinement in graph matching      358 378
Parallel-iterative relaxation      64 412
Parameter, optimization as matching      354
Parameter, space      123
1 2 3 4
blank
Ðåêëàìà
blank
blank
HR
@Mail.ru
       © Ýëåêòðîííàÿ áèáëèîòåêà ïîïå÷èòåëüñêîãî ñîâåòà ìåõìàòà ÌÃÓ, 2004-2024
Ýëåêòðîííàÿ áèáëèîòåêà ìåõìàòà ÌÃÓ | Valid HTML 4.01! | Valid CSS! Î ïðîåêòå