Einloggen

Thematische Bibliographien / Signed Distance Functions

Inhaltsverzeichnis

Zeitschriftenartikel
Dissertationen
Bücher
Buchteile
Konferenzberichte
Berichte der Organisationen

Auswahl der wissenschaftlichen Literatur zum Thema „Signed Distance Functions“

Autor: Grafiati

Veröffentlicht am 29. Juni 2021

Zuletzt aktualisiert am 7. Februar 2022

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an

Wählen Sie eine Art der Quelle aus:

Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Signed Distance Functions" bekannt.

Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.

Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.

Zeitschriftenartikel zum Thema "Signed Distance Functions"

1

Bálint, Csaba, Gábor Valasek und Lajos Gergó. „Operations on Signed Distance Functions“. Acta Cybernetica 24, Nr. 1 (21.05.2019): 17–28. http://dx.doi.org/10.14232/actacyb.24.1.2019.3.

Der volle Inhalt der Quelle

Annotation:

We present a theoretical overview of signed distance functions and analyze how this representation changes when applying an offset transformation. First, we analyze the properties of signed distance and the sets they describe. Second, we introduce our main theorem regarding the distance to an offset set in (X,||.||) strictly normed Banach spaces. An offset set of D in X is the set of points equidistant to D. We show when such a set can be represented by f(x)-c=0, where c denotes the radius of the offset. Finally, we explain these results for applications that offset signed distance functions.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

2

Luo, Honglin, Xianfu Wang und Brett Lukens. „Variational Analysis on the Signed Distance Functions“. Journal of Optimization Theory and Applications 180, Nr. 3 (26.10.2018): 751–74. http://dx.doi.org/10.1007/s10957-018-1414-2.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

3

Esedog¯lu, Selim, Steven Ruuth und Richard Tsai. „Diffusion generated motion using signed distance functions“. Journal of Computational Physics 229, Nr. 4 (Februar 2010): 1017–42. http://dx.doi.org/10.1016/j.jcp.2009.10.002.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

4

Fayolle, Pierre-Alain, Alexander Pasko, Benjamin Schmitt und Nikolay Mirenkov. „Constructive Heterogeneous Object Modeling Using Signed Approximate Real Distance Functions“. Journal of Computing and Information Science in Engineering 6, Nr. 3 (25.11.2005): 221–29. http://dx.doi.org/10.1115/1.2218366.

Der volle Inhalt der Quelle

Annotation:

We introduce a smooth approximation of the min∕max operations, called signed approximate real distance function (SARDF), for maintaining an approximate signed distance function in constructive shape modeling. We apply constructive distance-based shape modeling to design objects with heterogeneous material distribution in the constructive hypervolume model framework. The introduced distance approximation helps intuitively model material distributions parametrized by distances to so-called material features. The smoothness of the material functions, provided here by the smoothness of the defining function for the shape, helps to avoid undesirable singularities in the material distribution, like stress or concentrations. We illustrate application of the SARDF operations by two- and three-dimensional heterogeneous object modeling case studies.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

5

Zollhöfer, Michael, Angela Dai, Matthias Innmann, Chenglei Wu, Marc Stamminger, Christian Theobalt und Matthias Nießner. „Shading-based refinement on volumetric signed distance functions“. ACM Transactions on Graphics 34, Nr. 4 (27.07.2015): 1–14. http://dx.doi.org/10.1145/2766887.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

6

Koch, Philipp, Stefan May, Michael Schmidpeter, Markus Kühn, Christian Pfitzner, Christian Merkl, Rainer Koch et al. „Multi-Robot Localization and Mapping Based on Signed Distance Functions“. Journal of Intelligent & Robotic Systems 83, Nr. 3-4 (27.06.2016): 409–28. http://dx.doi.org/10.1007/s10846-016-0375-7.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

7

Deutsch, Clayton V., und Brandon J. Wilde. „Modeling multiple coal seams using signed distance functions and global kriging“. International Journal of Coal Geology 112 (Juni 2013): 87–93. http://dx.doi.org/10.1016/j.coal.2012.11.013.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

8

Tao, Songqiao, und Juan Tan. „Path Planning with Obstacle Avoidance Based on Normalized R-Functions“. Journal of Robotics 2018 (04.10.2018): 1–10. http://dx.doi.org/10.1155/2018/5868915.

