M. Gelautz - Academia.edu (original) (raw)
Papers by M. Gelautz
The 3D reconstruction of image and video scenes by stereo analysis is an important topic in compu... more The 3D reconstruction of image and video scenes by stereo analysis is an important topic in computer vision research. In this talk, we first present some principles of stereo algorithms and recent developments. We then demonstrate two applications of stereo reconstruction for the analysis and visualization of human movement: (a) We employ depth maps derived from sport scenes for novel view synthesis, and (b) we show how stereo processing can be used for expressive visualization of human motion in a comic-like style.
2014 22nd European Signal Processing Conference (EUSIPCO), 2014
We present stereo matching solutions based on a fast cost-volume filtering approach for High Dyna... more We present stereo matching solutions based on a fast cost-volume filtering approach for High Dynamic Range (HDR) scenes. Multi-exposed stereo images are captured and used to generate HDR and Tone Mapped (TM) images of the left and right views. We perform stereo matching on conventional, Low Dynamic Range (LDR) images, original HDR, as well as TM images by customizing the matching algorithm for each of them. An evaluation on the disparity maps computed from the different approaches demonstrates that stereo matching on HDR images outperforms conventional LDR stereo matching and TM stereo matching, with the most discriminative disparity maps achieved by using HDR color information and log-luminance gradient values for matching cost calculation.
We present a new image-based stereoscopic painterly algorithm that we use to automatically genera... more We present a new image-based stereoscopic painterly algorithm that we use to automatically generate stereoscopic paintings. Our work is motivated by contemporary painters who have explored the aesthetic implications of painting stereo pairs of canvases. We base our method on two real images, acquired from spatially displaced cameras. We derive a depth map by utilizing computer vision depth-from-stereo techniques and use this information to plan and render stereo paintings. These paintings can be viewed stereoscopically, in which case the pictorial medium is perceptually extended by the viewer to better suggest the sense of distance.
2004 International Conference on Image Processing, 2004. ICIP '04.
We propose a new stereo algorithm which uses colour segmentation to allow the handling of large u... more We propose a new stereo algorithm which uses colour segmentation to allow the handling of large untextured regions and precise localization of depth boundaries. Each segment is modelled as a plane. Robustness of the depth representation is achieved by the use of a layered model. Layers are extracted by mean-shift-based clustering of depth planes. For layer assignment a global cost function is defined. The quality of the disparity map is measured by warping the reference image to the second view and comparing it with the real image. Z-buffering enforces visibility and allows the explicit detection of occlusions. An efficient greedy algorithm searches for a local minimum of the cost function. Layer extraction and assignment are alternately applied. Results obtained for benchmark and self-recorded images indicate that the proposed algorithm can compete with the state-of-the-art.
IGARSS '96. 1996 International Geoscience and Remote Sensing Symposium
We carry out tests with two readily available autoinated matching algorithms in their application... more We carry out tests with two readily available autoinated matching algorithms in their application to (a) Magellan SAR stereo images, and (b) ERS-1 and X-SARL realsimulated images. The match points, are examined visually, and an accuracy analysis on Magellan data is performed by comparison with manual measurements.
2009 IEEE Conference on Computer Vision and Pattern Recognition, 2009
The availability of quantitative online benchmarks for low-level vision tasks such as stereo and ... more The availability of quantitative online benchmarks for low-level vision tasks such as stereo and optical flow has led to significant progress in the respective fields. This paper introduces such a benchmark for image matting. There are three key factors for a successful benchmarking system: (a) a challenging, high-quality ground truth test set; (b) an online evaluation repository that is dynamically updated with new results; (c) perceptually motivated error functions. Our new benchmark strives to meet all three criteria. We evaluated several matting methods with our benchmark and show that their performance varies depending on the error function. Also, our challenging test set reveals problems of existing algorithms, not reflected in previously reported results. We hope that our effort will lead to considerable progress in the field of image matting, and welcome the reader to visit our benchmark at www.alphamatting.com.
2009 IEEE Conference on Computer Vision and Pattern Recognition, 2009
Image Quality and System Performance VI, 2009
Recently, the quantitative evaluation of interactive single image matting techniques has become p... more Recently, the quantitative evaluation of interactive single image matting techniques has become possible by the introduction of high-quality ground truth datasets. However, quantitative comparisons conducted in previous work are based on error metrics (e.g. sum of absolute differences) that are not necessarily correlated to the visual quality of the image as perceived by the user. This motivates research to better understand the perception of errors inherent to matting algorithms, in order to provide the ground for a future design of error metrics that better reflect the subjective impression of the human observer. In this work we gain novel insights into the perception of errors due to imperfect matting results. To investigate these errors, we compare two recent state-of-the-art matting algorithms in a user study. We use an eye-tracker to reveal details of the decision making of the users. The data acquired in the user study show a considerable correlation between expert knowledge in photography and the ability of the user to detect errors in the image. This is also reflected in the eye-tracking data which reveals different types of scanning paths dependent on the experience of the user.
IEEE International Conference on Image Processing 2005, 2005
We present a method to generate stylized stereo imagery that effectively communicates shape and d... more We present a method to generate stylized stereo imagery that effectively communicates shape and distance of the de- picted scene objects. We use computer vision techniques to analyze real stereo image pairs. In particular, a region based stereo matching algorithm with symmetrical treatment of occlusions is used to extract a disparity map and succes- sively the depth information of the
2009 Proceedings of 6th International Symposium on Image and Signal Processing and Analysis, 2009
We describe a method that considerably improves the computational behaviour of H.264 Intra-only e... more We describe a method that considerably improves the computational behaviour of H.264 Intra-only encoders. Such Intra-only encoders come to use in video-cutting and low-latency video coding where temporal prediction via using Inter-frames is no feasible option. We identify the spatial prediction step as the computational bottleneck in Intraonly encoders. In this step, the encoder tests various modes that represent predictions of the current macroblock's or sub-macroblock's texture from spatial neighbouring pixels in order to find the mode of lowest residuum. Unfortunately, testing the complete set of allowed modes is computational expensive. However, as is demonstrated by an analysis provided in this paper, it is reasonable to assume that a large percentage of blocks preserve their prediction modes over time. Based on this assumption we develop two algorithms that improve the computation time in the prediction step. These algorithms differ by their criteria used to decide whether a block's coding mode can be propagated from a temporal preceding frame. Computational speed is enhanced, since we test the full set of modes only for blocks that fail these criteria. Experimental results show that our methods considerably improve the execution time of an Intra-only encoder and only show small impact on data-rate and image quality.
Stereoscopic Displays and Applications XXV, 2014
We propose an efficient disparity map enhancement method that improves the alignment of disparity... more We propose an efficient disparity map enhancement method that improves the alignment of disparity edges and color edges even in the presence of mixed pixels and provides alpha values for pixels at disparity edges as a byproduct. In contrast to previous publications, the proposed method addresses mixed pixels at disparity edges and does not introduce mixed disparities that can lead to object deformations in synthesized views. The proposed algorithm computes transparencies by performing alpha matting per disparity-layer. These alpha values indicate the degree of affiliation to a disparity-layer and can hence be used as an indicator for a disparity reassignment that aligns disparity edges with color edges and accounts for mixed pixels. We demonstrate the capabilities of the proposed method on various images and corresponding disparity maps, including images that contain fuzzy object borders (e.g., fur). Furthermore, the proposed method is qualitatively and quantitatively evaluated using disparity ground truth and compared to previously published disparity post-processing methods.
Proceedings of the 6th International Conference on Advances in Mobile Computing and Multimedia, 2008
The high computational demands of the H.264 decoding process pose serious challenges on current p... more The high computational demands of the H.264 decoding process pose serious challenges on current processor architectures. A natural way to tackle this problem is the use of multi-core systems. The contribution of this paper lies in a systematic overview and performance evaluation of parallel video decoding approaches. Our study investigates six methods for accomplishing data-parallel splitting in strongly resource-restricted environments inherent to mobile devices. These methods are compared against each other in terms of run-time complexity, core usage, inter-communication and bus transfers. We present benchmark results using different numbers of processor cores. Our results shall aid in finding a splitting strategy that is best suited for the targeted hardware-architecture.
Journal of Electronic Imaging, 2014
ABSTRACT We present two improvement techniques for stereo matching algorithms using silicon retin... more ABSTRACT We present two improvement techniques for stereo matching algorithms using silicon retina sensors. We verify the results with ground truth data. In contrast to conventional monochrome/color cameras, silicon retina sensors deliver an asynchronous flow of events instead of common framed and discrete intensity or color images. While using this kind of sensor in a stereo setup to enable new fields of applications, it also introduces new challenges in terms of stereo image analysis. Using this type of sensor, stereo matching algorithms have to deal with sparse event data, thus, less information. This affects the quality of the achievable disparity results and renders improving the stereo matching algorithms a necessary task. For this reason, we introduce two techniques for increasing the accuracy of silicon retina stereo results, in the sense that the average distance error is reduced. The first method is an adapted belief propagation approach optimizing the initial matching cost volume, and the second is an innovative two-stage postfilter for smoothing and outlier rejection. The evaluation shows that the proposed techniques increase the accuracy of the stereo matching and constitute a useful extension for using silicon retina sensors for depth estimation. (C) 2014 SPIE and IS&T
2009 Fifth International Conference on Image and Graphics, 2009
We present a simple and fast method for performing unsupervised segmentation. Our method works by... more We present a simple and fast method for performing unsupervised segmentation. Our method works by centering a square window on each pixel of the input image. Each pixel is then assigned to a new color which is computed by averaging the pixel colors inside the window. The idea is that if this averaging operation is repeated a few times then we should obtain an image in which pixels of the same color surface are assigned to the same (or at least to very similar) color values. Consequently, the desired color segments are formed by groups of spatially neighboring pixels that share the same color in the convolved image. Obviously, our method would deliver poor performance if the averaging operation is applied in a naive manner, as pixel colors of different segments would be mixed. To overcome this problem, we propose to compute a geodesic weight mask that regulates a pixel's influence in the averaging operation. A pixel's weight in the window is determined by computing the geodesic distance to the center pixel. In other words, we enforce that a pixel obtains high influence only if there exists a path to the center pixel along which the color does not change significantly (connectivity). The proposed method is evaluated on some widely used test images. Our method seems to produce accurate segmentation results and to capture object outlines correctly. We show by quantitative evaluation that our segmentation algorithm outperforms two competing segmentation methods.
Pattern Recognition and Image Analysis, 2007
In this paper, we present an algorithm to combine edge information from stereo-derived disparity ... more In this paper, we present an algorithm to combine edge information from stereo-derived disparity maps with edges from the original intensity/color image to improve the contour detection in images of natural scenes. After computing the disparity map, we generate a so-called "edge-combination image," which relies on those edges of the original image that are also present in the stereo map. We describe an algorithm to identify corresponding intensity and disparity edges, which are usually not perfectly aligned due to errors in the stereo reconstruction. Our experiments show that the proposed edge-combination approach can significantly improve the segmentation results of an active contour algorithm.
ISPRS Journal of Photogrammetry and Remote Sensing, 1998
... to extract the snow cover from a geomet rically and radiometrically corrected SAR data set, M... more ... to extract the snow cover from a geomet rically and radiometrically corrected SAR data set, M ... In order to achieve high geometric precision, a rigorous mapping model based on the ... The current implementation is specially suited to applications in alpine terrain, where SAR layover ...
International Journal of Remote Sensing, 2003
In this experiment, we derive and compare radar stereo and interferometric digital elevation mode... more In this experiment, we derive and compare radar stereo and interferometric digital elevation models (DEMs) of a study site in Djibouti, East Africa. A Radarsat stereo pair, as well as Radarsat and ERS-2 interferometric data, comprise the test images. The primary objective of the study was to analyse and compare the results obtained by the two techniques and explore possible synergisms between them. We find that in regions of high coherence, the DEMs produced by interferometry are of much better quality than the stereo result. However, the corresponding error histograms also show some pronounced errors due to decorrelation and phase-unwrapping problems on forested mountain slopes. On the other hand, the more robust stereo reconstruction, with an error standard deviation of 45 m, is able to capture the general terrain shape, although finer surface details are lost. In the second part of our experiment, we demonstrate that merging the stereoscopic and interferometric DEMs by applying a user-defined weighting function to a filtered coherence map can significantly improve the accuracy of the computed elevation maps.
Computer Graphics Forum, 2006
... Computational Aesthetics 2005 Eurographics Workshop on Computational Aesthetics in Graphics, ... more ... Computational Aesthetics 2005 Eurographics Workshop on Computational Aesthetics in Graphics, Visualization and Imaging Girona, Spain, 1820 May 2005. László Neumann,; Mateu Sbert,;Bruce Gooch,; Werner Purgathofer. Article first published online: 15 MAR 2006. ...
We describe the methodology, design considerations and practical implementation of an environment... more We describe the methodology, design considerations and practical implementation of an environment used in developing and testing video-based, multiview computer vision algo- rithms. The environment we have built is composed by a variety of heterogeneous hard- ware devices for acquisition and display, connected together into a coherent system by object-oriented software components. Much attention has been paid into the development
The 3D reconstruction of image and video scenes by stereo analysis is an important topic in compu... more The 3D reconstruction of image and video scenes by stereo analysis is an important topic in computer vision research. In this talk, we first present some principles of stereo algorithms and recent developments. We then demonstrate two applications of stereo reconstruction for the analysis and visualization of human movement: (a) We employ depth maps derived from sport scenes for novel view synthesis, and (b) we show how stereo processing can be used for expressive visualization of human motion in a comic-like style.
2014 22nd European Signal Processing Conference (EUSIPCO), 2014
We present stereo matching solutions based on a fast cost-volume filtering approach for High Dyna... more We present stereo matching solutions based on a fast cost-volume filtering approach for High Dynamic Range (HDR) scenes. Multi-exposed stereo images are captured and used to generate HDR and Tone Mapped (TM) images of the left and right views. We perform stereo matching on conventional, Low Dynamic Range (LDR) images, original HDR, as well as TM images by customizing the matching algorithm for each of them. An evaluation on the disparity maps computed from the different approaches demonstrates that stereo matching on HDR images outperforms conventional LDR stereo matching and TM stereo matching, with the most discriminative disparity maps achieved by using HDR color information and log-luminance gradient values for matching cost calculation.
We present a new image-based stereoscopic painterly algorithm that we use to automatically genera... more We present a new image-based stereoscopic painterly algorithm that we use to automatically generate stereoscopic paintings. Our work is motivated by contemporary painters who have explored the aesthetic implications of painting stereo pairs of canvases. We base our method on two real images, acquired from spatially displaced cameras. We derive a depth map by utilizing computer vision depth-from-stereo techniques and use this information to plan and render stereo paintings. These paintings can be viewed stereoscopically, in which case the pictorial medium is perceptually extended by the viewer to better suggest the sense of distance.
2004 International Conference on Image Processing, 2004. ICIP '04.
We propose a new stereo algorithm which uses colour segmentation to allow the handling of large u... more We propose a new stereo algorithm which uses colour segmentation to allow the handling of large untextured regions and precise localization of depth boundaries. Each segment is modelled as a plane. Robustness of the depth representation is achieved by the use of a layered model. Layers are extracted by mean-shift-based clustering of depth planes. For layer assignment a global cost function is defined. The quality of the disparity map is measured by warping the reference image to the second view and comparing it with the real image. Z-buffering enforces visibility and allows the explicit detection of occlusions. An efficient greedy algorithm searches for a local minimum of the cost function. Layer extraction and assignment are alternately applied. Results obtained for benchmark and self-recorded images indicate that the proposed algorithm can compete with the state-of-the-art.
IGARSS '96. 1996 International Geoscience and Remote Sensing Symposium
We carry out tests with two readily available autoinated matching algorithms in their application... more We carry out tests with two readily available autoinated matching algorithms in their application to (a) Magellan SAR stereo images, and (b) ERS-1 and X-SARL realsimulated images. The match points, are examined visually, and an accuracy analysis on Magellan data is performed by comparison with manual measurements.
2009 IEEE Conference on Computer Vision and Pattern Recognition, 2009
The availability of quantitative online benchmarks for low-level vision tasks such as stereo and ... more The availability of quantitative online benchmarks for low-level vision tasks such as stereo and optical flow has led to significant progress in the respective fields. This paper introduces such a benchmark for image matting. There are three key factors for a successful benchmarking system: (a) a challenging, high-quality ground truth test set; (b) an online evaluation repository that is dynamically updated with new results; (c) perceptually motivated error functions. Our new benchmark strives to meet all three criteria. We evaluated several matting methods with our benchmark and show that their performance varies depending on the error function. Also, our challenging test set reveals problems of existing algorithms, not reflected in previously reported results. We hope that our effort will lead to considerable progress in the field of image matting, and welcome the reader to visit our benchmark at www.alphamatting.com.
2009 IEEE Conference on Computer Vision and Pattern Recognition, 2009
Image Quality and System Performance VI, 2009
Recently, the quantitative evaluation of interactive single image matting techniques has become p... more Recently, the quantitative evaluation of interactive single image matting techniques has become possible by the introduction of high-quality ground truth datasets. However, quantitative comparisons conducted in previous work are based on error metrics (e.g. sum of absolute differences) that are not necessarily correlated to the visual quality of the image as perceived by the user. This motivates research to better understand the perception of errors inherent to matting algorithms, in order to provide the ground for a future design of error metrics that better reflect the subjective impression of the human observer. In this work we gain novel insights into the perception of errors due to imperfect matting results. To investigate these errors, we compare two recent state-of-the-art matting algorithms in a user study. We use an eye-tracker to reveal details of the decision making of the users. The data acquired in the user study show a considerable correlation between expert knowledge in photography and the ability of the user to detect errors in the image. This is also reflected in the eye-tracking data which reveals different types of scanning paths dependent on the experience of the user.
IEEE International Conference on Image Processing 2005, 2005
We present a method to generate stylized stereo imagery that effectively communicates shape and d... more We present a method to generate stylized stereo imagery that effectively communicates shape and distance of the de- picted scene objects. We use computer vision techniques to analyze real stereo image pairs. In particular, a region based stereo matching algorithm with symmetrical treatment of occlusions is used to extract a disparity map and succes- sively the depth information of the
2009 Proceedings of 6th International Symposium on Image and Signal Processing and Analysis, 2009
We describe a method that considerably improves the computational behaviour of H.264 Intra-only e... more We describe a method that considerably improves the computational behaviour of H.264 Intra-only encoders. Such Intra-only encoders come to use in video-cutting and low-latency video coding where temporal prediction via using Inter-frames is no feasible option. We identify the spatial prediction step as the computational bottleneck in Intraonly encoders. In this step, the encoder tests various modes that represent predictions of the current macroblock's or sub-macroblock's texture from spatial neighbouring pixels in order to find the mode of lowest residuum. Unfortunately, testing the complete set of allowed modes is computational expensive. However, as is demonstrated by an analysis provided in this paper, it is reasonable to assume that a large percentage of blocks preserve their prediction modes over time. Based on this assumption we develop two algorithms that improve the computation time in the prediction step. These algorithms differ by their criteria used to decide whether a block's coding mode can be propagated from a temporal preceding frame. Computational speed is enhanced, since we test the full set of modes only for blocks that fail these criteria. Experimental results show that our methods considerably improve the execution time of an Intra-only encoder and only show small impact on data-rate and image quality.
Stereoscopic Displays and Applications XXV, 2014
We propose an efficient disparity map enhancement method that improves the alignment of disparity... more We propose an efficient disparity map enhancement method that improves the alignment of disparity edges and color edges even in the presence of mixed pixels and provides alpha values for pixels at disparity edges as a byproduct. In contrast to previous publications, the proposed method addresses mixed pixels at disparity edges and does not introduce mixed disparities that can lead to object deformations in synthesized views. The proposed algorithm computes transparencies by performing alpha matting per disparity-layer. These alpha values indicate the degree of affiliation to a disparity-layer and can hence be used as an indicator for a disparity reassignment that aligns disparity edges with color edges and accounts for mixed pixels. We demonstrate the capabilities of the proposed method on various images and corresponding disparity maps, including images that contain fuzzy object borders (e.g., fur). Furthermore, the proposed method is qualitatively and quantitatively evaluated using disparity ground truth and compared to previously published disparity post-processing methods.
Proceedings of the 6th International Conference on Advances in Mobile Computing and Multimedia, 2008
The high computational demands of the H.264 decoding process pose serious challenges on current p... more The high computational demands of the H.264 decoding process pose serious challenges on current processor architectures. A natural way to tackle this problem is the use of multi-core systems. The contribution of this paper lies in a systematic overview and performance evaluation of parallel video decoding approaches. Our study investigates six methods for accomplishing data-parallel splitting in strongly resource-restricted environments inherent to mobile devices. These methods are compared against each other in terms of run-time complexity, core usage, inter-communication and bus transfers. We present benchmark results using different numbers of processor cores. Our results shall aid in finding a splitting strategy that is best suited for the targeted hardware-architecture.
Journal of Electronic Imaging, 2014
ABSTRACT We present two improvement techniques for stereo matching algorithms using silicon retin... more ABSTRACT We present two improvement techniques for stereo matching algorithms using silicon retina sensors. We verify the results with ground truth data. In contrast to conventional monochrome/color cameras, silicon retina sensors deliver an asynchronous flow of events instead of common framed and discrete intensity or color images. While using this kind of sensor in a stereo setup to enable new fields of applications, it also introduces new challenges in terms of stereo image analysis. Using this type of sensor, stereo matching algorithms have to deal with sparse event data, thus, less information. This affects the quality of the achievable disparity results and renders improving the stereo matching algorithms a necessary task. For this reason, we introduce two techniques for increasing the accuracy of silicon retina stereo results, in the sense that the average distance error is reduced. The first method is an adapted belief propagation approach optimizing the initial matching cost volume, and the second is an innovative two-stage postfilter for smoothing and outlier rejection. The evaluation shows that the proposed techniques increase the accuracy of the stereo matching and constitute a useful extension for using silicon retina sensors for depth estimation. (C) 2014 SPIE and IS&T
2009 Fifth International Conference on Image and Graphics, 2009
We present a simple and fast method for performing unsupervised segmentation. Our method works by... more We present a simple and fast method for performing unsupervised segmentation. Our method works by centering a square window on each pixel of the input image. Each pixel is then assigned to a new color which is computed by averaging the pixel colors inside the window. The idea is that if this averaging operation is repeated a few times then we should obtain an image in which pixels of the same color surface are assigned to the same (or at least to very similar) color values. Consequently, the desired color segments are formed by groups of spatially neighboring pixels that share the same color in the convolved image. Obviously, our method would deliver poor performance if the averaging operation is applied in a naive manner, as pixel colors of different segments would be mixed. To overcome this problem, we propose to compute a geodesic weight mask that regulates a pixel's influence in the averaging operation. A pixel's weight in the window is determined by computing the geodesic distance to the center pixel. In other words, we enforce that a pixel obtains high influence only if there exists a path to the center pixel along which the color does not change significantly (connectivity). The proposed method is evaluated on some widely used test images. Our method seems to produce accurate segmentation results and to capture object outlines correctly. We show by quantitative evaluation that our segmentation algorithm outperforms two competing segmentation methods.
Pattern Recognition and Image Analysis, 2007
In this paper, we present an algorithm to combine edge information from stereo-derived disparity ... more In this paper, we present an algorithm to combine edge information from stereo-derived disparity maps with edges from the original intensity/color image to improve the contour detection in images of natural scenes. After computing the disparity map, we generate a so-called "edge-combination image," which relies on those edges of the original image that are also present in the stereo map. We describe an algorithm to identify corresponding intensity and disparity edges, which are usually not perfectly aligned due to errors in the stereo reconstruction. Our experiments show that the proposed edge-combination approach can significantly improve the segmentation results of an active contour algorithm.
ISPRS Journal of Photogrammetry and Remote Sensing, 1998
... to extract the snow cover from a geomet rically and radiometrically corrected SAR data set, M... more ... to extract the snow cover from a geomet rically and radiometrically corrected SAR data set, M ... In order to achieve high geometric precision, a rigorous mapping model based on the ... The current implementation is specially suited to applications in alpine terrain, where SAR layover ...
International Journal of Remote Sensing, 2003
In this experiment, we derive and compare radar stereo and interferometric digital elevation mode... more In this experiment, we derive and compare radar stereo and interferometric digital elevation models (DEMs) of a study site in Djibouti, East Africa. A Radarsat stereo pair, as well as Radarsat and ERS-2 interferometric data, comprise the test images. The primary objective of the study was to analyse and compare the results obtained by the two techniques and explore possible synergisms between them. We find that in regions of high coherence, the DEMs produced by interferometry are of much better quality than the stereo result. However, the corresponding error histograms also show some pronounced errors due to decorrelation and phase-unwrapping problems on forested mountain slopes. On the other hand, the more robust stereo reconstruction, with an error standard deviation of 45 m, is able to capture the general terrain shape, although finer surface details are lost. In the second part of our experiment, we demonstrate that merging the stereoscopic and interferometric DEMs by applying a user-defined weighting function to a filtered coherence map can significantly improve the accuracy of the computed elevation maps.
Computer Graphics Forum, 2006
... Computational Aesthetics 2005 Eurographics Workshop on Computational Aesthetics in Graphics, ... more ... Computational Aesthetics 2005 Eurographics Workshop on Computational Aesthetics in Graphics, Visualization and Imaging Girona, Spain, 1820 May 2005. László Neumann,; Mateu Sbert,;Bruce Gooch,; Werner Purgathofer. Article first published online: 15 MAR 2006. ...
We describe the methodology, design considerations and practical implementation of an environment... more We describe the methodology, design considerations and practical implementation of an environment used in developing and testing video-based, multiview computer vision algo- rithms. The environment we have built is composed by a variety of heterogeneous hard- ware devices for acquisition and display, connected together into a coherent system by object-oriented software components. Much attention has been paid into the development