Relevant bibliographies by topics / Matching points

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Matching points'

Author: Grafiati
Published: 4 June 2021
Last updated: 1 February 2022

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

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Matching points.'

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 "Matching points"

1

Ábrego, Bernardo M., Esther M. Arkin, Silvia Fernández-Merchant, Ferran Hurtado, Mikio Kano, Joseph S. B. Mitchell, and Jorge Urrutia. "Matching Points with Squares." Discrete & Computational Geometry 41, no. 1 (July 3, 2008): 77–95. http://dx.doi.org/10.1007/s00454-008-9099-1.

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

Vincent, Etienne, and Robert Laganière. "Detecting and matching feature points." Journal of Visual Communication and Image Representation 16, no. 1 (February 2005): 38–54. http://dx.doi.org/10.1016/j.jvcir.2004.05.001.

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

Caraballo, L. E., C. Ochoa, P. Pérez-Lantero, and J. Rojas-Ledesma. "Matching colored points with rectangles." Journal of Combinatorial Optimization 33, no. 2 (October 27, 2015): 403–21. http://dx.doi.org/10.1007/s10878-015-9971-x.

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

Yuan, Wei, Shiyu Chen, Yong Zhang, Jianya Gong, and Ryosuke Shibasaki. "AN AERIAL-IMAGE DENSE MATCHING APPROACH BASED ON OPTICAL FLOW FIELD." ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences XLI-B3 (June 9, 2016): 543–48. http://dx.doi.org/10.5194/isprsarchives-xli-b3-543-2016.

Full text
Abstract:
Dense matching plays an important role in many fields, such as DEM (digital evaluation model) producing, robot navigation and 3D environment reconstruction. Traditional approaches may meet the demand of accuracy. But the calculation time and out puts density is hardly be accepted. Focus on the matching efficiency and complex terrain surface matching feasibility an aerial image dense matching method based on optical flow field is proposed in this paper. First, some high accurate and uniformed control points are extracted by using the feature based matching method. Then the optical flow is calculated by using these control points, so as to determine the similar region between two images. Second, the optical flow field is interpolated by using the multi-level B-spline interpolation in the similar region and accomplished the pixel by pixel coarse matching. Final, the results related to the coarse matching refinement based on the combined constraint, which recognizes the same points between images. The experimental results have shown that our method can achieve per-pixel dense matching points, the matching accuracy achieves sub-pixel level, and fully meet the three-dimensional reconstruction and automatic generation of DSM-intensive matching’s requirements. The comparison experiments demonstrated that our approach’s matching efficiency is higher than semi-global matching (SGM) and Patch-based multi-view stereo matching (PMVS) which verifies the feasibility and effectiveness of the algorithm.
APA, Harvard, Vancouver, ISO, and other styles
5

Yuan, Wei, Shiyu Chen, Yong Zhang, Jianya Gong, and Ryosuke Shibasaki. "AN AERIAL-IMAGE DENSE MATCHING APPROACH BASED ON OPTICAL FLOW FIELD." ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences XLI-B3 (June 9, 2016): 543–48. http://dx.doi.org/10.5194/isprs-archives-xli-b3-543-2016.

Full text
Abstract:
Dense matching plays an important role in many fields, such as DEM (digital evaluation model) producing, robot navigation and 3D environment reconstruction. Traditional approaches may meet the demand of accuracy. But the calculation time and out puts density is hardly be accepted. Focus on the matching efficiency and complex terrain surface matching feasibility an aerial image dense matching method based on optical flow field is proposed in this paper. First, some high accurate and uniformed control points are extracted by using the feature based matching method. Then the optical flow is calculated by using these control points, so as to determine the similar region between two images. Second, the optical flow field is interpolated by using the multi-level B-spline interpolation in the similar region and accomplished the pixel by pixel coarse matching. Final, the results related to the coarse matching refinement based on the combined constraint, which recognizes the same points between images. The experimental results have shown that our method can achieve per-pixel dense matching points, the matching accuracy achieves sub-pixel level, and fully meet the three-dimensional reconstruction and automatic generation of DSM-intensive matching’s requirements. The comparison experiments demonstrated that our approach’s matching efficiency is higher than semi-global matching (SGM) and Patch-based multi-view stereo matching (PMVS) which verifies the feasibility and effectiveness of the algorithm.
APA, Harvard, Vancouver, ISO, and other styles
6

Cui, Haihua, Wenhe Liao, Xiaosheng Cheng, Ning Dai, and Changye Guo. "Flexible point cloud matching method based on three-dimensional image feature points." Advances in Mechanical Engineering 10, no. 9 (September 2018): 168781401879503. http://dx.doi.org/10.1177/1687814018795032.

Full text
Abstract:
Flexible and robust point cloud matching is important for three-dimensional surface measurement. This article proposes a new matching method based on three-dimensional image feature points. First, an intrinsic shape signature algorithm is used to detect the key shape feature points, using a weighted three-dimensional occupational histogram of the data points within the angular space, which is a view-independent representation of the three-dimensional shape. Then, the point feature histogram is used to represent the underlying surface model properties at a point whose computation is based on the combination of certain geometrical relations between the point’s nearest k-neighbors. The two-view point clouds are robustly matched using the proposed double neighborhood constraint of minimizing the sum of the Euclidean distances between the local neighbors of the point and feature point. The proposed optimization method is immune to noise, reduces the search range for matching points, and improves the correct feature point matching rate for a weak surface texture. The matching accuracy and stability of the proposed method are verified using experiments. This method can be used for a flat surface with weak features and in other applications. The method has a larger application range than the traditional methods.
APA, Harvard, Vancouver, ISO, and other styles
7

