Region merging methods consist of improving an initial segmentation by merging some pairs of neighboring regions. In a graph, merging two regions, separated by a set of vertices, is not straightforward. The perfect fusion graphs defined in [J. Cousty et al, “Fusion Graphs: Merging Properties and Watersheds”, JMIV 2008] verify all the basic properties required by region merging algorithms as use...

In this paper, we investigate the geometry of a general class of gradient flows with multiple local maxima. we decompose the underlying space into disjoint regions of attraction and establish the adjacency criterion. The criterion states a necessary and sufficient condition for two regions of attraction of stable equilibria to be adjacent. We then apply this criterion on a specific type of grad...

1 2 Abstract This paper describes a multi-modal corpus of hand-annotated meeting 3 dialogues that was designed for studying addressing behaviour in face-to-face con4 versations. The corpus contains annotated dialogue acts, addressees, adjacency pairs 5 and gaze direction. First, we describe the corpus design where we present the 6 meetings collection, annotation scheme and annotation tools. The...

We present the new and unexpected results concerning the Bose–Einstein Condensation for the Pure Hopping Model, describing the thermodynamic behaviour of Bardeen–Cooper pairs in arrays of Josephson junctions located on non homogeneous amenable networks. For this particular situation arising from physics, the results are obtained by a detailed analysis concerning harmonic analysis of the adjacen...

Let Γ=(V,E) be a graph and ‎W_(‎a)={w_1,…,w_k } be a subset of the vertices of Γ and v be a vertex of it. The k-vector r_2 (v∣ W_a)=(a_Γ (v,w_1),‎…‎ ,a_Γ (v,w_k)) is the adjacency representation of v with respect to W in which a_Γ (v,w_i )=min{2,d_Γ (v,w_i )} and d_Γ (v,w_i ) is the distance between v and w_i in Γ. W_a is called as an adjacency resolving set for Γ if distinct vertices of ...

The resource allocation in SC-FDMA is constrained by the condition that multiple subchannels should be allocated to a single user only if they are adjacent. Therefore, scheduling scheme of D2D-cellular system uses must also conform so-called adjacency constraint. This paper proposes heuristic algorithm with low computational complexity applies proportional fair (PF) system. proposed consists tw...

This work shows how to efficiently construct binary de Bruijn sequences, even those with large orders, using the cycle joining method. The cycles are generated by an LFSR with a chosen period e whose irreducible characteristic polynomial can be derived from any primitive polynomial of degree n satisfying e = 2 n −1 t by t-decimation. The crux is our proof that determining Zech’s logarithms is e...

Doctors and clients sometimes experience interactive clashes during hospital meetings in South-western Nigerian hospitals because of their divergent culture-constrained orientation to politeness cues. The goal of this paper is to unpack the discursive elements that characterize interactive confluence and divergence in selected consultative encounters in the hospitals. The findings indicate that...

Manifold alignment is to extract the shared latent semantic structure from multiple manifolds. The joint adjacency matrix plays a key role in manifold alignment. To construct the matrix, it is crucial to get more corresponding pairs. This paper proposes an approach to obtain more and reliable corresponding pairs in terms of local structure correspondence. The sparse reconstruction weight matrix...