نتایج جستجو برای: many stereo

تعداد نتایج: 966297  

2014
Séverine Cloix Guido Bologna Viviana Weiss Thierry Pun David Hasler

With the increasing proportion of senior citizens, many mobility aid devices were developed such as the rollator. However among walker’s users, 87% of their falls is attributed to rollators. The EyeWalker project aims at developing a small device for rollators to protect elderly people from such dangers. Descending stairs are ones of the potential hazards rollator users have to daily face. We p...

2008
Benjamin Bringier David Helbert Majdi Khoudeir

Textured surface analysis is essential for many applications. In this paper, we present a three-dimensional recovery approach for real textured surfaces based on photometric stereo. The aim is to be able to measure the textured surfaces with a high degree of accuracy. For this, we use a color digital sensor and principles of color photometric stereo. This method uses a single color image, inste...

Journal: :Neural Computation 1994
Ning Qian

Many models for stereo disparity computation have been proposed, but few can be said to be truly biological. There is also a rich literature devoted to physiological studies of stereopsis. Cells sensitive to binocular disparity have been found in the visual cortex, but it is not clear whether these cells could be used to compute disparity maps from stereograms. Here we propose a model for biolo...

Journal: :IJAPUC 2013
Yingpeng Yang

Determination of the depth of the image feature distinctive automation and other industries of machine vision and computer vision technology in everyday life are becoming increasingly popular. Some techniques have been proposed to extract from the current depth of a 2D image of the feature, which defines a particular object or structure of the information. In many cases, these techniques are au...

Journal: :Journal of Machine Learning Research 2016
Jure Zbontar Yann LeCun

We present a method for extracting depth information from a rectified image pair. Our approach focuses on the first stage of many stereo algorithms: the matching cost computation. We approach the problem by learning a similarity measure on small image patches using a convolutional neural network. Training is carried out in a supervised manner by constructing a binary classification data set wit...

Journal: :Vision Research 1997
NING QIAN RICHARD A. ERSEN

Many psychophysical and physiological experiments indicate that visual motion analysis and stereoscopic depth perception are processed together in the brain. However, little computational effort has been devoted to combining these two visual modalities into a common framework based on physiological mechanisms. We present such an integrated model in this paper. We have previously developed a phy...

2006
Kan'ya Sasaki Seiji Kameda Atsushi Iwata

A window-based stereo matching, which matches pixel values within a window between two images, produces a dense disparity map, and as a result, constructs a dense depth structure. Many algorithms of the window-based stereo matching have been proposed. The conventional algorithms, however, face a trade-off between accuracies of the disparity map in disparity continuity and discontinuity regions ...

1995
Pascal Fua

We present a framework for 3-D surface reconstruction that can be used to model fully 3-D scenes from an arbitrary number of stereo views taken from vastly different viewpoints. This is a key step toward producing 3-D world-descriptions of complex scenes using stereo and is a very challenging problem: real-world scenes tend to contain many 3-D objects, they do not usually conform to the 2-1/2-D...

2006
Vladimir Kolmogorov Carsten Rother

Algorithms for discrete energy minimization play a fundamental role for low-level vision. Known techniques include graph cuts, belief propagation (BP) and recently introduced tree-reweighted message passing (TRW). So far, the standard benchmark for their comparison has been a 4-connected grid-graph arising in pixel-labelling stereo. This minimization problem, however, has been largely solved: r...

2012
Rachna H.S. Singh A. K. Verma

Stereo correspondence mapping is the fundamental problem to achieve human like vision capabilities to machines and robots. Many local and global algorithms have been reported in literature in the last decade. Window-based cost aggregation methods for solving the correspondence problem have attracted researches as it can be implemented in real time using parallel processors. In this paper a new ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید