Sign inSubmit
Tips: “quotes” for a phrase · author:Lee · a DOI goes straight to its article

166 results for “k-matching”
Set a search alert
Research ArticleOpen accessEvery word in the titleMULTIMODAL RETINAL IMAGE REGISTRATION USING RANSAC MATCHING AND GRADIENT ICP ALGORITHMP. Pradeepa, Ila. VennilaMultimodal retinal imaging is an important facet of the diagnosis and therapy of retinal disorders like retinopathy, occlusion. Many imaging techniques for multimodal retinal images are developing in the recent years. These novel developments are subjected to a tradeoff between the computational time and effective registration. This study aims at developing a new algorithm based on the RANSAC matching and … …Journal of Computer Science, Vol. 10, Issue 12 · 24 Dec 2014 · 7,740 accessesView PDFCite
Research ArticleOpen accessEvery word in the title3-DIMENSIONAL EAR RECOGNITION BASED ITERATIVE CLOSEST POINT WITH STOCHASTIC CLUSTERING MATCHINGKhamiss Masaoud S. Algabary, Khairuddin Omar, Md Jan NordinEar recognition is a new technology and future trend for personal identification. However, the false detection rate and matching recognition are very challenging due to the ear complex geometry. The Scope of the study is to introduced a combination of Iterative Closest Point (ICP) and Stochastic Clustering Matching (SCM) algorithm for 3D ears matching based on biometrics field with a … …Journal of Computer Science, Vol. 10, Issue 3 · 29 Nov 2013 · 6,812 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleAssisted History Matching for Petroleum Reservoirs in the Social Computing EraMichel Cancelliere, Dario Viberti, Francesca VergaThe exploitation strategy of hydrocarbon reservoirs can be technically and economically optimized only if a reliable numerical model of the reservoir under investigation is available to predict the system response for different production scenarios. A numerical model can be reasonably trustworthy after calibration only, which means the model has at least proved its ability to reproduce the historical behavior of … …American Journal of Applied Sciences, Vol. 10, Issue 8 · 24 Jul 2013 · 7,083 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleA Single Core Hardware Module of a Data Compression Scheme Using Prediction by Partial Matching TechniqueJubayer Jalil, Md. Mamun, Mohd. Marufuzzaman, Hafizah HusainProblem statement: Compression is useful because it helps reduce the consumption of expensive resources, such as hard disk space or transmission bandwidth. For effective data compression, the compression algorithm must be able to predict future data accurately in order to build a good probabilistic model for compression. Lossless compression is essential in cases where it is important that the original … …American Journal of Applied Sciences, Vol. 8, Issue 11 · 7 Oct 2011 · 7,255 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleImprovement of Image Matching by using the Proximity Criterion: Application to Omnidirectional and Perspective ImagesIbrahim Guelzim, Ahmed Hammouch, Driss AboutajdineProblem statement: In computer vision, matching is an important phase for several applications (object reconstruction, robot navigation ...). The similarity measures used provided results which could be improved. Approach: This research proposed to improve image matching by using the proximity criterion. The similarity measures used mutual information and correlation coefficient. The matching was done between neighborhoods of points of interest … …Journal of Computer Science, Vol. 7, Issue 8 · 15 Jul 2011 · 6,672 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleA Fast Hybrid Algorithm Approach for the Exact String Matching Problem Via Berry Ravindran and Alpha Skip Search AlgorithmsAbdulwahab Ali AlmazroiProblem statement: String matching algorithm had been an essential means for searching biological sequence database. With the constant expansion in scientific data such as DNA and Protein; the development of enhanced algorithms have even become more critical as the major concern had always been how to raise the performances of these search algorithms to meet challenges of scientific information. Approach: … …Journal of Computer Science, Vol. 7, Issue 5 · 7 May 2011 · 7,398 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleA Fast Hybrid Algorithm for the Exact String Matching ProblemAbdulwahab Ali Al-mazroi, Nur’Aini Abdul RashidProblem statement: Due to huge amount and complicated nature of data being generated recently, the usage of one algorithm for string searching was not sufficient to ensure faster search and matching of patterns. So there is the urgent need to integrate two or more algorithms to form a hybrid algorithm (called BRSS) to ensure speedy results. Approach: This study proposes … …American Journal of Engineering and Applied Sciences, Vol. 4, Issue 1 · 31 Jan 2011 · 8,240 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleRobust Template Matching Using Orthogonal Legendre Moment InvariantsKhalid M. HosnyProblem statement: Template matching is a famous methodology that has a wide range of applications in image and signal processing. For a template and input image, template matching methodology finds the partial input image that is most closely matches the template image in terms of specific criterion such as the Euclidean distance or cross-correlation. Approach: In this study, a fast … …Journal of Computer Science, Vol. 6, Issue 10 · 30 Jul 2010 · 7,617 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleTwigINLAB: A Decomposition-Matching-Merging Approach To Improving XML Query ProcessingSu-Cheng Haw, Chien-Sing LeeThe emergence of the Web has increased significant interests in querying XML data. Current methods for XML query processing still suffers from producing large intermediate results and are not efficient in supporting query with mixed types of relationships. We propose the TwigINLAB algorithm to process and optimize the query evaluation. Our TwigINLAB adopts the decomposition-matching-merging approach and focuses on optimizing … …American Journal of Applied Sciences, Vol. 5, Issue 9 · 30 Sep 2008 · 6,988 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleA Fast Pattern Matching Algorithm with Two Sliding Windows (TSW)Amjad Hudaib, Rola Al-Khalid, Dima Suleiman et al.In this research, we propose a fast pattern matching algorithm: The Two Sliding Windows (TSW) algorithm. The algorithm makes use of two sliding windows, each window has a size that is equal to the pattern length. Both windows slide in parallel over the text until the first occurrence of the pattern is found or until both windows reach the middle … …Journal of Computer Science, Vol. 4, Issue 5 · 31 May 2008 · 7,499 accessesView PDFCite