Se connecter

Bibliographies thématiques / Keypoint-based

Sommaire

Articles de revues
Thèses
Chapitres de livres
Actes de conférences

Littérature scientifique sur le sujet « Keypoint-based »

Auteur : Grafiati

Publié le 9 mars 2023

Mis à jour le 10 mars 2023

Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres

Choisissez une source :

Consultez les listes thématiques d’articles de revues, de livres, de thèses, de rapports de conférences et d’autres sources académiques sur le sujet « Keypoint-based ».

À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.

Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.

Articles de revues sur le sujet "Keypoint-based"

1

Guan, Genliang, Zhiyong Wang, Shiyang Lu, Jeremiah Da Deng et David Dagan Feng. « Keypoint-Based Keyframe Selection ». IEEE Transactions on Circuits and Systems for Video Technology 23, n^o 4 (avril 2013) : 729–34. http://dx.doi.org/10.1109/tcsvt.2012.2214871.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

2

Tavakol, Ali, et Mohammad Soltanian. « Fast Feature-Based Template Matching, Based on Efficient Keypoint Extraction ». Advanced Materials Research 341-342 (septembre 2011) : 798–802. http://dx.doi.org/10.4028/www.scientific.net/amr.341-342.798.

Texte intégral

Résumé :

In order to improve the performance of feature-based template matching techniques, several research papers have been published. Real-time applications require the computational complexity of keypoint matching algorithms to be as low as possible. In this paper, we propose a method to improve the keypoint detection stage of feature-based template matching algorithms. Our experiment results show that the proposed method outperforms keypoint matching techniques in terms of speed, keypoint stability and repeatability.

Styles APA, Harvard, Vancouver, ISO, etc.

3

Gu, Mingfei, Yinghua Wang, Hongwei Liu et Penghui Wang. « PolSAR Ship Detection Based on a SIFT-like PolSAR Keypoint Detector ». Remote Sensing 14, n^o 12 (17 juin 2022) : 2900. http://dx.doi.org/10.3390/rs14122900.

Texte intégral

Résumé :

The detection of ships on the open sea is an important issue for both military and civilian fields. As an active microwave imaging sensor, synthetic aperture radar (SAR) is a useful device in marine supervision. To extract small and weak ships precisely in the marine areas, polarimetric synthetic aperture radar (PolSAR) data have been used more and more widely. We propose a new PolSAR ship detection method which is based on a keypoint detector, referred to as a PolSAR-SIFT keypoint detector, and a patch variation indicator in this paper. The PolSAR-SIFT keypoint detector proposed in this paper is inspired by the SAR-SIFT keypoint detector. We improve the gradient definition in the SAR-SIFT keypoint detector to adapt to the properties of PolSAR data by defining a new gradient based on the distance measurement of polarimetric covariance matrices. We present the application of PolSAR-SIFT keypoint detector to the detection of ship targets in PolSAR data by combining the PolSAR-SIFT keypoint detector with the patch variation indicator we proposed before. The keypoints extracted by the PolSAR-SIFT keypoint detector are usually located in regions with corner structures, which are likely to be ship regions. Then, the patch variation indicator is used to characterize the context information of the extracted keypoints, and the keypoints located on the sea area are filtered out by setting a constant false alarm rate threshold for the patch variation indicator. Finally, a patch centered on each filtered keypoint is selected. Then, the detection statistics in the patch are calculated. The detection statistics are binarized according to the local threshold set by the detection statistic value of the keypoint to complete the ship detection. Experiments on three data sets obtained from the RADARSAT-2 and AIRSAR quad-polarization data demonstrate that the proposed detector is effective for ship detection.

Styles APA, Harvard, Vancouver, ISO, etc.

4

Boonsivanon, Krittachai, et Worawat Sa-Ngiamvibool. « A SIFT Description Approach for Non-Uniform Illumination and Other Invariants ». Ingénierie des systèmes d information 26, n^o 6 (27 décembre 2021) : 533–39. http://dx.doi.org/10.18280/isi.260603.

Texte intégral

Résumé :