Piech, Mateusz, Aleksander Smywinski-Pohl, Robert Marcjan, and Leszek Siwik. "Towards Automatic Points of Interest Matching." ISPRS International Journal of Geo-Information 9, no. 5 (May 1, 2020): 291. http://dx.doi.org/10.3390/ijgi9050291.

Full text
Abstract:
Complementing information about particular points, places, or institutions, i.e., so-called Points of Interest (POIs) can be achieved by matching data from the growing number of geospatial databases; these include Foursquare, OpenStreetMap, Yelp, and Facebook Places. Doing this potentially allows for the acquisition of more accurate and more complete information about POIs than would be possible by merely extracting the information from each of the systems alone. Problem: The task of Points of Interest matching, and the development of an algorithm to perform this automatically, are quite challenging problems due to the prevalence of different data structures, data incompleteness, conflicting information, naming differences, data inaccuracy, and cultural and language differences; in short, the difficulties experienced in the process of obtaining (complementary) information about the POI from different sources are due, in part, to the lack of standardization among Points of Interest descriptions; a further difficulty stems from the vast and rapidly growing amount of data to be assessed on each occasion. Research design and contributions: To propose an efficient algorithm for automatic Points of Interest matching, we: (1) analyzed available data sources—their structures, models, attributes, number of objects, the quality of data (number of missing attributes), etc.—and defined a unified POI model; (2) prepared a fairly large experimental dataset consisting of 50,000 matching and 50,000 non-matching points, taken from different geographical, cultural, and language areas; (3) comprehensively reviewed metrics that can be used for assessing the similarity between Points of Interest; (4) proposed and verified different strategies for dealing with missing or incomplete attributes; (5) reviewed and analyzed six different classifiers for Points of Interest matching, conducting experiments and follow-up comparisons to determine the most effective combination of similarity metric, strategy for dealing with missing data, and POIs matching classifier; and (6) presented an algorithm for automatic Points of Interest matching, detailing its accuracy and carrying out a complexity analysis. Results and conclusions: The main results of the research are: (1) comprehensive experimental verification and numerical comparisons of the crucial Points of Interest matching components (similarity metrics, approaches for dealing with missing data, and classifiers), indicating that the best Points of Interest matching classifier is a combination of random forest algorithm coupled with marking of missing data and mixing different similarity metrics for different POI attributes; and (2) an efficient greedy algorithm for automatic POI matching. At a cost of just 3.5% in terms of accuracy, it allows for reducing POI matching time complexity by two orders of magnitude in comparison to the exact algorithm.
APA, Harvard, Vancouver, ISO, and other styles
8

Bereg, Sergey, Nikolaus Mutsanas, and Alexander Wolff. "Matching points with rectangles and squares." Computational Geometry 42, no. 2 (February 2009): 93–108. http://dx.doi.org/10.1016/j.comgeo.2008.05.001.

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

Yuan, Jian Ying, Xian Yong Liu, and Zhi Qiang Qiu. "A Robust Feature Points Matching Algorithm in 3D Optical Measuring System." Advanced Materials Research 383-390 (November 2011): 5193–99. http://dx.doi.org/10.4028/www.scientific.net/amr.383-390.5193.

Full text
Abstract:
In optical measuring system with a handheld digital camera, image points matching is very important for 3-dimensional(3D) reconstruction. The traditional matching algorithms are usually based on epipolar geometry or multi-base lines. Mistaken matching points can not be eliminated by epipolar geometry and many matching points will be lost by multi-base lines. In this paper, a robust algorithm is presented to eliminate mistaken matching feature points in the process of 3D reconstruction from multiple images. The algorithm include three steps: (1) pre-matching the feature points using constraints of epipolar geometry and image topological structure firstly; (2) eliminating the mistaken matching points by the principle of triangulation in multi-images; (3) refining camera external parameters by bundle adjustment. After the external parameters of every image refined, repeat step (1) to step (3) until all the feature points been matched. Comparative experiments with real image data have shown that mistaken matching feature points can be effectively eliminated, and nearly no matching points have been lost, which have a better performance than traditonal matching algorithms do.
APA, Harvard, Vancouver, ISO, and other styles
10

Shan, X. J., and P. Tang. "A Robust False Matching Points Detection Method for Remote Sensing Image Registration." ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences XL-7/W3 (April 29, 2015): 699–702. http://dx.doi.org/10.5194/isprsarchives-xl-7-w3-699-2015.

Full text
Abstract:
Given the influences of illumination, imaging angle, and geometric distortion, among others, false matching points still occur in all image registration algorithms. Therefore, false matching points detection is an important step in remote sensing image registration. Random Sample Consensus (RANSAC) is typically used to detect false matching points. However, RANSAC method cannot detect all false matching points in some remote sensing images. Therefore, a robust false matching points detection method based on Knearest- neighbour (K-NN) graph (KGD) is proposed in this method to obtain robust and high accuracy result. The KGD method starts with the construction of the K-NN graph in one image. K-NN graph can be first generated for each matching points and its K nearest matching points. Local transformation model for each matching point is then obtained by using its K nearest matching points. The error of each matching point is computed by using its transformation model. Last, L matching points with largest error are identified false matching points and removed. This process is iterative until all errors are smaller than the given threshold. In addition, KGD method can be used in combination with other methods, such as RANSAC. Several remote sensing images with different resolutions and terrains are used in the experiment. We evaluate the performance of KGD method, RANSAC + KGD method, RANSAC, and Graph Transformation Matching (GTM). The experimental results demonstrate the superior performance of the KGD and RANSAC + KGD methods.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Matching points"

