Relevant bibliographies by topics / Resection-intersection

Academic literature on the topic 'Resection-intersection'

Author: Grafiati
Published: 10 December 2022
Last updated: 28 January 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Contents

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Resection-intersection.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Resection-intersection"

1

Lakemond, Ruan, Clinton Fookes, and Sridha Sridharan. "Resection-Intersection Bundle Adjustment Revisited." ISRN Machine Vision 2013 (December 12, 2013): 1–8. http://dx.doi.org/10.1155/2013/261956.

Full text
Abstract:
Bundle adjustment is one of the essential components of the computer vision toolbox. This paper revisits the resection-intersection approach, which has previously been shown to have inferior convergence properties. Modifications are proposed that greatly improve the performance of this method, resulting in a fast and accurate approach. Firstly, a linear triangulation step is added to the intersection stage, yielding higher accuracy and improved convergence rate. Secondly, the effect of parameter updates is tracked in order to reduce wasteful computation; only variables coupled to significantly changing variables are updated. This leads to significant improvements in computation time, at the cost of a small, controllable increase in error. Loop closures are handled effectively without the need for additional network modelling. The proposed approach is shown experimentally to yield comparable accuracy to a full sparse bundle adjustment (20% error increase) while computation time scales much better with the number of variables. Experiments on a progressive reconstruction system show the proposed method to be more efficient by a factor of 65 to 177, and 4.5 times more accurate (increasing over time) than a localised sparse bundle adjustment approach.
APA, Harvard, Vancouver, ISO, and other styles
2

Liu, Shigang, Jiancheng Sun, and Jianwu Dang. "A Linear Resection-Intersection Bundle Adjustment Method." Information Technology Journal 7, no. 1 (December 15, 2007): 220–23. http://dx.doi.org/10.3923/itj.2008.220.223.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Börlin, Niclas. "Comparison of resection–intersection algorithms and projection geometries in radiostereometry." ISPRS Journal of Photogrammetry and Remote Sensing 56, no. 5-6 (August 2002): 390–400. http://dx.doi.org/10.1016/s0924-2716(02)00068-0.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Paláncz, B., and J. L. Awange. "Pareto optimality solution of the multi-objective photogrammetric resection-intersection problem." Earth Science Informatics 6, no. 1 (December 8, 2012): 1–20. http://dx.doi.org/10.1007/s12145-012-0107-x.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Font-Llagunes, Josep M., and Joaquim A. Batlle. "New Method That Solves the Three-Point Resection Problem Using Straight Lines Intersection." Journal of Surveying Engineering 135, no. 2 (May 2009): 39–45. http://dx.doi.org/10.1061/(asce)0733-9453(2009)135:2(39).

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Pereira, Fabio Irigon, Joel Augusto Luft, Gustavo Ilha, and Altamiro Susin. "A Novel Resection–Intersection Algorithm With Fast Triangulation Applied to Monocular Visual Odometry." IEEE Transactions on Intelligent Transportation Systems 19, no. 11 (November 2018): 3584–93. http://dx.doi.org/10.1109/tits.2018.2853579.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Beal, Eliza W., Rittal Mehta, Katiuscha Merath, Diamantis I. Tsilimigras, J. Madison Hyer, Anghela Paredes, Mary E. Dillhoff, Jordan Cloyd, Aslam Ejaz, and Timothy M. Pawlik. "Outcomes After Resection of Hepatocellular Carcinoma: Intersection of Travel Distance and Hospital Volume." Journal of Gastrointestinal Surgery 23, no. 7 (May 8, 2019): 1425–34. http://dx.doi.org/10.1007/s11605-019-04233-w.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Maiborodin, I. V., S. V. Marchukov, and V. I. Maiborodina. "SOME FEATURES OF THE KIDNEY SCAR FORMATION AFTER SURGERY IN THE EXPERIMENT." Novosti Khirurgii 29, no. 3 (July 25, 2021): 275–84. http://dx.doi.org/10.18484/2305-0047.2021.3.275.

