Filters








1,874 Hits in 4.6 sec

SIFT: An Algorithm for Extracting Structural Information From Taxonomies [article]

Jorge Martinez-Gil
2016 arXiv   pre-print
In this work we present SIFT, a 3-step algorithm for the analysis of the structural information represented by means of a taxonomy.  ...  This method is particular relevant in scenarios where taxonomy alignment techniques exploiting textual information from taxonomy nodes cannot operate successfully.  ...  Comparing structural similarities It is possible to use our algorithm for extracting structural indexes of taxonomies in order to compare its structural similarity.  ... 
arXiv:1602.07064v1 fatcat:sfsjd2uyuzetxnzygoqvgotjze

Application of Sparse Coded SIFT Features for Classification of Plant Images

Suchit Purohit, Savita R. Gandhi
2017 International Journal of Image Graphics and Signal Processing  
Automated system for plant species recognition is need of today since manual taxonomy is cumbersome, tedious, time consuming, expensive and suffers from perceptual biasness as well as taxonomic impediment  ...  plant taxonomy.  ...  D S Guru et al. developed an algorithmic model for automatic flowers classification using KNN as the classifier [19] .  ... 
doi:10.5815/ijigsp.2017.10.06 fatcat:c7rao3dwavbl7mrb5evmhq3pae

Bacterial DNA Sifted from the Trichoplax adhaerens (Animalia: Placozoa) Genome Project Reveals a Putative Rickettsial Endosymbiont

Timothy Driscoll, Joseph J. Gillespie, Eric K. Nordberg, Abdu F. Azad, Bruno W. Sobral
2013 Genome Biology and Evolution  
Our work provides methodological insight for such an approach.  ...  Bioinformatic and phylogenomic analyses of extracted data from the genome assembly (181 bacterial coding sequences [CDS]) and trace read archive (16S rDNA) revealed a dominant proteobacterial profile strongly  ...  They thank Bernd Schierwater and Tina Herzog (University of Veterinary Medicine Hannover Foundation) for providing literature on T. adhaerens, and Leo Buss (Yale University) for fielding inquiries about  ... 
doi:10.1093/gbe/evt036 pmid:23475938 pmcid:PMC3641634 fatcat:qk3j6xil6jdnleidtoysffnihq

Local focus-tolerant image descriptors for classification of biological particles

Nefeli Vassiliki Politi-Stergiou, Ilias Theodorakopoulos, George Economou
2013 13th IEEE International Conference on BioInformatics and BioEngineering  
We use SIFT descriptors in order to encode local gradient, fused with features derived from an introduced adaptive filterbank of Gabor filters.  ...  In this work we present a new approach to the extraction of features robust to focal mismatches, for the classification of biological particles characterized by 3 dimensional structures.  ...  represent local structural and textural characteristics of biological particles like pollen grains, as a means to enhance the information acquired from gradient descriptors such as SIFT.  ... 
doi:10.1109/bibe.2013.6701589 dblp:conf/bibe/Politi-StergiouTE13 fatcat:7lacwlcmsjhlbbwphy22yct4yq

A scalable approach for understanding the visual structures of hand grasps

Minjie Cai, Kris M. Kitani, Yoichi Sato
2015 2015 IEEE International Conference on Robotics and Automation (ICRA)  
Building on the output of these grasp classifiers, visual structures among hand grasps are learned based on an iterative discriminative clustering procedure.  ...  Analysis of real-world video shows that it is possible to automatically learn intuitive visual grasp structures that are consistent with expert-designed grasp taxonomies.  ...  Therefore, we extracted [23] computed from a palm region.  ... 
doi:10.1109/icra.2015.7139367 dblp:conf/icra/CaiKS15 fatcat:ehjvyeozhzeqtpimegjhwmcuda

Video Object Mining: Issues and Perspectives

Jonathan Weber, Sebastien Lefevre, Pierre Gancarski
2010 2010 IEEE Fourth International Conference on Semantic Computing  
Today, video is becoming one of the primary sources of information.  ...  But video object mining needs some semantics, both in the object extraction step and in the object mining step.  ...  We particulary thank Christian Dhinaut from RBS for his support.  ... 
doi:10.1109/icsc.2010.71 dblp:conf/semco/WeberLG10 fatcat:ylrd66b72jfghpjn4sudvefifa

Taxonomy of Feature Description Attributes [chapter]