1

Avdiu, Blerta. "Matching Feature Points in 3D World." Thesis, Tekniska Högskolan, Högskolan i Jönköping, JTH, Data- och elektroteknik, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:hj:diva-23049.

Full text
Abstract:
This thesis work deals with the most actual topic in Computer Vision field which is scene understanding and this using matching of 3D feature point images. The objective is to make use of Saab’s latest breakthrough in extraction of 3D feature points, to identify the best alignment of at least two 3D feature point images. The thesis gives a theoretical overview of the latest algorithms used for feature detection, description and matching. The work continues with a brief description of the simultaneous localization and mapping (SLAM) technique, ending with a case study on evaluation of the newly developed software solution for SLAM, called slam6d. Slam6d is a tool that registers point clouds into a common coordinate system. It does an automatic high-accurate registration of the laser scans. In the case study the use of slam6d is extended in registering 3D feature point images extracted from a stereo camera and the results of registration are analyzed. In the case study we start with registration of one single 3D feature point image captured from stationary image sensor continuing with registration of multiple images following a trail. Finally the conclusion from the case study results is that slam6d can register non-laser scan extracted feature point images with high-accuracy in case of single image but it introduces some overlapping results in the case of multiple images following a trail.
APA, Harvard, Vancouver, ISO, and other styles
2

Klein, Oliver [Verfasser]. "Shape Matching With Reference Points / Oliver Klein." Berlin : Freie Universität Berlin, 2008. http://d-nb.info/1023050862/34.

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

Stanton, Kevin Blythe. "Matching Points to Lines: Sonar-based Localization for the PSUBOT." PDXScholar, 1993. https://pdxscholar.library.pdx.edu/open_access_etds/4630.

Full text
Abstract:
The PSUBOT (pronounced pea-es-you-bought) is an autonomous wheelchair robot for persons with certain disabilities. Its use of voice recognition and autonomous navigation enable it to carry out high level commands with little or no user assistance. We first describe the goals, constraints, and capabilities of the overall system including path planning and obstacle avoidance. We then focus on localization-the ability of the robot to locate itself in space. Odometry, a compass, and an algorithm which matches points to lines are each employed to accomplish this task. The matching algorithm (which matches "points" to "lines") is the main contribution to this work. The .. points" are acquired from a rotating sonar device, and the "lines" are extracted from a user-entered line-segment model of the building. The algorithm assumes that only small corrections are necessary to correct for odometry errors which inherently accumulate, and makes a correction by shifting and rotating the sonar image so that the data points are as close as possible to the lines. A modification of the basic algorithm to accommodate parallel lines was developed as well as an improvement to the basic noise removal algorithm. We found that the matching algorithm was able to determine the location of the robot to within one foot even when required to correct for as many as five feet of simulated odometry error. Finally, the algorithm's complexity was found to be well within the processing power of currently available hardware.
APA, Harvard, Vancouver, ISO, and other styles
4

Li, Chih-Lin. "Propensity Score Matching in Observational Studies with Multiple Time Points." The Ohio State University, 2011. http://rave.ohiolink.edu/etdc/view?acc_num=osu1313420291.

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

Mellado, Nicolas. "Analysis of 3D objects at multiple scales : application to shape matching." Thesis, Bordeaux 1, 2012. http://www.theses.fr/2012BOR14685/document.

Full text
Abstract:
Depuis quelques années, l’évolution des techniques d’acquisition a entraîné une généralisation de l’utilisation d’objets 3D très dense, représentés par des nuages de points de plusieurs millions de sommets. Au vu de la complexité de ces données, il est souvent nécessaire de les analyser pour en extraire les structures les plus pertinentes, potentiellement définies à plusieurs échelles. Parmi les nombreuses méthodes traditionnellement utilisées pour analyser des signaux numériques, l’analyse dite scale-space est aujourd’hui un standard pour l’étude des courbes et des images. Cependant, son adaptation aux données 3D pose des problèmes d’instabilité et nécessite une information de connectivité, qui n’est pas directement définie dans les cas des nuages de points. Dans cette thèse, nous présentons une suite d’outils mathématiques pour l’analyse des objets 3D, sous le nom de Growing Least Squares (GLS). Nous proposons de représenter la géométrie décrite par un nuage de points via une primitive du second ordre ajustée par une minimisation aux moindres carrés, et cela à pour plusieurs échelles. Cette description est ensuite derivée analytiquement pour extraire de manière continue les structures les plus pertinentes à la fois en espace et en échelle. Nous montrons par plusieurs exemples et comparaisons que cette représentation et les outils associés définissent une solution efficace pour l’analyse des nuages de points à plusieurs échelles. Un défi intéressant est l’analyse d’objets 3D acquis dans le cadre de l’étude du patrimoine culturel. Dans cette thèse, nous nous étudions les données générées par l’acquisition des fragments des statues entourant par le passé le Phare d’Alexandrie, Septième Merveille du Monde. Plus précisément, nous nous intéressons au réassemblage d’objets fracturés en peu de fragments (une dizaine), mais avec de nombreuses parties manquantes ou fortement dégradées par l’action du temps. Nous proposons un formalisme pour la conception de systèmes d’assemblage virtuel semi-automatiques, permettant de combiner à la fois les connaissances des archéologues et la précision des algorithmes d’assemblage. Nous présentons deux systèmes basés sur cette conception, et nous montrons leur efficacité dans des cas concrets
Over the last decades, the evolution of acquisition techniques yields the generalization of detailed 3D objects, represented as huge point sets composed of millions of vertices. The complexity of the involved data often requires to analyze them for the extraction and characterization of pertinent structures, which are potentially defined at multiple scales. Amongthe wide variety of methods proposed to analyze digital signals, the scale-space analysis istoday a standard for the study of 2D curves and images. However, its adaptation to 3D dataleads to instabilities and requires connectivity information, which is not directly availablewhen dealing with point sets.In this thesis, we present a new multi-scale analysis framework that we call the GrowingLeast Squares (GLS). It consists of a robust local geometric descriptor that can be evaluatedon point sets at multiple scales using an efficient second-order fitting procedure. We proposeto analytically differentiate this descriptor to extract continuously the pertinent structuresin scale-space. We show that this representation and the associated toolbox define an effi-cient way to analyze 3D objects represented as point sets at multiple scales. To this end, we demonstrate its relevance in various application scenarios.A challenging application is the analysis of acquired 3D objects coming from the CulturalHeritage field. In this thesis, we study a real-world dataset composed of the fragments ofthe statues that were surrounding the legendary Alexandria Lighthouse. In particular, wefocus on the problem of fractured object reassembly, consisting of few fragments (up to aboutten), but with missing parts due to erosion or deterioration. We propose a semi-automaticformalism to combine both the archaeologist’s knowledge and the accuracy of geometricmatching algorithms during the reassembly process. We use it to design two systems, andwe show their efficiency in concrete cases
APA, Harvard, Vancouver, ISO, and other styles
6