Full text
Abstract:
Objective. To study the features of scar formation and structural changes in the remaining renal parenchyma in rats after the kidney resection in various terms. Methods. A layeredclosure of midline laparotomy and the caudal part of the left kidney removal was performed in rats under general inhalation ether anesthesia in a clean operating room. The morphology of the remaining kidney part after resection was studied using light microscope in different terms. Results. Athrombusfrom blood leaking outof the cut vessels is formed on the damaged surface of the kidney immediately after the resection. This clot with the parenchyma is gradually replaced by the connective tissue along the edge of the defect with the subsequently formation of a thin connective or fibrous tissue scar. However, in many cases, the number of which in rats can reach 40%, the processes of kidney damage continue for a long time after surgery, and leading to total or subtotal nephrosclerosis. The detected cystic change in tubular structures, apparently, occurred firstly due to their intersection during the resection, clamping by a blood clot and / or compression by edema distal to the observation site. Then, the forming extensive scar again clamped the adjacent tubular structures with subsequent cystic degeneration and sclerosis. In this case, detritus formed from non-viable renal tissues is eliminated by macrophages, which can form multinucleated cells with fused cytoplasm. Conclusion. Structural changes in the nephrosclerosis progression after kidney resection consist in the gradual replacement of the all renal cortical and medullar parenchyma by the connective tissue. This is not associated with the autoimmune process, but is more likely due to both impaired urine outflow after intercut of the tubular structures at resection and/or compression by edema, inflammatory infiltrate, forming or organizing scar, and vascular disorders associated with these causes. The inflammation accompanying necrosis and sclerosis of the renal structures can become granulomatous. What this paper adds For the first time, it has been shown that the progressively enlarging scar can be formed after the kidney resection, resulting in total nephrosclerosis. Such changes develop both due to the intersection of the tubular structures during the resection and their compression by edema, inflammatory infiltrate, forming or organizing a scar, and vascular disorders due to the above-mentioned causes.
APA, Harvard, Vancouver, ISO, and other styles
9

Hänsch, R., I. Drude, and O. Hellwich. "MODERN METHODS OF BUNDLE ADJUSTMENT ON THE GPU." ISPRS Annals of Photogrammetry, Remote Sensing and Spatial Information Sciences III-3 (June 3, 2016): 43–50. http://dx.doi.org/10.5194/isprsannals-iii-3-43-2016.

Full text
Abstract:
The task to compute 3D reconstructions from large amounts of data has become an active field of research within the last years. Based on an initial estimate provided by structure from motion, bundle adjustment seeks to find a solution that is optimal for all cameras and 3D points. The corresponding nonlinear optimization problem is usually solved by the Levenberg-Marquardt algorithm combined with conjugate gradient descent. While many adaptations and extensions to the classical bundle adjustment approach have been proposed, only few works consider the acceleration potentials of GPU systems. This paper elaborates the possibilities of time and space savings when fitting the implementation strategy to the terms and requirements of realizing a bundler on heterogeneous CPUGPU systems. Instead of focusing on the standard approach of Levenberg-Marquardt optimization alone, nonlinear conjugate gradient descent and alternating resection-intersection are studied as two alternatives. The experiments show that in particular alternating resection-intersection reaches low error rates very fast, but converges to larger error rates than Levenberg-Marquardt. PBA, as one of the current state-of-the-art bundlers, converges slower in 50 % of the test cases and needs 1.5-2 times more memory than the Levenberg- Marquardt implementation.
APA, Harvard, Vancouver, ISO, and other styles
10

Hänsch, R., I. Drude, and O. Hellwich. "MODERN METHODS OF BUNDLE ADJUSTMENT ON THE GPU." ISPRS Annals of Photogrammetry, Remote Sensing and Spatial Information Sciences III-3 (June 3, 2016): 43–50. http://dx.doi.org/10.5194/isprs-annals-iii-3-43-2016.