Der volle Inhalt der Quelle

Annotation:

Existing methods for path planning with obstacle avoidance need to check having the interference between a moving part and an obstacle at iteration and even to calculate their shortest distance in the case of given motion parameters. Besides, the tasks like collision-checking and minimum-distance calculating themselves are complicated and time-consuming. Rigorous mathematical analysis might be a practical way for dealing with the above-mentioned problems. An R-function is a real-valued function whose properties are fully determined by corresponding attributes of their parameters, which is usually applied to express a geometrical object. Thus, a signed distance function based on R-functions is created to represent whether two objects intervene and their level of intervention or separation. As the signed function is continuous and differentiable, the gradient information of the objective function guides a moving part to avoid its obstacles and to approach its target position rapidly. Therefore, a path planning approach with obstacle avoidance based on normalized R-functions is proposed in this paper. A discrete convex hull approach is adopted to solve the problem that R-function is inappropriate to represent a geometric object with some curves or surfaces, and pendent points and edges are generated in Boolean operations. Besides, a normalized approach ensures accuracy calculation of signed distance function. Experimental results have shown that the presented approach is a feasible way for path planning with obstacle avoidance.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

9

Kraft, Daniel. „Computing the Hausdorff Distance of Two Sets from Their Distance Functions“. International Journal of Computational Geometry & Applications 30, Nr. 01 (März 2020): 19–49. http://dx.doi.org/10.1142/s0218195920500028.

Der volle Inhalt der Quelle

Annotation:

The Hausdorff distance is a measure of (dis-)similarity between two sets which is widely used in various applications. Most of the applied literature is devoted to the computation for sets consisting of a finite number of points. This has applications, for instance, in image processing. However, we would like to apply the Hausdorff distance to control and evaluate optimisation methods in level-set based shape optimisation. In this context, the involved sets are not finite point sets but characterised by level-set or signed distance functions. This paper discusses the computation of the Hausdorff distance between two such sets. We recall fundamental properties of the Hausdorff distance, including a characterisation in terms of distance functions. In numerical applications, this result gives at least an exact lower bound on the Hausdorff distance. We also derive an upper bound, and consequently a precise error estimate. By giving an example, we show that our error estimate cannot be further improved for a general situation. On the other hand, we also show that much better accuracy can be expected for non-pathological situations that are more likely to occur in practice. The resulting error estimate can be improved even further if one assumes that the grid is rotated randomly with respect to the involved sets.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

10

Molchanov, Vladimir, Paul Rosenthal und Lars Linsen. „Non-iterative Second-order Approximation of Signed Distance Functions for Any Isosurface Representation“. Computer Graphics Forum 29, Nr. 3 (12.08.2010): 1211–20. http://dx.doi.org/10.1111/j.1467-8659.2009.01699.x.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mehr Quellen

Dissertationen zum Thema "Signed Distance Functions"

1

Laney, Daniel Edward. „Surface visualization and compression with signed-distance functions /“. For electronic version search Digital dissertations database. Restricted to UC campuses. Access is free to UC campus dissertations, 2002. http://uclibs.org/PID/11984.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

2

Hansson, Söderlund Herman. „Hardware-Accelerated Ray Tracing of Implicit Surfaces : A study of real-time editing and rendering of implicit surfaces“. Thesis, Blekinge Tekniska Högskola, Institutionen för datavetenskap, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-21764.

Der volle Inhalt der Quelle

Annotation:

