In technical drawings and medical drawings/maps it is often common to explain certain features of the drawing by blocks of text that are arranged on its boundary. Bekos et. al. introduced the term boundary labelling to describe this special type of labelling and presented algorithms for automatic boundary labelling. BLer is a prototype tool aiming to automate the boundary labelling process. It ...

For positive integers k and d ≥ 2, a k-S(d, 1)-labelling of a graph G is a function on the vertex set of G, f : V (G) → {0, 1, 2, · · · , k− 1}, such that |f(u)− f(v)|k ≥ { d if dG(u, v) = 1; 1 if dG(u, v) = 2, where |x|k = min{|x|, k − |x|} is the circular difference modulo k. In general, this kind of labelling is called the S(d, 1)-labelling. The σdnumber of G, σd(G), is the minimum k of a k-...

gold preparations are one of the oldest disease modifying drugs in the treatment of rheumatoid arthritis. this are different reports about the effects and complications of these compoumis. these opposite reports may he due to the difference in genetic ami ethnic background of patients. this study was designed to evaluate our results in gold therapy ami compare them with those of western countri...

Deterministic annealing and relaxation labeling algorithms for classiication and matching are presented and discussed. A new approach |self annealing|is introduced to bring deterministic annealing and relaxation labeling into accord. Self annealing results in an emergent linear schedule for winner-take-all and assignment problems. Also, the relaxation labeling algorithm can be seen as an approx...

In this paper, we tackle the problem of matching of objects in video in the context of the rough indexing paradigm. The approach developed is based on matching of region adjacency graphs (RAG) of pre-segmented objects. In the context of the rough indexing paradigm, the video data are of very low resolution and segmentation is consequently inaccurate. Hence the RAGs vary with the time. The contr...

A novel approach to junction detection using an explicit line finder model and contextual rules is presented. Contextual rules expressing properties of 3D-edges (surface orientation discontinuities) limit the number of line intersections interpreted as junctions. Probabilistic relaxation labelling scheme is used to combine the a priori world knowledge represented by contextual rules and the inf...

We present a comparative study of several optimisation approaches used in probabilistic relaxation labelling. For test purposes, we propose a 3 node 2 label variant of Rosenfelds famous triangle labelling problem. Experiments comparing Rosenfelds original probability updating rule with the theoretically better justified projected gradient method of Hummel et al show that the latter is to prefer...

BACKGROUND Precautionary 'may contain' warnings are used to indicate possible allergen contamination. Neither food safety nor foods labelling legislation address this issue. The aim of this study is to understand how peanut and nut allergic adults interpret 'may contain' labelling and how they use this information when purchasing food. METHODS Qualitative methods were used to explore both beh...

We investigate natural extensions of the Continuous Image Graph (CIG) labelling scheme, which is based on the Consecutive Ones Property of matrices. The CIG labelling scheme generalizes tree labelling schemes to many graphs yet remaining as efficient, i.e., adjacency tests run in constant time, the space requirement is constant per node, and testing whether a graph is a CIG is possible in polyn...