Image-Based Modeling

Cover -- Contents -- Foreword -- Preface -- Acknowledgements -- Notation -- 1 Introduction -- Part I: Geometry -- 2 Geometry prerequisite -- 2.1 Introduction -- 2.2 Projective geometry -- 2.3 Algebraic geometry -- 3 Multi-view geometry -- 3.1 Introduction -- 3.2 The single-view geometry -- 3.3 The uncalibrated two-view geometry -- 3.4 The calibrated two-view geometry -- 3.5 The three-view geometry -- 3.6 The N-view geometry -- 3.7 Discussions -- 3.8 Bibliographic notes -- Part II: Computation -- 4 Feature point -- 4.1 Introduction -- 4.2 Points of interest -- 4.3 Scale invariance -- 4.4 Bibliographic notes -- 5 Structure from Motion -- 5.1 Introduction -- 5.2 The standard sparse approach -- 5.3 The match propagation -- 5.4 The quasi-dense approach -- 5.5 Bibliographic notes -- Part III Modeling: from 3D points to objects -- 6 Surface modeling -- 6.1 Introduction -- 6.2 Minimal surface functionals -- 6.3 A unified functional -- 6.4 Level-set method -- 6.5 A bounded regularization method -- 6.6 Implementation -- 6.7 Results and discussions -- 6.8 Bibliographic notes -- 7 Hair modeling -- 7.1 Introduction -- 7.2 Hair volume determination -- 7.3 Hair fiber recovery -- 7.4 Implementation -- 7.5 Results and discussions -- 7.6 Bibliographic notes -- 8 Tree modeling -- 8.1 Introduction -- 8.2 Branche recovery -- 8.3 Leaf extraction and reconstruction -- 8.4 Results and discussions -- 8.5 Bibliographic notes -- 9 Fa231;ade modeling -- 9.1 Introduction -- 9.2 Fa231;ade initialization -- 9.3 Fa231;ade decomposition -- 9.4 Fa231;ade augmentation -- 9.5 Fa231;ade completion -- 9.6 Results and discussions -- 9.7 Bibliographic notes -- 10 Building modeling -- 10.1 Introduction -- 10.2 Pre-processing -- 10.3 Building segmentation -- 10.4 Building partition -- 10.5 Fa231;ade modeling -- 10.6 Post-processing -- 10.7 Results and discussions -- 10.8 Bibliographic notes -- List of algorithms -- List of figures -- References -- Index -- A -- B -- C -- D -- E -- F -- G -- H -- I -- J -- K -- L -- M -- N -- O -- P -- Q -- R -- S -- T -- U -- V -- W.