The new improvement keypoint description technique of image-based recognition for rotation, viewpoint and non-uniform illumination situations is presented. The technique is relatively simple based on two procedures, i.e., the keypoint detection and the keypoint description procedure. The keypoint detection procedure is based on the SIFT approach, Top-Hat filtering, morphological operations and average filtering approach. Where this keypoint detection procedure can segment the targets from uneven illumination particle images. While the keypoint description procedures are described and implemented using the Hu moment invariants. Where the central moments are being unchanged under image translations. The sensitivity, accuracy and precision rate of data sets were evaluated and compared. The data set are provided by color image database with variants uniform and non-uniform illumination, viewpoint and rotation changes. The evaluative results show that the approach is superior to the other SIFTs in terms of uniform illumination, non-uniform illumination and other situations. Additionally, the paper demonstrates the high sensitivity of 100%, high accuracy of 83.33% and high precision rate of 80.00%. Comparisons to other SIFT approaches are also included.

Styles APA, Harvard, Vancouver, ISO, etc.

5

Wu, Zhonghua, Guosheng Lin et Jianfei Cai. « Keypoint based weakly supervised human parsing ». Image and Vision Computing 91 (novembre 2019) : 103801. http://dx.doi.org/10.1016/j.imavis.2019.08.005.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

6

Ding, Xintao, Qingde Li, Yongqiang Cheng, Jinbao Wang, Weixin Bian et Biao Jie. « Local keypoint-based Faster R-CNN ». Applied Intelligence 50, n^o 10 (28 avril 2020) : 3007–22. http://dx.doi.org/10.1007/s10489-020-01665-9.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

7

Cevahir, Ali, et Junji Torii. « High Performance Online Image Search with GPUs on Large Image Databases ». International Journal of Multimedia Data Engineering and Management 4, n^o 3 (juillet 2013) : 24–41. http://dx.doi.org/10.4018/jmdem.2013070102.

Texte intégral

Résumé :

The authors propose an online image search engine based on local image keypoint matching with GPU support. State-of-the-art models are based on bag-of-visual-words, which is an analogy of textual search for visual search. In this work, thanks to the vector computation power of the GPU, the authors utilize real values of keypoint descriptors and realize real-time search at keypoint level. By keeping the identities of each keypoint, closest keypoints are accurately retrieved. Image search has different characteristics than textual search. The authors implement one-to-one keypoint matching, which is more natural for images. The authors utilize GPUs for every basic step. To demonstrate practicality of GPU-extended image search, the authors also present a simple bag-of-visual-words search technique with full-text search engines. The authors explain how to implement one-to-one keypoint matching with text search engine. Proposed methods lead to drastic performance and precision improvement, which is demonstrated on datasets of different sizes.

Styles APA, Harvard, Vancouver, ISO, etc.

8

Feng, Lu, Quan Fu, Xiang Long et Zhuang Zhi Wu. « Keypoint Recognition for 3D Head Model Using Geometry Image ». Applied Mechanics and Materials 654 (octobre 2014) : 287–90. http://dx.doi.org/10.4028/www.scientific.net/amm.654.287.

Texte intégral

Résumé :

This paper presents a novel and efficient 3D head model keypoint recognition framework based on the geometry image. Based on conformal mapping and diffusion scale space, our method can utilize the SIFT method to extract and describe the keypoint of 3D head model. We use this framework to identify the keypoint of the human head. The experiments shows the robust and efficiency of our method.

Styles APA, Harvard, Vancouver, ISO, etc.

9

Paek, Kangho, Min Yao, Zhongwei Liu et Hun Kim. « Log-Spiral Keypoint : A Robust Approach toward Image Patch Matching ». Computational Intelligence and Neuroscience 2015 (2015) : 1–12. http://dx.doi.org/10.1155/2015/457495.

Texte intégral

Résumé :

Matching of keypoints across image patches forms the basis of computer vision applications, such as object detection, recognition, and tracking in real-world images. Most of keypoint methods are mainly used to match the high-resolution images, which always utilize an image pyramid for multiscale keypoint detection. In this paper, we propose a novel keypoint method to improve the matching performance of image patches with the low-resolution and small size. The location, scale, and orientation of keypoints are directly estimated from an original image patch using a Log-Spiral sampling pattern for keypoint detection without consideration of image pyramid. A Log-Spiral sampling pattern for keypoint description and two bit-generated functions are designed for generating a binary descriptor. Extensive experiments show that the proposed method is more effective and robust than existing binary-based methods for image patch matching.