RAVEENDIRAN, JAYANTHAN. "FAST ESTIMATION OF DENSE DISPARITY MAP USING PIVOT POINTS." OpenSIUC, 2013. https://opensiuc.lib.siu.edu/theses/1208.

Full text
Abstract:
In this thesis, a novel and fast method to compute the dense disparity map of a stereo pair of images is presented. Most of the current stereo matching algorithms are ill suited for real-time matching owing to their time complexity. Methods that concentrate on providing a real-time performance, sacrifice much in accuracy. The presented method, Fast Estimation of Dense Disparity Map Using Pivot Points (FEDDUP), uses a hierarchical approach towards reduction of search space to find the correspondences. The hierarchy starts with a set of points and then it moves on to a mesh with which the edge pixels are matched. This results in a semi-global disparity map. The semi global disparity map is then used as a soft constraint to find the correspondences of the remaining points. This process delivers good real-time performance with promising accuracy.
APA, Harvard, Vancouver, ISO, and other styles
7

Wang, Jue. "Modeling and Matching of Landmarks for Automation of Mars Rover Localization." The Ohio State University, 2008. http://rave.ohiolink.edu/etdc/view?acc_num=osu1213192082.

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

Palomares, Jean-Louis. "Une nouvelle méthode d’appariement de points d’intérêt pour la mise en correspondance d’images." Thesis, Montpellier 2, 2012. http://www.theses.fr/2012MON20075/document.

Full text
Abstract:
Ce mémoire de thèse traite de la mise en correspondance d'images pour des applications de vision stéréoscopique ou de stabilisation d'images de caméras vidéo. les méthodes de mise en correspondance reposent généralement sur l'utilisation de points d'intérêts dans les images, c'est-à-dire de points qui présentent de fortes discontinuités d'intensité lumineuse. Nous présentons tout d'abord un nouveau descripteur de points d'intérêt, obtenu au moyen d'un filtre anisotropique rotatif qui délivre en chaque point d'intérêt une signature mono-dimensionnelle basée sur un gradient d'intensité. Invariant à la rotationpar construction, ce descripteur possède de trés bonnes propriétés de robustesse et de discrimination. Nous proposons ensuite une nouvelle méthode d'appariement invariante aux transformations euclidiennes et affines. Cette méthode exploite la corrélation des signatures sous l'hypothèse de faibles déformations, et définit une mesure de distance nécessaire à l'appariement de points. Les résultats obtenus sur des images difficiles laissent envisager des prolongements prometteurs de cette méthode
This thesis adresses the issue of image matching for stereoscopic vison applications and image stabilization of video cameras. Methods of mapping are generally based on the use of interest points in the images, i.e. of points which have strong discontinuities in light intensity. We first present a new descriptor of points of interest, obtained by means of an anisotropic rotary filter which delivers at each point of interest a one-dimensional signature based on an intensity gradient. Invariant to rotation by construction, thisdescriptor has very good properties of robustness and discrimination. We then propose a new matching method invariant to Euclidean and affine transformations. This method exploits the correlation of the signatures subject to moderate warping, and defines a distance measure, necesssary for the matching of points. the results obtained on difficult images augur promising extentions to this method
APA, Harvard, Vancouver, ISO, and other styles
9

Stefanik, Kevin Vincent. "Sequential Motion Estimation and Refinement for Applications of Real-time Reconstruction from Stereo Vision." Thesis, Virginia Tech, 2011. http://hdl.handle.net/10919/76802.

