Biometric identification based on the eye movements and graph matching techniques

2012 ◽  
Vol 33 (6) ◽  
pp. 786-792 ◽  
Author(s):  
Ioannis Rigas ◽  
George Economou ◽  
Spiros Fotopoulos
Keyword(s):  
Eye Movements ◽  
Graph Matching ◽  
Biometric Identification ◽  
Matching Techniques

Graph Matching Techniques for Computer Vision

2013 ◽  
pp. 381-421 ◽  
Author(s):  
Mario Vento ◽  
Pasquale Foggia
Keyword(s):  
Computer Vision ◽  
Graph Matching ◽  
Reference Model ◽  
Computer Vision Applications ◽  
Matching Techniques

Many computer vision applications require a comparison between two objects, or between an object and a reference model. When the objects or the scenes are represented by graphs, this comparison can be performed using some form of graph matching. The aim of this chapter is to introduce the main graph matching techniques that have been used for computer vision, and to relate each application with the techniques that are most suited to it.

Graph Matching Techniques for Computer Vision

2012 ◽  
pp. 1-41 ◽  
Author(s):  
Mario Vento ◽  
Pasquale Foggia
Keyword(s):  
Computer Vision ◽  
Graph Matching ◽  
Reference Model ◽  
Computer Vision Applications ◽  
Matching Techniques

Many computer vision applications require a comparison between two objects, or between an object and a reference model. When the objects or the scenes are represented by graphs, this comparison can be performed using some form of graph matching. The aim of this chapter is to introduce the main graph matching techniques that have been used for computer vision, and to relate each application with the techniques that are most suited to it.

A Graph-Based Approach for Semantic Process Model Discovery

2011 ◽  
pp. 438-462 ◽  
Author(s):  
Ahmed Gater ◽  
Daniela Grigori ◽  
Mokrane Bouzeghoub
Keyword(s):  
Web Services ◽  
Process Model ◽  
Service Oriented Architecture ◽  
Graph Matching ◽  
Process Models ◽  
Matching Problem ◽  
Service Oriented ◽  
Semantic Process ◽  
Process Structure ◽  
Matching Techniques

One of the key tasks in the service oriented architecture that Semantic Web services aim to automate is the discovery of services that can fulfill the applications or user needs. OWL-S is one of the proposals for describing semantic metadata about Web services, which is based on the OWL ontology language. Majority of current approaches for matching OWL-S processes take into account only the inputs/outputs service profile. This chapter argues that, in many situations the service matchmaking should take into account also the process model. We present matching techniques that operate on OWL-S process models and allow retrieving in a given repository, the processes most similar to the query. To do so, the chapter proposes to reduce the problem of process matching to a graph matching problem and to adapt existing algorithms for this purpose. It proposes a similarity measure used to rank the discovered services. This measure captures differences in process structure and semantic differences between input/outputs used in the processes.

Architecture-Driven Service Discovery for Service Centric Systems

2011 ◽  
pp. 811-842 ◽  
Author(s):  
A. Kozlenkov ◽  
G. Spanoudakis ◽  
A. Zisman ◽  
V. Fasoulas ◽  
F. Sanchez
Keyword(s):  
Service Discovery ◽  
Graph Matching ◽  
Quality Criteria ◽  
Software Systems ◽  
Design Phase ◽  
Design Models ◽  
Prototype Tool ◽  
Development Lifecycle ◽  
Execution Engine ◽  
Matching Techniques

Service discovery has been recognized as an important aspect in the development of service-centric systems, i.e., software systems which deploy Web services. To develop such systems, it is necessary to identify services that can be combined in order to fulfill the functionality and achieve quality criteria of the system being developed. In this paper, we present a framework supporting architecture-driven service discovery (ASD)—that is the discovery of services that can provide functionalities and satisfy properties and constraints of systems as specified during the design phase of the development lifecycle based on detailed system design models. Our framework assumes an iterative design process and allows for the (re-)formulation of design models of service-centric systems based on the discovered services. The framework is composed of a query extractor, which derives queries from behavioral and structural UML design models of service-centric systems, and a query execution engine that executes these queries against service registries based on graph matching techniques. The article describes a prototype tool that we have developed to demonstrate and evaluate our framework and the results of a set of preliminary experiments that we have conducted to evaluate it.

Sign in / Sign up

Export Citation Format

Share Document