Styles APA, Harvard, Vancouver, ISO, etc.

10

Morgacheva, A. I., V. A. Kulikov et V. P. Kosykh. « DYNAMIC KEYPOINT-BASED ALGORITHM OF OBJECT TRACKING ». ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences XLII-2/W4 (10 mai 2017) : 79–82. http://dx.doi.org/10.5194/isprs-archives-xlii-2-w4-79-2017.

Texte intégral

Résumé :

The model of the observed object plays the key role in the task of object tracking. Models as a set of image parts, in particular, keypoints, is more resistant to the changes in shape, texture, angle of view, because local changes apply only to specific parts of the object. On the other hand, any model requires updating as the appearance of the object changes with respect to the camera. In this paper, we propose a dynamic (time-varying) model, based on a set of keypoints. To update the data this model uses the algorithm of rating keypoints and the decision rule, based on a Function of Rival Similarity (FRiS). As a result, at the test set of image sequences the improvement was achieved on average by 9.3% compared to the original algorithm. On some sequences, the improvement was 16% compared to the original algorithm.

Styles APA, Harvard, Vancouver, ISO, etc.

Plus de sources

Thèses sur le sujet "Keypoint-based"

1

Dragon, Ralf [Verfasser]. « Keypoint-Based Object Segmentation / Ralf Dragon ». Aachen : Shaker, 2013. http://d-nb.info/1051573521/34.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

2

Zhao, Mingchang. « Keypoint-Based Binocular Distance Measurement for Pedestrian Detection System on Vehicle ». Thesis, Université d'Ottawa / University of Ottawa, 2014. http://hdl.handle.net/10393/31693.

Texte intégral

Résumé :

The Pedestrian Detection System (PDS) has become a significant area of research designed to protect pedestrians. Despite the huge number of research work, the most current PDSs are designed to detect pedestrians without knowing their distances from cars. In fact, a priori knowledge of the distance between a car and pedestrian allows this system to make the appropriate decision in order to avoid collisions. Typical methods of distance measurement require additional equipment (e.g., Radars) which, unfortunately, cannot identify objects. Moreover, traditional stereo-vision methods have poor precision in long-range conditions. In this thesis, we use the keypoint-based feature extraction method to generate the parallax in a binocular vision system in order to measure a detectable object; this is used instead of a disparity map. Our method enhances the tolerance to instability of a moving vehicle; and, it also enables binocular measurement systems to be equipped with a zoom lens and to have greater distance between cameras. In addition, we designed a crossover re-detection and tracking method in order to reinforce the robustness of the system (one camera helps the other reduce detection errors). Our system is able to measure the distance between cars and pedestrians; and, it can also be used efficiently to measure the distance between cars and other objects such as Traffic signs or animals. Through a real word experiment, the system shows a 7.5% margin of error in outdoor and long-range conditions.

Styles APA, Harvard, Vancouver, ISO, etc.

3

Марченко, Ігор Олександрович, Игорь Александрович Марченко, Ihor Oleksandrovych Marchenko, Сергій Олександрович Петров, Сергей Александрович Петров, Serhii Oleksandrovych Petrov et A. A. Pidkuiko. « Usage of keypoint descriptors based algorithms for real-time objects localization ». Thesis, Центральноукраїнський національний технічний університет, 2018. http://essuir.sumdu.edu.ua/handle/123456789/68603.

Texte intégral

Résumé :

In order to achieve high level of security in our everyday life we produce huge amount of data. Significant part of information is presented by videos, sounds or images. A computer is used to extract useful information from raw data [1]. Pattern recognition is branch of computer vision, which allows us to get information from images [2] and videos. Information extraction is crucial problem of pattern recognition. This problem is divided into next branches: object presence; object localization; object classification.

Styles APA, Harvard, Vancouver, ISO, etc.

4

MAZZINI, DAVIDE. « Local Detectors and Descriptors for Object and Scene Recognition ». Doctoral thesis, Università degli Studi di Milano-Bicocca, 2018. http://hdl.handle.net/10281/199003.

Texte intégral

Résumé :

