0% found this document useful (0 votes)

8 views

Image Processing Analysis and Machine Vision 4th Edition Milan Sonka instant download

The document provides information about the 4th edition of 'Image Processing, Analysis, and Machine Vision' by Milan Sonka and others, available for download in various formats. It includes links to additional related resources and textbooks on image processing and machine vision. The text is published by Cengage Learning and contains copyright information regarding its use and distribution.

Uploaded by

ujicamonchu

Available Formats

Download as PDF, TXT or read online on Scribd

0% found this document useful (0 votes)

8 views

Image Processing Analysis and Machine Vision 4th Edition Milan Sonka instant download

Uploaded by

ujicamonchu

Available Formats

Download as PDF, TXT or read online on Scribd

You are on page 1/ 53

Image Processing Analysis and Machine Vision 4th

Edition Milan Sonka pdf download

https://ebookname.com/product/image-processing-analysis-and-
machine-vision-4th-edition-milan-sonka/

Get Instant Ebook Downloads – Browse at https://ebookname.com

Instant digital products (PDF, ePub, MOBI) available
Download now and explore formats that suit you...

Image Processing Analysis and Machine Vision 3rd

Edition Milan Sonka

https://ebookname.com/product/image-processing-analysis-and-
machine-vision-3rd-edition-milan-sonka/

Digital Image Processing and Analysis Human and

Computer Vision Applications with CVIPtools Second
Edition Umbaugh

https://ebookname.com/product/digital-image-processing-and-
analysis-human-and-computer-vision-applications-with-cviptools-
second-edition-umbaugh/

Dictionary of computer vision and image processing 2ed.

Edition R B Fisher

https://ebookname.com/product/dictionary-of-computer-vision-and-
image-processing-2ed-edition-r-b-fisher/

500 Low Cholesterol Recipes Flavorful Heart Healthy

Dishes Your Whole Family Will Love 1st Edition Dick
Logue

https://ebookname.com/product/500-low-cholesterol-recipes-
flavorful-heart-healthy-dishes-your-whole-family-will-love-1st-
edition-dick-logue/
Resource Management Information Systems Remote Sensing
GIS and Modelling Second Edition Keith R. Mccloy
(Author)

https://ebookname.com/product/resource-management-information-
systems-remote-sensing-gis-and-modelling-second-edition-keith-r-
mccloy-author/

MCSA Windows Server 2016 Complete Study Guide Exam 70

740 70 741 70 742 William Panek

https://ebookname.com/product/mcsa-windows-server-2016-complete-
study-guide-exam-70-740-70-741-70-742-william-panek/

An Empire of Wealth The Epic History of American

Economic Power First Harper Perennial Edition/Full
Number Line Edition John Steele Gordon

https://ebookname.com/product/an-empire-of-wealth-the-epic-
history-of-american-economic-power-first-harper-perennial-
edition-full-number-line-edition-john-steele-gordon/

Emerging Business Online Global Markets and the Power

of B2B Internet Marketing 1st Edition Lara Fawzy

https://ebookname.com/product/emerging-business-online-global-
markets-and-the-power-of-b2b-internet-marketing-1st-edition-lara-
fawzy/

The Problem of Natural Law Douglas Kries

https://ebookname.com/product/the-problem-of-natural-law-douglas-
kries/
Machine Shop Trade Secrets 2nd Edition A Guide to
Manufacturing Machine Shop Practices James A. Harvey

https://ebookname.com/product/machine-shop-trade-secrets-2nd-
edition-a-guide-to-manufacturing-machine-shop-practices-james-a-
harvey/
Image Processing, Analysis, and
Machine Vision

Milan Sonka
The University of Iowa, Iowa City
Vaclav Hlavac
Czech Technical University, Prague
Roger Boyle
Prifysgol Aberystwyth, Aberystwyth

Australia • Brazil • Japan • Mexico • Singapore • United Kingdom • United States

Copyright 201 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
Image Processing, Analysis, and © 2015, 2008 Cengage Learning
Machine Vision, Fourth Edition WCN: 02-200-203
Milan Sonka, Vaclav Hlavac, and
Roger Boyle ALL RIGHTS RESERVED. No part of this work covered by the
copyright herein may be reproduced, transmitted, stored or used
Publisher, Global Engineering: in any form or by any means graphic, electronic, or mechanical,
Timothy L. Anderson including but not limited to photocopying, recording, scanning,
Senior Developmental Editor: digitizing, taping, Web distribution, information networks, or
Hilda Gowans information storage and retrieval systems, except as permitted
under Section 107 or 108 of the 1976 United States Copyright Act,
Senior Editorial Assistant: Tanya Altieri without the prior written permission of the publisher.
Art and Cover Direction, Production
Management: PreMediaGlobal
For product information and technology assistance, contact us at
Compositor: Hrvoje Bugonovic Cengage Learning Customer & Sales Support, 1-800-354-9706
Rights Acquisition Director: For permission to use material from this text or product,
Audrey Pettengill submit all requests online at www.cengage.com/permissions
Rights Acquisition Specialist, Further permissions questions can be emailed to
Text and Image: Amber Hosea permissionrequest@cengage.com

Text & Image Permissions Researcher:

Kristiina Paul Library of Congress Control Number: 2013947420
Manufacturing Planner: Doug Wilke ISBN-13: 978-1-133-59360-7
Cover Image: © Milan Sonka, ISBN-10: 1-133-59360-7
Vaclav Hlavac, and Roger Boyle

