A graph-based framework for thermal faceprint characterization

Thermal faceprint has been paramount in the last years. Since we can handle with face recognition using images acquired in the infrared spectrum, an unique individual's signature can be obtained through the blood vessels network of the face. In this work, we propose a novel framework for thermal faceprint extraction using a collection of graph-based techniques, which were never used to this task up to date. A robust method of thermal face segmentation is also presented. The experiments, which were conducted over the UND Collection C dataset, have showed promising results. © 2011 Springer-Verlag.

Riemannian Submersions with Discrete Spectrum

We prove some estimates on the spectrum of the Laplacian of the total space of a Riemannian submersion in terms of the spectrum of the Laplacian of the base and the geometry of the fibers. When the fibers of the submersions are compact and minimal, we prove that the spectrum of the Laplacian of the total space is discrete if and only if the spectrum of the Laplacian of the base is discrete. When the fibers are not minimal, we prove a discreteness criterion for the total space in terms of the relative growth of the mean curvature of the fibers and the mean curvature of the geodesic spheres in the base. We discuss in particular the case of warped products.

Hearing Delzant Polytopes From the Equivariant Spectrum

Let M^{2n} be a symplectic toric manifold with a fixed T^n-action and with a toric K\"ahler metric g. Abreu asked whether the spectrum of the Laplace operator $\Delta_g$ on $\mathcal{C}^\infty(M)$ determines the moment polytope of M, and hence by Delzant's theorem determines M up to symplectomorphism. We report on some progress made on an equivariant version of this conjecture. If the moment polygon of M^4 is generic and does not have too many pairs of parallel sides, the so-called equivariant spectrum of M and the spectrum of its associated real manifold M_R determine its polygon, up to translation and a small number of choices. For M of arbitrary even dimension and with integer cohomology class, the equivariant spectrum of the Laplacian acting on sections of a naturally associated line bundle determines the moment polytope of M.

Estudo do espectro Laplaciano na categorização de imagens

Uma imagem engloba informação que precisa ser organizada para interpretar e compreender seu conteúdo. Existem diversas técnicas computacionais para extrair a principal informação de uma imagem e podem ser divididas em três áreas: análise de cor, textura e forma. Uma das principais delas é a análise de forma, por descrever características de objetos baseadas em seus pontos fronteira. Propomos um método de caracterização de imagens, por meio da análise de forma, baseada nas propriedades espectrais do laplaciano em grafos. O procedimento construiu grafos G baseados nos pontos fronteira do objeto, cujas conexões entre vértices são determinadas por limiares T_l. A partir dos grafos obtêm-se a matriz de adjacência A e a matriz de graus D, as quais definem a matriz Laplaciana L=D -A. A decomposição espectral da matriz Laplaciana (autovalores) é investigada para descrever características das imagens. Duas abordagens são consideradas: a) Análise do vetor característico baseado em limiares e a histogramas, considera dois parâmetros o intervalo de classes IC_l e o limiar T_l; b) Análise do vetor característico baseado em vários limiares para autovalores fixos; os quais representam o segundo e último autovalor da matriz L. As técnicas foram testada em três coleções de imagens: sintéticas (Genéricas), parasitas intestinais (SADPI) e folhas de plantas (CNShape), cada uma destas com suas próprias características e desafios. Na avaliação dos resultados, empregamos o modelo de classificação support vector machine (SVM), o qual avalia nossas abordagens, determinando o índice de separação das categorias. A primeira abordagem obteve um acerto de 90 % com a coleção de imagens Genéricas, 88 % na coleção SADPI, e 72 % na coleção CNShape. Na segunda abordagem, obtém-se uma taxa de acerto de 97 % com a coleção de imagens Genéricas; 83 % para SADPI e 86 % no CNShape. Os resultados mostram que a classificação de imagens a partir do espectro do Laplaciano, consegue categorizá-las satisfatoriamente.

Quality of transmission estimation in WDM and elastic optical networks accounting for space-spectrum dependencies

We develop a framework for estimating the quality of transmission (QoT) of a new lightpath before it is established, as well as for calculating the expected degradation it will cause to existing lightpaths. The framework correlates the QoT metrics of established lightpaths, which are readily available from coherent optical receivers that can be extended to serve as optical performance monitors. Past similar studies used only space (routing) information and thus neglected spectrum, while they focused on oldgeneration noncoherent networks. The proposed framework accounts for correlation in both the space and spectrum domains and can be applied to both fixed-grid wavelength division multiplexing (WDM) and elastic optical networks. It is based on a graph transformation that exposes and models the interference between spectrum-neighboring channels. Our results indicate that our QoT estimates are very close to the actual performance data, that is, to having perfect knowledge of the physical layer. The proposed estimation framework is shown to provide up to 4 × 10-2 lower pre-forward error correction bit error ratio (BER) compared to theworst-case interference scenario,which overestimates the BER. The higher accuracy can be harvested when lightpaths are provisioned with low margins; our results showed up to 47% reduction in required regenerators, a substantial savings in equipment cost.

Packings and coverings of the complete graph with trees

In this thesis, we define the spectrum problem for packings (coverings) of G to be the problem of finding all graphs H such that a maximum G-packing (minimum G- covering) of the complete graph with the leave (excess) graph H exists. The set of achievable leave (excess) graphs in G-packings (G-coverings) of the complete graph is called the spectrum of leave (excess) graphs for G. Then, we consider this problem for trees with up to five edges. We will prove that for any tree T with up to five edges, if the leave graph in a maximum T-packing of the complete graph Kn has i edges, then the spectrum of leave graphs for T is the set of all simple graphs with i edges. In fact, for these T and i and H any simple graph with i edges, we will construct a maximum T-packing of Kn with the leave graph H. We will also show that for any tree T with k ≤ 5 edges, if the excess graph in a minimum T-covering of the complete graph Kn has i edges, then the spectrum of excess graphs for T is the set of all simple graphs and multigraphs with i edges, except for the case that T is a 5-star, for which the graph formed by four multiple edges is not achievable when n = 12.