Full text
Abstract:
The task to compute 3D reconstructions from large amounts of data has become an active field of research within the last years. Based on an initial estimate provided by structure from motion, bundle adjustment seeks to find a solution that is optimal for all cameras and 3D points. The corresponding nonlinear optimization problem is usually solved by the Levenberg-Marquardt algorithm combined with conjugate gradient descent. While many adaptations and extensions to the classical bundle adjustment approach have been proposed, only few works consider the acceleration potentials of GPU systems. This paper elaborates the possibilities of time and space savings when fitting the implementation strategy to the terms and requirements of realizing a bundler on heterogeneous CPUGPU systems. Instead of focusing on the standard approach of Levenberg-Marquardt optimization alone, nonlinear conjugate gradient descent and alternating resection-intersection are studied as two alternatives. The experiments show that in particular alternating resection-intersection reaches low error rates very fast, but converges to larger error rates than Levenberg-Marquardt. PBA, as one of the current state-of-the-art bundlers, converges slower in 50 % of the test cases and needs 1.5-2 times more memory than the Levenberg- Marquardt implementation.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Resection-intersection"

1

Lehmann, Rüdiger. "Ebene Geodätische Berechnungen: Internes Manuskript." Hochschule für Technik und Wirtschaft, 2018. https://htw-dresden.qucosa.de/id/qucosa%3A31824.

Full text
Abstract:
Dieses Manuskript entstand aus Vorlesungen über Geodätische Berechnungen an der Hochschule für Technik und Wirtschaft Dresden. Da diese Lehrveranstaltung im ersten oder zweiten Semester stattfindet, werden noch keine Methoden der höheren Mathematik benutzt. Das Themenspektrum beschränkt sich deshalb weitgehend auf elementare Berechnungen in der Ebene.:0 Vorwort 1 Ebene Trigonometrie 1.1 Winkelfunktionen 1.2 Berechnung schiefwinkliger ebener Dreiecke 1.3 Berechnung schiefwinkliger ebener Vierecke 2 Ebene Koordinatenrechnung 2.1 Kartesische und Polarkoordinaten 2.2 Erste Geodätische Grundaufgabe 2.3 Zweite Geodätische Grundaufgabe 3 Flächenberechnung und Flächenteilung 3.1 Flächenberechnung aus Maßzahlen. 3.2 Flächenberechnung aus Koordinaten 3.3 Absteckung und Teilung gegebener Dreiecksflächen 3.4 Absteckung und Teilung gegebener Vierecksflächen 4 Kreis und Ellipse 4.1 Kreisbogen und Kreissegment 4.2 Näherungsformeln für flache Kreisbögen 4.3 Sehnen-Tangenten-Verfahren 4.4 Grundlegendes über Ellipsen 4.5 Abplattung und Exzentrizitäten 4.6 Die Meridianellipse der Erde 4.7 Flächeninhalt und Bogenlängen 5 Ebene Einschneideverfahren 5.1 Bogenschnitt 5.2 Vorwärtsschnitt 5.3 Anwendung: Geradenschnitt 5.4 Anwendung: Kreis durch drei Punkte 5.5 Schnitt Gerade ⎼ Kreis oder Strahl ⎼ Kreis 5.6 Rückwärtsschnitt 5.7 Anwendung: Rechteck durch fünf Punkte 6 Ebene Koordinatentransformationen 6.1 Elementare Transformationsschritte 6.2 Rotation und Translation. 6.3 Rotation, Skalierung und Translation 6.4 Ähnlichkeitstransformation mit zwei identischen Punkten 6.5 Anwendung: Hansensche Aufgabe 6.6 Anwendung: Kleinpunktberechnung 6.7 Anwendung: Rechteck durch fünf Punkte 6.8 Ebene Helmert-Transformation 6.9 Bestimmung der Parameter bei Rotation und Translation 6.10 Ebene Affintransformation 7 Lösungen
This manuscript evolved from lectures on Geodetic Computations at the University of Applied Sciences Dresden (Germany). Since this lecture is given in the first or second semester, no advanced mathematical methods are used. The range of topics is limited to elementary computations in the plane.:0 Vorwort 1 Ebene Trigonometrie 1.1 Winkelfunktionen 1.2 Berechnung schiefwinkliger ebener Dreiecke 1.3 Berechnung schiefwinkliger ebener Vierecke 2 Ebene Koordinatenrechnung 2.1 Kartesische und Polarkoordinaten 2.2 Erste Geodätische Grundaufgabe 2.3 Zweite Geodätische Grundaufgabe 3 Flächenberechnung und Flächenteilung 3.1 Flächenberechnung aus Maßzahlen. 3.2 Flächenberechnung aus Koordinaten 3.3 Absteckung und Teilung gegebener Dreiecksflächen 3.4 Absteckung und Teilung gegebener Vierecksflächen 4 Kreis und Ellipse 4.1 Kreisbogen und Kreissegment 4.2 Näherungsformeln für flache Kreisbögen 4.3 Sehnen-Tangenten-Verfahren 4.4 Grundlegendes über Ellipsen 4.5 Abplattung und Exzentrizitäten 4.6 Die Meridianellipse der Erde 4.7 Flächeninhalt und Bogenlängen 5 Ebene Einschneideverfahren 5.1 Bogenschnitt 5.2 Vorwärtsschnitt 5.3 Anwendung: Geradenschnitt 5.4 Anwendung: Kreis durch drei Punkte 5.5 Schnitt Gerade ⎼ Kreis oder Strahl ⎼ Kreis 5.6 Rückwärtsschnitt 5.7 Anwendung: Rechteck durch fünf Punkte 6 Ebene Koordinatentransformationen 6.1 Elementare Transformationsschritte 6.2 Rotation und Translation. 6.3 Rotation, Skalierung und Translation 6.4 Ähnlichkeitstransformation mit zwei identischen Punkten 6.5 Anwendung: Hansensche Aufgabe 6.6 Anwendung: Kleinpunktberechnung 6.7 Anwendung: Rechteck durch fünf Punkte 6.8 Ebene Helmert-Transformation 6.9 Bestimmung der Parameter bei Rotation und Translation 6.10 Ebene Affintransformation 7 Lösungen
APA, Harvard, Vancouver, ISO, and other styles
2

