Spelling suggestions: "subject:"finishing"" "subject:"diminishing""
31 |
Géométrie algébrique : théorèmes d'annulation sur les variétés toriquesGirard, Vincent 08 1900 (has links)
No description available.
|
32 |
Analysis of several non-linear PDEs in fluid mechanics and differential geometryLi, Siran January 2017 (has links)
In the thesis we investigate two problems on Partial Differential Equations (PDEs) in differential geometry and fluid mechanics. First, we prove the weak L<sup> p</sup> continuity of the Gauss-Codazzi-Ricci (GCR) equations, which serve as a compatibility condition for the isometric immersions of Riemannian and semi-Riemannian manifolds. Our arguments, based on the generalised compensated compactness theorems established via functional and micro-local analytic methods, are intrinsic and global. Second, we prove the vanishing viscosity limit of an incompressible fluid in three-dimensional smooth, curved domains, with the kinematic and Navier boundary conditions. It is shown that the strong solution of the Navier-Stokes equation in H<sup> r+1</sup> (r > 5/2) converges to the strong solution of the Euler equation with the kinematic boundary condition in H<sup> r</sup>, as the viscosity tends to zero. For the proof, we derive energy estimates using the special geometric structure of the Navier boundary conditions; in particular, the second fundamental form of the fluid boundary and the vorticity thereon play a crucial role. In these projects we emphasise the linkages between the techniques in differential geometry and mathematical hydrodynamics.
|
33 |
Moments des fonctions thêta / Moments of theta functionsMunsch, Marc 12 December 2013 (has links)
On s’intéresse dans cette thèse à l’étude des fonctions thêta intervenant dans la preuve de l’équation fonctionnelle des fonctions L de Dirichlet. En particulier, on adapte certains résultats obtenus dans le cadre des fonctions L au cas des fonctions thêta. S. Chowla a conjecturé que les fonctions L de Dirichlet associées à des caractères χ primitifs ne doivent pas s’annuler au point central de leur équation fonctionnelle. De façon analogue, il est conjecturé que les fonctions thêta ne s'annulent pas au point 1. Dans le but de prouver cette conjecture pour beaucoup de caractères, on étudie les moments de fonctions thêta dans plusieurs familles. On se focalise sur deux familles importantes. La première considérée est l’ensemble des caractères de Dirichlet modulo p où p est un nombre premier. On prouve des formules asymptotiques pour les moments d'ordre 2 et 4 en se ramenant à des problèmes de nature diophantienne. La seconde famille considérée est celle des caractères primitifs et quadratiques associés à des discriminants fondamentaux d inférieurs à une certaine borne fixée. On donne une formule asymptotique pour le premier moment et une majoration pour le moment d'ordre 2 en utilisant des techniques de transformée de Mellin ainsi que des estimations sur les sommes de caractères. Dans les deux cas, on en déduit des résultats de non-annulation des fonctions thêta. On propose également un algorithme qui, pour beaucoup de caractères, se révèle en pratique efficace pour prouver la non-annulation sur l'axe réel positif des fonctions thêta ce qui entraîne la non-annulation sur le même axe des fonctions L associées. / In this thesis, we focus on the study of theta functions involved in the proof of the functional equation of Dirichlet L- functions. In particular, we adapt some results obtained for L-functions to the case of theta functions. S. Chowla conjectured that Dirichlet L- functions associated to primitive characters χ don’t vanish at the central point of their functional equation. In a similar way to Chowla’s conjecture, it is conjectured that theta functions don't vanish at the central point of their functional equation for each primitive character. With the aim of proving this conjecture for a lot of characters, we study moments of theta functions in various families. We concentrate on two important families. The first one which we consider is the family of all Dirichlet characters modulo p where p is a prime number. In this case, we prove asymptotic formulae for the second and fourth moment of theta functions using diophantine techniques. The second family which we consider is the set of primitive quadratic characters associated to a fundamental discriminant less than a fixed bound. We give an asymptotic formula for the first moment and an upper bound for the second moment using techniques of Mellin transforms and estimation of character sums. In both cases, we deduce some results of non-vanishing. We also give an algorithm which, in practice, works well for a lot of characters to prove the non-vanishing of theta functions on the positive real axis. In this case, this implies in particular that the associated L-functions don’t vanish on the same axis.
|
34 |
Produits eulériens motiviques / Motivic Euler productsBilu, Margaret 28 November 2017 (has links)
L’objectif de cette thèse est l’étude de la fonction zêta des hauteurs motivique associée à un problème de comptage de courbes sur les compactifications équivariantes d’espaces affines, résolvant au chapitre 6 l’analogue motivique de la conjecture de Manin pour celles-ci. La fonction zêta des hauteurs provenant du problème de comptage considéré est récrite convenablement à l’aide d'une formule de Poisson motivique démontrée au cinquième chapitre, qui généralise celle de Hrushovski-Kazhdan. Chaque terme est alors décomposé sous la forme d'un produit eulérien motivique, dont la définition et les propriétés sont établies au chapitre 3. La convergence de ces produits eulériens doit être comprise pour une topologie des poids que nous introduisons au quatrième chapitre et qui repose d'une part sur la théorie des modules de Hodge de Saito, et d'autre part sur une mesure motivique sur l’anneau de Grothendieck des variétés avec exponentielles, construite dans le chapitre 2 à l’aide de la notion de cycles évanescents motiviques. On en déduit ainsi une description de l'asymptotique d'une proportion positive des coefficients du polynôme de Hodge-Deligne des espaces de modules des courbes sur la compactification équivariante donnée, lorsque le degré tend vers l'infini. / The goal of this thesis is the study of the motivic height zeta function associated to the problem of counting curves on equivariant compactifications of vector groups, solving in chapter 6 the motivic analogue of Manin's conjecture for such varieties.The motivic height zeta function coming from this counting problem is rewritten in a convenient way using a Poisson summation formula proved in chapter 5, and which generalises Hrushovski and Kazhdan's motivic Poisson formula. Each term is then expressed as a motivic Euler product, the definition and properties of the latter being established in chapter 3. The convergence of these Euler products must be understood for a weight topology which we introduce in the fourth chapter and which relies both on Saito's theory of mixed Hodge modules and on a motivic measure on the Grothendieck ring of varieties with exponentials, constructed in chapter 2 using the notion of motivic vanishing cycles. We deduce from this a description of the asymptotic of a positive proportion of the coefficients of the Hodge-Deligne polynomial of the moduli spaces of curves on the given equivariant compactification, when the degree goes to infinity.
|
35 |
Parametrizace bodů a čar pomocí paralelních souřadnic pro Houghovu transformaci / Point and Line Parameterizations Using Parallel Coordinates for Hough TransformJuránková, Markéta Unknown Date (has links)
Tato dizertační práce se zaměřuje na použití paralelních souřadnic pro parametrizaci čar a bodů. Paralelní souřadný systém má souřadnicové osy vzájemně rovnoběžné. Bod ve dvourozměrném prostoru je v paralelních souřadnicích zobrazen jako přímka a přímka jako bod. Toho je možné využít pro Houghovu transformaci - metodu, při které body zájmu hlasují v prostoru parametrů pro danou hypotézu. Parametrizace pomocí paralelních souřadnic vyžaduje pouze rasterizaci úseček, a proto je velmi rychlá a přesná. V práci je tato parameterizace demonstrována na detekci maticových kódů a úběžníků.
|
36 |
Analyse mathématique et simulation numérique des modèles d'écoulements bouillants pour la thermohydraulique des centrales nucléaires / On the mathematical analysis and the numerical simulation of boiling flow models in nuclear power plants thermal hydraulicsNguyen, Thi Phuong Kieu 29 January 2016 (has links)
Nous avons étudié des méthodes de volumes finis pour la simulation numérique d'un flux impliquant deux phases incompressibles ou deux phases générales compressibles en déséquilibre mécanique. Les principales difficultés du régime où il y a une apparition de phase ou une disparition de phase est la singularité de la vitesse. Nous montrons que l'utilisation du l'entropie correction améliorer beaucoup ces problèmes. Enfin, nous simulons certains tests numériques importants pour vérifier les méthodes numériques, telles que la séparation de phase par gravité ou un canal bouillant. / We investigated some finite volume methods for the numerical simulation of a flow involving two incompressible phases or general two compressible phases in mechanical disequilibrium. The main difficulties of the regime where there is either a phase appearance or a phase disappearance is the singularity of the velocity. We show that using the entropy fix will much improve these problems. Finally, we perfom some important numerical tests to verify the numerical methods, such as a phase separation by gravity or a boiling channel.
|
37 |
A window to the past through modern urban environments: Developing a photogrammetric workflow for the orientation parameter estimation of historical imagesMaiwald, Ferdinand 05 October 2022 (has links)
The ongoing process of digitization in archives is providing access to ever-increasing historical image collections. In many of these repositories, images can typically be viewed in a list or gallery view. Due to the growing number of digitized objects, this type of visualization is becoming increasingly complex. Among other things, it is difficult to determine how many photographs show a particular object and spatial information can only be communicated via metadata.
Within the scope of this thesis, research is conducted on the automated determination and provision of this spatial data. Enhanced visualization options make this information more eas- ily accessible to scientists as well as citizens. Different types of visualizations can be presented in three-dimensional (3D), Virtual Reality (VR) or Augmented Reality (AR) applications. However, applications of this type require the estimation of the photographer’s point of view. In the photogrammetric context, this is referred to as estimating the interior and exterior orientation parameters of the camera. For determination of orientation parameters for single images, there are the established methods of Direct Linear Transformation (DLT) or photogrammetric space resection. Using these methods requires the assignment of measured object points to their homologue image points. This is feasible for single images, but quickly becomes impractical due to the large amount of images available in archives. Thus, for larger image collections, usually the Structure-from-Motion (SfM) method is chosen, which allows the simultaneous estimation of the interior as well as the exterior orientation of the cameras. While this method yields good results especially for sequential, contemporary image data, its application to unsorted historical photographs poses a major challenge.
In the context of this work, which is mainly limited to scenarios of urban terrestrial photographs, the reasons for failure of the SfM process are identified. In contrast to sequential image collections, pairs of images from different points in time or from varying viewpoints show huge differences in terms of scene representation such as deviations in the lighting situation, building state, or seasonal changes. Since homologue image points have to be found automatically in image pairs or image sequences in the feature matching procedure of SfM, these image differences
pose the most complex problem.
In order to test different feature matching methods, it is necessary to use a pre-oriented historical dataset. Since such a benchmark dataset did not exist yet, eight historical image triples (corresponding to 24 image pairs) are oriented in this work by manual selection of homologue image points. This dataset allows the evaluation of frequently new published methods in feature matching. The initial methods used, which are based on algorithmic procedures for feature matching (e.g., Scale Invariant Feature Transform (SIFT)), provide satisfactory results for only few of the image pairs in this dataset. By introducing methods that use neural networks for feature detection and feature description, homologue features can be reliably found for a large fraction of image pairs in the benchmark dataset.
In addition to a successful feature matching strategy, determining camera orientation requires an initial estimate of the principal distance. Hence for historical images, the principal distance cannot be directly determined as the camera information is usually lost during the process of digitizing the analog original. A possible solution to this problem is to use three vanishing points that are automatically detected in the historical image and from which the principal distance can then be determined. The combination of principal distance estimation and robust feature matching is integrated into the SfM process and allows the determination of the interior
and exterior camera orientation parameters of historical images. Based on
these results, a workflow is designed that allows archives to be directly connected to 3D applications.
A search query in archives is usually performed using keywords, which have to be assigned to the corresponding object as metadata. Therefore, a keyword search for a specific building also results in hits on drawings, paintings, events, interior or detailed views directly connected to this building. However, for the successful application of SfM in an urban context, primarily the photographic exterior view of the building is of interest. While the images for a single building can be sorted by hand, this process is too time-consuming for multiple buildings.
Therefore, in collaboration with the Competence Center for Scalable Data Services and Solutions (ScaDS), an approach is developed to filter historical photographs by image similarities. This method reliably enables the search for content-similar views via the selection of one or more query images. By linking this content-based image retrieval with the SfM approach, automatic determination of camera parameters for a large number of historical photographs is possible. The developed method represents a significant improvement over commercial and open-source SfM standard solutions.
The result of this work is a complete workflow from archive to application that automatically filters images and calculates the camera parameters. The expected accuracy of a few meters for the camera position is sufficient for the presented applications in this work, but offer further potential for improvement. A connection to archives, which will automatically exchange photographs and positions via interfaces, is currently under development. This makes it possible to retrieve interior and exterior orientation parameters directly from historical photography as metadata which opens up new fields of research.:1 Introduction 1
1.1 Thesis structure . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1
1.2 Historical image data and archives . . . . . . . . . . . . . . . . . . . . . . . . 2
1.3 Structure-from-Motion for historical images . . . . . . . . . . . . . . . . . . . 4
1.3.1 Terminology . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4
1.3.2 Selection of images and preprocessing . . . . . . . . . . . . . . . . . . 5
1.3.3 Feature detection, feature description and feature matching . . . . . . 6
1.3.3.1 Feature detection . . . . . . . . . . . . . . . . . . . . . . . . 7
1.3.3.2 Feature description . . . . . . . . . . . . . . . . . . . . . . . 9
1.3.3.3 Feature matching . . . . . . . . . . . . . . . . . . . . . . . . 10
1.3.3.4 Geometric verification and robust estimators . . . . . . . . . 13
1.3.3.5 Joint methods . . . . . . . . . . . . . . . . . . . . . . . . . . 16
1.3.4 Initial parameterization . . . . . . . . . . . . . . . . . . . . . . . . . . 19
1.3.5 Bundle adjustment . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 24
1.3.6 Dense reconstruction . . . . . . . . . . . . . . . . . . . . . . . . . . . . 24
1.3.7 Georeferencing . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 26
1.4 Research objectives . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 27
2 Generation of a benchmark dataset using historical photographs for the evaluation
of feature matching methods 29
2.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30
2.1.1 Image differences based on digitization and image medium . . . . . . . 30
2.1.2 Image differences based on different cameras and acquisition technique 31
2.1.3 Object differences based on different dates of acquisition . . . . . . . . 31
2.2 Related work . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31
2.3 The image dataset . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 32
2.4 Comparison of different feature detection and description methods . . . . . . 35
2.4.1 Oriented FAST and Rotated BRIEF (ORB) . . . . . . . . . . . . . . . 36
2.4.2 Maximally Stable Extremal Region Detector (MSER) . . . . . . . . . 36
2.4.3 Radiation-invariant Feature Transform (RIFT) . . . . . . . . . . . . . 36
2.4.4 Feature matching and outlier removal . . . . . . . . . . . . . . . . . . 36
2.5 Results . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 37
2.6 Conclusions and future work . . . . . . . . . . . . . . . . . . . . . . . . . . . 39
References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 40
3 Photogrammetry as a link between image repository and 4D applications 45
3.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 46
IX
Contents
3.2 Multimodal access on repositories . . . . . . . . . . . . . . . . . . . . . . . . . 47
3.2.1 Conventional access . . . . . . . . . . . . . . . . . . . . . . . . . . . . 47
3.2.2 Virtual access using online collections . . . . . . . . . . . . . . . . . . 48
3.2.3 Virtual museums . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 50
3.3 Workflow and access strategies . . . . . . . . . . . . . . . . . . . . . . . . . . 52
3.3.1 Overview . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 52
3.3.2 Filtering . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 53
3.3.3 Photogrammetry . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 54
3.3.4 Browser access . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 58
3.3.5 VR and AR access . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 61
3.4 Conclusions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 62
References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 64
4 An adapted Structure-from-Motion Workflow for the orientation of historical
images 69
4.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 70
4.2 Related Research . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 72
4.2.1 Historical images for 3D reconstruction . . . . . . . . . . . . . . . . . 72
4.2.2 Algorithmic Feature Detection and Matching . . . . . . . . . . . . . . 73
4.2.3 Feature Detection and Matching using Convolutional Neural Networks 74
4.3 Feature Matching . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 75
4.4 Workflow . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 77
4.4.1 Step 1: Data preparation . . . . . . . . . . . . . . . . . . . . . . . . . 78
4.4.2 Step 2.1: Feature Detection and Matching . . . . . . . . . . . . . . . . 78
4.4.3 Step 2.2: Vanishing Point Detection and Principal Distance Estimation 80
4.4.4 Step 3: Scene Reconstruction . . . . . . . . . . . . . . . . . . . . . . . 80
4.4.5 Comparison with Three Other State-of-the-Art SfM Workflows . . . . 81
4.5 Datasets . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 81
4.6 Results . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 83
4.7 Conclusions and Future Work . . . . . . . . . . . . . . . . . . . . . . . . . . . 85
4.8 Acknowledgements . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 86
4.A Appendix . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 87
References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 90
5 Fully automated pose estimation of historical images 97
5.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 98
5.2 Related Work . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 100
5.2.1 Image Retrieval . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 100
5.2.2 Feature Detection and Matching . . . . . . . . . . . . . . . . . . . . . 101
5.3 Data Preparation: Image Retrieval . . . . . . . . . . . . . . . . . . . . . . . . 102
5.3.1 Experiment and Data . . . . . . . . . . . . . . . . . . . . . . . . . . . 103
5.3.2 Methods . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 104
5.3.2.1 Layer Extraction Approach (LEA) . . . . . . . . . . . . . . . 104
5.3.2.2 Attentive Deep Local Features (DELF) Approach . . . . . . 105
5.3.3 Results and Evaluation . . . . . . . . . . . . . . . . . . . . . . . . . . 106
5.4 Camera Pose Estimation of Historical Images Using Photogrammetric Methods 110
5.4.1 Data . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 110
5.4.1.1 Benchmark Datasets . . . . . . . . . . . . . . . . . . . . . . . 111
5.4.1.2 Retrieval Datasets . . . . . . . . . . . . . . . . . . . . . . . . 113
5.4.2 Methods . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 115
5.4.2.1 Feature Detection and Matching . . . . . . . . . . . . . . . . 115
5.4.2.2 Geometric Verification and Camera Pose Estimation . . . . . 116
5.4.3 Results and Evaluation . . . . . . . . . . . . . . . . . . . . . . . . . . 117
5.5 Conclusions and Future Work . . . . . . . . . . . . . . . . . . . . . . . . . . . 120
5.A Appendix . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 122
References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 124
6 Related publications 129
6.1 Photogrammetric analysis of historical image repositores for virtual reconstruction
in the field of digital humanities . . . . . . . . . . . . . . . . . . . . . . . 130
6.2 Feature matching of historical images based on geometry of quadrilaterals . . 131
6.3 Geo-information technologies for a multimodal access on historical photographs
and maps for research and communication in urban history . . . . . . . . . . 132
6.4 An automated pipeline for a browser-based, city-scale mobile 4D VR application
based on historical images . . . . . . . . . . . . . . . . . . . . . . . . . . 133
6.5 Software and content design of a browser-based mobile 4D VR application to
explore historical city architecture . . . . . . . . . . . . . . . . . . . . . . . . 134
7 Synthesis 135
7.1 Summary of the developed workflows . . . . . . . . . . . . . . . . . . . . . . . 135
7.1.1 Error assessment . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 137
7.1.2 Accuracy estimation . . . . . . . . . . . . . . . . . . . . . . . . . . . . 139
7.1.3 Transfer of the workflow . . . . . . . . . . . . . . . . . . . . . . . . . . 141
7.2 Developments and Outlook . . . . . . . . . . . . . . . . . . . . . . . . . . . . 145
8 Appendix 149
8.1 Setup for the feature matching evaluation . . . . . . . . . . . . . . . . . . . . 149
8.2 Transformation from COLMAP coordinate system to OpenGL . . . . . . . . 150
References 151
List of Figures 165
List of Tables 167
List of Abbreviations 169 / Der andauernde Prozess der Digitalisierung in Archiven ermöglicht den Zugriff auf immer größer werdende historische Bildbestände. In vielen Repositorien können die Bilder typischerweise in einer Listen- oder Gallerieansicht betrachtet werden. Aufgrund der steigenden Zahl an digitalisierten Objekten wird diese Art der Visualisierung zunehmend unübersichtlicher. Es kann u.a. nur noch schwierig bestimmt werden, wie viele Fotografien ein bestimmtes Motiv zeigen. Des Weiteren können räumliche Informationen bisher nur über Metadaten vermittelt werden.
Im Rahmen der Arbeit wird an der automatisierten Ermittlung und Bereitstellung dieser räumlichen Daten geforscht. Erweiterte Visualisierungsmöglichkeiten machen diese Informationen Wissenschaftlern sowie Bürgern einfacher zugänglich. Diese Visualisierungen können u.a. in drei-dimensionalen (3D), Virtual Reality (VR) oder Augmented Reality (AR) Anwendungen präsentiert werden. Allerdings erfordern Anwendungen dieser Art die Schätzung des Standpunktes des Fotografen. Im photogrammetrischen Kontext spricht man dabei von der Schätzung der inneren und äußeren Orientierungsparameter der Kamera. Zur Bestimmung der Orientierungsparameter für Einzelbilder existieren die etablierten Verfahren der direkten linearen Transformation oder des photogrammetrischen Rückwärtsschnittes. Dazu muss eine Zuordnung von gemessenen Objektpunkten zu ihren homologen Bildpunkten erfolgen. Das ist für einzelne Bilder realisierbar, wird aber aufgrund der großen Menge an Bildern in Archiven schnell nicht mehr praktikabel. Für größere Bildverbände wird im photogrammetrischen Kontext somit üblicherweise das Verfahren Structure-from-Motion (SfM) gewählt, das die simultane Schätzung der inneren sowie der äußeren Orientierung der Kameras ermöglicht. Während diese Methode vor allem für sequenzielle, gegenwärtige Bildverbände gute Ergebnisse liefert, stellt die Anwendung auf unsortierten historischen Fotografien eine große Herausforderung dar.
Im Rahmen der Arbeit, die sich größtenteils auf Szenarien stadträumlicher terrestrischer Fotografien beschränkt, werden zuerst die Gründe für das Scheitern des SfM Prozesses identifiziert. Im Gegensatz zu sequenziellen Bildverbänden zeigen Bildpaare aus unterschiedlichen zeitlichen Epochen oder von unterschiedlichen Standpunkten enorme Differenzen hinsichtlich der Szenendarstellung. Dies können u.a. Unterschiede in der Beleuchtungssituation, des
Aufnahmezeitpunktes oder Schäden am originalen analogen Medium sein. Da für die Merkmalszuordnung in SfM automatisiert homologe Bildpunkte in Bildpaaren bzw. Bildsequenzen gefunden werden müssen, stellen diese Bilddifferenzen die größte Schwierigkeit dar.
Um verschiedene Verfahren der Merkmalszuordnung testen zu können, ist es notwendig einen vororientierten historischen Datensatz zu verwenden. Da solch ein Benchmark-Datensatz noch nicht existierte, werden im Rahmen der Arbeit durch manuelle Selektion homologer Bildpunkte acht historische Bildtripel (entspricht 24 Bildpaaren) orientiert, die anschließend genutzt werden, um neu publizierte Verfahren bei der Merkmalszuordnung zu evaluieren. Die ersten verwendeten Methoden, die algorithmische Verfahren zur Merkmalszuordnung nutzen (z.B. Scale Invariant Feature Transform (SIFT)), liefern nur für wenige Bildpaare des Datensatzes zufriedenstellende Ergebnisse. Erst durch die Verwendung von Verfahren, die neuronale Netze zur Merkmalsdetektion und Merkmalsbeschreibung einsetzen, können für einen großen Teil der historischen Bilder des Benchmark-Datensatzes zuverlässig homologe Bildpunkte gefunden werden.
Die Bestimmung der Kameraorientierung erfordert zusätzlich zur Merkmalszuordnung eine initiale Schätzung der Kamerakonstante, die jedoch im Zuge der Digitalisierung des analogen Bildes nicht mehr direkt zu ermitteln ist. Eine mögliche Lösung dieses Problems ist die Verwendung von drei Fluchtpunkten, die automatisiert im historischen Bild detektiert werden und aus denen dann die Kamerakonstante bestimmt werden kann. Die Kombination aus Schätzung der Kamerakonstante und robuster Merkmalszuordnung wird in den SfM Prozess integriert und erlaubt die Bestimmung der Kameraorientierung historischer Bilder.
Auf Grundlage dieser Ergebnisse wird ein Arbeitsablauf konzipiert, der es ermöglicht, Archive mittels dieses photogrammetrischen Verfahrens direkt an 3D-Anwendungen anzubinden.
Eine Suchanfrage in Archiven erfolgt üblicherweise über Schlagworte, die dann als Metadaten dem entsprechenden Objekt zugeordnet sein müssen. Eine Suche nach einem bestimmten Gebäude generiert deshalb u.a. Treffer zu Zeichnungen, Gemälden, Veranstaltungen, Innen- oder Detailansichten. Für die erfolgreiche Anwendung von SfM im stadträumlichen Kontext interessiert jedoch v.a. die fotografische Außenansicht des Gebäudes. Während die Bilder für ein einzelnes Gebäude von Hand sortiert werden können, ist dieser Prozess für mehrere
Gebäude zu zeitaufwendig.
Daher wird in Zusammenarbeit mit dem Competence Center for Scalable Data Services and Solutions (ScaDS) ein Ansatz entwickelt, um historische Fotografien über Bildähnlichkeiten zu filtern. Dieser ermöglicht zuverlässig über die Auswahl eines oder mehrerer Suchbilder die Suche nach inhaltsähnlichen Ansichten. Durch die Verknüpfung der inhaltsbasierten Suche mit dem SfM Ansatz ist es möglich, automatisiert für eine große Anzahl historischer Fotografien die Kameraparameter zu bestimmen. Das entwickelte Verfahren stellt eine deutliche Verbesserung im Vergleich zu kommerziellen und open-source SfM Standardlösungen dar.
Das Ergebnis dieser Arbeit ist ein kompletter Arbeitsablauf vom Archiv bis zur Applikation, der automatisch Bilder filtert und diese orientiert. Die zu erwartende Genauigkeit von wenigen Metern für die Kameraposition sind ausreichend für die dargestellten Anwendungen in dieser Arbeit, bieten aber weiteres Verbesserungspotential. Eine Anbindung an Archive, die über Schnittstellen automatisch Fotografien und Positionen austauschen soll, befindet sich bereits in der Entwicklung. Dadurch ist es möglich, innere und äußere Orientierungsparameter direkt von der historischen Fotografie als Metadaten abzurufen, was neue Forschungsfelder eröffnet.:1 Introduction 1
1.1 Thesis structure . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1
1.2 Historical image data and archives . . . . . . . . . . . . . . . . . . . . . . . . 2
1.3 Structure-from-Motion for historical images . . . . . . . . . . . . . . . . . . . 4
1.3.1 Terminology . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4
1.3.2 Selection of images and preprocessing . . . . . . . . . . . . . . . . . . 5
1.3.3 Feature detection, feature description and feature matching . . . . . . 6
1.3.3.1 Feature detection . . . . . . . . . . . . . . . . . . . . . . . . 7
1.3.3.2 Feature description . . . . . . . . . . . . . . . . . . . . . . . 9
1.3.3.3 Feature matching . . . . . . . . . . . . . . . . . . . . . . . . 10
1.3.3.4 Geometric verification and robust estimators . . . . . . . . . 13
1.3.3.5 Joint methods . . . . . . . . . . . . . . . . . . . . . . . . . . 16
1.3.4 Initial parameterization . . . . . . . . . . . . . . . . . . . . . . . . . . 19
1.3.5 Bundle adjustment . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 24
1.3.6 Dense reconstruction . . . . . . . . . . . . . . . . . . . . . . . . . . . . 24
1.3.7 Georeferencing . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 26
1.4 Research objectives . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 27
2 Generation of a benchmark dataset using historical photographs for the evaluation
of feature matching methods 29
2.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30
2.1.1 Image differences based on digitization and image medium . . . . . . . 30
2.1.2 Image differences based on different cameras and acquisition technique 31
2.1.3 Object differences based on different dates of acquisition . . . . . . . . 31
2.2 Related work . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31
2.3 The image dataset . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 32
2.4 Comparison of different feature detection and description methods . . . . . . 35
2.4.1 Oriented FAST and Rotated BRIEF (ORB) . . . . . . . . . . . . . . . 36
2.4.2 Maximally Stable Extremal Region Detector (MSER) . . . . . . . . . 36
2.4.3 Radiation-invariant Feature Transform (RIFT) . . . . . . . . . . . . . 36
2.4.4 Feature matching and outlier removal . . . . . . . . . . . . . . . . . . 36
2.5 Results . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 37
2.6 Conclusions and future work . . . . . . . . . . . . . . . . . . . . . . . . . . . 39
References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 40
3 Photogrammetry as a link between image repository and 4D applications 45
3.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 46
IX
Contents
3.2 Multimodal access on repositories . . . . . . . . . . . . . . . . . . . . . . . . . 47
3.2.1 Conventional access . . . . . . . . . . . . . . . . . . . . . . . . . . . . 47
3.2.2 Virtual access using online collections . . . . . . . . . . . . . . . . . . 48
3.2.3 Virtual museums . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 50
3.3 Workflow and access strategies . . . . . . . . . . . . . . . . . . . . . . . . . . 52
3.3.1 Overview . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 52
3.3.2 Filtering . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 53
3.3.3 Photogrammetry . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 54
3.3.4 Browser access . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 58
3.3.5 VR and AR access . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 61
3.4 Conclusions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 62
References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 64
4 An adapted Structure-from-Motion Workflow for the orientation of historical
images 69
4.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 70
4.2 Related Research . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 72
4.2.1 Historical images for 3D reconstruction . . . . . . . . . . . . . . . . . 72
4.2.2 Algorithmic Feature Detection and Matching . . . . . . . . . . . . . . 73
4.2.3 Feature Detection and Matching using Convolutional Neural Networks 74
4.3 Feature Matching . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 75
4.4 Workflow . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 77
4.4.1 Step 1: Data preparation . . . . . . . . . . . . . . . . . . . . . . . . . 78
4.4.2 Step 2.1: Feature Detection and Matching . . . . . . . . . . . . . . . . 78
4.4.3 Step 2.2: Vanishing Point Detection and Principal Distance Estimation 80
4.4.4 Step 3: Scene Reconstruction . . . . . . . . . . . . . . . . . . . . . . . 80
4.4.5 Comparison with Three Other State-of-the-Art SfM Workflows . . . . 81
4.5 Datasets . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 81
4.6 Results . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 83
4.7 Conclusions and Future Work . . . . . . . . . . . . . . . . . . . . . . . . . . . 85
4.8 Acknowledgements . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 86
4.A Appendix . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 87
References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 90
5 Fully automated pose estimation of historical images 97
5.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 98
5.2 Related Work . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 100
5.2.1 Image Retrieval . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 100
5.2.2 Feature Detection and Matching . . . . . . . . . . . . . . . . . . . . . 101
5.3 Data Preparation: Image Retrieval . . . . . . . . . . . . . . . . . . . . . . . . 102
5.3.1 Experiment and Data . . . . . . . . . . . . . . . . . . . . . . . . . . . 103
5.3.2 Methods . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 104
5.3.2.1 Layer Extraction Approach (LEA) . . . . . . . . . . . . . . . 104
5.3.2.2 Attentive Deep Local Features (DELF) Approach . . . . . . 105
5.3.3 Results and Evaluation . . . . . . . . . . . . . . . . . . . . . . . . . . 106
5.4 Camera Pose Estimation of Historical Images Using Photogrammetric Methods 110
5.4.1 Data . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 110
5.4.1.1 Benchmark Datasets . . . . . . . . . . . . . . . . . . . . . . . 111
5.4.1.2 Retrieval Datasets . . . . . . . . . . . . . . . . . . . . . . . . 113
5.4.2 Methods . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 115
5.4.2.1 Feature Detection and Matching . . . . . . . . . . . . . . . . 115
5.4.2.2 Geometric Verification and Camera Pose Estimation . . . . . 116
5.4.3 Results and Evaluation . . . . . . . . . . . . . . . . . . . . . . . . . . 117
5.5 Conclusions and Future Work . . . . . . . . . . . . . . . . . . . . . . . . . . . 120
5.A Appendix . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 122
References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 124
6 Related publications 129
6.1 Photogrammetric analysis of historical image repositores for virtual reconstruction
in the field of digital humanities . . . . . . . . . . . . . . . . . . . . . . . 130
6.2 Feature matching of historical images based on geometry of quadrilaterals . . 131
6.3 Geo-information technologies for a multimodal access on historical photographs
and maps for research and communication in urban history . . . . . . . . . . 132
6.4 An automated pipeline for a browser-based, city-scale mobile 4D VR application
based on historical images . . . . . . . . . . . . . . . . . . . . . . . . . . 133
6.5 Software and content design of a browser-based mobile 4D VR application to
explore historical city architecture . . . . . . . . . . . . . . . . . . . . . . . . 134
7 Synthesis 135
7.1 Summary of the developed workflows . . . . . . . . . . . . . . . . . . . . . . . 135
7.1.1 Error assessment . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 137
7.1.2 Accuracy estimation . . . . . . . . . . . . . . . . . . . . . . . . . . . . 139
7.1.3 Transfer of the workflow . . . . . . . . . . . . . . . . . . . . . . . . . . 141
7.2 Developments and Outlook . . . . . . . . . . . . . . . . . . . . . . . . . . . . 145
8 Appendix 149
8.1 Setup for the feature matching evaluation . . . . . . . . . . . . . . . . . . . . 149
8.2 Transformation from COLMAP coordinate system to OpenGL . . . . . . . . 150
References 151
List of Figures 165
List of Tables 167
List of Abbreviations 169
|
38 |
Application of Wavelets to Filtering and Analysis of Self-Similar SignalsWirsing, Karlton 30 June 2014 (has links)
Digital Signal Processing has been dominated by the Fourier transform since the Fast Fourier Transform (FFT) was developed in 1965 by Cooley and Tukey. In the 1980's a new transform was developed called the wavelet transform, even though the first wavelet goes back to 1910. With the Fourier transform, all information about localized changes in signal features are spread out across the entire signal space, making local features global in scope. Wavelets are able to retain localized information about the signal by applying a function of a limited duration, also called a wavelet, to the signal.
As with the Fourier transform, the discrete wavelet transform has an inverse transform, which allows us to make changes in a signal in the wavelet domain and then transform it back in the time domain. In this thesis, we have investigated the filtering properties of this technique and analyzed its performance under various settings. Another popular application of wavelet transform is data compression, such as described in the JPEG 2000 standard and compressed digital storage of fingerprints developed by the FBI. Previous work on filtering has focused on the discrete wavelet transform. Here, we extended that method to the stationary wavelet transform and found that it gives a performance boost of as much as 9 dB over that of the discrete wavelet transform. We also found that the SNR of noise filtering decreases as a frequency of the base signal increases up to the Nyquist limit for both the discrete and stationary wavelet transforms.
Besides filtering the signal, the discrete wavelet transform can also be used to estimate the standard deviation of the white noise present in the signal. We extended the developed estimator for the discrete wavelet transform to the stationary wavelet transform. As with filtering, it is found that the quality of the estimate decreases as the frequency of the base signal increases.
Many interesting signals are self-similar, which means that one of their properties is invariant on many different scales. One popular example is strict self-similarity, where an exact copy of a signal is replicated on many scales, but the most common property is statistical self-similarity, where a random segment of a signal is replicated on many different scales. In this work, we investigated wavelet-based methods to detect statistical self-similarities in a signal and their performance on various types of self-similar signals. Specifically, we found that the quality of the estimate depends on the type of the units of the signal being investigated for low Hurst exponent and on the type of edge padding being used for high Hurst exponent. / Master of Science
|
39 |
Localisation par l'image en milieu urbain : application à la réalité augmentée / Image-based localization in urban environment : application to augmented realityFond, Antoine 06 April 2018 (has links)
Dans cette thèse on aborde le problème de la localisation en milieux urbains. Inférer un positionnement précis en ville est important dans nombre d’applications comme la réalité augmentée ou la robotique mobile. Or les systèmes basés sur des capteurs inertiels (IMU) sont sujets à des dérives importantes et les données GPS peuvent souffrir d’un effet de vallée qui limite leur précision. Une solution naturelle est de s’appuyer le calcul de pose de caméra en vision par ordinateur. On remarque que les bâtiments sont les repères visuels principaux de l’humain mais aussi des objets d’intérêt pour les applications de réalité augmentée. On cherche donc à partir d’une seule image à calculer la pose de la caméra par rapport à une base de données de bâtiments références connus. On décompose le problème en deux parties : trouver les références visibles dans l’image courante (reconnaissance de lieux) et calculer la pose de la caméra par rapport à eux. Les approches classiques de ces deux sous-problèmes sont mises en difficultés dans les environnements urbains à cause des forts effets perspectives, des répétitions fréquentes et de la similarité visuelle entre façades. Si des approches spécifiques à ces environnements ont été développés qui exploitent la grande régularité structurelle de tels milieux, elles souffrent encore d’un certain nombre de limitations autant pour la détection et la reconnaissance de façades que pour le calcul de pose par recalage de modèle. La méthode originale développée dans cette thèse s’inscrit dans ces approches spécifiques et vise à dépasser ces limitations en terme d’efficacité et de robustesse aux occultations, aux changements de points de vue et d’illumination. Pour cela, l’idée principale est de profiter des progrès récents de l’apprentissage profond par réseaux de neurones convolutionnels pour extraire de l’information de haut-niveau sur laquelle on peut baser des modèles géométriques. Notre approche est donc mixte Bottom-Up/Top-Down et se décompose en trois étapes clés. Nous proposons tout d’abord une méthode d’estimation de la rotation de la pose de caméra. Les 3 points de fuite principaux des images en milieux urbains, dits points de fuite de Manhattan sont détectés grâce à un réseau de neurones convolutionnels (CNN) qui fait à la fois une estimation de ces points de fuite mais aussi une segmentation de l’image relativement à eux. Une second étape de raffinement utilise ces informations et les segments de l’image dans une formulation bayésienne pour estimer efficacement et plus précisément ces points. L’estimation de la rotation de la caméra permet de rectifier les images et ainsi s’affranchir des effets de perspectives pour la recherche de la translation. Dans une seconde contribution, nous visons ainsi à détecter les façades dans ces images rectifiées et à les reconnaître parmi une base de bâtiments connus afin d’estimer une translation grossière. Dans un soucis d’efficacité, on a proposé une série d’indices basés sur des caractéristiques spécifiques aux façades (répétitions, symétrie, sémantique) qui permettent de sélectionner rapidement des candidats façades potentiels. Ensuite ceux-ci sont classifiés en façade ou non selon un nouveau descripteur CNN contextuel. Enfin la mise en correspondance des façades détectées avec les références est opérée par un recherche au plus proche voisin relativement à une métrique apprise sur ces descripteurs [...] / This thesis addresses the problem of localization in urban areas. Inferring accurate positioning in the city is important in many applications such as augmented reality or mobile robotics. However, systems based on inertial sensors (IMUs) are subject to significant drifts and GPS data can suffer from a valley effect that limits their accuracy. A natural solution is to rely on the camera pose estimation in computer vision. We notice that buildings are the main visual landmarks of human beings but also objects of interest for augmented reality applications. We therefore aim to compute the camera pose relatively to a database of known reference buildings from a single image. The problem is twofold : find the visible references in the current image (place recognition) and compute the camera pose relatively to them. Conventional approaches to these two sub-problems are challenged in urban environments due to strong perspective effects, frequent repetitions and visual similarity between facades. While specific approaches to these environments have been developed that exploit the high structural regularity of such environments, they still suffer from a number of limitations in terms of detection and recognition of facades as well as pose computation through model registration. The original method developed in this thesis is part of these specific approaches and aims to overcome these limitations in terms of effectiveness and robustness to clutter and changes of viewpoints and illumination. For do so, the main idea is to take advantage of recent advances in deep learning by convolutional neural networks to extract high-level information on which geometric models can be based. Our approach is thus mixed Bottom- Up/Top-Down and is divided into three key stages. We first propose a method to estimate the rotation of the camera pose. The 3 main vanishing points of the image of urban environnement, known as Manhattan vanishing points, are detected by a convolutional neural network (CNN) that estimates both these vanishing points and the image segmentation relative to them. A second refinement step uses this information and image segmentation in a Bayesian model to estimate these points effectively and more accurately. By estimating the camera’s rotation, the images can be rectified and thus free from perspective effects to find the translation. In a second contribution, we aim to detect the facades in these rectified images to recognize them among a database of known buildings and estimate a rough translation. For the sake of efficiency, a series of cues based on facade specific characteristics (repetitions, symmetry, semantics) have been proposed to enable the fast selection of facade proposals. Then they are classified as facade or non-facade according to a new contextual CNN descriptor. Finally, the matching of the detected facades to the references is done by a nearest neighbor search using a metric learned on these descriptors. Eventually we propose a method to refine the estimation of the translation relying on the semantic segmentation inferred by a CNN for its robustness to changes of illumination ans small deformations. If we can already estimate a rough translation from these detected facades, we choose to refine this result by relying on the se- mantic segmentation of the image inferred from a CNN for its robustness to changes of illuminations and small deformations. Since the facade is identified in the previous step, we adopt a model-based approach by registration. Since the problems of registration and segmentation are linked, a Bayesian model is proposed which enables both problems to be jointly solved. This joint processing improves the results of registration and segmentation while remaining efficient in terms of computation time. These three parts have been validated on consistent community data sets. The results show that our approach is fast and more robust to changes in shooting conditions than previous methods
|
40 |
Simula??es num?ricas de correntes gravitacionais com elevado n?mero de ReynoldsFrantz, Ricardo Andr? Schuh 09 March 2018 (has links)
Submitted by PPG Engenharia e Tecnologia de Materiais (engenharia.pg.materiais@pucrs.br) on 2018-06-05T13:28:29Z
No. of bitstreams: 1
frantz2018simulacoes.pdf: 23131075 bytes, checksum: e748910d1820968a07c86be9461b7489 (MD5) / Approved for entry into archive by Sheila Dias (sheila.dias@pucrs.br) on 2018-06-12T12:40:17Z (GMT) No. of bitstreams: 1
frantz2018simulacoes.pdf: 23131075 bytes, checksum: e748910d1820968a07c86be9461b7489 (MD5) / Made available in DSpace on 2018-06-12T12:49:08Z (GMT). No. of bitstreams: 1
frantz2018simulacoes.pdf: 23131075 bytes, checksum: e748910d1820968a07c86be9461b7489 (MD5)
Previous issue date: 2018-03-09 / Coordena??o de Aperfei?oamento de Pessoal de N?vel Superior - CAPES / This work investigates the method of large-eddy simulation (LES) in the context
of gravity currents, which is found necessary since it allows a substantial increase
in the order of magnitude of the characteristic Reynolds number used in numerical
simulations, approaching them with natural scales, in addition to significantly reducing
the computational cost. The implicit large eddy simulation (ILES) methodology, based
on the spectral vanishing viscosity model, is unprecedentedly employed in the context
of gravity currents, is compared against with explicit methods such as the static and
dynamic Smagorisnky. The evaluation of the models is performed based on statistics
from a direct numerical simulation (DNS). Results demonstrate that the first model
based purely on numerical dissipation, introduced by means of the second order
derivative, generates better correlations with the direct simulation. Finally, experimental
cases of the literature, in different flow configurations, are reproduced numerically
showing good agreement in terms of the front position evolution. / Este trabalho investiga o m?todo de simula??o de grandes escalas (LES) no
contexto de correntes gravitacionais. O mesmo se faz necess?rio, visto que possibilita
um aumento substancial da ordem de grandeza do n?mero de Reynolds caracter?stico
utilizado em simula??es num?ricas, aproximando os mesmos de escalas naturais, al?m
de reduzir significativamente o custo computacional dos c?lculos. A avalia??o dos
modelos ? realizada utilizando uma base de dados de simula??o num?rica direta (DNS).
A metodologia de simula??o de grandes escalas impl?cita (ILES), baseada no modelo
de viscosidade turbulenta espectral, ? colocado a prova de maneira in?dita no contexto
de correntes de gravidade com m?todos expl?citos dispon?veis na literatura. Resultados
demonstram que o mesmo, baseado puramente em dissipa??o num?rica introduzida
por meio do comportamento dos esquemas de derivada de segunda ordem, gera
melhores correla??es com as estat?sticas baseadas em campos m?dios da simula??o
direta. Por fim, casos experimentais da literatura, em diferentes configura??es de
escoamento, s?o reproduzidos numericamente.
|
Page generated in 0.0744 seconds