Full text
Abstract:
This paper presents a new approach to the feature-matching problem for 3D reconstruction by taking advantage of GPS and IMU data, along with a prior calibrated stereo camera system. It is expected that pose estimates and calibration can be used to increase feature matching speed and accuracy. Given pose estimates of cameras and extracted features from images, the algorithm first enumerates feature matches based on stereo projection constraints in 2D and then backprojects them to 3D. Then, a grid search algorithm over potential camera poses is proposed to match the 3D features and find the largest group of 3D feature matches between pairs of stereo frames. This approach will provide pose accuracy to within the space that each grid region covers. Further refinement of relative camera poses is performed with an iteratively re-weighted least squares (IRLS) method in order to reject outliers in the 3D matches. The algorithm is shown to be capable of running in real-time correctly, where the majority of processing time is taken by feature extraction and description. The method is shown to outperform standard open source software for reconstruction from imagery.
Master of Science
APA, Harvard, Vancouver, ISO, and other styles
10

Yang, Liming. "Recalage robuste à base de motifs de points pseudo aléatoires pour la réalité augmentée." Thesis, Ecole centrale de Nantes, 2016. http://www.theses.fr/2016ECDN0025.

Full text
Abstract:
La Réalité Augmentée (RA) vise à afficher des informations numériques virtuelles sur des images réelles. Le recalage est important, puisqu’il permet d'aligner correctement les objets virtuels dans le monde réel. Contrairement au tracking qui recale en utilisant les informations de l’image précédente, la localisation à grande échelle (wide baseline localization) calcule la solution en utilisant uniquement les informations présentes dans l’image courante. Il permet ainsi de trouver des solutions initiales au problème de recalage (initialisation) et, n’est pas sujet aux problèmes de « perte de tracking ». Le problème du recalage en RA est relativement bien étudié dans la littérature, mais les méthodes existantes fonctionnent principalement lorsque la scène augmentée présente des textures. Pourtant, pour le recalage avec les objets peu ou pas texturés, il est possible d’utiliser leurs informations géométriques qui représentent des caractéristiques plus stables que les textures. Cette thèse s’attache au problème de recalage basé sur des informations géométriques, et plus précisément sur les points. Nous proposons deux nouvelles méthodes de recalage de points (RRDM et LGC) robustes et rapides. LGC est une amélioration de la méthode RRDM et peut mettre en correspondance des ensembles de motifs de points 2D ou 3D subissant une transformation dont le type est connu. LGC présente un comportement linéaire en fonction du nombre de points, ce qui permet un tracking en temps-réel. La pertinence de LGC a été illustrée en développant une application de calibration de système projecteur-caméra dont les résultats sont comparables avec l’état de l’art tout en présentant des avantages pour l’utilisateur en termes de taille de mire de calibration
Registration is a very important task in Augmented Reality (AR). It provides the spatial alignment between the real environment and virtual objects. Unlike tracking (which relies on previous frame information), wide baseline localization finds the correct solution from a wide search space, so as to overcome the initialization or tracking failure problems. Nowadays, various wide baseline localization methods have been applied successfully. But for objects with no or little texture, there is still no promising method. One possible solution is to rely on the geometric information, which sometimes does not vary as much as texture or color. This dissertation focuses on new wide baseline localization methods entirely based on geometric information, and more specifically on points. I propose two novel point pattern matching algorithms, RRDM and LGC. Especially, LGC registers 2D or 3D point patterns under any known transformation type and supports multipattern recognitions. It has a linear behavior with respect to the number of points, which allows for real-time tracking. It is applied to multi targets tracking and augmentation, as well as to 3D model registration. A practical method for projector-camera system calibration based on LGC is also proposed. It can be useful for large scale Spatial Augmented Reality (SAR). Besides, I also developed a method to estimate the rotation axis of surface of revolution quickly and precisely on 3D data. It is integrated in a novel framework to reconstruct the surface of revolution on dense SLAM in real-time
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Matching points"

1

Speziale, Charles G. On the freestream matching condition for stagnation point turbulent flows. Hampton, Va: ICASE, 1989.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Stuart, Casey-Maslen, Clapham Andrew, Giacca Gilles, and Parker Sarah. Art.18 Secretariat. Oxford University Press, 2016. http://dx.doi.org/10.1093/law/9780198723523.003.0022.

Full text
Abstract:
This chapter examines Article 18 of the ATT, which establishes a Secretariat for the treaty. The Secretariat’s role includes maintaining and making available to states parties the list of national points of contact in accordance with Article 5; facilitating the matching of offers of and requests for assistance for treaty implementation; and promoting international co-operation ‘as requested’ in accordance with Articles 15 and 16 on international co-operation and international assistance, respectively. The Secretariat is also in charge of facilitating the work of the Conference of States Parties, including making arrangements and providing the necessary services for meetings under this treaty as set out in Article 17.
APA, Harvard, Vancouver, ISO, and other styles
3

Mercati, Flavio. Barbour–Bertotti Best Matching. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780198789475.003.0004.

Full text
Abstract:
Barbour and Bertotti’s Mach–Poincaré Principle can be realized in classical mechanics with a mathematical procedure which was beyond the grasp of Leibniz or Newton, and turns out to be equivalent to modern gauge theory. This is the formulation of a variational principle based on ‘best matching’: one transforms subsequent configurations of the system with the Euclidean group, and by minimizing a certain functional a notion of ‘equilocality’ is established: now it makes sense to say that a particle comes back to the same point at different times.
APA, Harvard, Vancouver, ISO, and other styles
4

Mercati, Flavio. Best Matching: Technical Details. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780198789475.003.0005.