Background. Rasterization of triangle geometry has been the dominating rendering technique in the real-time rendering industry for many years. However, triangles are not always easy to work with for content creators. With the introduction of hardware-accelerated ray tracing, rasterization-based lighting techniques have been steadily replaced by ray tracing techniques. This shift may signify the opportunity of exploring other, more easily manipulated, geometry-type alternatives compared to triangle geometry. One such geometry type is implicit surfaces. Objectives. This thesis investigates the rendering speed, editing speed, and image quality of different implicit surface rendering techniques using a state-of-the-art, hardware-accelerated, path tracing implementation. Furthermore, it investigates how implicit surfaces may be edited in real time and how editing affects rendering. Methods. A baseline direct sphere tracing algorithm is implemented to render implicit surfaces. Additionally, dense and narrow band discretization algorithms that sphere trace a discretization of the implicit surface are implemented. For each technique, two variations that provide potential benefits in rendering speed are also tested. Additionally, a real-time implicit surface editor that can utilize all the mentioned rendering techniques is created. Rendering speed, editing speed, and image quality metrics are captured for all techniques using different scenes created with the editor and an existing hardware-accelerated path tracing solution. Image quality differences are measured using mean squared error and the image difference evaluator FLIP. Results. Direct sphere tracing achieves the best image quality results but has the slowest rendering speed. Dense discretization achieves the best rendering speed in most tests and achieves better image quality results compared to narrow band discretization. Narrow band discretization achieves significantly better editing speed than both direct sphere tracing and dense discretization. All variations of each algorithm achieve better or equal rendering and editing speed compared to their standard implementation. All algorithms achieve real-time rendering and editing performance. However, only discretized methods display real-time rendering performance for all scenes, and only narrow band discretization displays real-time editing performance for a larger number of primitives. Conclusions. Implicit surfaces can be rendered and edited in real time while using a state-of-the-art, hardware-accelerated, path tracing algorithm. Direct sphere tracing degrades in performance when the implicit surface has an increased number of primitives, whereas discretization techniques perform independently of this. Furthermore, narrow band discretization is fast enough so that editing can be performed in real time even for implicit surfaces with a large number of primitives, which is not the case for direct sphere tracing or dense discretization.
Bakgrund. Triangelrastrering har varit den dominerande renderingstekniken inom realtidsgrafik i flera år. Trianglar är dock inte alltid lätta att jobba med för skapare av grafiska modeller. Med introduktionen av hårdvaruaccelererad strålspårning har rastreringsbaserade ljussättningstekniker stadigt ersatts av strålspårningstekniker. Detta skifte innebär att det kan finnas möjlighet för att utforska andra, mer lättredigerade geometrityper jämfört med triangelgeometri, exempelvis implicita ytor. Syfte. Detta examensarbete undersöker rendering- och redigeringshastigheten, samt bildkvaliteten av olika renderingstekniker för implicita ytor tillsammans med en spjutspetsalgoritm för hårdvaruaccelererad strålföljning. Den undersöker även hur implicita ytor kan redigeras i realtid och hur det påverkar rendering. Metod. En direkt sfärspårningsalgoritm implementeras som baslinje för att rendera implicita ytor. Även algoritmer som utför sfärstrålning över en kompakt- och smalbandsdiskretisering av den implicita ytan implementeras. För varje teknik implementeras även två variationer som potentiellt kan ge bättre prestanda. Utöver dessa renderingstekniker skapas även ett redigeringsverktyg för implicita ytor. Renderingshastighet, redigeringshastighet, och bildkvalité mäts för alla tekniker över flera olika scener som har skapats med redigeringsverktyget tillsammans med en hårdvaruaccelererad strålföljningsalgoritm. Skillnader i bildkvalité utvärderas med hjälp av mean squared error och evalueringsverktyget för bildskillnader som heter FLIP. Resultat. Direkt sfärspårning åstadkommer bäst bildkvalité, men har den långsammaste renderingshastigheten. Kompakt diskretisering renderar snabbast i de flesta tester och åstadkommer bättre bildkvalité än vad smalbandsdiskretisering gör. Smalbandsdiskretisering åstadkommer betydligt bättre redigeringshastighet än både direkt sfärspårning och kompakt diskretisering. Variationerna för respektive algoritm presterar alla lika bra eller bättre än standardvarianten för respektive algoritm. Alla algoritmer uppnår realtidsprestanda inom rendering och redigering. Endast diskretiseringsmetoderna uppnår dock realtidsprestanda för rendering med alla scener och endast smalbandsdiskretisering uppnår realtidsprestanda för redigering med ett större antal primitiver. Slutsatser. Implicita ytor kan renderas och redigeras i realtid tillsammans med en spjutspetsalgoritm för hårdvaruaccelererad strålföljning. Vid användning av direkt sfärstrålning minskar renderingshastigheten när den ytan består av ett stort antal primitiver. Diskretiseringstekniker har dock en renderingshastighet som är oberoende av antalet primitiver. Smalbandsdiskretisering är tillräckligt snabb för att redigering ska kunna ske i realtid även för implicita ytor som består stora antal primitiver.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

3

