Results 191 to 200 of about 165,668 (247)
Some of the next articles are maybe not open access.
Proceedings of the December 5-7, 1972, fall joint computer conference, part I on - AFIPS '72 (Fall, part I), 1972
Many computer applications have stringent requirements for continued correct operation of the computer in the presence of internal faults. The subject of design of such highly reliable computers has been extensively studied, and numerous techniques have been developed to achieve this high reliability.
openaire +1 more source
Many computer applications have stringent requirements for continued correct operation of the computer in the presence of internal faults. The subject of design of such highly reliable computers has been extensively studied, and numerous techniques have been developed to achieve this high reliability.
openaire +1 more source
Comparison of SIFT, Bi-SIFT, and Tri-SIFT and their frequency spectrum analysis
Machine Vision and Applications, 2017This paper aims to explore frequency behavior of isotropic (regular SIFT) and anisotropic (Bi-SIFT and Tri-SIFT) versions of the scale-space keypoint detection algorithm SIFT. We introduced a new smoothing function Trilateral filter that can be used in formation of a scale-space as an alternative to the Gaussian scale-space.
Kazim Şekeroğlu, Ömer Muhammet Soysal
openaire +1 more source
Computer Graphics Forum, 2013
AbstractWe introduce the Sifted Disk technique for locally resampling a point cloud in order to reduce the number of points. Two neighboring points are removed and we attempt to find a single random point that is sufficient to replace them both. The resampling respects the original sizing function; In that sense it is not a coarsening.
Mohamed S. Ebeida +6 more
openaire +1 more source
AbstractWe introduce the Sifted Disk technique for locally resampling a point cloud in order to reduce the number of points. Two neighboring points are removed and we attempt to find a single random point that is sufficient to replace them both. The resampling respects the original sizing function; In that sense it is not a coarsening.
Mohamed S. Ebeida +6 more
openaire +1 more source
ACM Journal of Experimental Algorithmics, 2012
Directed graphs are commonly drawn by the Sugiyama algorithm where first vertices are placed on distinct hierarchical levels, and second vertices on the same level are permuted to reduce the overall number of crossings. Separating these two phases simplifies the algorithms but diminishes the quality of the result.
Christian Bachmaier +2 more
openaire +1 more source
Directed graphs are commonly drawn by the Sugiyama algorithm where first vertices are placed on distinct hierarchical levels, and second vertices on the same level are permuted to reduce the overall number of crossings. Separating these two phases simplifies the algorithms but diminishes the quality of the result.
Christian Bachmaier +2 more
openaire +1 more source
Proceedings of the ACM International Conference on Image and Video Retrieval, 2010
The best known Scale-Invariant Feature Transform (SIFT) shows its superior performance in a variety of image processing tasks due to its distinctiveness, invariance to scale, rotation and local geometric distortion. Despite its remarkable performance, SIFT is not invariant to mirror images and grayscale-inverted images.This paper proposes an improved ...
Rui Ma, Jian Chen, Zhong Su
openaire +1 more source
The best known Scale-Invariant Feature Transform (SIFT) shows its superior performance in a variety of image processing tasks due to its distinctiveness, invariance to scale, rotation and local geometric distortion. Despite its remarkable performance, SIFT is not invariant to mirror images and grayscale-inverted images.This paper proposes an improved ...
Rui Ma, Jian Chen, Zhong Su
openaire +1 more source
Proceedings of the 4th International Conference on Internet Multimedia Computing and Service, 2012
Recently, great advance has been made in large-scale content-based image search. Most state-of-the-art approaches are based on the Bag-of-Visual-Words model with local features, such as SIFT. Visual matching between images is obtained by vector quantization of local features.
Wengang Zhou +4 more
openaire +1 more source
Recently, great advance has been made in large-scale content-based image search. Most state-of-the-art approaches are based on the Bag-of-Visual-Words model with local features, such as SIFT. Visual matching between images is obtained by vector quantization of local features.
Wengang Zhou +4 more
openaire +1 more source
VF-SIFT: Very Fast SIFT Feature Matching
2010Feature-based image matching is one of the most fundamental issues in computer vision tasks. As the number of features increases, the matching process rapidly becomes a bottleneck. This paper presents a novel method to speed up SIFT feature matching. The main idea is to extend SIFT feature by a few pairwise independent angles, which are invariant to ...
Faraj Alhwarin +2 more
openaire +1 more source
Proceedings of the 18th ACM international conference on Multimedia, 2010
Invariant feature descriptors such as SIFT and GLOH have been demonstrated to be very robust for image matching and object recognition. However, such descriptors are typically of high dimensionality, e.g. 128-dimension in the case of SIFT. This limits the performance of feature matching techniques in terms of speed and scalability.
Gangqiang Zhao +3 more
openaire +1 more source
Invariant feature descriptors such as SIFT and GLOH have been demonstrated to be very robust for image matching and object recognition. However, such descriptors are typically of high dimensionality, e.g. 128-dimension in the case of SIFT. This limits the performance of feature matching techniques in terms of speed and scalability.
Gangqiang Zhao +3 more
openaire +1 more source
HALF-SIFT: High-Accurate Localized Features for SIFT
2009 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops, 2009In this paper, the accuracy of feature points in images detected by the scale invariant feature transform (SIFT) is analyzed. It is shown that there is a systematic error in the feature point localization. The systematic error is caused by the improper subpel and subscale estimation, an interpolation with a parabolic function.
K. Cordes +3 more
openaire +1 more source