【离散数学】 SEU - 06 - 2021/03/19 - Rules of Inference

最新推荐文章于 2021-09-09 05:35:18 发布
最新推荐文章于 2021-09-09 05:35:18 发布
阅读量367 收藏 2
点赞数
分类专栏： 【离散数学】 文章标签： 离散数学 数学 Mathematics
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/weixin_50012998/article/details/114998463
版权

Discrete Mathematics and its Applications (8th Edition)
2021/03/19 - Rules of Inference

Contents

1 The Foundations: Logic and Proofs

1.5 Nested Quantifiers

Prenex Normal Form

PNF is a statement which is of the form
PNF

PNF Existence Theorem

Every compound formula can be transformed into an equivalent PNF.

  1. Replace → , ↔ \rightarrow, \leftrightarrow →,↔ by ¬ , ∧ , ∨ \neg, \wedge, \vee ¬,∧,∨
  2. Move ¬ \neg ¬ before atomic formula
  3. Applying rule of name replacement
  4. Move quantifiers in the front

Prenex Conjunctive Normal Form

PCNF

1.6 Rules of Inference

1.6.2 Valid Arguments in Propositional Logic

Revisiting the Socrates Example

Revisiting the Socrates Example

How to construct valid arguments
Arguments in Propositional Logic

An argument in propositional logic is a sequence of propositions. All but the final proposition are called premises. The last statement is the conclusion. An argument is valid if the truth of all its premises implies that the conclusion is true.
An argument form in propositional logic is a sequence of compound propositions involving propositional variables. An argument form is valid if no matter which particular propositions are substituted for the propositional variables in its premises, the conclusion is true if the premises are all true.

1.6.3 Rules of Inference for Propositional Logic

Modus Penens

( p ∧ ( p → q ) ) → q (p\wedge(p\rightarrow q))\rightarrow q (p∧(p→q))→q

Modus Tollens

( ¬ p ∧ ( p → q ) ) → ¬ p (\neg p\wedge(p\rightarrow q))\rightarrow \neg p (¬p∧(p→q))→¬p

Hypothetical Syllogism

( ( p → q ) ∧ ( q → r ) ) → ( p → r ) ((p\rightarrow q)\wedge(q\rightarrow r))\rightarrow (p\rightarrow r) ((p→q)∧(q→r))→(p→r)

Disjunctive Syllogism

( ¬ p ∧ ( p ∨ q ) ) → q (\neg p\wedge(p\vee q))\rightarrow q (¬p∧(p∨q))→q

Addition

p → ( p ∨ q ) p\rightarrow(p\vee q) p→(p∨q)

Simplification

( p ∧ q ) → p (p\wedge q)\rightarrow p (p∧q)→p

Conjunction

( ( p ) ∧ ( q ) ) → ( p ∧ q ) ((p)\wedge(q))\rightarrow (p\wedge q) ((p)∧(q))→(p∧q)

Resolution

( ( ¬ p ∧ r ) ∧ ( p ∨ q ) ) → ( q ∨ r ) ((\neg p\wedge r)\wedge(p\vee q))\rightarrow (q\vee r) ((¬p∧r)∧(p∨q))→(q∨r)

Table

1.6.4 Using Rules of Inference to Build Arguments

A valid argument is a sequence of statements. Each statement is either a premise or follows from previous statements by rules of inference. The last statement is called conclusion.
A valid argument takes the following form:
S 1 S 2 S n ⋮ ∴ C S1\\S2\\Sn\\\vdots\\\therefore C S1S2Sn⋮∴C

Example:
Premises:
“It is not sunny this afternoon and it is colder than yesterday.”
“We will go swimming only if it is sunny.”
“If we do not go swimming, then we will take a canoe trip.”
“If we take a canoe trip, then we will be home by sunset.”
Conclusion: “We will be home by sunset.”
Solution:

  1. Choose propositional variables:
    p : “It is sunny this afternoon.”
    q : “It is colder than yesterday.”
    r : “We will go swimming.”
    s : “We will take a canoe trip.”
    t : “We will be home by sunset.”
  2. Translation into propositional logic:
    premises: ¬p ∧ q, r → p, ¬r → s, s → t, conclusion: t.
  3. Construct the Valid Argument

Assignment

ALL RIGHTS RESERVED © 2021 Teddy van Jerry
This blog is licensed under the CC 4.0 Licence.

See also

