Sentiment Recognition in Egocentric Photostreams

Lifelogging is a process of collecting rich source of information about daily life of people. In this paper, we introduce the problem of sentiment analysis in egocentric events focusing on the moments that compose the images recalling positive, neutral or negative feelings to the observer. We propose a method for the classification of the sentiments in egocentric pictures based on global and semantic image features extracted by Convolutional Neural Networks. We carried out experiments on an egocentric dataset, which we organized in 3 classes on the basis of the sentiment that is recalled to the user (positive, negative or neutral)

On the Uniform Random Generation of Non Deterministic Automata Up to Isomorphism

In this paper we address the problem of the uniform random generation of non deterministic automata (NFA) up to isomorphism. First, we show how to use a Monte-Carlo approach to uniformly sample a NFA. Secondly, we show how to use the Metropolis-Hastings Algorithm to uniformly generate NFAs up to isomorphism. Using labeling techniques, we show that in practice it is possible to move into the modified Markov Chain efficiently, allowing the random generation of NFAs up to isomorphism with dozens of states. This general approach is also applied to several interesting subclasses of NFAs (up to isomorphism), such as NFAs having a unique initial states and a bounded output degree. Finally, we prove that for these interesting subclasses of NFAs, moving into the Metropolis Markov chain can be done in polynomial time. Promising experimental results constitute a practical contribution.Comment: Frank Drewes. CIAA 2015, Aug 2015, Umea, Sweden. Springer, 9223, pp.12, 2015, Implementation and Application of Automata - 20th International Conferenc

Subgraph spotting in graph representations of comic book images

