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

Ronen Lerner

dblp:18/3866 · DBLP profile ↗
← Back
8ranked-venue papers
7as first author
0since 2021 · last 2014
—ORCID · none

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

Artificial intelligence and machine learning · 6 · 5 first-authorSystems, architecture and hardware · 2 · 2 first-authorGraphics, computer vision, multimedia, augmented reality and games · 2 · 2 first-authorApplied, interdisciplinary, general and emerging computing · 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
4 papers
Robot navigation and mapping · 59% 3D vision · 41%

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

TopicWeightPapersLastEvidence papers
Robotics › Robot navigation and mapping
visual navigation
0.232011
Direct Method for Video-Based Navigation Using a Digital Terrain Map · IEEE Trans. Pattern Anal. Mach. Intell. 2011
Landmark Selection for Task-Oriented Navigation · IEEE Trans. Robotics 2007
Error Analysis for a Navigation Algorithm Based on Optical-Flow and a Digital Terrain Map · CVPR (1) 2004
Computer vision › 3D vision
3d reconstruction
0.122011
Pose and Motion Recovery from Feature Correspondences and a Digital Terrain Map · IEEE Trans. Pattern Anal. Mach. Intell. 2006
Direct Method for Video-Based Navigation Using a Digital Terrain Map · IEEE Trans. Pattern Anal. Mach. Intell. 2011
Robotics › Robot navigation and mapping › SLAM
landmark selection
0.112007
Landmark Selection for Task-Oriented Navigation · IEEE Trans. Robotics 2007
Computer vision › 3D vision › pose estimation
human pose and motion estimation
0.112006
Pose and Motion Recovery from Feature Correspondences and a Digital Terrain Map · IEEE Trans. Pattern Anal. Mach. Intell. 2006
Computer vision › 3D vision
elevation map
0.122011
Direct Method for Video-Based Navigation Using a Digital Terrain Map · IEEE Trans. Pattern Anal. Mach. Intell. 2011
Pose and Motion Recovery from Feature Correspondences and a Digital Terrain Map · IEEE Trans. Pattern Anal. Mach. Intell. 2006
Robotics › Robot navigation and mapping › visual navigation
optical-flow-based navigation
0.012004
Error Analysis for a Navigation Algorithm Based on Optical-Flow and a Digital Terrain Map · CVPR (1) 2004
Computer vision › 3D vision
pose estimation
0.012007
Landmark Selection for Task-Oriented Navigation · IEEE Trans. Robotics 2007
Computer vision › 3D vision › image registration
digital elevation map matching
0.012004
Error Analysis for a Navigation Algorithm Based on Optical-Flow and a Digital Terrain Map · CVPR (1) 2004

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

