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

Jason Meltzer

dblp:94/2370 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
0since 2021 · last 2008
—ORCID · none

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

Artificial intelligence and machine learning · 3 · 3 first-authorGraphics, computer vision, multimedia, augmented reality and games · 2 · 2 first-authorSystems, architecture and hardware · 1 · 1 first-author

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.

Artificial intelligence
2 papers
3D vision · 88% Image recognition and object detection · 12%
Computer graphics and multimedia
1 paper
Geometric modeling and processing · 50% Image and video processing · 50%

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

TopicWeightPapersLastEvidence papers
Computer vision › 3D vision
structure from motion
0.112008
Edge descriptors for robust wide-baseline correspondence · CVPR 2008
Computer vision › 3D vision › feature matching › local feature matching
wide-baseline matching
0.112008
Edge descriptors for robust wide-baseline correspondence · CVPR 2008
Image and video processing › feature extraction
feature descriptor
0.012004
Multiple View Feature Descriptors from Image Sequences via Kernel Principal Component Analysis · ECCV (1) 2004
Geometric modeling and processing
multi-view geometry
0.012004
Multiple View Feature Descriptors from Image Sequences via Kernel Principal Component Analysis · ECCV (1) 2004
Computer vision › Image recognition and object detection › image classification
object classification
0.012008
Edge descriptors for robust wide-baseline correspondence · CVPR 2008
Computer vision › 3D vision › 3d reconstruction
multi-view reconstruction
0.012004
Multiple View Feature Descriptors from Image Sequences via Kernel Principal Component Analysis · ECCV (1) 2004

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

kernel principal component analysis · 0.1scale-space edge detection · 0.1orientation and scale histogram descriptor · 0.1
YearPublicationVenuePosition
2008 Edge descriptors for robust wide-baseline correspondence
abstract
This paper describes a method for finding wide-baseline correspondences between images at locations along gradient edges. We find edges in scale space using established methods and develop invariant descriptors for these edges based on orientation and scale histograms. Because edges are often found on occluding boundaries, we calculate and store two descriptors per edge, one on each side, for robustness to occlusions. We demonstrate the effectiveness of edge matching in the applications of wide-baseline correspondence, structure from motion from line segments, and object category recognition on the Caltech 101 dataset.
Jason Meltzer, Stefano Soatto
CVPR1
2004 Multiple View Feature Descriptors from Image Sequences via Kernel Principal Component Analysis
Jason Meltzer, Ming-Hsuan Yang 0001, Rakesh Gupta 0001, Stefano Soatto
ECCV (1)1
2004 Simultaneous localization and mapping using multiple view feature descriptors
abstract
We propose a vision-based SLAM algorithm incorporating feature descriptors derived from multiple views of a scene, incorporating illumination and viewpoint variations. These descriptors are extracted from video and then applied to the challenging task of wide baseline matching across significant viewpoint changes. The system incorporates a single camera on a mobile robot in an extended Kalman filter framework to develop a 3D map of the environment and determine egomotion. At the same time, the feature descriptors are generated from the video sequence, which can be used to localize the robot when it returns to a mapped location. The kidnapped robot problem is addressed by matching descriptors without any estimate of position, then determining the epipolar geometry with respect to a known position in the map.
Jason Meltzer, Rakesh Gupta 0001, Ming-Hsuan Yang 0001, Stefano Soatto
IROS1