Bengtsson, Morgan. „Indoor 3D Mapping using Kinect“. Thesis, Linköpings universitet, Datorseende, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-106145.

Der volle Inhalt der Quelle

Annotation:

In recent years several depth cameras have emerged on the consumer market, creating many interesting possibilities forboth professional and recreational usage. One example of such a camera is the Microsoft Kinect sensor originally usedwith the Microsoft Xbox 360 game console. In this master thesis a system is presented that utilizes this device in order to create an as accurate as possible 3D reconstruction of an indoor environment. The major novelty of the presented system is the data structure based on signed distance fields and voxel octrees used to represent the observed environment.
Under de senaste åren har flera olika avståndskameror lanserats på konsumentmarkanden. Detta har skapat många intressanta applikationer både i professionella system samt för underhållningssyfte. Ett exempel på en sådan kamera är Microsoft Kinect som utvecklades för Microsofts spelkonsol Xbox 360. I detta examensarbete presenteras ett system som använder Kinect för att skapa en så exakt rekonstruktion i 3D av en innomhusmiljö som möjligt. Den främsta innovationen i systemet är en datastruktur baserad på signed distance fields (SDF) och octrees, vilket används för att representera den rekonstruerade miljön.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

4

Rundgren, Emil. „Automatic Volume Estimation of Timber from Multi-View Stereo 3D Reconstruction“. Thesis, Linköpings universitet, Datorseende, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-142513.

Der volle Inhalt der Quelle

Annotation:

The ability to automatically estimate the volume of timber is becoming increasingly important within the timber industry. The large number of timber trucks arriving each day at Swedish timber terminals fortifies the need for a volume estimation performed in real-time and on-the-go as the trucks arrive. This thesis investigates if a volumetric integration of disparity maps acquired from a Multi-View Stereo (MVS) system is a suitable approach for automatic volume estimation of timber loads. As real-time execution is preferred, efforts were made to provide a scalable method. The proposed method was quantitatively evaluated on datasets containing two geometric objects of known volume. A qualitative comparison to manual volume estimates of timber loads was also made on datasets recorded at a Swedish timber terminal. The proposed method is shown to be both accurate and precise under specific circumstances. However, robustness is poor to varying weather conditions, although a more thorough evaluation of this aspect needs to be performed. The method is also parallelizable, which means that future efforts can be made to significantly decrease execution time.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

5

Souza, Ricardo Radtke de. „Modelagem geológica implícita através de simulações de funções distância assinaladas“. reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2017. http://hdl.handle.net/10183/172276.

Der volle Inhalt der Quelle

Annotation:

Antes de se fazer uma estimativa ou uma simulação geoestatística, os domínios geológicos devem ser modelados de forma que cada domínio utilize apenas dados que pertencem a ele. Na industria mineral a incerteza oriunda dos teores geralmente é levada em consideração, entretanto a incerteza gerada pelo modelo nem sempre é analisada. Sabendo que a maior fonte de incerteza está na transição de uma litologia para outra, essa dissertação visa avaliar a incerteza do modelo geológico através de simulações de funções distâncias assinaladas em zonas de maior incerteza, gerando vários modelos com diferentes proporções de cada litologias. Um estudo de caso em um banco de dados real com alta complexidade geológica é utilizado para avaliar o uso da metodologia. O método se mostrou eficaz para avaliar o impacto da diferença de volume que cada litologia pode alcançar, demonstrando a importância de medir a incerteza na construção de modelos geológicos.
Before making an estimation or a geostatistical simulation, geological domains must be modeled so that each domain uses only data that belongs to it. In the mineral industry the uncertainty derived from the grades is generally taken into account, however the uncertainty generated by the model is not always analyzed. Knowing that the greatest source of uncertainty is in the transition from one lithology to another, this dissertation aims to evaluate the uncertainty of the geological model through signed distances function simulation in uncertainty zones, generating several models with different proportions of each lithology. A case study in a real dataset with high geological complexity is used to evaluate the use of the methodology. The method proved effective in assessing the impact of the volume difference that each lithology can reach, demonstrating the importance of measuring uncertainty in the construction of geological models.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

6

Rolo, Roberto Mentzingen. „Modelagem geológica implícita com funções distância assinaladas“. reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2017. http://hdl.handle.net/10183/163406.

Der volle Inhalt der Quelle