Extremal graphs for the sum of the two largest signless Laplacian eigenvalues

Let G be a simple graph on n vertices and e(G) edges. Consider the signless Laplacian, Q(G) = D + A, where A is the adjacency matrix and D is the diagonal matrix of the vertices degree of G. Let q1(G) and q2(G) be the first and the second largest eigenvalues of Q(G), respectively, and denote by S+ n the star graph with an additional edge. It is proved that inequality q1(G)+q2(G) e(G)+3 is tighter for the graph S+ n among all firefly graphs and also tighter to S+ n than to the graphs Kk _ Kn−k recently presented by Ashraf, Omidi and Tayfeh-Rezaie. Also, it is conjectured that S+ n minimizes f(G) = e(G) − q1(G) − q2(G) among all graphs G on n vertices.

Bethe graphs attached to the vertices of a connected graph: a spectral approach

A weighted Bethe graph $B$ is obtained from a weighted generalized Bethe tree by identifying each set of children with the vertices of a graph belonging to a family $F$ of graphs. The operation of identifying the root vertex of each of $r$ weighted Bethe graphs to the vertices of a connected graph $\mathcal{R}$ of order $r$ is introduced as the $\mathcal{R}$-concatenation of a family of $r$ weighted Bethe graphs. It is shown that the Laplacian eigenvalues (when $F$ has arbitrary graphs) as well as the signless Laplacian and adjacency eigenvalues (when the graphs in $F$ are all regular) of the $\mathcal{R}$-concatenation of a family of weighted Bethe graphs can be computed (in a unified way) using the stable and low computational cost methods available for the determination of the eigenvalues of symmetric tridiagonal matrices. Unlike the previous results already obtained on this topic, the more general context of families of distinct weighted Bethe graphs is herein considered.

Edge centrality via the Holevo quantity

In the study of complex networks, vertex centrality measures are used to identify the most important vertices within a graph. A related problem is that of measuring the centrality of an edge. In this paper, we propose a novel edge centrality index rooted in quantum information. More specifically, we measure the importance of an edge in terms of the contribution that it gives to the Von Neumann entropy of the graph. We show that this can be computed in terms of the Holevo quantity, a well known quantum information theoretical measure. While computing the Von Neumann entropy and hence the Holevo quantity requires computing the spectrum of the graph Laplacian, we show how to obtain a simplified measure through a quadratic approximation of the Shannon entropy. This in turns shows that the proposed centrality measure is strongly correlated with the negative degree centrality on the line graph. We evaluate our centrality measure through an extensive set of experiments on real-world as well as synthetic networks, and we compare it against commonly used alternative measures.

Towards a single crystal Raman spectrum of kaolinite at 77 K

The Raman spectra at 77 K of the hydroxyl stretching of kaolinite were obtained along the three axes perpendicular to the crystal faces. Raman bands were observed at 3616, 3658 and 3677 cm−1 together with a distinct band observed at 3691 cm−1 and a broad profile between 3695 and 3715 cm−1. The band at 3616 cm−1 is assigned to the inner hydroxyl. The bands at 3658 and 3677 cm−1 are attributed to the out-of-phase vibrations of the inner surface hydroxyls. The Raman spectra of the in-phase vibrations of the inner-surface hydroxyl-stretching region are described in terms of transverse and longitudinal optic splitting. The band at 3691 cm−1 is assigned to the transverse optic and the broad profile to the longitudinal optic mode. This splitting remained even at liquid nitrogen temperature. The transverse optic vibration may be curve resolved into two or three bands, which are attributed to different types of hydroxyl groups in the kaolinite.

Kava Anxiety Depression Spectrum Study (KADSS): a mixed methods RCT using an aqueous extract of Piper methysticum

Objectives: To report on the design, significance and potential impacts of the first documented human clinical trial assessing the anxiolytic and thymoleptic efficacy of an aqueous monoextract of Piper methysticum (kava). The significance of the qualitative element of our clinical trial is also explored. The Kava Anxiety Depression Spectrum Study (KADSS) is a 3-week placebocontrolled, double-blind, cross-over trial involving 60 adult participants (18—65) with elevated stable anxiety and varying levels of depressive symptoms. Aims: The aims of KADSS are: (1) to determine whether an aqueous standardised extract of kava is effective for the treatment of anxiety; (2) to assess the effects of kava on differing levels of depression; and (3) to explore participants’ experience of taking kava via qualitative research. The study also provides preliminary assessment of the safety of an aqueous extract of kava in humans. Conclusion: If results reveal that the aqueous kava preparation exerts significant anxiolytic effects and appears safe, potentially beneficial impacts may occur. Data supporting a safe and effective kava extract may encourage a re-introduction of kava to Europe, UK and Canada. This may provide a major socioeconomic benefit to Pacific Island nations, and to sufferers of anxiety disorders.

Multi-vehicles interaction graph model for cooperative collision warning system

Cooperative collision warning system for road vehicles, enabled by recent advances in positioning systems and wireless communication technologies, can potentially reduce traffic accident significantly. To improve the system, we propose a graph model to represent interactions between multiple road vehicles in a specific region and at a specific time. Given a list of vehicles in vicinity, we can generate the interaction graph using several rules that consider vehicle's properties such as position, speed, heading, etc. Safety applications can use the model to improve emergency warning accuracy and optimize wireless channel usage. The model allows us to develop some congestion control strategies for an efficient multi-hop broadcast protocol.