Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Similarity measure

Related publications (30)

Apartment Structure Estimation Using Fully Convolutional Networks and Graph Model

Jing Zhang, Jin Zhang

Apartment searching has been a hot demand all over the world. Understanding the apartment structure will significantly contribute to simplifying the searching process. In this project, the fully convolutional networks are applied to generate semantic segme ...

ASSOC COMPUTING MACHINERY2018

Text Similarity in Vector Space Models: A Comparative Study

Kenneth Younge, Omid Shahmirzadi

Automatic measurement of semantic text similarity is an important task in natural language processing. In this paper, we evaluate the performance of different vector space models to perform this task. We address the real-world problem of modeling patent-to ...

2018

Unleashing the power of semantic text analysis: a complex systems approach

Andrea Martini

In the present information era, a huge amount of machine-readable data is available regarding scientific publications. Such unprecedented wealth of data offers the opportunity to investigate science itself as a complex interacting system by means of quanti ...

EPFL2018

Personalized Anatomic Eye Model From T1-Weighted Volume Interpolated Gradient Echo Magnetic Resonance Imaging of Patients With Uveal Melanoma

Meritxell Bach Cuadra, Raphael Sznitman, Alessia Pica

Purpose: We present a 3-dimensional patient-specific eye model from magnetic resonance imaging (MRI) for proton therapy treatment planning of uveal melanoma (UM). During MRI acquisition of UM patients, the point fixation can be difficult and, together with ...

ELSEVIER SCIENCE INC2018

Learning embeddings: efficient algorithms and applications

Cijo Jose

Learning to embed data into a space where similar points are together and dissimilar points are far apart is a challenging machine learning problem. In this dissertation we study two learning scenarios that arise in the context of learning embeddings and o ...

EPFL2018

Capturing the Moment: Lightweight Similarity Computations

Rachid Guerraoui, Rhicheek Patra, Georgios Damaskinos

Similarity computations are crucial in various web activities like advertisements, search or trust-distrust predictions. These similarities often vary with time as product perception and popularity constantly change with users' evolving inclination. The hu ...

IEEE2017

Quantifying similarity of pore-geometry in nanoporous materials

Berend Smit, Kathryn Hess Bellwald, Senja Dominique Barthel, Yongjin Lee

In most applications of nanoporous materials the pore structure is as important as the chemical composition as a determinant of performance. For example, one can alter performance in applications like carbon capture or methane storage by orders of magnitud ...

Nature Publishing Group2017

Semi-automatic 3D morphological reconstruction of neurons with densely branching morphology: Application to retinal All amacrine cells imaged with multi -photon excitation microscopy

Bas-Jan Zandt

Background: Accurate reconstruction of the morphology of single neurons is important for morphometric studies and for developing compartmental models. However, manual morphological reconstruction can be extremely time-consuming and error-prone and algorith ...

Elsevier2017

Closed-Form Alignment of Active Surface Models Using Splines

Michaël Unser, Daniel Andreas Schmitter

We propose a new formulation of the active surface model in 3D. Instead of aligning a shape dictionary through the similarity transform, we consider more flexible affine transformations and introduce an alignment method that is unbiased in the sense that i ...

IEEE2017

Accelerated Spectral Clustering Using Graph Filtering of Random Signals

Pierre Vandergheynst, Rémi Gribonval, Gilles Puy

We build upon recent advances in graph signal processing to propose a faster spectral clustering algorithm. Indeed, classical spectral clustering is based on the computation of the first

k

eigenvectors of the similarity matrix' Laplacian, whose computati ...

Ieee2016

Related publications (30)

Personalized Anatomic Eye Model From T1-Weighted Volume Interpolated Gradient Echo Magnetic Resonance Imaging of Patients With Uveal Melanoma

Meritxell Bach Cuadra, Raphael Sznitman, Alessia Pica

ELSEVIER SCIENCE INC2018

Semi-automatic 3D morphological reconstruction of neurons with densely branching morphology: Application to retinal All amacrine cells imaged with multi -photon excitation microscopy

Bas-Jan Zandt

Elsevier2017

Closed-Form Alignment of Active Surface Models Using Splines

Michaël Unser, Daniel Andreas Schmitter

IEEE2017

Accelerated Spectral Clustering Using Graph Filtering of Random Signals

Pierre Vandergheynst, Rémi Gribonval, Gilles Puy

We build upon recent advances in graph signal processing to propose a faster spectral clustering algorithm. Indeed, classical spectral clustering is based on the computation of the first

k

eigenvectors of the similarity matrix' Laplacian, whose computati ...

Ieee2016