Annotation:

Previamente à cada estimativa ou simulação geoestatística os domínios geológicos do depósito devem ser modelados, o que tradicionalmente é feito de forma manual por um geomodelador, em um processo laborioso, demorado e subjetivo. Por essa razão novas técnicas conhecidas como métodos implícitos veem surgindo. Essas técnicas fornecem algoritmos que substituem o processo de digitalização manual dos métodos explícitos por alguma forma de procedimento automático. Essa dissertação visita alguns métodos implícitos bem estabelecidos com atenção especial à modelagem geológica implícita com funções distância assinalada. Um estudo de caso em um banco de dados real é apresentado e a aplicabilidade do método discutida. Embora não substitua por completo um geomodelador experiente, o método provou ser capaz de gerar modelos geológicos semi-automáticos realistas a partir dos dados amostrais, e se mostra útil principalmente nas fases iniciais da pesquisa mineral.
Prior to every geostatistical estimation or simulation study there is a need for delimiting the geologic domains of the deposit, which is traditionally done manually by a geomodeler in a laborious, time consuming and subjective process. For this reason, novel techniques referred to as implicit modelling have appeared. These techniques provide algorithms that replace the manual digitization process of the traditional methods by some form of automatic procedure. This dissertation covers a few well established implicit methods currently available with special attention to the signed distance function methodology. A case study based on a real dataset was performed and its applicability discussed. Although it did not replace an experienced geomodeler, the method proved to be capable in creating semi-automatic geological models from the sampling data, especially in the early stages of exploration.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

7

Su, Po-Chang. „A ROBUST RGB-D SLAM SYSTEM FOR 3D ENVIRONMENT WITH PLANAR SURFACES“. UKnowledge, 2013. http://uknowledge.uky.edu/ece_etds/17.

Der volle Inhalt der Quelle

Annotation:

Simultaneous localization and mapping is the technique to construct a 3D map of unknown environment. With the increasing popularity of RGB-depth (RGB-D) sensors such as the Microsoft Kinect, there have been much research on capturing and reconstructing 3D environments using a movable RGB-D sensor. The key process behind these kinds of simultaneous location and mapping (SLAM) systems is the iterative closest point or ICP algorithm, which is an iterative algorithm that can estimate the rigid movement of the camera based on the captured 3D point clouds. While ICP is a well-studied algorithm, it is problematic when it is used in scanning large planar regions such as wall surfaces in a room. The lack of depth variations on planar surfaces makes the global alignment an ill-conditioned problem. In this thesis, we present a novel approach for registering 3D point clouds by combining both color and depth information. Instead of directly searching for point correspondences among 3D data, the proposed method first extracts features from the RGB images, and then back-projects the features to the 3D space to identify more reliable correspondences. These color correspondences form the initial input to the ICP procedure which then proceeds to refine the alignment. Experimental results show that our proposed approach can achieve better accuracy than existing SLAMs in reconstructing indoor environments with large planar surfaces.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

8

Michailidis, Georgios. „Manufacturing Constraints and Multi-Phase Shape and Topology Optimization via a Level-Set Method“. Phd thesis, Ecole Polytechnique X, 2014. http://pastel.archives-ouvertes.fr/pastel-00937306.

Der volle Inhalt der Quelle

Annotation:

The main contribution of this thesis is the implementation of manufacturing constraints in shape and topology optimization. Fabrication limitations related to the casting process are formulated as mathematical constraints and introduced in the optimization algorithm. In addition, based on the same theoretical and modelization tools, we propose a novel formulation for multi-phase optimization problems, which can be extended to the optimization of structures with functionally-graded properties. A key ingredient for the mathematical formulation of most problems throughout our work is the notion of the signed distance function to a domain. This work is divided into three parts. The rst part is bibliographical and contains the necessary background material for the understanding of the thesis' main core. It includes the rst two chapters. Chapter 1 provides a synopsis of shape and topology optimization methods and emphasizes the combination of shape sensitivity analysis and the level-set method for tracking a shape's boundary. In Chapter 2 we give a short description of the casting process, from which all our manufacturing constraints derive. We explain how industrial designers account for these limitations and propose a strategy to incorporate them in shape and topology optimization algorithms. The second part is about the mathematical formulation of manufacturing constraints. It starts with Chapter 3, where the control of thickness is discussed. Based on the signed distance function, we formulate three constraints to ensure a maximum and minimm feature size, as well as a minimal distance between structural members. Then, in Chapter 4, we propose ways to handle molding direction constraints and combine them with thickness constraints. Finally, a thermal constraint coming from the solidi cation of cast parts is treated in Chapter 5 using several thermal models. Multi-phase optimization is discussed in the third part. The general problem of shape and topology optimization using multiple phases is presented in detail in Chapter 6. A "smoothed-interface" approach, based again on the signed distance function, is proposed to avoid numerical di culties related to classical "sharp-interface" problems and a shape derivative is calculated. An extension of this novel formulation to general types of material properties' gradation is shown in the Appendix A.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