Full text
Abstract:
The best matching procedure described in Chapter 4 is equivalent to the introduction of a principal fibre bundle in configuration space. Essentially one introduces a one-dimensional gauge connection on the time axis, which is a representation of the Euclidean group of rotations and translations (or, possibly, the similarity group which includes dilatations). To accommodate temporal relationalism, the variational principle needs to be invariant under reparametrizations. The simplest way to realize this in point–particle mechanics is to use Jacobi’s reformulation of Mapertuis’ principle. The chapter concludes with the relational reformulation of the Newtonian N-body problem (and its scale-invariant variant).
APA, Harvard, Vancouver, ISO, and other styles
5

Institute for Computer Applications in Science and Engineering., ed. On the freestream matching condition for stagnation point turbulent flows. Hampton, VA: Institute for Computer Applications in Science and Engineering, NASA Langley Research Center, 1989.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

International Commission on Illumination. Technical Committee 1-02 Luminous Efficiency Functions., ed. Spectral luminous efficiency functions based upon brightness matching for monochromatic point sources 2° and 10° fields. Vienna: Central Bureau of the CIE, 1988.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Goldberg, Abbie E. Open Adoption and Diverse Families. Oxford University Press, 2019. http://dx.doi.org/10.1093/oso/9780190692032.001.0001.

Full text
Abstract:
This book traces the experiences of diverse adoptive families—including lesbian, gay, and heterosexual parent families, and families who adopted through foster care and private adoption—as they manage birth family relationships across their children’s childhood. It explores the diversity among families in how open adoption is envisioned, enacted, and experienced over time. The author uses interview data from four time points spanning preadoption to 8 years postadoption to address a variety of questions, including: How do adoptive parents feel about openness when they first learn about it, and why do their feelings change over time? How do adoptive parents’ initial feelings about birth parents inform the types of relationships that they form with birth family? How do adoptive parents who strongly valued openness cope with and handle the disappointment of matching with birth parents who do not desire and/or are unable to enact a similar level of openness? What types of complex, unexpected, and nuanced trajectories of contact unfold over time between adoptive families and birth families? What types of boundary challenges occur between adoptive and birth family members, offline and online? How do adoptive parents talk about adoption with their children, and how does this vary depending on level and type of contact? How and to what extent do adoptive parents invoke environment versus genetics (i.e., birth family) in articulating children’s strengths, challenges, and physical features (e.g., height, skin color)? How do the experiences of adoptive parents differ by parent gender and sexual orientation?
APA, Harvard, Vancouver, ISO, and other styles
8

Wright, A. G. The Photomultiplier Handbook. Oxford University Press, 2017. http://dx.doi.org/10.1093/oso/9780199565092.001.0001.

Full text
Abstract:
This handbook is aimed at helping users of PMTs who are faced with the challenge of designing sensitive light detectors for scientific and industrial purposes. The raison d’être for photomultipliers (PMTs) stems from four intrinsic attributes: large detection area, high, and noiseless gain, and wide bandwidth. Detection involves a conversion process from photons to photoelectrons at the photocathode. Photoelectrons are subsequently collected and increased in number by the action of an incorporated electron multiplier. Photon detection, charge multiplication, and many PMT applications are statistical in nature. For this reason appropriate statistical treatments are provided and derived from first principles. PMTs are characterized by a range of photocathodes offering detection over UV to infra-red wavelengths, the sensitivities of which can be calibrated by National Laboratories. The optical interface between light sources and PMTs, particularly for diffuse or uncollimated light, is sparsely covered in the scientific literature. The theory of light guides, Winston cones, and other light concentrators points to means for optimizing light collection subject to the constraints of Liouville’s theorem (étandue). Certain PMTs can detect single photons but are restricted by the limitations of unwanted background ranging in magnitude from a fraction of a photoelectron equivalent to hundreds of photoelectrons. These sources, together with their correlated nature, are examined in detail. Photomultiplier biasing requires a voltage divider comprising a series of resistors or active components, such as FETs. Correct biasing provides the key to linear operation and so considerable attention is given to the treatment of this topic. Electronic circuits and modules that perform the functions of charge to voltage conversion, pulse shaping, and impedance matching are analysed in detail.
APA, Harvard, Vancouver, ISO, and other styles
9

Pietroski, Paul M. Massively monadic, potentially plural. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780198812722.003.0007.

Full text
Abstract:
This chapter offers evidence for the following hypothesis: the concepts fetched via lexical meanings are predicative (monadic) or minimally relational (dyadic), even though we often lexicalize concepts of other types. Denoting concepts are used to introduce predicative analogs, while “supradyadic” concepts are used to introduce predicative and/or dyadic analogs. Given a Fregean language, lexicalization could be a more transparent process in which concepts are simply labeled with words of matching types. In this sense, lexicalization effaces certain conceptual distinctions; and it is argued that mass/count/plural distinctions provide another illustration of this point. In this context, there is discussion of Boolos’s plural interpretation of second-order quantification, which also plays a role in chapter seven.
APA, Harvard, Vancouver, ISO, and other styles
10

Mercati, Flavio. A derivation of Shape Dynamics. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780198789475.003.0009.

Full text
Abstract:
By applying the principles of relational field theory to the gravitational field, and using 3D diffeomorphism invariance as our symmetry principle for best matching, it is feasible to reduce the working possibilities to just a few cases. One is a field-theory version of (GR), which is the limit of General Relativity in which the speed of light goes to infinity and the light cones open up to provide a notion of absolute simultaneity. Another is the opposite limit, dubbed ‘Carrollian Relativity’ by Levy–Leblond, in which the speed of light goes to zero and each point is causally isolated from the other. This limit is related to the so-called ‘BKL’ behaviour that appears to be universal near singularities. The penultimate possibility is (GR), while the last one is SD, which emerges as the unique generalization of the theory that allows for an arbitrary value of the one free coefficient in the supermetric.
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Matching points"