This is the author accepted manuscript. The final version is available from Elsevier via the DOI in this record Graph-based representations are the most powerful data structures for extracting, representing and preserving the structural information of underlying data. Subgraph spotting is an interesting research problem, especially for studying and investigating the structural information based content-based image retrieval (CBIR) and query by example (QBE) in image databases. In this paper we address the problem of lack of freely available ground-truthed datasets for subgraph spotting and present a new dataset for subgraph spotting in graph representations of comic book images (SSGCI) with its ground-truth and evaluation protocol. Experimental results of two state-of-the-art methods of subgraph spotting are presented on the new SSGCI dataset.University of La Rochelle (France

Design of technology-based rehabilitation pathways: the experience of Santobono-Pausilipon Hospital

The fields of rehabilitation robotics and virtual reality (VR) are becoming a growing area in the clinical rehabilitation of people with motion impairments. These systems have the potential to assess abilities through physiological measurements and modelling activities such as posture, gait, and balance. They can be used as rehabilitative tools by providing patients with task-specific training in a motivating and engaging way too. Although the potential advantages of such systems, until now there is a general limitation of their use in rehabilitative practice. Robotics and VR systems can be challenging, engaging and fun, particularly for children with disabilities, since they are often not very motivated to comply with conventional therapy. The aim of this work is to accurately describe the clinical use of innovative rehabilitative technologies and their use for the development of two technology-based rehabilitation pathways for the treatment of gait disorders following obesity and neurological diseases in treatment of pediatric patients

GraphFind: enhancing graph searching by low support data mining techniques

<p>Abstract</p> <p>Background</p> <p>Biomedical and chemical databases are large and rapidly growing in size. Graphs naturally model such kinds of data. To fully exploit the wealth of information in these graph databases, a key role is played by systems that search for all exact or approximate occurrences of a query graph. To deal efficiently with graph searching, advanced methods for indexing, representation and matching of graphs have been proposed.</p> <p>Results</p> <p>This paper presents GraphFind. The system implements efficient graph searching algorithms together with advanced filtering techniques that allow approximate search. It allows users to select candidate subgraphs rather than entire graphs. It implements an effective data storage based also on low-support data mining.</p> <p>Conclusions</p> <p>GraphFind is compared with Frowns, GraphGrep and gIndex. Experiments show that GraphFind outperforms the compared systems on a very large collection of small graphs. The proposed low-support mining technique which applies to any searching system also allows a significant index space reduction.</p

Generalised median of a set of correspondences based on the hamming distance.

A correspondence is a set of mappings that establishes a relation between the elements of two data structures (i.e. sets of points, strings, trees or graphs). If we consider several correspondences between the same two structures, one option to define a representative of them is through the generalised median correspondence. In general, the computation of the generalised median is an NP-complete task. In this paper, we present two methods to calculate the generalised median correspondence of multiple correspondences. The first one obtains the optimal solution in cubic time, but it is restricted to the Hamming distance. The second one obtains a sub-optimal solution through an iterative approach, but does not have any restrictions with respect to the used distance. We compare both proposals in terms of the distance to the true generalised median and runtime

Graph edit distance or graph edit pseudo-distance?

Graph Edit Distance has been intensively used since its appearance in 1983. This distance is very appropriate if we want to compare a pair of attributed graphs from any domain and obtain not only a distance, but also the best correspondence between nodes of the involved graphs. In this paper, we want to analyse if the Graph Edit Distance can be really considered a distance or a pseudo-distance, since some restrictions of the distance function are not fulfilled. Distinguishing between both cases is important because the use of a distance is a restriction in some methods to return exact instead of approximate results. This occurs, for instance, in some graph retrieval techniques. Experimental validation shows that in most of the cases, it is not appropriate to denominate the Graph Edit Distance as a distance, but a pseudo-distance instead, since the triangle inequality is not fulfilled. Therefore, in these cases, the graph retrieval techniques not always return the optimal graph

Analysis of Intracellular State Based on Controlled 3D Nanostructures Mediated Surface Enhanced Raman Scattering

Near-infrared surface-enhanced Raman spectroscopy (SERS) is a powerful technique for analyzing the chemical composition within a single living cell at unprecedented resolution. However, current SERS methods employing uncontrollable colloidal metal particles or non-uniformly distributed metal particles on a substrate as SERS-active sites show relatively low reliability and reproducibility. Here, we report a highly-ordered SERS-active surface that is provided by a gold nano-dots array based on thermal evaporation of gold onto an ITO surface through a nanoporous alumina mask. This new combined technique showed a broader distribution of hot spots and a higher signal-to-noise ratio than current SERS techniques due to the highly reproducible and uniform geometrical structures over a large area. This SERS-active surface was applied as cell culture system to study living cells in situ within their culture environment without any external preparation processes. We applied this newly developed method to cell-based research to differentiate cell lines, cells at different cell cycle stages, and live/dead cells. The enhanced Raman signals achieved from each cell, which represent the changes in biochemical compositions, enabled differentiation of each state and the conditions of the cells. This SERS technique employing a tightly controlled nanostructure array can potentially be applied to single cell analysis, early cancer diagnosis and cell physiology research

Clinical features and comorbidity pattern of HCV infected migrants compared to native patients in care in Italy: A real-life evaluation of the PITER cohort

Background: Direct-acting antivirals are highly effective for the treatment of hepatitis C virus (HCV) infection, regardless race/ethnicity. We aimed to evaluate demographic, virological and clinical data of HCV-infected migrants vs. natives consecutively enrolled in the PITER cohort. Methods: Migrants were defined by country of birth and nationality that was different from Italy. Mann-Whitney U test, Chi-squared test and multiple logistic regression were used. Results: Of 10,669 enrolled patients, 301 (2.8%) were migrants: median age 47 vs. 62 years, (p &lt; 0.001), females 56.5% vs. 45.3%, (p &lt; 0.001), HBsAg positivity 3.8% vs. 1.4%, (p &lt; 0.05). Genotype 1b was prevalent in both groups, whereas genotype 4 was more prevalent in migrants (p &lt; 0.05). Liver disease severity and sustained virologic response (SVR) were similar. A higher prevalence of comorbidities was reported for natives compared to migrants (p &lt; 0.05). Liver disease progression cofactors (HBsAg, HIV coinfection, alcohol abuse, potential metabolic syndrome) were present in 39.1% and 47.1% (p &gt; 0.05) of migrants and natives who eradicated HCV, respectively. Conclusion: Compared to natives, HCV-infected migrants in care have different demographics, HCV genotypes, viral coinfections and comorbidities and similar disease severity, SVR and cofactors for disease progression after HCV eradication. A periodic clinical assessment after HCV eradication in Italians and migrants with cofactors for disease progression is warranted