Results 1 - 10 of 337

Shape Matching and Object Recognition Using Shape Contexts

by Serge Belongie, Jitendra Malik, Jan Puzicha - IEEE Transactions on Pattern Analysis and Machine Intelligence , 2001
"... We present a novel approach to measuring similarity between shapes and exploit it for object recognition. In our framework, the measurement of similarity is preceded by (1) solv- ing for correspondences between points on the two shapes, (2) using the correspondences to estimate an aligning transform ..."
Abstract - Cited by 1809 (21 self) - Add to MetaCart
We present a novel approach to measuring similarity between shapes and exploit it for object recognition. In our framework, the measurement of similarity is preceded by (1) solv- ing for correspondences between points on the two shapes, (2) using the correspondences to estimate an aligning

A Divide and Conquer Approach for Parallel Classification of OWL Ontologies (submitted to special issue on Web Reasoning and Rule Systems)

by Kejia Wu, Volker Haarslev
"... Abstract. Description Logic (DL) describes knowledge using entities and rela-tionships between them, and TBox classification is a core DL reasoning service. Over more than two decades many research efforts have been devoted to optimiz-ing TBox classification. Those classification optimization algori ..."
Abstract - Add to MetaCart
Abstract. Description Logic (DL) describes knowledge using entities and rela-tionships between them, and TBox classification is a core DL reasoning service. Over more than two decades many research efforts have been devoted to optimiz-ing TBox classification. Those classification optimization

Towards Parallel Classification of TBoxes

by Mina Aslani, Volker Haarslev
"... Abstract. One of the most frequently used inference services of description logic reasoners is the classification of TBoxes with a subsumption hierarchy of all named concepts as the result. In response to (i) emerging TBoxes from the semantic web community consisting of up to hundreds of thousand of ..."
Abstract - Cited by 5 (0 self) - Add to MetaCart
Abstract. One of the most frequently used inference services of description logic reasoners is the classification of TBoxes with a subsumption hierarchy of all named concepts as the result. In response to (i) emerging TBoxes from the semantic web community consisting of up to hundreds of thousand

TBox Classification in Parallel: Design and First Evaluation

by Mina Aslani, Volker Haarslev
"... Abstract. One of the most frequently used inference services of description logic reasoners classifies all named classes of OWL ontologies into a subsumption hierarchy. Due to emerging OWL ontologies from the web community consisting of up to hundreds of thousand of named classes and the increasing ..."
Abstract - Cited by 3 (2 self) - Add to MetaCart
availability of multi-processor and multi- or manycore computers, we extend the work on parallel TBox classification and propose a new algorithm that is sound and complete and demonstrates in a first experimental evaluation a low overhead in the number of subsumption tests due to parallel execution. 1

Parallel TBox Classification in Description Logics – First Experimental Results

by Mina Aslani, Volker Haarslev
"... Abstract. One of the most frequently used inference services of description logic reasoners classifies all named classes of OWL ontologies into a subsumption hierarchy. Due to emerging OWL ontologies from the web community consisting of up to hundreds of thousand of named classes and the increasing ..."
Abstract - Cited by 19 (3 self) - Add to MetaCart
availability of multi-processor and multi- or many-core computers, we extend our work on parallel TBox classification and propose a new algorithm that is sound and complete and demonstrates in a first experimental evaluation a low overhead w.r.t. subsumption tests (less than 3%) if compared with sequential

A T-Box Generator for testing scalability of OWL mereotopological patterns

by Martin Boeker, Janna Hastings, Daniel Schober, Stefan Schulz
"... Abstract. The representation of biomedical structure- from cellular components to organisms- in biomedical ontologies is of pivotal importance, as the internal structure of complex structured objects needs to be referenced in the definition of processes, disorders, phenotypes and many other entities ..."
Abstract - Add to MetaCart
. In order to evaluate the DL reasoning performance for these patterns, we have created a T-Box Generator to programmatically generate small and large experimental T-Boxes with different reasoning complexities resulting from the relative proportions of the patterns (i) to (iii). Classification times have

Discriminative K-SVD for dictionary learning in face recognition

by Qiang Zhang, Baoxin Li - In CVPR
"... In a sparse-representation-based face recognition scheme, the desired dictionary should have good repre-sentational power (i.e., being able to span the subspace of all faces) while supporting optimal discrimination of the classes (i.e., different human subjects). We propose a method to learn an over ..."
Abstract - Cited by 105 (0 self) - Add to MetaCart
an over-complete dictionary that attempts to simultaneously achieve the above two goals. The pro-posed method, discriminative K-SVD (D-KSVD), is based on extending the K-SVD algorithm by incorporating the classification error into the objective function, thus allow-ing the performance of a linear

Predictive Automatic Relevance Determination by Expectation Propagation

by Yuan (alan Qi, Thomas P. Minka, Rosalind W. Picard - in Proceedings of the 21st International Conference on Machine Learning , 2004
"... In many real-world classification problems the input contains a large number of potentially ir-relevant features. This paper proposes a new Bayesian framework for determining the rele-vance of input features. This approach extends one of the most successful Bayesian methods for feature selection and ..."
Abstract - Cited by 53 (10 self) - Add to MetaCart
and sparse learning, known as Automatic Relevance Determination (ARD). ARD finds the relevance of features by optimiz-ing the model marginal likelihood, also known as the evidence. We show that this can lead to over-fitting. To address this problem, we propose Pre-dictive ARD based on estimating

Wavelet-based phase classification

by Ted Huffmire, Tim Sherwood - in Proceedings of the 15th International Conference on Parallel Architecture and Compilation Techniques (15th PACT’06 , 2006
"... Phase analysis has proven to be a useful method of summa-rizing the time-varying behavior of programs, with uses rang-ing from reducing simulation time to guiding run-time op-timizations. Although phase classification techniques based on basic block vectors have shown impressive accuracies on SPEC b ..."
Abstract - Cited by 12 (0 self) - Add to MetaCart
Phase analysis has proven to be a useful method of summa-rizing the time-varying behavior of programs, with uses rang-ing from reducing simulation time to guiding run-time op-timizations. Although phase classification techniques based on basic block vectors have shown impressive accuracies on SPEC

In the Search of Improvements to the EL+ Classification Algorithm

by Barıs ̧ Sertkaya
"... Abstract. We investigate possible improvements to the existing algo-rithm for classifying EL+ TBoxes. We present a modified algorithm based on the well-known linear closure algorithm from relational databases. De-spite its better worst-case complexity, surprisingly it turns out that this algorithm d ..."
Abstract - Add to MetaCart
Abstract. We investigate possible improvements to the existing algo-rithm for classifying EL+ TBoxes. We present a modified algorithm based on the well-known linear closure algorithm from relational databases. De-spite its better worst-case complexity, surprisingly it turns out that this algorithm
Results 1 - 10 of 337