1

Aloupis, Greg, Jean Cardinal, Sébastien Collette, Erik D. Demaine, Martin L. Demaine, Muriel Dulieu, Ruy Fabila-Monroy, et al. "Matching Points with Things." In LATIN 2010: Theoretical Informatics, 456–67. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-12200-2_40.

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

Platel, B., E. Balmachnova, L. M. J. Florack, and B. M. ter Haar Romeny. "Top-Points as Interest Points for Image Matching." In Computer Vision – ECCV 2006, 418–29. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11744023_33.

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

Platel, B., E. Balmachnova, L. M. J. Florack, F. M. W. Kanters, and B. M. ter Haar Romeny. "Using Top-Points as Interest Points for Image Matching." In Lecture Notes in Computer Science, 211–22. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11577812_19.

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

Bereg, Sergey, Nikolaus Mutsanas, and Alexander Wolff. "Matching Points with Rectangles and Squares." In SOFSEM 2006: Theory and Practice of Computer Science, 177–86. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11611257_15.

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

Ábrego, Bernardo M., Esther M. Arkin, Silvia Fernández-Merchant, Ferran Hurtado, Mikio Kano, Joseph S. B. Mitchell, and Jorge Urrutia. "Matching Points with Circles and Squares." In Discrete and Computational Geometry, 1–15. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11589440_1.

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

Lucas, Laurent, Céline Loscos, and Yannick Remion. "Feature Points Detection and Image Matching." In 3D Video, 113–35. Hoboken, USA: John Wiley & Sons, Inc., 2013. http://dx.doi.org/10.1002/9781118761915.ch6.

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

Corujo, Josué, David Flores-Peñaloza, Clemens Huemer, Pablo Pérez-Lantero, and Carlos Seara. "Matching Random Colored Points with Rectangles." In WALCOM: Algorithms and Computation, 261–72. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-39881-1_22.

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

Wang, Guilian, Joseph Goguen, Young-Kwang Nam, and Kai Lin. "Critical Points for Interactive Schema Matching." In Advanced Web Technologies and Applications, 654–64. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-24655-8_71.

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

Li, Xiangru, Tan Yang, Yu Lu, and Zhiheng Wang. "A Novel Iterative SIFT Points Matching Method." In Advances in Intelligent Systems and Computing, 623–33. Berlin, Heidelberg: Springer Berlin Heidelberg, 2014. http://dx.doi.org/10.1007/978-3-642-54924-3_59.

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

Lakshmi, S., and V. Sankaranarayanan. "Robust Key Points Matching by Ordinal Measure." In Communications in Computer and Information Science, 346–55. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-27183-0_37.

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

Conference papers on the topic "Matching points"

1

Yan, Yuanhui, Haiying Xia, Siqi Huang, and Wenjing Xiao. "An improved matching algorithm for feature points matching." In 2014 IEEE International Conference on Signal Processing, Communications and Computing (ICSPCC). IEEE, 2014. http://dx.doi.org/10.1109/icspcc.2014.6986201.

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

Barenbaum, Pablo, Eduardo Bonelli, and Kareem Mohamed. "Pattern Matching and Fixed Points." In PPDP '18: The 20th International Symposium on Principles and Practice of Declarative Programming. New York, NY, USA: ACM, 2018. http://dx.doi.org/10.1145/3236950.3236972.

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

Li, Yuhua, and Jianqiang Sheng. "Feature-Points Based Shape Matching." In 2012 4th International Conference on Digital Home (ICDH). IEEE, 2012. http://dx.doi.org/10.1109/icdh.2012.61.

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

Jun, Sang. "Point pattern relaxation matching with known number of spurious points." In Third International Symposium on Multispectral Image Processing and Pattern Recognition, edited by Hanqing Lu and Tianxu Zhang. SPIE, 2003. http://dx.doi.org/10.1117/12.538940.

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

Boluk, S. Arda, and M. Fatih Demirci. "Skeleton critical points for shape matching." In 2016 24th Signal Processing and Communication Application Conference (SIU). IEEE, 2016. http://dx.doi.org/10.1109/siu.2016.7495706.

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

Islam, S., and Zhu Lin. "Matching interest points of an object." In 2005 International Conference on Image Processing. IEEE, 2005. http://dx.doi.org/10.1109/icip.2005.1529765.

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

Medvedev, Mikhail, and Mikhail Shleymovich. "Image Key Points Detection and Matching." In Spring/Summer Young Researchers' Colloquium on Software Engineering. Institute for System Programming of the Russian Academy of Sciences, 2013. http://dx.doi.org/10.15514/syrcose-2013-7-26.

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

Marques, Manuel, and Joao Costeira. "Lamp: Linear approach for matching points." In 2009 16th IEEE International Conference on Image Processing (ICIP 2009). IEEE, 2009. http://dx.doi.org/10.1109/icip.2009.5414238.

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

Qin, Yanyan, Hongke Xu, and Huiru Chen. "Image feature points matching via improved ORB." In 2014 International Conference on Progress in Informatics and Computing (PIC). IEEE, 2014. http://dx.doi.org/10.1109/pic.2014.6972325.

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

Wu, Hua, Zhan Song, Jian Yao, Liang Li, and Yu Gu. "Stereo matching based on support points propagation." In 2012 IEEE International Conference on Information Science and Technology (ICIST). IEEE, 2012. http://dx.doi.org/10.1109/icist.2012.6221743.

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