Cengage Learning
200 First Stamford Place, 4th Floor
Stamford, CT 06902
USA

Cengage Learning is a leading provider of customized learning

solutions with office locations around the globe, including
Singapore, the United Kingdom, Australia, Mexico, Brazil, and
Japan. Locate your local office at www.cengage.com/global

Cengage Learning products are represented in Canada by

Nelson Education, Ltd.

To learn more about Cengage Learning, visit

www.cengage.com/engineering.
Purchase any of our products at your local college store or at our
preferred online store www.cengagebrain.com

Printed in the United States of America

1 2 3 4 5 6 7 17 16 15 14 13

1D one dimension(al)
2D, 3D, ... two dimension(al), three dimension(al), ...
AAM active appearance model
AGC automatic gain control
AI artificial intelligence
ART adaptive resonance theory
ASM active shape model
BBF best bin first
BBN Bayesian belief network
BRDF bi-directional re ectance distribution function
B-rep boundary representation
CAD computer-aided design
CCD charge-coupled device
CHMM coupled HMM
CIE International Commission on Illumination
CMOS complementary metal-oxide semiconductor
CMY cyan, magenta, yellow
CONDENSATION CONditional DENSity propagATION
CRT cathode ray tube
CSF cerebro-spinal uid
CSG constructive solid geometry
CT computed tomography
dB decibel, 20 times the decimal logarithm of a ratio
DCT discrete cosine transform
DFT discrete Fourier transform
dof degrees of freedom
DPCM differential PCM
DWF discrete wavelet frame
ECG electro-cardiogram
EEG electro-encephalogram
EM expectation-maximization
FFT fast Fourier transform
FLANN fast library for approximate nearest neighbors
FOE focus of expansion
GA genetic algorithm

Copyright 201 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
GB Giga byte = 230 bytes = 1,073,741,824 bytes
GIS geographic information system
GMM Gaussian mixture model
GRBF Gaussian radial basis function
GVF gradient vector ow
HDTV high definition TV
HLS as HSI
HMM hidden Markov model
HOG histogram of oriented gradients
HSI hue, saturation, intensity
HSL as HSI
HSV hue, saturation, value
ICA independent component analysis
ICP iterative closest point algorithm
ICRP iterative closest reciprocal point algorithm
IHS intensity, hue, saturation
JPEG Joint Photographic Experts Group
Kb Kilo bit = 210 bits = 1,024 bits
KB Kilo byte = 210 bytes = 1,024 bytes
KLT Kanade-Lucas-Tomasi (tracker)
LBP local binary pattern
LCD liquid crystal display
MAP maximum a posteriori
Mb Mega bit = 220 bits = 1,048,576 bits
MB Mega byte = 220 bytes = 1,048,576 bytes
MB, MB2 Manzanera–Bernard skeletonization
MCMC Monte Carlo Markov chain
MDL minimum description length
MJPEG motion JPEG
MPEG moving picture experts group
MRF Markov random field
MRI magnetic resonance imaging
MR magnetic resonance
MSE mean-square error
MSER maximally stable extremal region
ms millisecond

arg(x, y) angle (in radians) from x axis to the point (x, y)

argmax expr(i) the value of i that causes expr(i) to be maximal

i
argmin expr(i) the value of i that causes expr(i) to be minimal