9

Bartoli, Simone. „Deploying deep learning for 3D reconstruction from monocular video sequences“. Master's thesis, Alma Mater Studiorum - Università di Bologna, 2021. http://amslaurea.unibo.it/22402/.

Der volle Inhalt der Quelle

Annotation:

3D reconstruction from monocular video sequences is a field of increasingly interest in the late years. Before the growth of deep learning, the retrieve of depth information from single images was possible only with RGBD sensors or algorithmic approaches. However, the availability of more and more data has allowed the training of monocular depth estimation neural networks, introducing innovative data-driven techniques. Since recovering ground-truth labels for depth estimation is very challenging, most of the research has focused on unsupervised or semi-supervised training approaches. The currently state of the art for 3D reconstruction is defined by an algorithmic method which exploits a Structure from Motion and Multi-View Stereo pipeline. Nevertheless, the whole approach is based on keypoints extraction, which provides well-known limitations when it comes to texture-less, reflective and/or transparent surfaces. Consequentely, a possible way to predict dense depth maps even in absence of keypoints is by employing neural networks. This work proposes a novel data-driven pipeline for 3D reconstruction from monocular video sequences. It exploits a fine-tuning technique to adjust the weights of a pre-trained depth estimation neural network depending on the input scene. In doing so, the network can learn the features of a particular object and can provide semi real-time depth predictions for 3D reconstruction. Furthermore, the project provides a comparison with a custom implementation of the current state of the art approach and shows the potential of this innovative data-driven pipeline.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

10

Hunter, Brandon. „Channel Probing for an Indoor Wireless Communications Channel“. BYU ScholarsArchive, 2003. https://scholarsarchive.byu.edu/etd/64.

Der volle Inhalt der Quelle

Annotation:

The statistics of the amplitude, time and angle of arrival of multipaths in an indoor environment are all necessary components of multipath models used to simulate the performance of spatial diversity in receive antenna configurations. The model presented by Saleh and Valenzuela, was added to by Spencer et. al., and included all three of these parameters for a 7 GHz channel. A system was built to measure these multipath parameters at 2.4 GHz for multiple locations in an indoor environment. Another system was built to measure the angle of transmission for a 6 GHz channel. The addition of this parameter allows spatial diversity at the transmitter along with the receiver to be simulated. The process of going from raw measurement data to discrete arrivals and then to clustered arrivals is analyzed. Many possible errors associated with discrete arrival processing are discussed along with possible solutions. Four clustering methods are compared and their relative strengths and weaknesses are pointed out. The effects that errors in the clustering process have on parameter estimation and model performance are also simulated.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Bücher zum Thema "Signed Distance Functions"

1

Mann, Peter. Matrices. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780198822370.003.0031.

Der volle Inhalt der Quelle

Annotation:

This chapter looks at the calculus of a function of two or more variables, which is the subject of partial differentiation. The partial derivative of a function is the rate of change of the function with respect to the distance in the direction of a particular coordinate axis and is symbolised with the sign ∂. The chapter spends time on the implicit function theorem, since it is relied upon heavily elsewhere in the text. Lagrange multipliers are used to solve constrained optimisation problems. Topics include critical points, the product rule, the chain rule, directional derivatives, hypersurfaces and Taylor’s theorem. In addition, the chapter discusses Jacobian matrices, the inverse function theorem, gradients, level sets and Hessian matrices.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Buchteile zum Thema "Signed Distance Functions"

1

Osher, Stanley, und Ronald Fedkiw. „Signed Distance Functions“. In Applied Mathematical Sciences, 17–22. New York, NY: Springer New York, 2003. http://dx.doi.org/10.1007/0-387-22746-6_2.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