Lo scopo di questa tesi è di studiare due principali categorie di algoritmi per la detection di oggetti e il loro uso in particolari applicazioni. La prima categoria esaminata riguarda approcci basati su Keypoint. Diversi esperimenti comparativi vengono eseguiti all'interno della pipeline standard del modello di test MPEG CDVS e viene proposta una pipeline estesa che fa uso di informazione colore. La seconda categoria di object detectors oggetto di indagine si basa su Reti neurali convoluzionali. In particolare, vengono affrontate due applicazioni di reti neurali convoluzionali per il riconoscimento di oggetti. Il primo riguarda il riconoscimento di loghi commerciali. Due pipeline di classificazione sono progettate e testate su un set di immagini raccolte da Flickr. La prima architettura utilizza una rete pre-addestrata come feature extractor e raggiunge risultati comparabili a quelli di algoritmi basati Keypoint. La seconda architettura si avvale di una rete neurale che supera le performances di metodi stato dell'arte basati su Keypoint. L'altra applicazione esaminata è la categorizzazione di dipinti che consiste nell'associare l'autore, nell'assegnare un dipinto alla scuola o al movimento artistico a cui appartiene, e classificare il genere del dipinto, ad es. paesaggio, ritratto, illustrazione ecc. Per affrontare questo problema, viene proposta una struttura di rete neurale multibranch e multitask che beneficia dell'uso congiunto di approcci basati su keypoint e di features neurali. In entrambe le applicazioni viene anche esaminato l'uso di tecniche di data augmentation per ampliare il training set. In particolare per i dipinti, un algoritmo di trasferimento di stile pittorico basato su reti neurali viene sfruttato per generare quadri sintetici da utilizzare in fase di training.
The aim of this thesis is to study two main categories of algorithms for object detection and their use in particular applications. The first category that is investigated concerns Keypoint-based approaches. Several comparative experiments are performed within the standard testing pipeline of the MPEG CDVS Test Model and an extended pipeline which make use of color information is proposed. The second category of object detectors that is investigated is based on Convolutional Neural Networks. Two applications of Convolutional Neural Networks for object recognition are in particular addressed. The first concerns logo recognition. Two classification pipelines are designed and tested on a real-world dataset of images collected from Flickr. The first architecture makes use of a pre-trained network as feature extractor and it achieves comparable results keypoint based approaches. The second architecture makes use of a tiny end-to-end trained Neural Network that outperformed state-of-the-art keypoint based methods. The other application addressed is Painting Categorization. It consists in associating the author, assigning a painting to the school or art movement it belongs to, and categorizing the genre of the painting, e.g. landscape, portrait, illustration etc. To tackle this problem, a novel multibranch and multitask Neural Network structure is proposed which benefit from joint use of keypoint-based approaches and neural features. In both applications the use of data augmentation techniques to enlarge the training set is also investigated. In particular for paintings, a neural style transfer algorithm is exploited for generating synthetic paintings to be used in training.

Styles APA, Harvard, Vancouver, ISO, etc.

5

Bendale, Pashmina Ziparu. « Development and evaluation of a multiscale keypoint detector based on complex wavelets ». Thesis, University of Cambridge, 2011. https://www.repository.cam.ac.uk/handle/1810/252226.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

6

Kemp, Neal. « Content-Based Image Retrieval for Tattoos : An Analysis and Comparison of Keypoint Detection Algorithms ». Scholarship @ Claremont, 2013. http://scholarship.claremont.edu/cmc_theses/784.

Texte intégral

Résumé :

The field of biometrics has grown significantly in the past decade due to an increase in interest from law enforcement. Law enforcement officials are interested in adding tattoos alongside irises and fingerprints to their toolbox of biometrics. They often use these biometrics to aid in the identification of victims and suspects. Like facial recognition, tattoos have seen a spike in attention over the past few years. Tattoos, however, have not received as much attention by researchers. This lack of attention towards tattoos stems from the difficulty inherent in matching these tattoos. Such difficulties include image quality, affine transformation, warping of tattoos around the body, and in some cases, excessive body hair covering the tattoo. We will utilize context-based image retrieval to find a tattoo in a database which means using one image to query against a database in order to find similar tattoos. We will focus specifically on the keypoint detection process in computer vision. In addition, we are interested in finding not just exact matches but also similar tattoos. We will conclude that the ORB detector pulls the most relevant features and thus is the best chance for yielding an accurate result from content-based image retrieval for tattoos. However, we will also show that even ORB will not work on its own in a content-based image retrieval system. Other processes will have to be involved in order to return accurate matches. We will give recommendations on next-steps to create a better tattoo retrieval system.

