Concept

Stéréoscopie

Publications associées (187)

Retrieval of occluded images using DCT phase and region merging

Pierre-André Farine, Sara Grassi Pauletti, Pradyumna Ayyalasomayajula

In this paper we present an efficient method for Content Based Image Retrieval (CBIR) of occluded images using DCT-phase. The proposed method utilizes a novel correlation metric for ternary-valued DCT-phase, as well as a region merging method to reconstruc ...

IEEE2012

Large-scale Plasmonic Microarray: A New Approach for Label-free High-throughput Biosensing and Screening

Hatice Altug, Serap Aksu, Min Huang

We present a large-scale label-free microarray with over one million plasmonic nanohole array sensors on a microscope slide. A dual-color filter imaging method is invented to dramatically increase the sensor performance in a highly-multiplexed manner. ...

IEEE2012

Sparse stereo image coding with learned dictionaries

Pascal Frossard, Ivana Tosic, Dimitri Palaz

This paper proposes a framework for stereo image coding with effective representation of geometry in 3D scenes. We propose a joint sparse approximation framework for pairs of perspective images that are represented as linear expansions of atoms selected fr ...

2011

Stereoscopic High Dynamic Range Video

Dominic Rüfenacht

Stereoscopic video content is usually being created by using two or more cameras which are recording the same scene. Traditionally, those cameras have the exact same intrinsic camera parameters. In this project, the exposure times of the cameras differ, al ...

2011

Motion Parallax Based Restitution of 3D Images on Legacy Consumer Mobile Devices

Touradj Ebrahimi, Martin Rerabek, Jong Seok Lee, Lutz Goldmann

While 3D display technologies are already widely available for cinema and home or corporate use, only a few portable devices currently feature 3D display capabilities. Moreover, the large majority of 3D display solutions rely on binocular perception. In th ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2011

Dictionary learning in stereo imaging

Pascal Frossard, Ivana Tosic

This paper presents a new method for learning overcomplete dictionaries adapted to efficient joint representation of stereo images. We first formulate a sparse stereo image model where the multi-view correlation is described by local geometric transforms o ...

Institute of Electrical and Electronics Engineers2011

Automated Detection and Delineation of Tree Structures in Noisy Micrographs

Germán González Serrano

Despite more than a century of research, we still lack a concise description of the different types of neurons in the brain. This is a result of their large variance in morphology and the time consuming reconstruction process. In this thesis we design nove ...

EPFL2011

Daisy: An Efficient Dense Descriptor Applied to Wide Baseline Stereo

Pascal Fua, Vincent Lepetit, Engin Tola

In this paper, we introduce a local image descriptor, DAISY, which is very efficient to compute densely. We also present an EM based algorithm to compute dense depth and occlusion maps from wide baseline image pairs using this descriptor. This yields much ...

Institute of Electrical and Electronics Engineers2010

Large occlusion completion using normal maps

Pascal Fua, Christoph Strecha, Engin Tola, Andrea Fossati

Dense disparity maps can be computed from wide-baseline stereo pairs but will inevitably contain large areas where the depth cannot be estimated accurately because the pixels are seen in one view only. A traditional approach to this problem is to introduce ...

2010

Disparity Search Range Estimation: Enforcing Temporal Consistency

Zafer Arican

This paper presents a new approach for estimating the disparity search range in stereo video that enforces temporal consistency. Reliable search range estimation is very important since an incorrect estimate causes most stereo matching methods to get trapp ...

2010

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search