Results 241 to 250 of about 1,086,781 (280)
Some of the next articles are maybe not open access.
The Photogrammetric Record, 2015
AbstractThree‐dimensional (3D) feature‐matching techniques, which are essential for progress towards an automated feature‐based procedure, have attracted considerable research attention in both the photogrammetry and computer vision communities. This study introduces a novel matching approach, called RSTG, that comprises four major phases: rotation ...
Tzu‐Yi Chuang, Jen‐Jer Jaw
openaire +1 more source
AbstractThree‐dimensional (3D) feature‐matching techniques, which are essential for progress towards an automated feature‐based procedure, have attracted considerable research attention in both the photogrammetry and computer vision communities. This study introduces a novel matching approach, called RSTG, that comprises four major phases: rotation ...
Tzu‐Yi Chuang, Jen‐Jer Jaw
openaire +1 more source
Deep Semantic Feature Matching
2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2017Estimating dense visual correspondences between objects with intra-class variation, deformations and background clutter remains a challenging problem. Thanks to the breakthrough of CNNs there are new powerful features available. Despite their easy accessibility and great success, existing semantic flow methods could not significantly benefit from these
Nikolai Ufer, Bjorn Ommer
openaire +1 more source
Feature Point Matching with Matching Distribution
2015Most of the feature point matching techniques considers only the number of matches. The higher number of matches is, the better results are. However, reliability and quality of the matching is addressed in a few techniques. So, finding the good matches of the pairs of points from the two given point sets is one of the main issue of feature point ...
San Ratanasanya +2 more
openaire +1 more source
Generalized feature extraction using expansion matching
IEEE Transactions on Image Processing, 1999A novel generalized feature extraction method based on the expansion matching (EXM) method and on the Karhunen-Loeve transform (KLT) is presented. The method provides an efficient way to locate complex features of interest like corners and junctions with reduced number of filtering operations.
D, Nandy, J, Ben-Arie
openaire +2 more sources
Reconstructing shredded documents through feature matching
Forensic Science International, 2006We describe a procedure for reconstructing documents that have been shredded by hand, a problem that often arises in forensics. The proposed method first applies a polygonal approximation in order to reduce the complexity of the boundaries and then extracts relevant features of the polygon to carry out the local reconstruction. In this way, the overall
Edson, Justino +2 more
openaire +2 more sources
Feature Detection and Matching
2010Feature detection and matching are an essential component of many computer vision applications. Consider the two pairs of images shown in Figure 4.2. For the first pair, we may wish to align the two images so that they can be seamlessly stitched into a composite mosaic (Chapter 9).
openaire +1 more source
2012
In many visual effects applications, we need to relate images taken from different perspectives or at different times. For example, we often want to track a point on a set as a camera moves around during a shot so that a digital creature can be later inserted at that location.
openaire +1 more source
In many visual effects applications, we need to relate images taken from different perspectives or at different times. For example, we often want to track a point on a set as a camera moves around during a shot so that a digital creature can be later inserted at that location.
openaire +1 more source
Matching feature points and discarding false matching pairs
2005 IEEE International Conference on Information Acquisition, 2006The approach is to integrate some traditional matching methods of feature point, and proposes a matching method of the feature points based on the fuzzy similarity measure of the feature points. For obtaining the complete matching between two sets of the feature points that hold the fuzzy similarity measure, we employ Hungarian method.
null Youfu Wu, null Mo Dai
openaire +1 more source
Dynamic Feature Matching for Partial Face Recognition
IEEE Transactions on Image Processing, 2019Partial face recognition (PFR) in an unconstrained environment is a very important task, especially in situations where partial face images are likely to be captured due to occlusions, out-of-view, and large viewing angle, e.g., video surveillance and mobile devices.
Lingxiao He +3 more
openaire +2 more sources
A Feature Matching Method: Sparse Feature Tree
Journal of Software, 2006Computational efficiency is an important concern for machine learning algorithms, especially for applications on large test sets or in real-time scenarios. In this paper, a novel data structure and the corresponding algorithms for the execution system of the maximum entropy model are described.
openaire +1 more source