Styles APA, Harvard, Vancouver, ISO, etc.

7

Hansen, Peter Ian. « Wide-baseline keypoint detection and matching with wide-angle images for vision based localisation ». Thesis, Queensland University of Technology, 2010. https://eprints.qut.edu.au/37667/1/Peter_Hansen_Thesis.pdf.

Texte intégral

Résumé :

This thesis addresses the problem of detecting and describing the same scene points in different wide-angle images taken by the same camera at different viewpoints. This is a core competency of many vision-based localisation tasks including visual odometry and visual place recognition. Wide-angle cameras have a large field of view that can exceed a full hemisphere, and the images they produce contain severe radial distortion. When compared to traditional narrow field of view perspective cameras, more accurate estimates of camera egomotion can be found using the images obtained with wide-angle cameras. The ability to accurately estimate camera egomotion is a fundamental primitive of visual odometry, and this is one of the reasons for the increased popularity in the use of wide-angle cameras for this task. Their large field of view also enables them to capture images of the same regions in a scene taken at very different viewpoints, and this makes them suited for visual place recognition. However, the ability to estimate the camera egomotion and recognise the same scene in two different images is dependent on the ability to reliably detect and describe the same scene points, or ‘keypoints’, in the images. Most algorithms used for this purpose are designed almost exclusively for perspective images. Applying algorithms designed for perspective images directly to wide-angle images is problematic as no account is made for the image distortion. The primary contribution of this thesis is the development of two novel keypoint detectors, and a method of keypoint description, designed for wide-angle images. Both reformulate the Scale- Invariant Feature Transform (SIFT) as an image processing operation on the sphere. As the image captured by any central projection wide-angle camera can be mapped to the sphere, applying these variants to an image on the sphere enables keypoints to be detected in a manner that is invariant to image distortion. Each of the variants is required to find the scale-space representation of an image on the sphere, and they differ in the approaches they used to do this. Extensive experiments using real and synthetically generated wide-angle images are used to validate the two new keypoint detectors and the method of keypoint description. The best of these two new keypoint detectors is applied to vision based localisation tasks including visual odometry and visual place recognition using outdoor wide-angle image sequences. As part of this work, the effect of keypoint coordinate selection on the accuracy of egomotion estimates using the Direct Linear Transform (DLT) is investigated, and a simple weighting scheme is proposed which attempts to account for the uncertainty of keypoint positions during detection. A word reliability metric is also developed for use within a visual ‘bag of words’ approach to place recognition.

Styles APA, Harvard, Vancouver, ISO, etc.

8

Buck, Robert. « Cluster-Based Salient Object Detection Using K-Means Merging and Keypoint Separation with Rectangular Centers ». DigitalCommons@USU, 2016. https://digitalcommons.usu.edu/etd/4631.

Texte intégral

Résumé :

The explosion of internet traffic, advent of social media sites such as Facebook and Twitter, and increased availability of digital cameras has saturated life with images and videos. Never before has it been so important to sift quickly through large amounts of digital information. Salient Object Detection (SOD) is a computer vision topic that finds methods to locate important objects in pictures. SOD has proven to be helpful in numerous applications such as image forgery detection and traffic sign recognition. In this thesis, I outline a novel SOD technique to automatically isolate important objects from the background in images.

Styles APA, Harvard, Vancouver, ISO, etc.

9

Liu, Wen-Pin, et 劉文彬. « A face recognition system based on keypoint exclusion and dual keypoint detection ». Thesis, 2014. http://ndltd.ncl.edu.tw/handle/02572728630414645978.

Texte intégral

Résumé :

