Publication

Saliency-based representations and multi-component classifiers for visual scene recognition

Related publications (212)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Keyword-based Image Color Re-rendering with Semantic Segmentation

Sabine Süsstrunk, Fayez Lahoud, Bin Jin

Keyword-based image color re-rendering is a convenient way to enhance the color of images. Most methods only focus on the color characteristics of the image while ignoring the semantic meaning of different regions. We propose to incorporate semantic inform ...

2017

Multiscale Centerline Extraction Based on Regression and Projection onto the Set of Elongated Structures

Amos Sironi

Automatically extracting linear structures from images is a fundamental low-level vision problem with numerous applications in different domains. Centerline detection and radial estimation are the first crucial steps in most Computer Vision pipelines aimin ...

EPFL2016

Fast Robust PCA on Graphs

Pierre Vandergheynst, Gilles Puy, Nathanaël Perraudin, Nauman Shahid, Vasilis Kalofolias

Mining useful clusters from high dimensional data has received significant attention of the computer vision and pattern recognition community in the recent years. Linear and non-linear dimensionality reduction has played an important role to overcome the c ...

Ieee-Inst Electrical Electronics Engineers Inc2016

CP-CHARM: Segmentation-Free Image Classification Made Accessible

Virginie Sophie Uhlmann

Background: Automated classification using machine learning often relies on features derived from segmenting individual objects, which can be difficult to automate. WND-CHARM is a previously developed classification algorithm in which features are computed ...

2016

Sentiment Classification of Tweets using Hierarchical Classification

Afroze Ibrahim Baqapuri

This paper addresses the problem of sentiment classification of short messages on microblogging platforms. We apply machine learning and pattern recognition techniques to design and implement a classification system for microblog messages assigning them in ...

Ieee2016

Distribution-Matching Embedding for Visual Domain Adaptation

Mathieu Salzmann

Domain-invariant representations are key to addressing the domain shift problem where the training and test examples follow different distributions. Existing techniques that have attempted to match the distributions of the source and target domains typical ...

2016

Efficient Transductive Semantic Segmentation

Mathieu Salzmann

Semantically describing the contents of images is one of the classical problems of computer vision. With huge numbers of images being made available daily, there is increasing interest in methods for semantic pixel labelling that exploit large image sets. ...

Ieee2016

Convex block-sparse linear regression with expanders - provably

Volkan Cevher, Quoc Tran Dinh, Anastasios Kyrillidis, Luca Baldassarre, Bubacarr Bah

Sparse matrices are favorable objects in machine learning and optimization. When such matrices are used, in place of dense ones, the overall complexity requirements in optimization can be significantly reduced in practice, both in terms of space and run-ti ...

2016

Minkowski space is locally the Noldus limit of Poisson process causets

Jan Cristina

A Poisson process P-lambda on R-d with causal structure inherited from the the usual Minkowski metric on R-d has a normalised discrete causal distance D-lambda (x, y) given by the height of the longest causal chain normalised by lambda(1/d)c(d). We prove t ...

Iop Publishing Ltd2016

Fast K-Means with Accurate Bounds

François Fleuret, James Peter Newling

We propose a novel accelerated exact

k

-means algorithm, which outperforms the current state-of-the-art low-dimensional algorithm in 18 of 22 experiments, running up to 3

\times

faster. We also propose a general improvement of existing state-of-the-art a ...

Idiap2016

Fast K-Means with Accurate Bounds

François Fleuret, James Peter Newling

We propose a novel accelerated exact

k

-means algorithm, which outperforms the current state-of-the-art low-dimensional algorithm in 18 of 22 experiments, running up to 3

\times

faster. We also propose a general improvement of existing state-of-the-art a ...

Idiap2016