Filters








27,996 Hits in 4.8 sec

Verification of Closest Pair of Points Algorithms [chapter]

Martin Rau, Tobias Nipkow
2020 Lecture Notes in Computer Science  
We verify two related divide-and-conquer algorithms solving one of the fundamental problems in Computational Geometry, the Closest Pair of Points problem.  ...  Using the interactive theorem prover Isabelle/HOL, we prove functional correctness and the optimal running time of O(n log n) of the algorithms.  ...  Conclusion We have presented the first verification (both functional correctness and running time) of two related closest pair of points algorithms in the plane, without assuming the x coordinates of all  ... 
doi:10.1007/978-3-030-51054-1_20 fatcat:ltad2swwdfdsxdnyvv3cli7biu

Ring-constrained join

Man Lung Yiu, Panagiotis Karras, Nikos Mamoulis
2008 Proceedings of the 11th international conference on Extending database technology Advances in database technology - EDBT '08  
Thus, our operation is fundamentally different from the conventional distance joins and closest pairs problems. We are not aware of efficient processing algorithms for RCJ in the literature.  ...  Given two sets P and Q of spatial points, the result of RCJ consists of pairs p, q (where p ∈ P , q ∈ Q) satisfying an intuitive geometric constraint: the smallest circle enclosing p and q contains no  ...  Pairs vs ǫ, Resemblance of k-Closest Pairs vs k, Resemblance of k Nearest Neighbor Pairs vs k, Real Data Figure 13 : 13 The Effect of Join Combination, Real Data Figure 14 : 14 The Cost of RCJ Algorithms  ... 
doi:10.1145/1352431.1352504 fatcat:u565q5djxvdt3ifukpgxzuw5v4

Ring-constrained join

Man Lung Yiu, Panagiotis Karras, Nikos Mamoulis
2008 Proceedings of the 11th international conference on Extending database technology Advances in database technology - EDBT '08  
Thus, our operation is fundamentally different from the conventional distance joins and closest pairs problems. We are not aware of efficient processing algorithms for RCJ in the literature.  ...  Given two sets P and Q of spatial points, the result of RCJ consists of pairs p, q (where p ∈ P , q ∈ Q) satisfying an intuitive geometric constraint: the smallest circle enclosing p and q contains no  ...  Pairs vs ǫ, Resemblance of k-Closest Pairs vs k, Resemblance of k Nearest Neighbor Pairs vs k, Real Data Figure 13 : 13 The Effect of Join Combination, Real Data Figure 14 : 14 The Cost of RCJ Algorithms  ... 
doi:10.1145/1353343.1353416 dblp:conf/edbt/YiuKM08 fatcat:f6b5rn4lmjfk7lxyuqrizpyzeu

Differential Invariants as the Base of Triangulated Surface Registration

Pavel Krsek, Tomáš Pajdla, Václav Hlaváč
2002 Computer Vision and Image Understanding  
, and uses all available points and the iterative closest reciprocal point algorithm to refine the estimate and finally match surfaces (to attain high precision, good initial estimation avoids local minima  ...  We propose a hybrid registration algorithm that combines advantages of working with small amounts of interest points (to attain computational speed), estimates the Euclidean transform matching both surfaces  ...  The iterative closest points (ICP) algorithm [1] is a widely used technique.  ... 
doi:10.1006/cviu.2002.0980 fatcat:4vnawuxsmjapph5rjv63og4t6i

A Fingerprint Verification Algorithm Using the Smallest Minimum Sum of Closest Euclidean Distance

Ujjal Kumar Bhowmik, Ashkan Ashrafi, Reza R. Adhami
2009 2009 International Conference on Electrical, Communications, and Computers  
This algorithm extracts matched minutia pairs from input and template fingerprints by using the smallest minimum sum of closest Euclidean distance (SMSCED), corresponding rotation angle and empirically  ...  Instead of using the minutia type and orientation angle, which are widely employed in existing algorithms, the proposed algorithm uses only the minutia location, to reduce the effect of non-linear distortion  ...  We found, Verification rate = 100%; Rejection rate = 8.12% We have designed and implemented a novel minutiae matching algorithm using the smallest minimum sum of closest Euclidean distance.  ... 
doi:10.1109/conielecomp.2009.57 dblp:conf/conielecomp/BhowmikAA09 fatcat:prtf3azyobfyrlpxatq4apmkpi

Frame-rate spatial referencing based on invariant indexing and alignment with application to online retinal image registration

Hong Shen, C.V. Stewart, B. Roysam, Gang Lin, H.L. Tanenbaum
2003 IEEE Transactions on Pattern Analysis and Machine Intelligence  
This paper describes an algorithm to continually and accurately estimate the absolute location of a diagnostic or surgical tool (such as a laser) pointed at the human retina, from a series of image frames  ...  For each on-line image, the algorithm computes similarity invariants, locally valid despite the curved nature of the retina, from constellations of vascular landmarks.  ...  The retinal images were of unnamed volunteers whose assistance is greatly appreciated. Finally, the continuing guidance provided by Dr. James N.  ... 
doi:10.1109/tpami.2003.1182101 fatcat:jy34apk6djhzvfswhogjmxjtbe

Fingerprint Identification Using SIFT-Based Minutia Descriptors and Improved All Descriptor-Pair Matching

Ru Zhou, Dexing Zhong, Jiuqiang Han
2013 Sensors  
A two-step fast matcher, named improved All Descriptor-Pair Matching (iADM), is also proposed to implement the 1:N verifications in real-time.  ...  To enhance the efficiency and effectiveness of the algorithm for fingerprint verification, we propose a SIFT-based Minutia Descriptor (SMD) to improve the SIFT algorithm through image processing, descriptor  ...  The proposed technique uses key points of SIFT for fingerprint verification. The proposed algorithm has several advantages over previous SIFT-based methods.  ... 
doi:10.3390/s130303142 pmid:23467056 pmcid:PMC3658737 fatcat:tfmp55pcxzgl7dvsopjirpootm

Optimum Partition Parameter of Divide-And-Conquer Algorithm for Solving Closest-Pair Problem

Mohammad Zaidul Karim, Nargis Akter
2011 International Journal of Computer Science & Information Technology (IJCSIT)  
Finding the distance of the closest pair is an interesting topic in computer science. With divide and conquer algorithm we can solve closest pair problem.  ...  In this paper, a new proposal is given that dividing the problem space into (n) number of parts can give better result while divide and conquer algorithm is used for solving the closest pair of point's  ...  two is not the best parameter of divide-and-conquer algorithm for solving famous closest pair problem.  ... 
doi:10.5121/ijcsit.2011.3519 fatcat:374tw5vfxvbs7at5chcb6yalza

Facial Range Image Matching Using the ComplexWavelet Structural Similarity Metric

Shalini Gupta, Mehul Sampat, Mia Markey, Alan Bovik, Zhou Wang
2007 IEEE Workshop on Applications of Computer Vision  
Verification and identification performance of each algorithm was evaluated by means of the receiver operating characteristic curve and the cumulative match characteristic curve.  ...  Among the algorithms tested, the proposed algorithm based on the CW-SSIM resulted in the best overall performance with an equal error rate of 9.13% and a rank 1 recognition rate of 98.6%, significantly  ...  For computing the M SE CP and the Hausdorff distance, correspondence between pairs of points on the two surfaces is built by performing an exhaustive search procedure for closest points.  ... 
doi:10.1109/wacv.2007.22 dblp:conf/wacv/GuptaSMBW07 fatcat:mimh7g5r55gm7dygseve7kozva

Automated facial feature detection and face recognition using Gabor features on range and portrait images

Sina Jahanbin, Hyohoon Choi, Rana Jahanbin, Alan C. Bovik
2008 2008 15th IEEE International Conference on Image Processing  
In this paper, we present a novel identity verification system based on Gabor features extracted from range (3D) representations of faces.  ...  A superior verification accuracy was obtained using the range data, and a highly competitive accuracy to that of other techniques in the literature was also obtained for the portrait data.  ...  All ADIR's 2D and 3D face images are roughly aligned with respect to a fixed generic face model using iterative closest point (ICP) algorithm.  ... 
doi:10.1109/icip.2008.4712368 dblp:conf/icip/JahanbinCJB08 fatcat:35fz4o3f4jeczbcozzyqnm66ym

Fast Methods for Estimating the Distance to Uncontrollability

M. Gu, E. Mengi, M. L. Overton, J. Xia, J. Zhu
2006 SIAM Journal on Matrix Analysis and Applications  
We present an algorithm based on methods of Gu and Burke-Lewis-Overton that estimates the distance to uncontrollability to any prescribed accuracy.  ...  The new method requires O(n 4 ) operations on average, which is an improvement over previous methods which have complexity O(n 6 ), where n is the order of the system.  ...  There exists a pair of α and β satisfying (2.1) if and only if this process succeeds. Modified fast verification scheme. It turns out that Gu's verification scheme can be simplified.  ... 
doi:10.1137/05063060x fatcat:ponymstopjetzenju5eq2tvh2m

Neural Generative Models for 3D Faces with Application in 3D Texture Free Face Recognition [article]

Ahmed ElSayed, Elif Kongar, Ausif Mahmood, Tarek Sobh, Terrance Boult
2018 arXiv   pre-print
Using heterogeneous depth cameras and 3D scanners in 3D face verification causes variations in the resolution of the 3D point clouds.  ...  However, if the data belongs to different persons, the registration algorithms can convert the 3D point cloud of one person to another, destroying the distinguishing features between the two point clouds  ...  Iterative Closest Point (ICP) Iterative Closest Point (ICP), a.k.a., Iterative Corresponding Point, is an algorithm used to obtain the corresponding points and transformations between two groups of points  ... 
arXiv:1811.04358v1 fatcat:ysws43lyc5ba7g7wmmcouqqtpm

Image retrieval with the use of Bag of Words and structural analysis

R Malashin
2016 Journal of Physics, Conference Series  
The significant improvement in robustness is achieved by using fast and robust algorithm of structural verification based on Hough transform of parameters of keypoint matches.  ...  The paper considers task of image retrieval with the use of Bag of Words (BoW).  ...  Acknowledgements This work was supported by the Ministry of Education and Science of the Russian Federation, and by the Government of the Russian Federation, Grant 074-U01.  ... 
doi:10.1088/1742-6596/735/1/012004 fatcat:mnpqetufizdghl3rrdltyrgk3q

Implementation of Verification and Matching E-KTP with Faster R-CNN and ORB

Muhammad Muttabi Hudaya, Siti Saadah, Hendy Irawan
2021 Jurnal RESTI (Rekayasa Sistem dan Teknologi Informasi)  
needs a solid validation that has verification and matching uploaded images.  ...  The goal of the implementations is to reach both an 80% mark of accuracy and prove matching using ORB only can be a replaced OCR technique.  ...  Scenario 1 (S1) consists of matching the pair of the segmented dataset images using a matching algorithm.  ... 
doi:10.29207/resti.v5i4.3175 fatcat:mbwf5kgi6nbzfffbiizwc45l3e

Face Recognition Based on Sequence of Images [article]

Jacek Komorowski, Przemyslaw Rokita
2018 arXiv   pre-print
Experimental verification of the proposed method is also included.  ...  This paper presents a face recognition method based on a sequence of images. Face shape is reconstructed from images using a combination of structure-from-motion and multi-view stereo methods.  ...  Remove outliers from M, that is remove pairs (p i , q i ) for which |d i − q i | > km, where m is a median distance between pairs of corresponding points in M, and k is a small integer 5 . 7.  ... 
arXiv:1809.11069v1 fatcat:4jaxdqkjm5cuzphdfoaw44sxfq
« Previous Showing results 1 — 15 out of 27,996 results