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

Arrigo Benedetti

dblp:76/6733 · DBLP profile ↗
← Back
5ranked-venue papers
3as first author
0since 2021 · last 2013
—ORCID · none

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

Artificial intelligence and machine learning · 4 · 3 first-authorGraphics, computer vision, multimedia, augmented reality and games · 3 · 2 first-authorDatabases, data management, data science and information retrieval · 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 · 100%
Theoretical computer science
2 papers
Mathematical optimization · 100%
Computer graphics and multimedia
1 paper
Image and video processing · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Reconfigurable computing and FPGAs · 100%

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

TopicWeightPapersLastEvidence papers
Computer vision › 3D vision
camera calibration
0.122004
Globally Convergent Autocalibration Using Interval Analysis · IEEE Trans. Pattern Anal. Mach. Intell. 2004
Globally Convergent Autocalibration · ICCV 2003
Computer vision › 3D vision › camera calibration
self-calibration
0.122004
Globally Convergent Autocalibration Using Interval Analysis · IEEE Trans. Pattern Anal. Mach. Intell. 2004
Globally Convergent Autocalibration · ICCV 2003
Mathematical optimization
global optimization
0.122004
Globally Convergent Autocalibration · ICCV 2003
Globally Convergent Autocalibration Using Interval Analysis · IEEE Trans. Pattern Anal. Mach. Intell. 2004
Mathematical optimization › global optimization
interval branch and bound
0.122004
Globally Convergent Autocalibration · ICCV 2003
Globally Convergent Autocalibration Using Interval Analysis · IEEE Trans. Pattern Anal. Mach. Intell. 2004
Image and video processing
feature detection
0.011998
Real-Time 2-D Feature Detection on a Reconfigurable Computer · CVPR 1998
Reconfigurable computing and FPGAs › FPGA-based signal processing
FPGA-based vision system
0.011998
Real-Time 2-D Feature Detection on a Reconfigurable Computer · CVPR 1998

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

interval analysis · 0.2bernstein polynomial forms · 0.1branch-and-bound · 0.1pipelined architecture · 0.0bernstein polynomials · 0.0bernstein polynomial · 0.0
YearPublicationVenuePosition
2013 SPUMIC: Simultaneous phase unwrapping and multipath interference cancellation in time-of-flight cameras using spectral methods
abstract
We propose a framework for simultaneous phase unwrapping and multipath interference cancellation (SPUMIC) in homodyne time-of-flight (ToF) cameras. Our multi-frequency acquisition framework is based on parametric modeling of the multipath interference phenomena. We use robust spectral estimation methods with low computational complexity to detect and estimate multipath parameters. Using simulations and analysis we demonstrate that our proposed solution is implementable in real-time on existing ToF cameras without requiring any hardware modifications.
Ahmed Kirmani, Arrigo Benedetti, Philip A. Chou
ICME2
2004 Globally Convergent Autocalibration Using Interval Analysis
abstract
We address the problem of autocalibration of a moving camera with unknown constant intrinsic parameters. Existing autocalibration techniques use numerical optimization algorithms whose convergence to the correct result cannot be guaranteed, in general. To address this problem, we have developed a method where an interval branch-and-bound method is employed for numerical minimization. Thanks to the properties of Interval Analysis this method converges to the global solution with mathematical certainty and arbitrary accuracy and the only input information it requires from the user are a set of point correspondences and a search interval. The cost function is based on the Huang-Faugeras constraint of the essential matrix. A recently proposed interval extension based on Bernstein polynomial forms has been investigated to speed up the search for the solution. Finally, experimental results are presented.
Andrea Fusiello, Arrigo Benedetti, Michela Farenzena, Alessandro Busti
IEEE Trans. Pattern Anal. Mach. Intell.2
2003 Globally Convergent Autocalibration
abstract
Existing autocalibration techniques use numerical optimization algorithms that are prone to the problem of local minima. To address this problem, we have developed a method where an interval branch-and-bound method is employed for numerical minimization. Thanks to the properties of interval analysis this method is guaranteed to converge to the global solution with mathematical certainty and arbitrary accuracy, and the only input information it requires from the user is a set of point correspondences and a search box. The cost function is based on the Huang-Faugeras constraint of the fundamental matrix. A recently proposed interval extension based on Bernstein polynomial forms has been investigated to speed up the search for the solution. Finally, some experimental results on synthetic images are presented.
Arrigo Benedetti, Alessandro Busti, Michela Farenzena, Andrea Fusiello
ICCV1
1998 Real-Time 2-D Feature Detection on a Reconfigurable Computer
abstract
We have designed and implemented a system for real-time detection of 2-D features on a reconfigurable computer based on Field Programmable Gate Arrays (FPGA's). We envision this device as the front-end of a system able to track image features in real-time control applications like autonomous vehicle navigation. The algorithm employed to select good features is inspired by Tomasi and Kanade's method. Compared to the original method, the algorithm that we have devised does not require any floating point or transcendental operations, and can be implemented either in hardware or in software. Moreover, it maps efficiently into a highly pipelined architecture, well suited to implementation in FPGA technology. We have implemented the algorithm on a low-cost reconfigurable computer and have observed reliable operation on an image stream generated by a standard NTSC video camera at 30 Hz.
Arrigo Benedetti, Pietro Perona
CVPR1
1997 Confidence computation improvement in an optical field reading system
abstract
An expression in closed form is derived for the recognition error vs. rejection rate of optical character or word recognition systems. This expression allows to define a lower bound for the error rate of any recognition system employing a rejection process based on the definition of a confidence threshold. This relation has also proved to be useful to make a quantitative comparison between two confidence computation methods implemented in a system for reading USA Census '90 hand-written forms. The newly proposed method is based upon a confidence model integrating single-character confidence levels, digram statistics and other information from the dictionary matching phase. At a 50% rejection rate, the field error rate calculated using the new confidence computation algorithm decreased from 47.7% to 44.6%, which represents a considerable improvement, given a theoretical lower bound of 40.8% on the error rate.
Arrigo Benedetti, Zsolt Miklós Kovács-Vajna
ICDAR1