i
div integer division or divergence
mod remainder after integer division
round(x) largest integer which is not bigger than x + 0.5
; empty set
Ac complement of set A
A B, B A set A is included in set B
A\B intersection between sets A and B
A[B union of sets A and B
AnB difference between sets A and B
A (uppercase bold) matrices
x (lowercase bold) vectors
jjxjj magnitude (or modulus) of vector x
x y scalar product between vectors x and y
~
x estimate of the value x
jxj absolute value of a scalar
(x) Dirac function
x small finite interval of x, difference
@f =@x partial derivative of the function f with respect to x
rf , grad f gradient of f
r2 f Laplace operator applied to f
f g convolution between functions f and g
F. G element-by-element multiplication of matrices F , G
DE Euclidean distance
D4 city block distance
D8 chessboard distance
F∗ complex conjugate of the complex function F
rank(A) rank of a matrix A
T∗ transformation dual to transformation T , also complex conjugate of T
E mean value operator
L linear operator
O origin of the coordinate system

List of algorithms xxi

Preface xxv
Possible course outlines xxxi
1 Introduction 1
1.1 Motivation 1
1.2 Why is computer vision difficult? 3
1.3 Image representation and image analysis tasks 5
1.4 Summary 9
1.5 Exercises 10
1.6 References 10
2 The image, its representations and properties 11
2.1 Image representations, a few concepts 11
2.2 Image digitization 14
2.2.1 Sampling 14
2.2.2 Quantization 15
2.3 Digital image properties 16
2.3.1 Metric and topological properties of digital images 16
2.3.2 Histograms 23
2.3.3 Entropy 24
2.3.4 Visual perception of the image 25
2.3.5 Image quality 27
2.3.6 Noise in images 28
2.4 Color images 30
2.4.1 Physics of color 30
2.4.2 Color perceived by humans 32
2.4.3 Color spaces 36
2.4.4 Palette images 38
2.4.5 Color constancy 39
2.5 Cameras: An overview 40
2.5.1 Photosensitive sensors 40
2.5.2 A monochromatic camera 42
2.5.3 A color camera 44
2.6 Summary 45

2.7 Exercises 46
2.8 References 48
3 The image, its mathematical and physical background 50
3.1 Overview 50
3.1.1 Linearity 50
3.1.2 The Dirac distribution and convolution 51
3.2 Linear integral transforms 52
3.2.1 Images as linear systems 53
3.2.2 Introduction to linear integral transforms 53
3.2.3 1D Fourier transform 54
3.2.4 2D Fourier transform 59
3.2.5 Sampling and the Shannon constraint 62
3.2.6 Discrete cosine transform 65
3.2.7 Wavelet transform 66
3.2.8 Eigen-analysis 72
3.2.9 Singular value decomposition 73
3.2.10 Principal component analysis 74
3.2.11 Radon transform 77
3.2.12 Other orthogonal image transforms 78
3.3 Images as stochastic processes 79
3.4 Image formation physics 82
3.4.1 Images as radiometric measurements 82
3.4.2 Image capture and geometric optics 83
3.4.3 Lens aberrations and radial distortion 86
3.4.4 Image capture from a radiometric point of view 89
3.4.5 Surface re ectance 92
3.5 Summary 95
3.6 Exercises 97
3.7 References 98
4 Data structures for image analysis 100
4.1 Levels of image data representation 100
4.2 Traditional image data structures 101
4.2.1 Matrices 101
4.2.2 Chains 104
4.2.3 Topological data structures 106
4.2.4 Relational structures 107
4.3 Hierarchical data structures 108
4.3.1 Pyramids 108
4.3.2 Quadtrees 109
4.3.3 Other pyramidal structures 111
4.4 Summary 112
4.5 Exercises 113
4.6 References 115
5 Image pre-processing 116
5.1 Pixel brightness transformations 117

5.1.1 Position-dependent brightness correction 117

5.1.2 Gray-scale transformation 117
5.2 Geometric transformations 120
5.2.1 Pixel co-ordinate transformations 121
5.2.2 Brightness interpolation 123
5.3 Local pre-processing 125
5.3.1 Image smoothing 125
5.3.2 Edge detectors 133
5.3.3 Zero-crossings of the second derivative 139
5.3.4 Scale in image processing 143
5.3.5 Canny edge detection 144
5.3.6 Parametric edge models 147
5.3.7 Edges in multi-spectral images 148
5.3.8 Local pre-processing in the frequency domain 148
5.3.9 Line detection by local pre-processing operators 155
5.3.10 Detection of corners (interest points) 156
5.3.11 Detection of maximally stable extremal regions 160
5.4 Image restoration 162
5.4.1 Degradations that are easy to restore 163
5.4.2 Inverse filtering 163
5.4.3 Wiener filtering 164
5.5 Summary 165
5.6 Exercises 167
5.7 References 174
6 Segmentation I 178
6.1 Thresholding 179
6.1.1 Threshold detection methods 181
6.1.2 Optimal thresholding 183
6.1.3 Multi-spectral thresholding 186
6.2 Edge-based segmentation 187
6.2.1 Edge image thresholding 188
6.2.2 Edge relaxation 190
6.2.3 Border tracing 191
6.2.4 Border detection as graph searching 196
6.2.5 Border detection as dynamic programming 206
6.2.6 Hough transforms 210
6.2.7 Border detection using border location information 217
6.2.8 Region construction from borders 218
6.3 Region-based segmentation 220
6.3.1 Region merging 221
6.3.2 Region splitting 224
6.3.3 Splitting and merging 225
6.3.4 Watershed segmentation 229
6.3.5 Region growing post-processing 232
6.4 Matching 232
6.4.1 Template matching 233
6.4.2 Control strategies of templating 235

6.5 Evaluation issues in segmentation 236

6.5.1 Supervised evaluation 237
6.5.2 Unsupervised evaluation 240
6.6 Summary 241
6.7 Exercises 245
6.8 References 248
7 Segmentation II 255
7.1 Mean shift segmentation 255
7.2 Active contour models snakes 263
7.2.1 Traditional snakes and balloons 264
7.2.2 Extensions 267
7.2.3 Gradient vector ow snakes 268
7.3 Geometric deformable models level sets and geodesic active contours 273
7.4 Fuzzy connectivity 280
7.5 Towards 3D graph-based image segmentation 288
7.5.1 Simultaneous detection of border pairs 289
7.5.2 Suboptimal surface detection 293
7.6 Graph cut segmentation 295
7.7 Optimal single and multiple surface segmentation LOGISMOS 303
7.8 Summary 317
7.9 Exercises 319
7.10 References 321
8 Shape representation and description 329
8.1 Region identification 333
8.2 Contour-based shape representation and description 335
8.2.1 Chain codes 336
8.2.2 Simple geometric border representation 337
8.2.3 Fourier transforms of boundaries 341
8.2.4 Boundary description using segment sequences 343
8.2.5 B-spline representation 346
8.2.6 Other contour-based shape description approaches 348
8.2.7 Shape invariants 349
8.3 Region-based shape representation and description 353
8.3.1 Simple scalar region descriptors 353
8.3.2 Moments 358
8.3.3 Convex hull 360
8.3.4 Graph representation based on region skeleton 365
8.3.5 Region decomposition 370
8.3.6 Region neighborhood graphs 372
8.4 Shape classes 373
8.5 Summary 373
8.6 Exercises 375
8.7 References 379
9 Object recognition 385
9.1 Knowledge representation 386

9.2 Statistical pattern recognition 390

9.2.1 Classification principles 392
9.2.2 Nearest neighbors 393
9.2.3 Classifier setting 395
9.2.4 Classifier learning 398
9.2.5 Support vector machines 400
9.2.6 Cluster analysis 406
9.3 Neural nets 407
9.3.1 Feed-forward networks 409
9.3.2 Unsupervised learning 411
9.3.3 Hopfield neural nets 412
9.4 Syntactic pattern recognition 413
9.4.1 Grammars and languages 415
9.4.2 Syntactic analysis, syntactic classifier 417
9.4.3 Syntactic classifier learning, grammar inference 420
9.5 Recognition as graph matching 421
9.5.1 Isomorphism of graphs and subgraphs 421
9.5.2 Similarity of graphs 425
9.6 Optimization techniques in recognition 426
9.6.1 Genetic algorithms 427
9.6.2 Simulated annealing 430
9.7 Fuzzy systems 432
9.7.1 Fuzzy sets and fuzzy membership functions 432
9.7.2 Fuzzy set operators 434
9.7.3 Fuzzy reasoning 435
9.7.4 Fuzzy system design and training 438
9.8 Boosting in pattern recognition 439
9.9 Random forests 442
9.9.1 Random forest training 444
9.9.2 Random forest decision making 446
9.9.3 Random forest extensions 448
9.10 Summary 448
9.11 Exercises 452
9.12 References 459
10 Image understanding 464
10.1 Image understanding control strategies 466
10.1.1 Parallel and serial processing control 466
10.1.2 Hierarchical control 466
10.1.3 Bottom-up control 467
10.1.4 Model-based control 468
10.1.5 Combined control 469
10.1.6 Non-hierarchical control 472
10.2 SIFT: Scale invariant feature transform 474
10.3 RANSAC: Fitting via random sample consensus 477
10.4 Point distribution models 481
10.5 Active appearance models 492
10.6 Pattern recognition methods in image understanding 503

10.6.1 Classification-based segmentation 503

10.6.2 Contextual image classification 505
10.6.3 Histograms of oriented gradients HOG 509
10.7 Boosted cascades of classifiers 513
10.8 Image understanding using random forests 517
10.9 Scene labeling and constraint propagation 524
10.9.1 Discrete relaxation 525
10.9.2 Probabilistic relaxation 527
10.9.3 Searching interpretation trees 530
10.10 Semantic image segmentation and understanding 531
10.10.1 Semantic region growing 532
10.10.2 Genetic image interpretation 534
10.11 Hidden Markov models 543
10.11.1 Applications 548
10.11.2 Coupled HMMs 549
10.11.3 Bayesian belief networks 551
10.12 Markov random fields 553
10.12.1 Applications to images and vision 555
10.13 Gaussian mixture models and expectation–maximization 556
10.14 Summary 564
10.15 Exercises 568
10.16 References 572
11 3D geometry, correspondence, 3D from intensities 582
11.1 3D vision tasks 583
11.1.1 Marr's theory 585
11.1.2 Other vision paradigms: Active and purposive vision 587
11.2 Basics of projective geometry 589
11.2.1 Points and hyperplanes in projective space 590
11.2.2 Homography 592
11.2.3 Estimating homography from point correspondences 594
11.3 A single perspective camera 598
11.3.1 Camera model 598
11.3.2 Projection and back-projection in homogeneous coordinates 601
11.3.3 Camera calibration from a known scene 602
11.4 Scene reconstruction from multiple views 602
11.4.1 Triangulation 603
11.4.2 Projective reconstruction 604
11.4.3 Matching constraints 605
11.4.4 Bundle adjustment 607
11.4.5 Upgrading the projective reconstruction, self-calibration 608
11.5 Two cameras, stereopsis 609
11.5.1 Epipolar geometry; fundamental matrix 610
11.5.2 Relative motion of the camera; essential matrix 612
11.5.3 Decomposing the fundamental matrix to camera matrices 613
11.5.4 Estimating the fundamental matrix from point correspondences 614
11.5.5 Rectified configuration of two cameras 615
11.5.6 Computing rectification 617

11.6 Three cameras and trifocal tensor 619

11.6.1 Stereo correspondence algorithms 621
11.6.2 Active acquisition of range images 627
11.7 3D information from radiometric measurements 630
11.7.1 Shape from shading 631
11.7.2 Photometric stereo 635
11.8 Summary 636
11.9 Exercises 637
11.10 References 639
12 Use of 3D vision 644
12.1 Shape from X 644
12.1.1 Shape from motion 644
12.1.2 Shape from texture 651
12.1.3 Other shape from X techniques 652
12.2 Full 3D objects 655
12.2.1 3D objects, models, and related issues 655
12.2.2 Line labeling 656
12.2.3 Volumetric representation, direct measurements 658
12.2.4 Volumetric modeling strategies 660
12.2.5 Surface modeling strategies 662
12.2.6 Registering surface patches and their fusion to get a full 3D
model 663
12.3 2D view-based representations of a 3D scene 670
12.3.1 Viewing space 670
12.3.2 Multi-view representations and aspect graphs 670
12.4 3D reconstruction from an unorganized set of 2D views, and Structure
from Motion 671
12.5 Reconstructing scene geometry 674
12.6 Summary 677
12.7 Exercises 678
12.8 References 680
13 Mathematical morphology 684
13.1 Basic morphological concepts 684
13.2 Four morphological principles 686
13.3 Binary dilation and erosion 687
13.3.1 Dilation 688
13.3.2 Erosion 689
13.3.3 Hit-or-miss transformation 692
13.3.4 Opening and closing 692
13.4 Gray-scale dilation and erosion 694
13.4.1 Top surface, umbra, and gray-scale dilation and erosion 694
13.4.2 Umbra homeomorphism theorem, properties of erosion and
dilation, opening and closing 697
13.4.3 Top hat transformation 698
13.5 Skeletons and object marking 699
13.5.1 Homotopic transformations 699

13.5.2 Skeleton, medial axis, maximal ball 699

13.5.3 Thinning, thickening, and homotopic skeleton 701
13.5.4 Quench function, ultimate erosion 704
13.5.5 Ultimate erosion and distance functions 706
13.5.6 Geodesic transformations 707
13.5.7 Morphological reconstruction 709
13.6 Granulometry 711
13.7 Morphological segmentation and watersheds 713
13.7.1 Particle segmentation, marking, and watersheds 713
13.7.2 Binary morphological segmentation 714
13.7.3 Gray-scale segmentation, watersheds 716
13.8 Summary 717
13.9 Exercises 718
13.10 References 720
14 Image data compression 722
14.1 Image data properties 723
14.2 Discrete image transforms in image data compression 724
14.3 Predictive compression methods 727
14.4 Vector quantization 730
14.5 Hierarchical and progressive compression methods 730
14.6 Comparison of compression methods 732
14.7 Other techniques 733
14.8 Coding 733
14.9 JPEG and MPEG image compression 734
14.9.1 JPEG still image compression 734
14.9.2 JPEG–2000 compression 736
14.9.3 MPEG full-motion video compression 738
14.10 Summary 740
14.11 Exercises 742
14.12 References 744

15 Texture 747
15.1 Statistical texture description 750
15.1.1 Methods based on spatial frequencies 750
15.1.2 Co-occurrence matrices 752
15.1.3 Edge frequency 754
15.1.4 Primitive length (run length) 755
15.1.5 Laws' texture energy measures 757
15.1.6 Local binary patterns LBPs 757
15.1.7 Fractal texture description 762
15.1.8 Multiscale texture description wavelet domain approaches 764
15.1.9 Other statistical methods of texture description 768
15.2 Syntactic texture description methods 769
15.2.1 Shape chain grammars 770
15.2.2 Graph grammars 772
15.2.3 Primitive grouping in hierarchical textures 773

15.3 Hybrid texture description methods 775

15.4 Texture recognition method applications 776
15.5 Summary 777
15.6 Exercises 779
15.7 References 782

16 Motion analysis 787

16.1 Differential motion analysis methods 790
16.2 Optical ow 794
16.2.1 Optical ow computation 794
16.2.2 Global and local optical ow estimation 797
16.2.3 Combined local–global optical ow estimation 800
16.2.4 Optical ow in motion analysis 801
16.3 Analysis based on correspondence of interest points 804
16.3.1 Detection of interest points 805
16.3.2 Lucas–Kanade point tracking 805
16.3.3 Correspondence of interest points 807
16.4 Detection of specific motion patterns 810
16.5 Video tracking 814
16.5.1 Background modeling 815
16.5.2 Kernel-based tracking 820
16.5.3 Object path analysis 826
16.6 Motion models to aid tracking 831
16.6.1 Kalman filters 831
16.6.2 Particle filters 837
16.6.3 Semi-supervised tracking TLD 840
16.7 Summary 843
16.8 Exercises 846
16.9 References 848

Index 853

2.1 Distance transform 20

2.2 Computing the brightness histogram 23
2.3 Generation of additive, zero mean Gaussian noise 28
4.1 Co-occurrence matrix Cr (z, y) for the relation r 102
4.2 Integral image construction 103
5.1 Histogram equalization 119
5.2 Smoothing using a rotating mask 130
5.3 Efficient median filtering 131
5.4 Canny edge detector 146
5.5 Harris corner detector 159
5.6 Enumeration of extremal regions. 161
6.1 Basic thresholding 179
6.2 Otsu's threshold detection 184
6.3 Recursive multi-spectral thresholding 186
6.4 Non-maximal suppression of directional edge data 188
6.5 Hysteresis to filter output of an edge detector 189
6.6 Inner boundary tracing 191
6.7 Outer boundary tracing 193
6.8 Extended boundary tracing 195
6.9 Border tracing in gray-level images 196
6.10 A-algorithm graph search 198
6.11 Heuristic search for image borders 205
6.12 Boundary tracing as dynamic programming 208
6.13 Curve detection using the Hough transform 212
6.14 Generalized Hough transform 217
6.15 Region forming from partial borders 219
6.16 Region merging (outline) 221
6.17 Region merging via boundary melting 223
6.18 Split and merge 226
6.19 Split and link to the segmentation tree 227
6.20 Single-pass split-and-merge 228
6.21 Efficient watershed segmentation 230
6.22 Removal of small image regions 232
7.1 Mean shift mode detection 259
7.2 Mean shift discontinuity-preserving filtering 261
7.3 Mean shift image segmentation 262
7.4 Absolute fuzzy connectivity segmentation 282

7.5 Fuzzy object extraction 284

7.6 Fuzzy object extraction with preset connectedness 285
7.7 Graph cut segmentation 300
7.8 Optimal surface segmentation 304
7.9 Multiple optimal surface segmentation 311
8.1 4-neighborhood and 8-neighborhood region labeling 333
8.2 Region identification in run length encoded data 335
8.3 Quadtree region identification 335
8.4 Curvature estimation – HK2003 algorithm 338
8.5 Calculating area in quadtrees 354
8.6 Region area calculation from Freeman 4-connectivity chain code
representation 354
8.7 Region convex hull construction 361
8.8 Simple polygon convex hull detection 363
8.9 Fully parallel skeleton by thinning – MB algorithm 366
8.10 Fully parallel skeleton by thinning – MB2 algorithm 367
8.11 Region graph construction from skeleton 370
9.1 Minimum distance classifier learning and classification 393
9.2 Nearest neighbor search with K-D trees 394
9.3 Learning and classification by estimating normal distribution probability
densities 400
9.4 Support vector machine learning and classification 404
9.5 K-means cluster analysis 406
9.6 Back-propagation learning 410
9.7 Unsupervised learning of the Kohonen feature map 411
9.8 Recognition using a Hopfield net 413
9.9 Syntactic recognition 414
9.10 Graph isomorphism 424
9.11 Maximal clique location 425
9.12 Genetic algorithm 429
9.13 Simulated annealing optimization 431
9.14 Fuzzy system design 438
9.15 AdaBoost 440
9.16 AdaBoost-MH 441
10.1 Bottom-up control 467
10.2 Coronary border detection a combined control strategy 471
10.3 Non-hierarchical control 472
10.4 Scale Invariant Feature Transform SIFT 476
10.5 Random sample consensus for model fitting RANSAC 478
10.6 Approximate alignment of similar training shapes 482
10.7 Fitting an ASM 487
10.8 AAM construction 492
10.9 Active appearance model matching 495
10.10 Contextual image classification 507
10.11 Recursive contextual image classification 508
10.12 HOG object detection and localization 510
10.13 Classifier generation for Viola-Jones face detection 514
10.14 Discrete relaxation 527

10.15 Probabilistic relaxation 529

10.16 Updating a region adjacency graph and dual to merge two regions 532
10.17 Semantic region merging 533
10.18 Genetic image segmentation and interpretation 537
10.19 Gaussian mixture parameters via expectation-maximization 559
10.20 Expectation-maximization (a generalization of Algorithm 10.19) 562
10.21 Baum-Welch training for HMMs (the forward-backward algorithm) 564
11.1 Image rectification 618
11.2 PMF stereo correspondence 626
11.3 Reconstructing shape from shading 633
12.1 Line labeling 657
12.2 Iterative closest reciprocal points 668
15.1 Auto-correlation texture description 750
15.2 Co-occurrence method of texture description 753
15.3 Edge-frequency texture description 754
15.4 Primitive-length texture description 756
15.5 Shape chain grammar texture synthesis 770
15.6 Texture primitive grouping 774
16.1 Relaxation computation of optical ow from dynamic image pairs 796
16.2 Optical ow computation from an image sequence 796
16.3 General Lucas–Kanade tracking 806
16.4 Velocity field computation from two consecutive images 808
16.5 Background maintenance by median filtering 816
16.6 Background maintenance by Gaussian mixtures 818
16.7 Kernel-based object tracking 823
16.8 Condensation (particle filtering) 837
16.9 Tracking-Learning-Detection TLD 842

Title: Violet Forster's Lover

Author: Richard Marsh

Illustrator: E. S. Hodgson

Release date: August 8, 2012 [eBook #40450]

Most recently updated: October 23, 2024

Language: English

Credits: Produced by Charles Bowen, from page scans provided by

Google Books (Oxford University)

*** START OF THE PROJECT GUTENBERG EBOOK VIOLET

FORSTER'S LOVER ***
Transcriber's Notes:

1. Page scan source:

http://books.google.com/books?id=3DwPAAAAQAAJ
(Oxford University)
VIOLET FORSTER'S LOVER

By the Same Author

TWIN SISTERS

THE LOVELY MRS.

BLAKE

THE INTERRUPTED
KISS

Cassell & Co., Ltd.,

London
"'Sydney!' she cried. 'My darling!
Thank God, it's you.'" (see page 145).
VIOLET FORSTER'S LOVER

BY
RICHARD MARSH
Author of "The Interrupted Kiss,"
"The Lovely Mrs. Blake," "Twin Sisters," etc. etc.

WITH A FRONTISPIECE IN COLOUR BY

E. S. HODGSON

CASSELL AND COMPANY, LTD.

London, New York, Toronto and Melbourne
1912
ALL RIGHTS RESERVED
CONTENTS

CHAPTER
1. The Card on the Floor.
2. While the Groom Waited.
3. "Stop, Thief!"
4. The Good Samaritan.
5. Dreaming.
6. His Wife.
7. Among Thieves.
8. The Sandwich-man.
9. The Drapery.
10. The Woman Tempted Me.
11. In the Wood.
12. "What Does it Mean?"
13. The Alcove.
14. "Who is Simmons?"
15. 'Twixt the Dark and Daylight.
16. The Lacquered Club.
17. Sleepers Awakened.
18. In Bed.
19. The Two Women.
20. The Leather Bag.
21. An Envelope.
22. The Countess and Violet.
23. The Latest Story.
24. 2A Cobden Mansions.
25. Julia Spurrier.
26. Happiness!
27. A Game of Billiards.
28. An Irregular Visitor.
29. The Visitor Remains.
The Story of what Happened after the
30.
Easter Ball.
31. Asking Forgiveness.
32. In the Taxicab.
33. "Vi!"
34. Some Letters and a Telegram.

VIOLET FORSTER'S LOVER

CHAPTER I
The Card on the Floor

Tickell turned his cards.

"A straight." The men all bent over to look. "King high--there you
are, nine, ten, knave, queen, king; a mixed lot, but they'll take some
beating."

Something on Beaton's face seemed to suggest that the other's

hand was unexpectedly strong. He smiled--not easily.

"You're right, they will; and I'm afraid----" He turned his hand half
over, then, letting the five cards fall uppermost on the table, sat and
stared at him, as if startled. It was Major Reith who announced the
value of the hand.

"A full and ace high--he's got you, Jack; a bumper, Sydney."

He pushed the salver which served as a pool over towards

Beaton. Obviously it contained a great deal of money; there were
both notes and gold, and cheques and half-sheets of paper.

"What will you take for it, Sydney?" asked George Pierce.

Anthony Dodwell interposed.

"One moment, before Beaton takes either the pool or--anything

else. Perhaps he won't mind saying what is the card that he dropped
on the floor."
They all looked at him--Beaton with a sudden startled turn of the
head.

"What do you mean?" he asked.

Dodwell met his eager gaze with a calmness which, in its way,
was almost ominous.

"I'm afraid that question is quite unnecessary; I fancy you know

quite well what I mean. Will you pick up the card you dropped, or
shall I?"

"I dropped no card." He drew his chair a little away from the table
so as to enable him to see the floor. "I didn't know it, but there does
seem to be one down there."

"Unless some good fairy removed it since you dropped it, there
was bound to be. Draycott, would you mind picking up that card?"

Noel Draycott, stooping, picking up the card, showed it to the

assembled players, in whose demeanour, for some as yet unspoken
reason, there seemed to have come a sudden change.

"It's only the nine of spades."

"Exactly, which was possibly the reason why Beaton dropped it;
with the nine of spades he could hardly have made a full."

Beaton rose to his feet, his face flushed, his tones raised.

"Dodwell, are you--are you insinuating----" The other cut him

short.

"I'm insinuating nothing. You are the dealer; there's a pack close
to your hand; you gave yourself three cards; I saw you glance at
them, then drop one on to the floor, and take another off the top of
the pack--in the hope, I presume, that it was a better one. It clearly
was; the card you dropped was the nine of spades; the hand you
have shown there consists of three aces and a pair of knaves; I can't
say which was the card you took from the top of the pack, but it was
one of them, and it certainly gave you the full."

There was silence, that curious silence which suggests discomfort,

which presages a storm. It is not often that an accusation of foul
play is made at a card-table around which are seated English
gentlemen. These men were officers in one of His Majesty's
regiments of Guards; they were having what they called "a little
flutter at poker" after the mess dinner--it had gone farther perhaps
than some of them had intended. Considerable sums had been
staked, and won and lost. Sydney Beaton in particular had punted
heavily. For the most part he had lost--all his ready cash and more.
For some time he had been betting with I.O.U.'s scribbled on odd
scraps of paper. There had just been a jackpot. Five men had come
in, dropping out one after the other until only Beaton and Tickell had
been left. Tickell's last raise had been a hundred pounds; Beaton
had covered the bet with an I.O.U. for £100 to see him; the hand he
had exposed was, of course, the better one; there was a large sum
of money in the pool, much the largest which it had as yet
contained; if it was his, then it would probably more than set him on
his feet again. It was the fact that there seemed to be an "if" which
caused those present to stare at each other and at him as if all at
once tongue-tied.

Beaton had gone red, then white; and now one felt that
something must have happened to the muscles of his face, its
expression seemed to have become so set and rigid. Major Reith,
who was the oldest man present, broke the silence.

"Dodwell, please be careful what you say. Come, Sydney, tell him
he is mistaken."

What Beaton said was gasped rather than spoken.

"It's a lie!"

Dodwell's manner continued unruffled. He turned to Draycott.

"Noel, I fancy I caught your eye. Am I wrong in supposing that

you also saw what happened?"

"I'm afraid I did."

"You saw Beaton drop one of the three cards he gave himself, and
take another off the top of the pack?"

"I'm afraid I did."

As Draycott repeated his former words, Beaton, still on his feet,

swinging round, struck him with such violence that the man and the
chair on which he was seated both went together to the floor. The
thing was so unexpected that it had been done before anyone could
interpose. Frank Clifford, who was on the other side of him, caught
at Beaton's arm.

"Sydney! That won't do!"

Beaton, instead of heeding his words, was endeavouring to thrust

the table away in order to get at Dodwell, who was on the other
side. The others were able to prevent his doing that.

"If I get at him," he gasped, "I'll kill him."

But they did not allow him to get at his accuser, for they held him
back; and they were five or six to one. Major Reith spoke.

"Don't make bad worse, Beaton, please; this is not a matter with
which you can deal on quite those lines. Do we understand you to
deny what Dodwell and Draycott say?"

The fact was, Beaton had not only had his share of wine at the
table, he had been drinking since, liqueur after liqueur. Trifles of that
kind, when in sufficient numbers, do not tend to cool a young man's
already heated brain. For longer than they supposed Sydney had not
been his real self; many and various were the causes which had
been tending to make him lose his balance. Then, in that supreme
moment, when he needed to keep his head more than ever in his
life, he lost his balance altogether and played the fool.

"Do you think," he shouted, "that I'll condescend to deny such a

charge coming from a beast like Draycott and a cur like Dodwell? I
tell you what I will do, I'll take them on both together and fight them
to a standstill, and choke their infernal lies back into their throats.
Major Harold Reith, if I do get hold of you, I'll tear your lying tongue
out by the roots."

He tried to get at the major, but of course they would not let him.
For a few minutes there was a discreditable scene; Beaton behaved
like a lunatic. Those who tried to keep him from attacking Major
Reith he fought tooth and nail. Between them he was borne to the
ground, then, as if he had been some wild beast, they had to drag
him out of the room, and fling the door to in his face.

When, later, inquiries were made as to his whereabouts, he was

not to be found. His room was empty. He had apparently paid a
hurried visit to it. His mess uniform was on the floor. Apparently he
had torn it off him and attired himself in something else. What he
had done afterwards there was little to show. The sentry on duty,
when closely questioned, said that Captain Beaton, in civilian dress,
had passed him, reeling like a drunken man, and vanished into the
night. The sentry was the last man connected with his regiment who
saw him. Not a line came from him; nothing was heard; the place
which had known him knew him no more. He had gone, a pariah,
out into the world. He had been one of the best-liked men in the
regiment; there were many who missed him; but there was one
whose heart was nearly broken.
CHAPTER II
While the Groom Waited

Two days before that fatal night Sydney Beaton had gone down to
see his brother, Sir George Beaton, head of the family, and
practically its sole representative, in his old home at Adisham, in the
County of Wilts. The visit had been of the nature of a forlorn hope.
Sydney wanted help, pecuniary help, as he had done more than
once before. He was in a very tight place. He had piled folly on to
folly, and just lately he had surmounted the pile with the biggest of
the lot. If he could not get money quickly matters would go very ill
with him. Money-lenders and all those sort of people were not to be
persuaded; he owed them already more than they ever expected to
get. Nor did he know of any friend or acquaintance who would be
likely to do what he required; his credit was bad even among them.
He did not think he would be able to get the money from his
brother; George had told him on a previous occasion that he would
never let him have another farthing; there was evidence that he
meant to keep his word. Still, Sydney had to try lest worse befell.

But he failed, badly. There was something very like a quarrel.

Sydney confessed, after a fashion. He warned George that if he did
not get the money he wanted the family name might suffer. George,
in reply, said right out what he thought of him; he made it quite
clear that his opinion of his brother could hardly have been a worse
one. He refused to let him have even so much as a five-pound note.

"Sydney," he said with brutal frankness, "nothing can save you--

certainly my money can't; I mean, nothing can save you from
yourself. I mayn't be the steadiest mover; I'm not holding myself up
as an example----"

"There you show your wisdom."

"But you--you're the limit. In the sense in which they use the
word in the stable, you're a rogue. You're worse than an unbroken,
bad-tempered colt; you're not safe either to ride or drive. You're
absolutely certain to come a cropper, and probably a bad one. I give
you my word that I have no intention, if I can help it, of letting you
bring me down with you. You know, I'm not a rich man; I want all
the money I've got for my own use----"

"That I will admit."

"If you had your way you'd make a bankrupt of me in another

couple of years. But you're not going to have your own way; not
another sovereign do you get out of me. That's my last word."

The younger brother seemed to be moistening his lips before

answering; there was a strained look in his eyes.

"You understand that if you won't help me I'm in a hole?"

"I understand that clearly. I also understand that if I won't, what

you call, 'help' you, you'll drag me in with you. In fact, what you're
after is sheer blackmail. If there had been a witness of our
conversation, I could give you into custody for attempting to obtain
money by means of threats, and you'd be convicted. If the family
name is to be dragged in the mud by you, then I shall want all the
money I have to get it out again. Hadn't you better go? I don't
propose to offer you a bed for the night, and if you waste much
more time the last train will need some catching."

Sydney did go, after some very unbrotherly words had been
exchanged; but he did not catch the last train. The last train from
that part of the world left early; another interview which
Welcome to our website – the ideal destination for book lovers and
knowledge seekers. With a mission to inspire endlessly, we offer a
vast collection of books, ranging from classic literary works to
specialized publications, self-development books, and children's
literature. Each book is a new journey of discovery, expanding
knowledge and enriching the soul of the reade

Our website is not just a platform for buying books, but a bridge
connecting readers to the timeless values of culture and wisdom. With
an elegant, user-friendly interface and an intelligent search system,
we are committed to providing a quick and convenient shopping
experience. Additionally, our special promotions and home delivery
services ensure that you save time and fully enjoy the joy of reading.