2

Osher, Stanley, und Ronald Fedkiw. „Constructing Signed Distance Functions“. In Applied Mathematical Sciences, 63–74. New York, NY: Springer New York, 2003. http://dx.doi.org/10.1007/0-387-22746-6_7.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

3

Cavallari, Tommaso, und Luigi Di Stefano. „Volume-Based Semantic Labeling with Signed Distance Functions“. In Image and Video Technology, 544–56. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-29451-3_43.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

4

Mahmoodi, Sasan, Muayed S. Al-Huseiny und Mark S. Nixon. „Similarity Registration for Shapes Based on Signed Distance Functions“. In Advances in Visual Computing, 599–609. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-33179-4_57.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

5

Werner, Diana, Ayoub Al-Hamadi und Philipp Werner. „Truncated Signed Distance Function: Experiments on Voxel Size“. In Lecture Notes in Computer Science, 357–64. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-11755-3_40.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

6

Wójcik, Krzysztof, Bogdan Wziętek, Piotr Wziętek und Marcin Piekarczyk. „Signal Recognition Based on Multidimensional Optimization of Distance Function in Medical Applications“. In Computer Networks, 410–20. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-39207-3_35.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

7

Kim, Jung Hwan, Amanda Taylor und David Ress. „Simple Signed-Distance Function Depth Calculation Applied to Measurement of the fMRI BOLD Hemodynamic Response Function in Human Visual Cortex“. In Computational Modeling of Objects Presented in Images. Fundamentals, Methods, and Applications, 216–28. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-54609-4_16.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

8

Dong, Wei, Qiuyuan Wang, Xin Wang und Hongbin Zha. „PSDF Fusion: Probabilistic Signed Distance Function for On-the-fly 3D Data Fusion and Scene Reconstruction“. In Computer Vision – ECCV 2018, 714–30. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-030-01240-3_43.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

9

Lin, Guishan, Zhiming He, Jing Wu, Meng Zhao und Zhihao Mei. „Wideband Radar Target Detection Based on the Probability Distance of Empirical Cumulative Distribution Function“. In The Proceedings of the Second International Conference on Communications, Signal Processing, and Systems, 617–23. Cham: Springer International Publishing, 2013. http://dx.doi.org/10.1007/978-3-319-00536-2_71.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

10

Jaggi, Chandra K., Anuj Sharma und Reena Jain. „EOQ Model with Permissible Delay in Payments under Fuzzy Environment“. In Advances in Business Information Systems and Analytics, 281–96. IGI Global, 2014. http://dx.doi.org/10.4018/978-1-4666-5958-2.ch014.

Der volle Inhalt der Quelle

Annotation:

This chapter introduces an economic order quantity inventory model under the condition of permissible delay in payments in fuzzy environment. All the parameters of the model, excluding permissible delay period and cycle length, are taken to be trapezoidal Fuzzy numbers. The arithmetic operations are defined under the function principle. The cost function has been defuzzified using signed distance method and thereby solved to obtain the optimal replenishment period. The numerical example is presented to show the validity of the model followed by sensitivity analysis.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Konferenzberichte zum Thema "Signed Distance Functions"

1

Haugo, Simen, Annette Stahl und Edmund Brekke. „Continuous Signed Distance Functions for 3D Vision“. In 2017 International Conference on 3D Vision (3DV). IEEE, 2017. http://dx.doi.org/10.1109/3dv.2017.00023.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

2

Gong, Yuanhao, Gregory Paul und Ivo F. Sbalzarini. „Coupled signed-distance functions for implicit surface reconstruction“. In 2012 IEEE 9th International Symposium on Biomedical Imaging (ISBI 2012). IEEE, 2012. http://dx.doi.org/10.1109/isbi.2012.6235726.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

3

Yan, Jun, Qing Xia, YiJun Ji und ZhiJiang Zhang. „Localization of transparent objects using signed distance functions“. In Sixth International Conference on Optical and Photonic Engineering, herausgegeben von Yingjie Yu, Chao Zuo und Kemao Qian. SPIE, 2018. http://dx.doi.org/10.1117/12.2326963.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

4