碩士
銘傳大學
電腦與通訊工程學系碩士班
103
This thesis presents a face recognition system based on keypoint exclusion and dual keypoiont detection. There are three major problems with conventional SIFT (Scale Invariant Feature Transform). (1) It uses single type keypoint detector. For images of small size the number of detected keypoints may be too small and this causes difficulties on image matching. (2) Each keypoint of the test image is matched independently against all keypoints of the training images. This is very time consuming. (3) Only similarities between descriptors are compared and this may still causes some false matches. To increase the number of keypoints, SIFT and FAST (Features from accelerated segment test) keypoints are combined for face image matching. Since there is no corresponding descriptor for FAST detector, the LOG (Laplace of Gaussian) function with Automatic Scale Selection is applied on each FAST keypoint to find proper scales and corresponding SIFT descriptors. On the other hand, based on the similarities between locations of features on human faces, three keypoint exclusion methods (relative location, orientation, and scale) are proposed to eliminate impossible keypoints for further descriptor matching. In this way, the number of false matches can be reduced and hence higher recognition rates can be obtained. On the other hand, matching time can also be reduced. The proposed algorithms are evaluated with the ORL and the Yale face databases. Each database pick 10 person, every person get 10 image. Our proposed method shows significantly improvements on recognition rates over conventional methods.

Styles APA, Harvard, Vancouver, ISO, etc.

10

Chen, Yi-An, et 陳翊安. « CREAK : Color-based REtinA Keypoint descriptor ». Thesis, 2016. http://ndltd.ncl.edu.tw/handle/96ke4e.

Texte intégral

Résumé :

碩士
國立交通大學
多媒體工程研究所
104
Feature matching between images is key to many computer vision applications. Effective Feature matching requires effective feature description. Recently, binary descriptors which are used to describe feature points are attracting increasing attention for their low computational complexity and small memory requirement. However, most binary descriptors are based on intensity comparisons of grayscale images and did not consider color information. In this paper, a novel binary descriptor inspired by human retina is proposed, which considers not only gray values of pixels but also color information. Experimental results show that the proposed feature descriptor spends fewer storage spaces while having better precision level than other popular binary descriptors. Besides, the proposed feature descriptor has the fastest matching speed among all the descriptors under comparison, which makes it suitable for real-time applications.

Styles APA, Harvard, Vancouver, ISO, etc.

Plus de sources

Chapitres de livres sur le sujet "Keypoint-based"

1

Her, Paris, Logan Manderle, Philipe A. Dias, Henry Medeiros et Francesca Odone. « Keypoint-Based Gaze Tracking ». Dans Pattern Recognition. ICPR International Workshops and Challenges, 144–55. Cham : Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-68790-8_12.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

2

Zeng, Ming, Jian Liu, Youfu Li, Qinghao Meng, Ting Yang et Zhengbiao Bai. « Keypoint-Based Enhanced Image Quality Assessment ». Dans Communications in Computer and Information Science, 420–27. Berlin, Heidelberg : Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-22456-0_60.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

3

Wang, Shen, Xunzhi Jiang, Xiangzhan Yu et Shuai Sun. « KCFuzz : Directed Fuzzing Based on Keypoint Coverage ». Dans Lecture Notes in Computer Science, 312–25. Cham : Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-78609-0_27.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

4

Avola, Danilo, Marco Bernardi, Marco Cascio, Luigi Cinque, Gian Luca Foresti et Cristiano Massaroni. « A New Descriptor for Keypoint-Based Background Modeling ». Dans Lecture Notes in Computer Science, 15–25. Cham : Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-30642-7_2.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

5

Grycuk, Rafał, Magdalena Scherer et Sviatoslav Voloshynovskiy. « Local Keypoint-Based Image Detector with Object Detection ». Dans Artificial Intelligence and Soft Computing, 507–17. Cham : Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-59063-9_45.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

6

Cataño, M. A., et J. Climent. « Keypoint Detection Based on the Unimodality Test of HOGs ». Dans Advances in Visual Computing, 189–98. Berlin, Heidelberg : Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-33179-4_19.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

7

Safdarnejad, S. Morteza, Yousef Atoum et Xiaoming Liu. « Temporally Robust Global Motion Compensation by Keypoint-Based Congealing ». Dans Computer Vision – ECCV 2016, 101–19. Cham : Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-46466-4_7.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

8