Zhang, Qianggong. "Robust and large-scale quasiconvex programming in structure-from-motion." Thesis, 2018. http://hdl.handle.net/2440/114269.

Full text
Abstract:
Structure-from-Motion (SfM) is a cornerstone of computer vision. Briefly speaking, SfM is the task of simultaneously estimating the poses of the cameras behind a set of images of a scene, and the 3D coordinates of the points in the scene. Often, the optimisation problems that underpin SfM do not have closed-form solutions, and finding solutions via numerical schemes is necessary. An objective function, which measures the discrepancy of a geometric object (e.g., camera poses, rotations, 3D coordi- nates) with a set of image measurements, is to be minimised. Each image measurement gives rise to an error function. For example, the reprojection error, which measures the distance between an observed image point and the projection of a 3D point onto the image, is a commonly used error function. An influential optimisation paradigm in SfM is the ℓ₀₀ paradigm, where the objective function takes the form of the maximum of all individual error functions (e.g. individual reprojection errors of scene points). The benefit of the ℓ₀₀ paradigm is that the objective function of many SfM optimisation problems become quasiconvex, hence there is a unique minimum in the objective function. The task of formulating and minimising quasiconvex objective functions is called quasiconvex programming. Although tremendous progress in SfM techniques under the ℓ₀₀ paradigm has been made, there are still unsatisfactorily solved problems, specifically, problems associated with large-scale input data and outliers in the data. This thesis describes novel techniques to tackle these problems. A major weakness of the ℓ₀₀ paradigm is its susceptibility to outliers. This thesis improves the robustness of ℓ₀₀ solutions against outliers by employing the least median of squares (LMS) criterion, which amounts to minimising the median error. In the context of triangulation, this thesis proposes a locally convergent robust algorithm underpinned by a novel quasiconvex plane sweep technique. Imposing the LMS criterion achieves significant outlier tolerance, and, at the same time, some properties of quasiconvexity greatly simplify the process of solving the LMS problem. Approximation is a commonly used technique to tackle large-scale input data. This thesis introduces the coreset technique to quasiconvex programming problems. The coreset technique aims find a representative subset of the input data, such that solving the same problem on the subset yields a solution that is within known bound of the optimal solution on the complete input set. In particular, this thesis develops a coreset approximate algorithm to handle large-scale triangulation tasks. Another technique to handle large-scale input data is to break the optimisation into multiple smaller sub-problems. Such a decomposition usually speeds up the overall optimisation process, and alleviates the limitation on memory. This thesis develops a large-scale optimisation algorithm for the known rotation problem (KRot). The proposed method decomposes the original quasiconvex programming problem with potentially hundreds of thousands of parameters into multiple sub-problems with only three parameters each. An efficient solver based on a novel minimum enclosing ball technique is proposed to solve the sub-problems.
Thesis (Ph.D.) (Research by Publication) -- University of Adelaide, School of Computer Science, 2018
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Resection-intersection"

