VLSI image/scene recognition systems inspired by brain architecture Combining some processing models inspired by brain vision functions, we have constructed a real-time image/scene recognition VLSI system that can recognize natural scenes including human faces and different objects. The processing functions used in the system are coarse region segmentation using resistive-fuse networks and imag...

Pattern-avoiding permutations are permutations where none of the subsequences match the relative order of a given pattern. Pattern-avoiding permutations are related to practical and abstract mathematical problems and can provide simple representations for such problems. For example, some floorplans, which are used for optimizing very-large-scale integration(VLSI) circuit design, can be encoded ...

Ontology matching is a crucial task of enabling interoperation between Web applications using different but related ontologies. Due to the size and the monolithic nature, large-scale ontologies regarding real world domains cause a new challenge to current ontology matching techniques. In this paper, we propose a method for partition-based block matching that is practically applicable to large c...

Abstract. Schema matching is a crucial task to gather information of the same domain. This is more true on the web, where a large number of data sources are available and require to be matched. However, the schema matching process is still largely performed manually or semiautomatically, discouraging the deployment of large-scale integration systems. Indeed, these large-scale scenarios need a s...

With the development and the use of a large variety of DB schemas and ontologies, in many domains (e.g. semantic web, digital libraries, life science, etc), matching techniques are called to overcome the challenge of aligning and reconciling these different interrelated representations. Matching field is becoming a very attractive research topic. In this chapter, the authors are interested in s...

In this paper, a new convex matching pursuit scheme is proposed for tackling large-scale sparse coding and subset selection problems. In contrast with current matching pursuit algorithms such as subspace pursuit (SP), the proposed algorithm has a convex formulation and guarantees that the objective value can be monotonically decreased. Moreover, theoretical analysis and experimental results sho...

In this paper, an image matching algorithm combining a SVD matching approach and scale invariant measure is proposed to relate images with large-scale variations. To obtain a better performance on handling redundant points, we modify the SVD matching approach which enforces the condition of minimal distance between the structures of point patterns at the same time ensures the likeliness of the ...