nonlinear optimization · 0.2image registration · 0.1semidefinite programming relaxation · 0.1integer programming · 0.1feature correspondence · 0.1optical flow · 0.0error analysis · 0.0
YearPublicationVenuePosition
2014 Recent progress in road and lane detection: a survey
Aharon Bar-Hillel, Ronen Lerner, Dan Levi, Guy Raz
Mach. Vis. Appl.2
2011 Direct Method for Video-Based Navigation Using a Digital Terrain Map
abstract
A novel vision-based navigation algorithm is proposed. The gray levels of two images, together with a Digital Terrain Map (DTM), are directly utilized to define constraints on the navigation parameters. The feasibility of the algorithm is examined both under a simulated environment and using real flight data.
Ronen Lerner, Ehud Rivlin
IEEE Trans. Pattern Anal. Mach. Intell.1
2007 Landmark Selection for Task-Oriented Navigation
abstract
Many vision-based navigation systems are restricted to the use of only a limited number of landmarks when computing the camera pose. This limitation is due to the overhead of detecting and tracking these landmarks along the image sequence. A new algorithm is proposed for subset selection from the available landmarks. This algorithm searches for the subset that yields minimal uncertainty for the obtained pose parameters. Navigation tasks have different types of goals: moving along a path, photographing an object for a long period of time, etc. The significance of the various pose parameters differs for different navigation tasks. Therefore, a requirements matrix is constructed from a supplied severity function, which defines the relative importance of each parameter. This knowledge can then be used to search for the subset that minimizes the uncertainty of the important parameters, possibly at the cost of greater uncertainty in others. It is shown that the task-oriented landmark selection problem can be defined as an integer-programming problem for which a very good approximation can be obtained. The problem is then translated into a semi-definite programming representation which can be rapidly solved. The feasibility and performance of the proposed algorithm is studied through simulations and lab experimentation.
Ronen Lerner, Ehud Rivlin, Ilan Shimshoni
IEEE Trans. Robotics1
2006 Pose and Motion from Omnidirectional Optical Flow and a Digital Terrain Map
abstract
An algorithm for pose and motion estimation using corresponding features in omnidirectional images and a digital terrain map is proposed. In previous paper, such algorithm for regular camera was considered. Using a digital terrain (or digital elevation) map (DTM/DEM) as a global reference enables recovering the absolute position and orientation of the camera. In order to do this, the DTM is used to formulate a constraint between corresponding features in two consecutive frames. In this paper, these constraints are extended to handle non-central projection, as is the case with many omnidirectional systems. The utilization of omnidirectional data is shown to improve the robustness and accuracy of the navigation algorithm. The feasibility of this algorithm is established through lab experimentation with two kinds of omnidirectional acquisition systems. The first one is polydioptric cameras while the second is catadioptric camera
Ronen Lerner, Oleg Kupervasser, Ehud Rivlin
IROS1
2006 Landmark Selection for Task-Oriented Navigation
abstract
Many vision-based navigation systems are restricted to use only a limited number of landmarks when computing the camera pose. This limitation is due to the overhead of detecting and tracking these landmarks along the image sequence. A new algorithm is proposed for subset selection from the available landmarks. This algorithm searches for the subset that yields minimal uncertainty for the obtained pose parameters. Navigation tasks have different types of goals: moving along a path, photographing an object for a long period of time etc. The significance of the various pose parameters differs for different navigation tasks. Therefore, a requirements matrix is constructed from a supplied severity function, which defines the relative importance of each parameter. This knowledge can then be used to search for the subset that minimizes the uncertainty of the important parameters, possibly at the cost of greater uncertainty in others. It is shown that the task-oriented landmark selection problem can be defined as an integer-programming problem for which a very good approximation can be obtained. The problem is then translated into a semi-definite programming representation which can be rapidly solved. The feasibility and performance of the proposed algorithm is studied through simulations and lab experimentation
Ronen Lerner, Ehud Rivlin, Ilan Shimshoni
IROS1
2006 Pose and Motion Recovery from Feature Correspondences and a Digital Terrain Map
abstract
A novel algorithm for pose and motion estimation using corresponding features and a Digital Terrain Map is proposed. Using a Digital Terrain (or Digital Elevation) Map (DTM/DEM) as a global reference enables the elimination of the ambiguity present in vision-based algorithms for motion recovery. As a consequence, the absolute position and orientation of a camera can be recovered with respect to the external reference frame. In order to do this, the DTM is used to formulate a constraint between corresponding features in two consecutive frames. Explicit reconstruction of the 3D world is not required. When considering a number of feature points, the resulting constraints can be solved using nonlinear optimization in terms of position, orientation, and motion. Such a procedure requires an initial guess of these parameters, which can be obtained from dead-reckoning or any other source. The feasibility of the algorithm is established through extensive experimentation. Performance is compared with a state-of-the-art alternative algorithm, which intermediately reconstructs the 3D structure and then registers it to the DTM. A clear advantage for the novel algorithm is demonstrated in variety of scenarios.
Ronen Lerner, Ehud Rivlin, Héctor Rotstein
IEEE Trans. Pattern Anal. Mach. Intell.1
2004 Error Analysis for a Navigation Algorithm Based on Optical-Flow and a Digital Terrain Map
Ronen Lerner, Ehud Rivlin, Héctor Rotstein
CVPR (1)1
2004 Pose estimation using feature correspondences and dtm
abstract
A novel algorithm for pose estimation using feature correspondences and Digital Terrain Map (DTM) is proposed. A constraint is formulated by using corresponding features from two consecutive frames together with the information provided by the elevation map. The proposed constraint is nonlinear and is solved by using a simple numerical method. The proposed approach does not require an intermediate explicit reconstruction of the 3D world. The feasibility of the algorithm is studied using both synthetic data of a virtual terrain and experimental data obtained from a terrain model and a robotic camera.
Ronen Lerner, Ehud Rivlin, Héctor Rotstein
ICIP1