1

Uren, J., and W. F. Price. "Intersection and Resection." In Surveying for Engineers, 188–96. London: Macmillan Education UK, 1985. http://dx.doi.org/10.1007/978-1-349-07348-1_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Uren, J., and W. F. Price. "Intersection and Resection." In Surveying for Engineers, 188–96. London: Macmillan Education UK, 1985. http://dx.doi.org/10.1007/978-1-349-07355-9_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Grafarend, E. W., and A. Mader. "Robot vision based on an exact solution of the threedimensional resection-intersection." In Applications of Geodesy to Engineering, 376–88. Berlin, Heidelberg: Springer Berlin Heidelberg, 1993. http://dx.doi.org/10.1007/978-3-642-77958-9_33.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Singh, Ashish Kumar, Karthik Srinivasan, and Venkat Ramana Peddigari. "Hybrid Resection-Intersection Method for Real-Time Bundle Adjustment on Mobile Devices." In Communications in Computer and Information Science, 282–91. Singapore: Springer Singapore, 2020. http://dx.doi.org/10.1007/978-981-15-8697-2_26.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Richardus, Peter. "Intersection and Resection." In Project Surveying, 18–29. Routledge, 2017. http://dx.doi.org/10.1201/9780203741740-3.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Resection-intersection"

1

Zhang, Qianggong, Tat-Jun Chin, and Huu Minh Le. "A Fast Resection-Intersection Method for the Known Rotation Problem." In 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). IEEE, 2018. http://dx.doi.org/10.1109/cvpr.2018.00318.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Barrett, Eamon B., Michael H. Brill, Nils N. Haag, and Paul M. Payton. "Linear resection, intersection, and perspective-independent model matching in photogrammetry: theory." In San Diego, '91, San Diego, CA, edited by Andrew G. Tescher. SPIE, 1991. http://dx.doi.org/10.1117/12.50811.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Zablotskii, Vladimir. "TRAINING COMPUTER PROGRAMS FOR THE GEODESY AND CARTOGRAPHY STUDENTS: DETERMINING THE COORDINATES OF POINTS USING THE GEODETIC INTERSECTION AND RESECTION." In 19th SGEM International Multidisciplinary Scientific GeoConference EXPO Proceedings. STEF92 Technology, 2019. http://dx.doi.org/10.5593/sgem2019/2.2/s09.049.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Linzer, Finn, and Hans-Berndt Neuner. "Transferability of an estimation procedure for distance deviations of terrestrial laser scanners from laboratory to on-site conditions." In 5th Joint International Symposium on Deformation Monitoring. Valencia: Editorial de la Universitat Politècnica de València, 2022. http://dx.doi.org/10.4995/jisdm2022.2022.13853.

Full text
Abstract:
Employing terrestrial laser scanners (TLS) for geodetic deformation measurements requires attaining the highest possible accuracy. In this paper, we estimate the influence of varying incidence angles (IA) and materials on measurements regarding the distance component. Considering not only stochastic characteristics, the use of a scanning total station enables additionally the study of systematic distance deviations. By using the total station ocular, the device is brought into the local coordinate system of a laser tracker via position resection and intersection. The point cloud recording, with a Close-Range scanner, represents the reference. Due to transformation into a common coordinate system, defined by a laser tracker, a distance driven point comparison is possible. To test a large number of conditions an automated setup was developed. For each device, a suitable interface was implemented in the Robot Operating System. After the specimen has been set up, an automatic measurement can be performed for data acquisition. We can demonstrate that different building materials and varying IAs cause systematic distance deviations up to 3 mm magnitude. For measurement objects, this kind of correction must be considered, especially when the measurement configuration varies between measurement epochs. It can be demonstrated that the values and characteristics observed in the laboratory agree to those obtained on-site. However, the chosen approach thereby reveals previously unrecognized challenges that need to be considered for the use of TLS in high-accuracy deformation analysis.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Resection-intersection' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography