A geometric simultaneous embedding of two graphs G1 = (V1, E1) and G2 = (V2, E2) with a bijective mapping of their vertex sets γ : V1 → V2 is a pair of planar straightline drawi...
Fabrizio Frati, Michael Kaufmann, Stephen G. Kobou...
We consider the following problem known as simultaneous geometric graph embedding (SGE). Given a set of planar graphs on a shared vertex set, decide whether the vertices can be pla...
Alejandro Estrella-Balderrama, Elisabeth Gassner, ...
This paper describes a novel color texture-based image retrieval system for the query of an image database to find similar images to a target image. The retrieval process involves...
A general geometrical framework for image processing is presented. We consider intensity images as surfaces in the (x I) space. The image is thereby a two dimensional surface in t...
Random geometric distortion is one of the most difficult kinds of image processing to survive and has been a noted problem in watermarking research. Previous methods for dealing ...