Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

David H. Marimont

dblp:93/2310 · DBLP profile ↗
← Back
9ranked-venue papers
2as first author
0since 2021 · last 1998
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 6 · 2 first-authorArtificial intelligence and machine learning · 5 · 2 first-authorSystems, architecture and hardware · 1Theory of computation · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer graphics and multimedia
5 papers
Image and video processing · 84% Geometric modeling and processing · 8% Rendering · 7%
Theoretical computer science
1 paper
Computational geometry · 75% Algorithms and data structures · 25%
Artificial intelligence
3 papers
3D vision · 89% Probabilistic and Bayesian machine learning · 11%

Topics — the 20 heaviest of 22, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Image and video processing
edge detection
0.021998
Robust anisotropic diffusion · IEEE Trans. Image Process. 1998
A Probabilistic Framework for Edge Detection and Scale Selection · ICCV 1998
Image and video processing › image filtering › nonlinear diffusion
anisotropic diffusion
0.011998
Robust anisotropic diffusion · IEEE Trans. Image Process. 1998
Image and video processing › image restoration
image denoising
0.011998
Robust anisotropic diffusion · IEEE Trans. Image Process. 1998
Image and video processing
image segmentation
0.011998
Robust anisotropic diffusion · IEEE Trans. Image Process. 1998
Image and video processing › multiscale analysis › multiresolution analysis
scale selection
0.011998
A Probabilistic Framework for Edge Detection and Scale Selection · ICCV 1998
Image and video processing › color image processing
gamut mapping
0.011995
Device-Directed Rendering · ACM Trans. Graph. 1995
Computational geometry
arrangement
0.011995
Rounding Arrangements Dynamically · SCG 1995
Algorithms and data structures
dynamic algorithms
0.011995
Rounding Arrangements Dynamically · SCG 1995
Computational geometry › arrangement
line segment arrangements
0.011995
Rounding Arrangements Dynamically · SCG 1995
Computational geometry
robust geometric computation
0.011995
Rounding Arrangements Dynamically · SCG 1995
Computer vision › 3D vision
3d reconstruction
0.011994
Geometric Methods for Relative Reconstruction from Weakly Calibrated Images · ICRA 1994
Computer vision › 3D vision › 3d reconstruction
projective reconstruction
0.011994
Geometric Methods for Relative Reconstruction from Weakly Calibrated Images · ICRA 1994
Computer vision › 3D vision › 3d reconstruction › multi-view stereo
stereo reconstruction
0.011994
Geometric Methods for Relative Reconstruction from Weakly Calibrated Images · ICRA 1994
Image and video processing › motion analysis
motion reconstruction
0.011994
Analytical Methods for Uncalibrated Stereo and Motion Reconstruction · ECCV (1) 1994
Geometric modeling and processing › 3d reconstruction › multi-view reconstruction
stereo reconstruction
0.011994
Analytical Methods for Uncalibrated Stereo and Motion Reconstruction · ECCV (1) 1994
Image and video processing › image restoration › inverse problem › inverse problem regularization
image regularization
0.011998
Robust anisotropic diffusion · IEEE Trans. Image Process. 1998
Computer vision › 3D vision › multi-view geometry
epipolar geometry
0.011987
Epipolar-plane image analysis: An approach to determining structure from motion · Int. J. Comput. Vis. 1987
Computer vision › 3D vision
structure from motion
0.011987
Epipolar-plane image analysis: An approach to determining structure from motion · Int. J. Comput. Vis. 1987
Computer vision › 3D vision
camera calibration
0.011994
Geometric Methods for Relative Reconstruction from Weakly Calibrated Images · ICRA 1994
Geometric modeling and processing › shape representation
curve representation
0.011984
A Representation for Image Curves · AAAI 1984

Methods — techniques the papers use, named apart from their topics