Brissman, Emil, Joakim Johnander und Michael Felsberg. „Predicting Signed Distance Functions for Visual Instance Segmentation“. In 2021 Swedish Artificial Intelligence Society Workshop (SAIS). IEEE, 2021. http://dx.doi.org/10.1109/sais53221.2021.9484039.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

5

Park, Jeong Joon, Peter Florence, Julian Straub, Richard Newcombe und Steven Lovegrove. „DeepSDF: Learning Continuous Signed Distance Functions for Shape Representation“. In 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). IEEE, 2019. http://dx.doi.org/10.1109/cvpr.2019.00025.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

6

Dietrich, Vincent, Dong Chen, Kai M. Wurm, Georg v. Wichert und Philipp Ennen. „Probabilistic multi-sensor fusion based on signed distance functions“. In 2016 IEEE International Conference on Robotics and Automation (ICRA). IEEE, 2016. http://dx.doi.org/10.1109/icra.2016.7487333.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

7

Schmidt, Nicolas. „A CAD Interface for Drawing with Signed Distance Functions“. In SIGGRAPH '20: Special Interest Group on Computer Graphics and Interactive Techniques Conference. New York, NY, USA: ACM, 2020. http://dx.doi.org/10.1145/3388770.3407435.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

8

Koch, Philipp, Stefan May, Michael Schmidpeter, Markus Kuhn, Christian Pfitzner, Christian Merkl, Rainer Koch, Martin Fees, Jon Martin und Andreas Nuchter. „Multi-robot Localization and Mapping Based on Signed Distance Functions“. In 2015 IEEE International Conference on Autonomous Robot Systems and Competitions (ICARSC). IEEE, 2015. http://dx.doi.org/10.1109/icarsc.2015.18.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

9

Daun, Kevin, Stefan Kohlbrecher, Jurgen Sturm und Oskar von Stryk. „Large Scale 2D Laser SLAM using Truncated Signed Distance Functions“. In 2019 IEEE International Symposium on Safety, Security, and Rescue Robotics (SSRR). IEEE, 2019. http://dx.doi.org/10.1109/ssrr.2019.8848964.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

10

Morgan, John P., und Richard L. Tutwiler. „Real-time reconstruction of depth sequences using signed distance functions“. In SPIE Defense + Security, herausgegeben von Ivan Kadar. SPIE, 2014. http://dx.doi.org/10.1117/12.2054158.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Berichte der Organisationen zum Thema "Signed Distance Functions"

1

Kuznetsov, Victor, Vladislav Litvinenko, Egor Bykov und Vadim Lukin. A program for determining the area of the object entering the IR sensor grid, as well as determining the dynamic characteristics. Science and Innovation Center Publishing House, April 2021. http://dx.doi.org/10.12731/bykov.0415.15042021.

Der volle Inhalt der Quelle

Annotation:

Currently, to evaluate the dynamic characteristics of objects, quite a large number of devices are used in the form of chronographs, which consist of various optical, thermal and laser sensors. Among the problems of these devices, the following can be distinguished: the lack of recording of the received data; the inaccessibility of taking into account the trajectory of the object flying in the sensor area, as well as taking into consideration the trajectory of the object during the approach to the device frame. The signal received from the infrared sensors is recorded in a separate document in txt format, in the form of a table. When you turn to the document, data is read from the current position of the input data stream in the specified list by an argument in accordance with the given condition. As a result of reading the data, it forms an array that includes N number of columns. The array is constructed in a such way that the first column includes time values, and columns 2...N- the value of voltage . The algorithm uses cycles that perform the function of deleting array rows where there is a fact of exceeding the threshold value in more than two columns, as well as rows where the threshold level was not exceeded. The modified array is converted into two new arrays, each of which includes data from different sensor frames. An array with the coordinates of the centers of the sensor operation zones was created to apply the Pythagorean theorem in three-dimensional space, which is necessary for calculating the exact distance between the zones. The time is determined by the difference in the response of the first and second sensor frames. Knowing the path and time, we are able to calculate the exact speed of the object. For visualization, the oscillograms of each sensor channel were displayed, and a chronograph model was created. The chronograph model highlights in purple the area where the threshold has been exceeded.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wir bieten Rabatte auf alle Premium-Pläne für Autoren, deren Werke in thematische Literatursammlungen aufgenommen wurden. Kontaktieren Sie uns, um einen einzigartigen Promo-Code zu erhalten!