Demo Data from EDBT 2026 / reviewers in the wild / expert
Leonard A. Ferrari
dblp:91/3213
· DBLP profile ↗
9ranked-venue papers
7as first author
0since 2021 · last 1994
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 6 · 5 first-authorArtificial intelligence and machine learning · 2 · 1 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.
| Computer architecture, parallel and distributed computing, and storage systems
3 papers |
Integrated circuit design · 44% Electronic design automation · 22% Hardware accelerators and domain-specific architectures · 22% | |
| Computer graphics and multimedia
3 papers |
Image and video processing · 65% Geometric modeling and processing · 35% |
Topics — the 9 heaviest of 9, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Geometric modeling and processing › shape modeling › parametric modeling › spline curves
b-spline interpolation |
0.0 | 1 | 1988 | Simple Algorithms and Architectures for B-spline Interpolation · IEEE Trans. Pattern Anal. Mach. Intell. 1988 |
Image and video processing › video frame interpolation › interpolation
image interpolation |
0.0 | 1 | 1988 | Simple Algorithms and Architectures for B-spline Interpolation · IEEE Trans. Pattern Anal. Mach. Intell. 1988 |
Integrated circuit design
digital circuit design |
0.0 | 1 | 1988 | Minimum Complexity FIR Filters and Sparse Systolic Arrays · IEEE Trans. Computers 1988 |
Integrated circuit design › analog and mixed-signal circuits
filter design |
0.0 | 1 | 1988 | Minimum Complexity FIR Filters and Sparse Systolic Arrays · IEEE Trans. Computers 1988 |
Electronic design automation › high-level synthesis › digital filter design
FIR filter synthesis |
0.0 | 1 | 1988 | Minimum Complexity FIR Filters and Sparse Systolic Arrays · IEEE Trans. Computers 1988 |
Hardware accelerators and domain-specific architectures
systolic array |
0.0 | 1 | 1988 | Minimum Complexity FIR Filters and Sparse Systolic Arrays · IEEE Trans. Computers 1988 |
Image and video processing
image filtering |
0.0 | 1 | 1987 | Recursive Algorithms for Implementing Digital Image Filters · IEEE Trans. Pattern Anal. Mach. Intell. 1987 |
Processor architecture and microarchitecture › pipelining
pipelined processor |
0.0 | 1 | 1988 | Simple Algorithms and Architectures for B-spline Interpolation · IEEE Trans. Pattern Anal. Mach. Intell. 1988 |
Embedded and real-time systems › real-time scheduling
complexity analysis |
0.0 | 1 | 1987 | Recursive Algorithms for Implementing Digital Image Filters · IEEE Trans. Pattern Anal. Mach. Intell. 1987 |
Methods — techniques the papers use, named apart from their topics
truncated sinc approximation · 0.0toeplitz matrix inversion · 0.0running average filter · 0.0convolution algorithm · 0.0b-spline approximation · 0.0z-transform · 0.0duhamel's theorem · 0.0b-spline representation · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1994 | Efficient Algorithms for the Implementation of General B-Splines
Leonard A. Ferrari, Martine J. Silbermann, Pathamadi V. Sankar |
CVGIP Graph. Model. Image Process. | 1 |
| 1994 | Curve and Surface Generation and Refinement Based on a High Speed Derivative Algorithm
Pathamadi V. Sankar, Martine J. Silbermann, Leonard A. Ferrari |
CVGIP Graph. Model. Image Process. | 3 |
| 1988 | Simple Algorithms and Architectures for B-spline InterpolationabstractIt is proved that the Toeplitz binary value matrix inversion associated with mth-order B-spline interpolation can be implemented using only 2(m+1) additions. Pipelined architectures are developed for real-time B-spline interpolation based on simple running average filters. It is shown that an ideal interpolating function, which is approximated by a truncated sinc function with M half cycles, can be implemented using B-splines with M+2 multiplies. With insignificant loss of performance, the coefficients at the knots of the truncated sinc function can be approximated using coefficients which are powers of two. The resulting implementation requires only M+4m+6 additions. It is believed that the truncated sinc function approximated by zero-order B-spline functions actually achieves the best visual performance.> Pathamadi V. Sankar, Leonard A. Ferrari |
IEEE Trans. Pattern Anal. Mach. Intell. | 2 |
| 1988 | Minimum Complexity FIR Filters and Sparse Systolic ArraysabstractThe properties of B-spline approximation and the integral/derivative properties of convolution lead to efficient algorithms for the implementation of multidimensional FIR filters. The implementations are of minimum time complexity under the Nyquist criterion. The algorithm can easily be implemented using a sparse systolic array architecture. The resulting B-spline convolvers have much lower circuit complexity than systolic architectures based on conventional convolution algorithms. A two-dimensional hardware implementation based on simplifications of current architectures is presented.> Leonard A. Ferrari, Pathamadi V. Sankar |
IEEE Trans. Computers | 1 |
| 1987 | Recursive Algorithms for Implementing Digital Image FiltersabstractThe B-spline functions are used to develop recursive algorithms for the efficient implementation of two-dimensional linear digital image filters. These filters may be spatially varying. The B-splines are used in a representation of the desired point spread function. We show that this leads to recursive algorithms and hardware implementations which are more efficient than either direct spatial domain filter realizations or FFT implementations. The Z-transform is used to develop a discrete version of Duhamel's theorem. A computer architecture for B-spline image filters is proposed and a complexity analysis and comparison to other approaches is provided. Leonard A. Ferrari, Pathamadi V. Sankar, S. Shinnaka, Jack Sklansky |
IEEE Trans. Pattern Anal. Mach. Intell. | 1 |
| 1985 | A note on duhamel integrals and running average filters
Leonard A. Ferrari, Jack Sklansky |
Comput. Vis. Graph. Image Process. | 1 |
| 1984 | A fast recursive algorithm for binary-valued two-dimensional filters
Leonard A. Ferrari, Jack Sklansky |
Comput. Vis. Graph. Image Process. | 1 |
| 1984 | Minimal rectangular partitions of digitized blobs
Leonard A. Ferrari, Pathamadi V. Sankar, Jack Sklansky |
Comput. Vis. Graph. Image Process. | 1 |
| 1983 | A fast recursive algorithm for binary valued two-dimensional filters
Leonard A. Ferrari, Jack Sklansky |
Comput. Vis. Graph. Image Process. | 1 |