zero-crossing analysis · 0.0maximum likelihood · 0.0lindeberg operators · 0.0tukey biweight estimator · 0.0robust statistics · 0.0vertical cell decomposition · 0.0symbolic image representation · 0.0robust rounding · 0.0randomized hierarchy · 0.0minimization · 0.0point correspondence · 0.0epipolar geometry · 0.0analytical methods · 0.0epipolar plane image analysis · 0.0
YearPublicationVenuePosition
1998 A Probabilistic Framework for Edge Detection and Scale Selection
abstract
We devise a statistical framework for edge detection by performing a statistical analysis of zero crossings of the second derivative of an image. This analysis enables us to estimate at each pixel of an image the probability that an edge passes through the pixel. We present a statistical analysis of the the Lindeberg operators that we use to compute image derivatives. We also introduce a confidence probability that tells us how reliable the edge probability is, given the image's noise level and the operator's scale. Combining the edge and confidence probabilities leads to a probabilistic scale selection algorithm. We present the results of experiments on natural images.
David H. Marimont, Yossi Rubner
ICCV1
1998 Robust anisotropic diffusion
abstract
Relations between anisotropic diffusion and robust statistics are described in this paper. Specifically, we show that anisotropic diffusion can be seen as a robust estimation procedure that estimates a piecewise smooth image from a noisy input image. The "edge-stopping" function in the anisotropic diffusion equation is closely related to the error norm and influence function in the robust estimation framework. This connection leads to a new "edge-stopping" function based on Tukey's biweight robust estimator that preserves sharper boundaries than previous formulations and improves the automatic stopping of the diffusion. The robust statistical interpretation also provides a means for detecting the boundaries (edges) between the piecewise smooth regions in an image that has been smoothed with anisotropic diffusion. Additionally, we derive a relationship between anisotropic diffusion and regularization with line processes. Adding constraints on the spatial organization of the line processes allows us to develop new anisotropic diffusion equations that result in a qualitative improvement in the continuity of edges.
Michael J. Black, Guillermo Sapiro, David H. Marimont, David Heeger
IEEE Trans. Image Process.3
1997 Robust Anisotropic Diffusion and Sharpening of Scalar and Vector Images
abstract
Relations between anisotropic diffusion and robust statistics are described. We show that anisotropic diffusion can be seen as a robust estimation procedure that estimates a piecewise smooth image from a noisy input image. The "edge-stopping" function in the anisotropic diffusion equation is closely related to the error norm and influence function in the robust estimation framework. This connection leads to a new "edge-stopping" function based on Tukey's biweight robust estimator, that preserves sharper boundaries than previous formulations and improves the automatic stopping of the diffusion. The robust statistical interpretation also provides a means for detecting the boundaries (edges) between the piecewise smooth regions in the image. We extend the framework to vector-valued images and show applications to robust image sharpening.
Michael J. Black, Guillermo Sapiro, David H. Marimont, David Heeger
ICIP (1)3
1995 Rounding Arrangements Dynamically
abstract
We describe a robust, dynamic algorithm to compute the arrangement of a set of line segments in the plane, and its implementation.The algorithm is robust because, following Greene [6] and Hobby [8], it rounds the endpoints and intersections of all line segments to representable points, but in a way that is globally topologically consistent.The algorithm is dynamic because, following Mulmttley [13], it uses a randomized hierarchy of vertical cell decompositions to make locating points, and inserting and deleting line segments, efficient.Our algorithm is novel because it marries the robustness of the Greene and Hobby algorithms with Mulmuley's dynamic algorithm in a way that preserves the desirable properties of each.
Leonidas J. Guibas, David H. Marimont
SCG2
1995 Device-Directed Rendering
abstract
Rendering systems can produce images that include the entire range of visible colors. Imaging hardware, however, can reproduce only a subset of these colors: the device gamut. An image can only be correctly displayed if all of its colors lie inside of the gamut of the target device. Current solutions to this problem are either to correct the scene colors by hand, or to apply gamut mapping techniques to the final image. We propose a methodology called device-directed rendering that performs scene color adjustments automatically. Device-directed rendering applies classic minimization techniques to a symbolic representation of the image that describes the relationship of the scene lights and surfaces to the pixel colors. This representation can then be evaluated to produce an image that is guaranteed to be in gamut. Although our primary application has been correcting out-of-gamut colors, this methodology can be generally applied to the problem of adjusting a scene description to accommodate constraints on the output image pixel values.
Andrew S. Glassner, Kenneth P. Fishkin, David H. Marimont, Maureen Stone 0002
ACM Trans. Graph.3
1994 Analytical Methods for Uncalibrated Stereo and Motion Reconstruction
Jean Ponce, David H. Marimont, Todd A. Cass
ECCV (1)2
1994 Geometric Methods for Relative Reconstruction from Weakly Calibrated Images
abstract
We present several new geometric methods for relative stereo and motion reconstruction using a discrete set of point correspondences. We suppose that the epipoles are known but do not assume any knowledge of the cameras' intrinsic or extrinsic parameters. In each case, we choose a set of five points as a basis for projective space and perform reconstruction relative to these five points. We also present a new technique for reprojection without reconstruction. We have implemented the proposed methods and present several examples using real images.>
Jean Ponce, David H. Marimont, Todd A. Cass
ICRA2
1987 Epipolar-plane image analysis: An approach to determining structure from motion
Robert C. Bolles, H. Harlyn Baker, David H. Marimont
Int. J. Comput. Vis.3
1984 A Representation for Image Curves
David H. Marimont
AAAI1