Giebenhain, Simon, Urs Waldmann, Ole Johannsen et Bastian Goldluecke. « Neural Puppeteer : Keypoint-Based Neural Rendering of Dynamic Shapes ». Dans Computer Vision – ACCV 2022, 239–56. Cham : Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-26316-3_15.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

9

Jin, Ling, Yiguang Liu, Zhenyu Xu, Yunan Zheng et Shuangli Du. « Robust Binary Keypoint Descriptor Based on Local Hierarchical Octagon Pattern ». Dans Lecture Notes in Electrical Engineering, 277–84. Cham : Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-91659-0_21.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

10

Zeng, Ming, Ting Yang, Youfu Li, Qinghao Meng, Jian Liu et Tiemao Han. « Finding Regions of Interest Based on Scale-Space Keypoint Detection ». Dans Communications in Computer and Information Science, 428–35. Berlin, Heidelberg : Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-22456-0_61.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Actes de conférences sur le sujet "Keypoint-based"

1

Estrada, F. J., P. Fua, V. Lepetit et S. Susstrunk. « Appearance-based keypoint clustering ». Dans 2009 IEEE Conference on Computer Vision and Pattern Recognition (CVPR). IEEE, 2009. http://dx.doi.org/10.1109/cvprw.2009.5206514.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

2

Estrada, Francisco J., Pascal Fua, Vincent Lepetit et Sabine Susstrunk. « Appearance-based keypoint clustering ». Dans 2009 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops (CVPR Workshops). IEEE, 2009. http://dx.doi.org/10.1109/cvpr.2009.5206514.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

3

Bralet, Antoine, Razmig Kechichian et Sebastien Valette. « Local Surf-Based Keypoint Transfer Segmentation ». Dans 2021 IEEE 18th International Symposium on Biomedical Imaging (ISBI). IEEE, 2021. http://dx.doi.org/10.1109/isbi48211.2021.9434106.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

4

Fan, Guanglei, Xin Song, Lei Yang et Yong Zhao. « Research on Keypoint-based Object Detection ». Dans 2021 2nd International Conference on Electronics, Communications and Information Technology (CECIT). IEEE, 2021. http://dx.doi.org/10.1109/cecit53797.2021.00173.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

5

Volkov, Alexandr, Valeria Efimova, Viacheslav Shalamov et Andrey Filchenkov. « Keypoint-based static object removal from photographs ». Dans Thirteenth International Conference on Machine Vision, sous la direction de Wolfgang Osten, Jianhong Zhou et Dmitry P. Nikolaev. SPIE, 2021. http://dx.doi.org/10.1117/12.2587036.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

6

Bendale, Pashmina, Bill Triggs et Nick Kingsbury. « Multiscale Keypoint Analysis based on Complex Wavelets ». Dans British Machine Vision Conference 2010. British Machine Vision Association, 2010. http://dx.doi.org/10.5244/c.24.49.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

7

Fanani, Nolang, Matthias Ochs, Henry Bradler et Rudolf Mester. « Keypoint trajectory estimation using propagation based tracking ». Dans 2016 IEEE Intelligent Vehicles Symposium (IV). IEEE, 2016. http://dx.doi.org/10.1109/ivs.2016.7535500.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

8

Zeng, Hui, Ji-Yuan Dong, Zhi-Chun Mu et Yin Guo. « Ear recognition based on 3D keypoint matching ». Dans 2010 10th International Conference on Signal Processing (ICSP 2010). IEEE, 2010. http://dx.doi.org/10.1109/icosp.2010.5656140.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

9

Cao, Weihua, Qiang Ling, Feng Li, Quan Zheng et Song Wang. « A keypoint-based fast object tracking algorithm ». Dans 2016 35th Chinese Control Conference (CCC). IEEE, 2016. http://dx.doi.org/10.1109/chicc.2016.7553993.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

10

Hsiao, Shan-Chien, et Ching-Te Chiu. « Efficient 2D Keypoint-based Hand Pose Estimation ». Dans 2021 International Conference on Computational Science and Computational Intelligence (CSCI). IEEE, 2021. http://dx.doi.org/10.1109/csci54926.2021.00315.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Nous offrons des réductions sur tous les plans premium pour les auteurs dont les œuvres sont incluses dans des sélections littéraires thématiques. Contactez-nous pour obtenir un code promo unique!