Teddy van Jerry’s CSDN Homepage
Teddy van Jerry’s GitHub Homepage

Teddy van Jerry
关注
  • 0
    点赞
  • 踩
  • 2
    收藏
    觉得还不错? 一键收藏
  • 1
    评论
专栏目录
RuleFest 规则引擎
01-31
Rule Engine ： Using Constraint Solvers as Inference Engines to Validate and Execute Rules-Based Decision ModelsJacob Feldman, Ph.D.Founder & CTO, OpenRules, Inc.JSR-331 Specification Lead
计算机视觉（英文版）
07-20
CONTENTS I IMAGEFORMATION 1 1 RADIOMETRY — MEASURING LIGHT 3 1.1 Light in Space 3 1.1.1 Foreshortening 3 1.1.2 Solid Angle 4 1.1.3 Radiance 6 1.2 Light at Surfaces 8 1.2.1 Simplifying Assumptions 9 1.2.2 The Bidirectional Reflectance Distribution Function 9 1.3 Important Special Cases 11 1.3.1 Radiosity 11 1.3.2 Directional Hemispheric Reflectance 12 1.3.3 Lambertian Surfaces and Albedo 12 1.3.4 Specular Surfaces 13 1.3.5 The Lambertian + Specular Model 14 1.4 Quick Reference: Radiometric Terminology for Light 16 1.5 Quick Reference: Radiometric Properties of Surfaces 17 1.6 Quick Reference: Important Types of Surface 18 1.7 Notes 19 1.8 Assignments 19 2 SOURCES, SHADOWS AND SHADING 21 2.1 Radiometric Properties of Light Sources 21 2.2 Qualitative Radiometry 22 2.3 Sources and their Effects 23 2.3.1 Point Sources 24 v vi 2.3.2 Line Sources 26 2.3.3 Area Sources 27 2.4 Local Shading Models 28 2.4.1 Local Shading Models for Point Sources 28 2.4.2 Area Sources and their Shadows 31 2.4.3 Ambient Illumination 31 2.5 Application: Photometric Stereo 33 2.5.1 Normal and Albedo from Many Views 36 2.5.2 Shape from Normals 37 2.6 Interreflections: Global Shading Models 40 2.6.1 An Interreflection Model 42 2.6.2 Solving for Radiosity 43 2.6.3 The qualitative effects of interreflections 45 2.7 Notes 47 2.8 Assignments 50 2.8.1 Exercises 50 2.8.2 Programming Assignments 51 3 COLOUR 53 3.1 The Physics of Colour 53 3.1.1 Radiometry for Coloured Lights: Spectral Quantities 53 3.1.2 The Colour of Surfaces 54 3.1.3 The Colour of Sources 55 3.2 Human Colour Perception 58 3.2.1 Colour Matching 58 3.2.2 Colour Receptors 61 3.3 Representing Colour 63 3.3.1 Linear Colour Spaces 63 3.3.2 Non-linear Colour Spaces 68 3.3.3 Spatial and Temporal Effects 73 3.4 Application: Finding Specularities 73 3.5 Surface Colour from Image Colour 77 3.5.1 Surface Colour Perception in People 77 3.5.2 Inferring Lightness 80 3.5.3 A Model for Image Colour 83 3.5.4 Surface Colour from Finite Dimensional Linear Models 86 3.6 Notes 89 vii 3.6.1 Trichromacy and Colour Spaces 89 3.6.2 Lightness and Colour Constancy 90 3.6.3 Colour in Recognition 91 3.7 Assignments 91 II IMAGE MODELS 94 4 GEOMETRIC IMAGE FEATURES 96 4.1 Elements of Differential Geometry 100 4.1.1 Curves 100 4.1.2 Surfaces 105 Application: The shape of specularities 109 4.2 Contour Geometry 112 4.2.1 The Occluding Contour and the Image Contour 113 4.2.2 The Cusps and Inflections of the Image Contour 114 4.2.3 Koenderink’s Theorem 115 4.3 Notes 117 4.4 Assignments 118 5 ANALYTICAL IMAGE FEATURES 120 5.1 Elements of Analytical Euclidean Geometry 120 5.1.1 Coordinate Systems and Homogeneous Coordinates 121 5.1.2 Coordinate System Changes and Rigid Transformations 124 5.2 Geometric Camera Parameters 129 5.2.1 Intrinsic Parameters 129 5.2.2 Extrinsic Parameters 132 5.2.3 A Characterization of Perspective Projection Matrices 132 5.3 Calibration Methods 133 5.3.1 A Linear Approach to Camera Calibration 134 Technique: Linear Least Squares Methods 135 5.3.2 Taking Radial Distortion into Account 139 5.3.3 Using Straight Lines for Calibration 140 5.3.4 Analytical Photogrammetry 143 Technique: Non-Linear Least Squares Methods 145 5.4 Notes 147 5.5 Assignments 147 viii 6 AN INTRODUCTION TO PROBABILITY 150 6.1 Probability in Discrete Spaces 151 6.1.1 Probability: the P-function 151 6.1.2 Conditional Probability 153 6.1.3 Choosing P 153 6.2 Probability in Continuous Spaces 159 6.2.1 Event Structures for Continuous Spaces 159 6.2.2 Representing a P-function for the Real Line 160 6.2.3 Probability Densities 161 6.3 Random Variables 161 6.3.1 Conditional Probability and Independence 162 6.3.2 Expectations 163 6.3.3 Joint Distributions and Marginalization 165 6.4 Standard Distributions and Densities 165 6.4.1 The Normal Distribution 167 6.5 Probabilistic Inference 167 6.5.1 The Maximum Likelihood Principle 168 6.5.2 Priors, Posteriors and Bayes’ rule 170 6.5.3 Bayesian Inference 170 6.5.4 Open Issues 177 6.6 Discussion 178 III EARLY VISION: ONE IMAGE 180 7 LINEAR FILTERS 182 7.1 Linear Filters and Convolution 182 7.1.1 Convolution 182 7.1.2 Example: Smoothing by Averaging 183 7.1.3 Example: Smoothing with a Gaussian 185 7.2 Shift invariant linear systems 186 7.2.1 Discrete Convolution 188 7.2.2 Continuous Convolution 190 7.2.3 Edge Effects in Discrete Convolutions 192 7.3 Spatial Frequency and Fourier Transforms 193 7.3.1 Fourier Transforms 193 7.4 Sampling and Aliasing 197 7.4.1 Sampling 198 ix 7.4.2 Aliasing 201 7.4.3 Smoothing and Resampling 202 7.5 Technique: Scale and Image Pyramids 204 7.5.1 The Gaussian Pyramid 205 7.5.2 Applications of Scaled Representations 206 7.5.3 Scale Space 208 7.6 Discussion 211 7.6.1 Real Imaging Systems vs Shift-Invariant Linear Systems 211 7.6.2 Scale 212 8 EDGE DETECTION 214 8.1 Estimating Derivatives with Finite Differences 214 8.1.1 Differentiation and Noise 216 8.1.2 Laplacians and edges 217 8.2 Noise 217 8.2.1 Additive Stationary Gaussian Noise 219 8.3 Edges and Gradient-based Edge Detectors 224 8.3.1 Estimating Gradients 224 8.3.2 Choosing a Smoothing Filter 225 8.3.3 Why Smooth with a Gaussian? 227 8.3.4 Derivative of Gaussian Filters 229 8.3.5 Identifying Edge Points from Filter Outputs 230 8.4 Commentary 234 9 FILTERS AND FEATURES 237 9.1 Filters as Templates 237 9.1.1 Convolution as a Dot Product 237 9.1.2 Changing Basis 238 9.2 Human Vision: Filters and Primate Early Vision 239 9.2.1 The Visual Pathway 239 9.2.2 How the Visual Pathway is Studied 241 9.2.3 The Response of Retinal Cells 241 9.2.4 The Lateral Geniculate Nucleus 242 9.2.5 The Visual Cortex 243 9.2.6 A Model of Early Spatial Vision 246 9.3 Technique: Normalised Correlation and Finding Patterns 248 9.3.1 Controlling the Television by Finding Hands by Normalised Correlation 248 x 9.4 Corners and Orientation Representations 249 9.5 Advanced Smoothing Strategies and Non-linear Filters 252 9.5.1 More Noise Models 252 9.5.2 Robust Estimates 253 9.5.3 Median Filters 254 9.5.4 Mathematical morphology: erosion and dilation 257 9.5.5 Anisotropic Scaling 258 9.6 Commentary 259 10 TEXTURE 261 10.1 Representing Texture 263 10.1.1 Extracting Image Structure with Filter Banks 263 10.2 Analysis (and Synthesis) Using Oriented Pyramids 268 10.2.1 The Laplacian Pyramid 269 10.2.2 Oriented Pyramids 272 10.3 Application: Synthesizing Textures for Rendering 272 10.3.1 Homogeneity 274 10.3.2 Synthesis by Matching Histograms of Filter Responses 275 10.3.3 Synthesis by Sampling Conditional Densities of Filter Responses280 10.3.4 Synthesis by Sampling Local Models 284 10.4 Shape from Texture: Planes and Isotropy 286 10.4.1 Recovering the Orientation of a Plane from an Isotropic Texture288 10.4.2 Recovering the Orientation of a Plane from an Homogeneity Assumption 290 10.4.3 Shape from Texture for Curved Surfaces 291 10.5 Notes 292 10.5.1 Shape from Texture 293 IV EARLY VISION: MULTIPLE IMAGES 295 11 THE GEOMETRY OF MULTIPLE VIEWS 297 11.1 Two Views 298 11.1.1 Epipolar Geometry 298 11.1.2 The Calibrated Case 299 11.1.3 Small Motions 300 11.1.4 The Uncalibrated Case 301 11.1.5 Weak Calibration 302 xi 11.2 Three Views 305 11.2.1 Trifocal Geometry 307 11.2.2 The Calibrated Case 307 11.2.3 The Uncalibrated Case 309 11.2.4 Estimation of the Trifocal Tensor 310 11.3 More Views 311 11.4 Notes 317 11.5 Assignments 319 12 STEREOPSIS 321 12.1 Reconstruction 323 12.1.1 Camera Calibration 324 12.1.2 Image Rectification 325 Human Vision: Stereopsis 327 12.2 Binocular Fusion 331 12.2.1 Correlation 331 12.2.2 Multi-Scale Edge Matching 333 12.2.3 Dynamic Programming 336 12.3 Using More Cameras 338 12.3.1 Trinocular Stereo 338 12.3.2 Multiple-Baseline Stereo 340 12.4 Notes 341 12.5 Assignments 343 13 AFFINE STRUCTURE FROM MOTION 345 13.1 Elements of Affine Geometry 346 13.2 Affine Structure from Two Images 349 13.2.1 The Affine Structure-from-Motion Theorem 350 13.2.2 Rigidity and Metric Constraints 351 13.3 Affine Structure from Multiple Images 351 13.3.1 The Affine Structure of Affine Image Sequences 352 Technique: Singular Value Decomposition 353 13.3.2 A Factorization Approach to Affine Motion Analysis 353 13.4 From Affine to Euclidean Images 356 13.4.1 Euclidean Projection Models 357 13.4.2 From Affine to Euclidean Motion 358 13.5 Affine Motion Segmentation 360 13.5.1 The Reduced Echelon Form of the Data Matrix 360 xii 13.5.2 The Shape Interaction Matrix 360 13.6 Notes 362 13.7 Assignments 363 14 PROJECTIVE STRUCTURE FROM MOTION 365 14.1 Elements of Projective Geometry 366 14.1.1 Projective Bases and Projective Coordinates 366 14.1.2 Projective Transformations 368 14.1.3 Affine and Projective Spaces 370 14.1.4 Hyperplanes and Duality 371 14.1.5 Cross-Ratios 372 14.1.6 Application: Parameterizing the Fundamental Matrix 375 14.2 Projective Scene Reconstruction from Two Views 376 14.2.1 Analytical Scene Reconstruction 376 14.2.2 Geometric Scene Reconstruction 378 14.3 Motion Estimation from Two or Three Views 379 14.3.1 Motion Estimation from Fundamental Matrices 379 14.3.2 Motion Estimation from Trifocal Tensors 381 14.4 Motion Estimation from Multiple Views 382 14.4.1 A Factorization Approach to Projective Motion Analysis 383 14.4.2 Bundle Adjustment 386 14.5 From Projective to Euclidean Structure and Motion 386 14.5.1 Metric Upgrades from (Partial) Camera Calibration 387 14.5.2 Metric Upgrades from Minimal Assumptions 389 14.6 Notes 392 14.7 Assignments 394 V MID-LEVEL VISION 399 15 SEGMENTATION USING CLUSTERING METHODS 401 15.1 Human vision: Grouping and Gestalt 403 15.2 Applications: Shot Boundary Detection, Background Subtraction and Skin Finding 407 15.2.1 Background Subtraction 407 15.2.2 Shot Boundary Detection 408 15.2.3 Finding Skin Using Image Colour 410 15.3 Image Segmentation by Clustering Pixels 411 xiii 15.3.1 Simple Clustering Methods 411 15.3.2 Segmentation Using Simple Clustering Methods 413 15.3.3 Clustering and Segmentation by K-means 415 15.4 Segmentation by Graph-Theoretic Clustering 417 15.4.1 Basic Graphs 418 15.4.2 The Overall Approach 420 15.4.3 Affinity Measures 420 15.4.4 Eigenvectors and Segmentation 424 15.4.5 Normalised Cuts 427 15.5 Discussion 430 16 FITTING 436 16.1 The Hough Transform 437 16.1.1 Fitting Lines with the Hough Transform 437 16.1.2 Practical Problems with the Hough Transform 438 16.2 Fitting Lines 440 16.2.1 Least Squares, Maximum Likelihood and Parameter Estimation441 16.2.2 Which Point is on Which Line? 444 16.3 Fitting Curves 445 16.3.1 Implicit Curves 446 16.3.2 Parametric Curves 449 16.4 Fitting to the Outlines of Surfaces 450 16.4.1 Some Relations Between Surfaces and Outlines 451 16.4.2 Clustering to Form Symmetries 453 16.5 Discussion 457 17 SEGMENTATION AND FITTING USING PROBABILISTICMETHODS 460 17.1 Missing Data Problems, Fitting and Segmentation 461 17.1.1 Missing Data Problems 461 17.1.2 The EM Algorithm 463 17.1.3 Colour and Texture Segmentation with EM 469 17.1.4 Motion Segmentation and EM 470 17.1.5 The Number of Components 474 17.1.6 How Many Lines are There? 474 17.2 Robustness 475 17.2.1 Explicit Outliers 475 17.2.2 M-estimators 477 xiv 17.2.3 RANSAC 480 17.3 How Many are There? 483 17.3.1 Basic Ideas 484 17.3.2 AIC — An Information Criterion 484 17.3.3 Bayesian methods and Schwartz’ BIC 485 17.3.4 Description Length 486 17.3.5 Other Methods for Estimating Deviance 486 17.4 Discussion 487 18 TRACKING 489 18.1 Tracking as an Abstract Inference Problem 490 18.1.1 Independence Assumptions 490 18.1.2 Tracking as Inference 491 18.1.3 Overview 492 18.2 Linear Dynamic Models and the Kalman Filter 492 18.2.1 Linear Dynamic Models 492 18.2.2 Kalman Filtering 497 18.2.3 The Kalman Filter for a 1D State Vector 497 18.2.4 The Kalman Update Equations for a General State Vector 499 18.2.5 Forward-Backward Smoothing 500 18.3 Non-Linear Dynamic Models 505 18.3.1 Unpleasant Properties of Non-Linear Dynamics 508 18.3.2 Difficulties with Likelihoods 509 18.4 Particle Filtering 511 18.4.1 Sampled Representations of Probability Distributions 511 18.4.2 The Simplest Particle Filter 515 18.4.3 A Workable Particle Filter 518 18.4.4 If’s, And’s and But’s — Practical Issues in Building Particle Filters 519 18.5 Data Association 523 18.5.1 Choosing the Nearest — Global Nearest Neighbours 523 18.5.2 Gating and Probabilistic Data Association 524 18.6 Applications and Examples 527 18.6.1 Vehicle Tracking 528 18.6.2 Finding and Tracking People 532 18.7 Discussion 538 II Appendix: The Extended Kalman Filter, or EKF 540 xv VI HIGH-LEVEL VISION 542 19 CORRESPONDENCE AND POSE CONSISTENCY 544 19.1 Initial Assumptions 544 19.1.1 Obtaining Hypotheses 545 19.2 Obtaining Hypotheses by Pose Consistency 546 19.2.1 Pose Consistency for Perspective Cameras 547 19.2.2 Affine and Projective Camera Models 549 19.2.3 Linear Combinations of Models 551 19.3 Obtaining Hypotheses by Pose Clustering 553 19.4 Obtaining Hypotheses Using Invariants 554 19.4.1 Invariants for Plane Figures 554 19.4.2 Geometric Hashing 559 19.4.3 Invariants and Indexing 560 19.5 Verification 564 19.5.1 Edge Proximity 565 19.5.2 Similarity in Texture, Pattern and Intensity 567 19.5.3 Example: Bayes Factors and Verification 567 19.6 Application: Registration in Medical Imaging Systems 568 19.6.1 Imaging Modes 569 19.6.2 Applications of Registration 570 19.6.3 Geometric Hashing Techniques in Medical Imaging 571 19.7 Curved Surfaces and Alignment 573 19.8 Discussion 576 20 FINDING TEMPLATES USING CLASSIFIERS 581 20.1 Classifiers 582 20.1.1 Using Loss to Determine Decisions 582 20.1.2 Overview: Methods for Building Classifiers 584 20.1.3 Example: A Plug-in Classifier for Normal Class-conditional Densities 586 20.1.4 Example: A Non-Parametric Classifier using Nearest Neighbours 587 20.1.5 Estimating and Improving Performance 588 20.2 Building Classifiers from Class Histograms 590 20.2.1 Finding Skin Pixels using a Classifier 591 20.2.2 Face Finding Assuming Independent Template Responses 592 20.3 Feature Selection 595 xvi 20.3.1 Principal Component Analysis 595 20.3.2 Canonical Variates 597 20.4 Neural Networks 601 20.4.1 Key Ideas 601 20.4.2 Minimizing the Error 606 20.4.3 When to Stop Training 610 20.4.4 Finding Faces using Neural Networks 610 20.4.5 Convolutional Neural Nets 612 20.5 The Support Vector Machine 615 20.5.1 Support Vector Machines for Linearly Separable Datasets 616 20.5.2 Finding Pedestrians using Support Vector Machines 618 20.6 Conclusions 622 II Appendix: Support Vector Machines for Datasets that are not Linearly Separable 624 III Appendix: Using Support Vector Machines with Non-Linear Kernels 625 21 RECOGNITION BY RELATIONS BETWEEN TEMPLATES 627 21.1 Finding Objects by Voting on Relations between Templates 628 21.1.1 Describing Image Patches 628 21.1.2 Voting and a Simple Generative Model 629 21.1.3 Probabilistic Models for Voting 630 21.1.4 Voting on Relations 632 21.1.5 Voting and 3D Objects 632 21.2 Relational Reasoning using Probabilistic Models and Search 633 21.2.1 Correspondence and Search 633 21.2.2 Example: Finding Faces 636 21.3 Using Classifiers to Prune Search 639 21.3.1 Identifying Acceptable Assemblies Using Projected Classifiers 640 21.3.2 Example: Finding People and Horses Using Spatial Relations 640 21.4 Technique: Hidden Markov Models 643 21.4.1 Formal Matters 644 21.4.2 Computing with Hidden Markov Models 645 21.4.3 Varieties of HMM’s 652 21.5 Application: HiddenMarkovModels and Sign Language Understanding654 21.6 Application: Finding People with Hidden Markov Models 659 21.7 Frames and Probability Models 662 21.7.1 Representing Coordinate Frames Explicitly in a Probability Model 664 xvii 21.7.2 Using a Probability Model to Predict Feature Positions 666 21.7.3 Building Probability Models that are Frame-Invariant 668 21.7.4 Example: Finding Faces Using Frame Invariance 669 21.8 Conclusions 669 22 ASPECT GRAPHS 672 22.1 Differential Geometry and Visual Events 677 22.1.1 The Geometry of the Gauss Map 677 22.1.2 Asymptotic Curves 679 22.1.3 The Asymptotic Spherical Map 681 22.1.4 Local Visual Events 682 22.1.5 The Bitangent Ray Manifold 684 22.1.6 Multilocal Visual Events 686 22.1.7 Remarks 687 22.2 Computing the Aspect Graph 689 22.2.1 Step 1: Tracing Visual Events 690 22.2.2 Step 2: Constructing the Regions 691 22.2.3 Remaining Steps of the Algorithm 692 22.2.4 An Example 692 22.3 Aspect Graphs and Object Recognition 696 22.4 Notes 696 22.5 Assignments 697 VII APPLICATIONS AND TOPICS 699 23 RANGE DATA 701 23.1 Active Range Sensors 701 23.2 Range Data Segmentation 704 Technique: Analytical Differential Geometry 705 23.2.1 Finding Step and Roof Edges in Range Images 707 23.2.2 Segmenting Range Images into Planar Regions 712 23.3 Range Image Registration and Model Construction 714 Technique: Quaternions 715 23.3.1 Registering Range Images Using the Iterative Closest-Point Method 716 23.3.2 Fusing Multiple Range Images 719 23.4 Object Recognition 720 xviii 23.4.1 Matching Piecewise-Planar Surfaces Using Interpretation Trees721 23.4.2 Matching Free-Form Surfaces Using Spin Images 724 23.5 Notes 729 23.6 Assignments 730 24 APPLICATION: FINDING IN DIGITAL LIBRARIES 732 24.1 Background 733 24.1.1 What do users want? 733 24.1.2 What can tools do? 735 24.2 Appearance 736 24.2.1 Histograms and correlograms 737 24.2.2 Textures and textures of textures 738 24.3 Finding 745 24.3.1 Annotation and segmentation 748 24.3.2 Template matching 749 24.3.3 Shape and correspondence 751 24.4 Video 754 24.5 Discussion 756 25 APPLICATION: IMAGE-BASED RENDERING 758 25.1 Constructing 3D Models from Image Sequences 759 25.1.1 Scene Modeling from Registered Images 759 25.1.2 Scene Modeling from Unregistered Images 767 25.2 Transfer-Based Approaches to Image-Based Rendering 771 25.2.1 Affine View Synthesis 772 25.2.2 Euclidean View Synthesis 775 25.3 The Light Field 778 25.4 Notes 782 25.5 Assignments 784
四个主要的模糊算子(含Matlab代码)
weixin_49611232的博客
08-07 5593
基本概念 模糊关系合成运算“。” 称为模糊算子，而模糊算子是人为定义的，因此也可以给“。” 以不同的定义，以便比较哪一种模糊算子在模糊推理过程中控制效果最优、更加合理。常见的模糊算子有：“ Min-Max”模糊算子、“积-和”模糊算子、“Min-和”模糊算子、“积-Max”模糊算子。 在模糊推理过程中，选取不同的模糊算子便产生了不同的模糊推理方法。常用的模糊关系合成（Compostional Rule of Inference，CRI）法是模糊控制最基本的方法，模糊子集...
【数理逻辑三】命题逻辑及形式系统【下】
smilejiasmile的博客
06-15 7747
命题逻辑及形式系统【下】 在上一篇文章中我们已经讨论了由原子命题和逻辑联结词构成的命题公式。下面我们来探讨一下命题公式的分类，以及其中较为重要的重言式。 一、重言式 命题公式可以从真值的角度进行分类： 重言式，（永真式）tautology：命题变元的所有赋值都是命题公式的成真赋值矛盾式（永假式、不可满足式）contradiction：命题变元的所有赋值都是命题公式的成假赋值可满足式(contingency)：命题公式至少有一个成真赋值 其中，需要分清的概念是：永真式都是可满足式。矛盾式都不是可.
离散数学 1.6 Rules of Inference
星渊龙骑的博客
03-30 632
知识 练习 12 24 26 28 30 参考答案 12 24 26 28 30
[离散数学] 数理逻辑基础
GoldenaArcher的博客
09-09 947
[离散数学] 数理逻辑基础 复习一下 数理逻辑(Logic) 的内容，内容包含： 命题定理 连接符 真值表 推理规则(RULES OF INFERENCE) 逻辑等价(LOGICAL EQUIVALENCE) 合取范式 (Conjunctive Normal Form) 命题(proposition) 又称 语句(statement)，或是 命题语句(propositional statement)，命题的组成可以是最简单的符号，如 A，或是由一句话 外面在下雨 组成。 命题必须具有 真假意义，具有 判
fundamentals\Logic
u012296499的博客
09-05 583
We should always analyze and seek to understand the situation given. This often calls for attributes we cannot learn in a book, such as insight and creativity. Merely trying to apply formulas or invok...
离散数学笔记（3）逻辑证明
SongyangJi
02-29 1971
(推理规则)Rules of Inference 有效论证（Valid Arguments） 命题逻辑中的论证是由一串命题(r1、r2、……rn、sr_1、r_2、……r_n、sr1​、r2​、……rn​、s)构成。 如果称这个论证是有效的，也就得满足，如果前提全为真，则结果也为真。 (An argument in propositional logic is a sequence of prop...
Actel提升RTAX-S/SL系列FPGA的性能
01-19
RTAX-S/SL 系列FPGA能够免除与耐辐射ASIC相关的成本和进度表风险，是需要防止辐射引发单事件翻转 (single-event upset, SEU) 事件保护功能的航天应用的FPGA。 　RTAX-S/SL系列FPGA的性能提升包括： 　·相比 RTAX-...
seu-report-latex-template:东南大学的LaTeX模板
05-17
SEU LaTeX Template 东南大学 LaTeX 模板 LaTeX template for Southeast University 使用简介 支援且推荐使用 ，并推荐使用 xetex 引擎编译。 中文字体需求 默认采用作为衬线字体，作为非衬线与等宽字体。 使用...
Robomaster2018-SEU-OpenSource：这是东南大学RoboMaster 2018竞赛的开源项目
01-30
Robomaster2018-SEU-开源这是东南大学为Robomaster 2018设计的一个项目，其中包括完成自动射击和符文检测任务的完整过程。 包括装甲检测，符文检测，角度求解算法和驱动程序，串行通信。 这基本上是我们在比赛中使用...
SEU-master-thesis:东南大学硕士研究生学位论文LaTeX模板
05-06
SEU-master-thesis 东南大学硕士研究生学位论文 LaTeX 模版。 简介 本模版基于许元的 和樊智猛的 ，并在他们工作的基础上进行了修改以适应东南大学新的学位论文要求。本模板支持学术型硕士研究生和专业型硕士研究生...
An SEU-hardened latch with a triple-interlocked structure
02-06
A single event upset (SEU) tolerant latch with a triple-... Three recently reported SEU-hardened latches are chosen and compared with this latch in terms of reliability. The potential problems that thes
【离散数学】 SEU - 23 - 2021/05/26 - Trees
Teddy van Jerry的博客
05-28 766
Discrete Mathematics and its Applications (8th Edition) 2021/05/26 - Trees 11 Trees Terminology If vvv is a vertex other than the root, the parent of vvv is the unique vertex uuu such that there is a directed edge from uuu to vvv. vvv is called a child o
【离散数学】 MIT 6.042J 笔记 - Lecture 3 Strong Induction
Teddy van Jerry的博客
02-02 715
PDF 文件下载 图片效果 LaTeX\LaTeXLATE​X 代码 ALL RIGHTS RESERVED © 2021 Teddy van Jerry 欢迎转载，转载请注明出处。 See also Teddy van Jerry 的导航页
【离散数学】 SEU - 27 - 2021/06/09 - Lattice
Teddy van Jerry的博客
06-09 545
Discrete Mathematical Structures (6th Edition) 2021/06/09 - Lattice Lattice and Boolean Algebra Lattice Notation Greatest lower bound: ∧∧∧ Least upper bound: ∨∨∨ Properties Theorem:<L, ≤> is a lattice, for a, b, c ∈ L, we have Commutative laws:
【离散数学】 MIT 6.042J 笔记 - Lecture 2 Induction
Teddy van Jerry的博客
02-01 502
PDF 文件下载 图片效果 LaTeX\LaTeXLATE​X 代码 ALL RIGHTS RESERVED © 2021 Teddy van Jerry 欢迎转载，转载请注明出处。 See also Teddy van Jerry 的导航页
【离散数学】 SEU - Assignment 1 - 2021/03/03
Teddy van Jerry的博客
03-04 500
LaTeX\LaTeXLATE​X Code % !TeX spellcheck = en_EN-EnglishUnitedKingdom \documentclass{article} \usepackage{amsmath,amssymb,amsthm} \usepackage{graphicx} \usepackage{xcolor} \usepackage{fancyhdr} \usepackage{fancyhdr} \usepackage{graphicx} \usepackage{title
【离散数学】 MIT 6.042J 笔记 - Lecture 1 Introductions and Proofs
Teddy van Jerry的博客
01-31 496
PDF 文件下载 图片效果 LaTeX 代码 ALL RIGHTS RESERVED © 2021 Teddy van Jerry 欢迎转载，转载请注明出处。 See also Teddy van Jerry 的导航页
操作系统实验 seu
最新发布
09-11
操作系统实验(SEU)是南京航空航天大学(简称SEU)计算机科学与技术专业中开设的一门实践课程。该课程旨在让学生深入理解和研究操作系统的原理和实践，并通过实验来提升学生的学习能力和动手能力。 在SEU实验中，学生...

“相关推荐”对你有帮助么？

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论 1
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值