Reports on the topic "Matching points"

1

Stanton, Kevin. Matching Points to Lines: Sonar-based Localization for the PSUBOT. Portland State University Library, January 2000. http://dx.doi.org/10.15760/etd.6514.

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

Funch, Michael, and Anna Lundgren. Matching the missing links – Skills development in Nordic regions. Nordregio, December 2020. http://dx.doi.org/10.6027/pb2020:8.2001-3876.

Full text
Abstract:
This policy brief - based on the Nordregio report Skills Policies – Building capacities for innovative and resilient Nordic regions - focuses on how Nordic regions engage with skills development and skills matching as factors in regional development. It looks at the many points of linkage between the different actors involved, including the educational and business sectors, as well as the local and regional authorities.
APA, Harvard, Vancouver, ISO, and other styles
3

Dow, Stephen J. EPBST Workstation Improvement: Automated Point Matching. Fort Belvoir, VA: Defense Technical Information Center, November 2001. http://dx.doi.org/10.21236/ada397028.

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

Hopcroft, John E., and Daniel P. Huttenlocher. On Planar Point Matching under Affine Transformation. Fort Belvoir, VA: Defense Technical Information Center, April 1989. http://dx.doi.org/10.21236/ada210106.

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

Zheng, Yefeng, and David Doermann. Robust Point Matching for Non-Rigid Shapes: A Relaxation Labeling Based Approach. Fort Belvoir, VA: Defense Technical Information Center, December 2004. http://dx.doi.org/10.21236/ada453579.

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

McPhedran, R., K. Patel, B. Toombs, P. Menon, M. Patel, J. Disson, K. Porter, A. John, and A. Rayner. Food allergen communication in businesses feasibility trial. Food Standards Agency, March 2021. http://dx.doi.org/10.46756/sci.fsa.tpf160.

Full text
Abstract:
Background: Clear allergen communication in food business operators (FBOs) has been shown to have a positive impact on customers’ perceptions of businesses (Barnett et al., 2013). However, the precise size and nature of this effect is not known: there is a paucity of quantitative evidence in this area, particularly in the form of randomised controlled trials (RCTs). The Food Standards Agency (FSA), in collaboration with Kantar’s Behavioural Practice, conducted a feasibility trial to investigate whether a randomised cluster trial – involving the proactive communication of allergen information at the point of sale in FBOs – is feasible in the United Kingdom (UK). Objectives: The trial sought to establish: ease of recruitments of businesses into trials; customer response rates for in-store outcome surveys; fidelity of intervention delivery by FBO staff; sensitivity of outcome survey measures to change; and appropriateness of the chosen analytical approach. Method: Following a recruitment phase – in which one of fourteen multinational FBOs was successfully recruited – the execution of the feasibility trial involved a quasi-randomised matched-pairs clustered experiment. Each of the FBO’s ten participating branches underwent pair-wise matching, with similarity of branches judged according to four criteria: Food Hygiene Rating Scheme (FHRS) score, average weekly footfall, number of staff and customer satisfaction rating. The allocation ratio for this trial was 1:1: one branch in each pair was assigned to the treatment group by a representative from the FBO, while the other continued to operate in accordance with their standard operating procedure. As a business-based feasibility trial, customers at participating branches throughout the fieldwork period were automatically enrolled in the trial. The trial was single-blind: customers at treatment branches were not aware that they were receiving an intervention. All customers who visited participating branches throughout the fieldwork period were asked to complete a short in-store survey on a tablet affixed in branches. This survey contained four outcome measures which operationalised customers’: perceptions of food safety in the FBO; trust in the FBO; self-reported confidence to ask for allergen information in future visits; and overall satisfaction with their visit. Results: Fieldwork was conducted from the 3 – 20 March 2020, with cessation occurring prematurely due to the closure of outlets following the proliferation of COVID-19. n=177 participants took part in the trial across the ten branches; however, response rates (which ranged between 0.1 - 0.8%) were likely also adversely affected by COVID-19. Intervention fidelity was an issue in this study: while compliance with delivery of the intervention was relatively high in treatment branches (78.9%), erroneous delivery in control branches was also common (46.2%). Survey data were analysed using random-intercept multilevel linear regression models (due to the nesting of customers within branches). Despite the trial’s modest sample size, there was some evidence to suggest that the intervention had a positive effect for those suffering from allergies/intolerances for the ‘trust’ (β = 1.288, p<0.01) and ‘satisfaction’ (β = 0.945, p<0.01) outcome variables. Due to singularity within the fitted linear models, hierarchical Bayes models were used to corroborate the size of these interactions. Conclusions: The results of this trial suggest that a fully powered clustered RCT would likely be feasible in the UK. In this case, the primary challenge in the execution of the trial was the recruitment of FBOs: despite high levels of initial interest from four chains, only one took part. However, it is likely that the proliferation of COVID-19 adversely impacted chain participation – two other FBOs withdrew during branch eligibility assessment and selection, citing COVID-19 as a barrier. COVID-19 also likely lowered the on-site survey response rate: a significant negative Pearson correlation was observed between daily survey completions and COVID-19 cases in the UK, highlighting a likely relationship between the two. Limitations: The trial was quasi-random: selection of branches, pair matching and allocation to treatment/control groups were not systematically conducted. These processes were undertaken by a representative from the FBO’s Safety and Quality Assurance team (with oversight from Kantar representatives on pair matching), as a result of the chain’s internal operational restrictions.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Matching points' for particular source types:
Journal articles Dissertations / Theses
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