Scott Krig
2014 Computer Vision Metrics  
Typically, the shapes are extracted using a morphological vision pipeline and regional algorithms, which can be more complex than localized algorithms for feature detectors and feature descriptors (as  ...  SIFT Example We use SIFT as an example baseline, since SIFT is widely recognized and carefully designed.  ...  Binary or Boolean Distance Family Feature Metric Evaluation This section addresses the question of how to summarize feature descriptor information at a high level from the Vision Metrics Taxonomy into  ... 
doi:10.1007/978-1-4302-5930-5_5 fatcat:kzdhaew74zabbjgsao7s3oycwa

Enhancing action recognition of construction workers using data-driven scene parsing

Jun Yang
2018 Journal of Civil Engineering and Management  
The proposed system is especially suitable for construction sites, where semantic information is rich from local objects to global surroundings.  ...  The experimental results on a comprehensive dataset show that the proposed system outperforms the baseline algorithm by 10.5%.  ...  Taxonomy of construction objects is a category structure to define interested construction objects. Reasonable taxonomy is important for effectively understanding a construction scene.  ... 
doi:10.3846/jcem.2018.6133 fatcat:kb46weibsvfmpfrtry74oqlnsq

Role of Deep Learning in Loop Closure Detection for Visual and Lidar SLAM: A Survey

Saba Arshad, Gon-Woo Kim
2021 Sensors  
It provides a thorough study of existing literature on loop closure detection algorithms for visual and Lidar SLAM and discusses their insight along with their limitations.  ...  It presents a taxonomy of state-of-the-art deep learning-based loop detection algorithms with detailed comparison metrics. Also, the major challenges of conventional approaches are identified.  ...  In [67] , an NDT histogram is used to extract the structural information from Lidar scans by spatially dividing the scans into overlapping cells.  ... 
doi:10.3390/s21041243 pmid:33578695 pmcid:PMC7916334 fatcat:25xo5gtxnfb43modwzuncytqj4

Disparity Map Computation from Stereo Images Using Hill-Climbing Segmentation

Tin Tin San, Image Processing Lab, University of Computer Studies, Mandalay, Myanmar, Kay Thi Win, Faculty of Information Science, University of Computer Studies, Mandalay, Myanmar
2019 INTERNATIONAL JOURNAL OF RESEARCH AND ENGINEERING  
The task of stereo matching is to find the point correspondence between two images of the same scene taken from different viewpoints. This paper presents a segment-based stereo matching algorithm.  ...  Stereo matching is one of the most active research areas in computer vision for decades.  ...  The SIFT features are features extracted from images that can provide reliable matching between different views of an object or scene [19] .  ... 
doi:10.21276/ijre.2019.6.1.1 fatcat:n25mruujszaffjuovgulamijci

Improving PMVS Algorithm for 3D Scene Reconstruction from Sparse Stereo Pairs [chapter]

Bo Li, Y. V. Venkatesh, Ashraf Kassim, Yijuan Lu
2013 Lecture Notes in Computer Science  
algorithms.  ...  In this paper, we analyze the performance of the PMVS (Patch-based Multi-View Stereo software) for scene reconstruction from stereo pairs of scenes captured by a simple 3D camera.  ...  The authors wish to express grateful thanks to Professor Lawrence Wong (Deputy Director, IDMI) for his keen interest and encouragement.  ... 
doi:10.1007/978-3-319-03731-8_21 fatcat:cvac4zfpzfao3j7wh4vphpxewy

Multi-Faceted Hierarchical Image Segmentation Taxonomy ( MFHIST)

Tilottama Goswami, Arun Agarwal, C Raghavendra Rao
2021 IEEE Access  
Every scope is exemplified with research works from the literature for better understanding.  ...  The performance analysis of the algorithms using quantitative metrics is not in the present scope and will be considered in future version of MFHIST.  ...  In contrast, bottom-up information is extracted from the given image, which is intrinsic or embedded into it, hence meant to be unsupervised.  ... 
doi:10.1109/access.2021.3055678 fatcat:r3aaee4vrbgqhdzlb6qc5vkefy

Automated identification of Lauraceae by scale-invariant feature transform

Sung-Wook Hwang, Kayoko Kobayashi, Shengcheng Zhai, Junji Sugiyama
2017 Journal of Wood Science  
transform (SIFT), a computer vision-based feature extraction algorithm.  ...  Cluster analysis of all the SIFT descriptors for each image yielded practical information regarding the descriptors; they recognize selectively the cell lumina, cell corners, vessels, and axial and ray  ...  The study was supported by a Grants-in-Aid for Scientific Research (Grant Number 25252033) from the Japan Society for the Promotion of Science, RISH Cooperative Research (database), and RISH Mission Research  ... 
doi:10.1007/s10086-017-1680-x fatcat:op7td5xdgrdffdof5fe3w2bica

A Hand to Hand Taxonomical Survey on Web Mining

Neha Sharma, Sanjay Kumar Dubey
2012 International Journal of Computer Applications  
Keywords Web mining,web content mining,web structure mining,web usage mining,information retrieval, information extraction.  ...  Information extraction from the web documents is a typical task and can be done efficiently after the through study of mining.  ...  Chang et al describes that Information extraction (IE) from semi-structured web documents is a critical issue for information integration systems on the Internet [6] .  ... 
doi:10.5120/9670-4091 fatcat:jidm6hmmvfal5fauhblmb7plkq

Retrieval of Flower Based on Sketches

Y.H. Sharath Kumar, D.S. Guru
2015 Procedia Computer Science  
A standard way to speed up the retrieval procedure is to design an indexing scheme prior to retrieval, which results in the reduction of number of flowers considered for searching by the retrieval algorithm  ...  For querying the database we collected about 100 flower sketches from 20 different users. Experimental results reveal the success of the proposed method.  ...  Kd-tree is a suitable indexing structure for flower retrieval system particularly during the execution of range search algorithm and it also decreases the search time.  ... 
doi:10.1016/j.procs.2015.02.086 fatcat:xzftikqacrajrlgnjw72csuhgq
« Previous Showing results 1 — 15 out of 1,874 results