Results 1 - 10 of 11,888

Table 2. First SPARQL query for public services that match the found properties.

in A Semantic Web GIS based Emergency Management System *
by Gregoris Mentzas, Ljiljana Stojanovic, Vlad Tanasescu, Alessio Gugliotta, John Domingue, Gutierrez Villarias, Rob Davies, Mary Rowlatt, Marc Richardson, Sotirios K. Goudos, Vassilios Peristeras, Konstantinos Tarabanis, Nils Barnickel, Matthias Fluegge, Kay-uwe Schmidt, Elisabeth Diedrich, Daniel Schmidt, Maria Wimmer, Vlad Tanasescu, Alessio Gugliotta, John Domingue, Leticia Gutierrez Villarias, Rob Davies, Mary Rowlatt, Marc Richardson
"... In PAGE 37: ... Due to the fact that two PADomain values are found, two que- ries are performed. The first is given in Table2 . A similar query is executed for gea: CommunityAndSocialServices PADomain.... ..."

Table 2.1: The SPARQL query result

in Towards a Scalable and Collaborative Information Integration Platform and Methodology
by Felix van de Maele

Table 4: Distance of Figure 6(a) (after removing from its SMG the subgraph corresponding to the matched piggy back image) to other images in Figure 5.

in Applications of Bipartite Matching to Problems in Object Recognition
by Sven Dickinson, et al.
"... In PAGE 8: ... In a labeling task, the subgraph matching the closest model view would be removed from the graph and the procedure applied to the remaining subgraph. After removing the matching subgraph, we match the remaining scene subgraph to the entire database, as shown in Table4 . In this case, the closest view is the correct view (Figure 5(d)) of the socket.... ..."

Table 5. Comparison with the error-correcting sub-graph isomorphism algorithm

in 2002, ‘A New Algorithm for Graph Matching with Application to Content-Based Image Retrieval
by Adel Hlaoui, Shengrui Wang 2002
"... In PAGE 5: ... This can be very significant when matching large graphs. Table5 shows a comparison with the A*- based error-correcting algorithm over 1000 pairs of graphs generated randomly. The size of each graph is between 2 and 10 nodes.... ..."
Cited by 2

Table 1: A tabulation of the top seven morphological matches for each class query shape: the scores indicate the energy function value scaled by the optimal subgraph order.

in Recognition of Shapes By Morphological Attributed Relational Graphs
by Di Ruberto Rodriguez, G. Rodriguez, L. Casta
"... In PAGE 8: ... Notice the different number of knots on each branch, due to the fact that the parameter a232a152a227 is determined adaptively. Figure 3: A morphological skeleton and its approximation We have applied the proposed method to other silhouettes from the Rutgers Tools database (see Table1 ). We have selected 20 silhouettes representing six different objects classes.... In PAGE 8: ... The score rep- resents the weight of the maximal optimal subgraph energy function scaled by the maximum number of the nodes in the graphs onto the square order of optimal subgraph in matching. For each query shape only the top 7 matches are shown in Table1 . All the exemplars in the same class, as well as the query shape, are typically within the top 4 matches, confirming the... ..."

Table 5: Distance of Figure 10(a) (after removing from its SMG the subgraph corresponding to the matched piggy back image) to other images in Figure 8.

in View-Based Object Recognition Using Saliency Maps
by Ali Shokoufandeh, Ivan Marsic, Sven J. Dickinson
"... In PAGE 25: ... The closest matching image can be either one of its true neighboring views, a di erent view belonging to the correct object, or a view belonging to a di erent object. Figure 10: Occluded Object Matching: (a) original image; (b) saliency map; and (c) saliency map graph in Table5 . In this case, the closest view is the correct view (Figure 8(d)) of the socket.... ..."

Table 5. Distance of Fig. 10(a) (after removing from its SMG the subgraph corre- sponding to the matched piggy back image) to other images in Fig. 9.

in Graph-Theoretical Methods in Computer Vision
by Ali Shokoufandeh, Sven Dickinson
Cited by 1

Table 1: Transformational Procedures (TPs). Note that the Input column lists only image-based arguments. Model-based arguments are not listed for Subgraph Isomorphism, Geometric Matching and Planar Distance TPs.

in Learning Control Strategies for Object Recognition
by Bruce Draper
"... In PAGE 24: ... Of course, since any two points on the object model can serve as compile-time parameters to a scaling TP, many other parameterizations of the scaling TP could be included in the library. Although the visual procedure library shown in Table1 is su cient for the pur- poses of this experiment, it includes just a few of the computer vision algorithms described in the literature. Unfortunately, the current Lisp implementation of SLS has proved an impediment to building a larger library, since source code for most visual procedures is available only in C.... ..."

Table 5 Distance of Fig. 13(a) (after removing from its SMG the subgraph corre- sponding to the matched piggy back image) to other images in Fig. 11

in View-based object recognition using saliency maps
by Ali Shokoufandeh, Ivan Marsic , Sven J. Dickinson 1998

Table 1. SPARQL query for finding the value of hasPADomain property.

in A Semantic Web GIS based Emergency Management System *
by Gregoris Mentzas, Ljiljana Stojanovic, Vlad Tanasescu, Alessio Gugliotta, John Domingue, Gutierrez Villarias, Rob Davies, Mary Rowlatt, Marc Richardson, Sotirios K. Goudos, Vassilios Peristeras, Konstantinos Tarabanis, Nils Barnickel, Matthias Fluegge, Kay-uwe Schmidt, Elisabeth Diedrich, Daniel Schmidt, Maria Wimmer, Vlad Tanasescu, Alessio Gugliotta, John Domingue, Leticia Gutierrez Villarias, Rob Davies, Mary Rowlatt, Marc Richardson
"... In PAGE 36: ... Then SPARQL queries are sent to the reasoner (Pellet) asking for the properties of the public services that are linked to this individual. Such a SPARQL query asking for the value of hasPADomain prop- erty is given in Table1 below. Table 1.... ..."
Results 1 - 10 of 11,888