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

Ralph Benjamin

dblp:67/483 · DBLP profile ↗
← Back
5ranked-venue papers
1as first author
0since 2021 · last 2011
—ORCID · none

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

Artificial intelligence and machine learning · 3Computer networks · 1 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1Applied, interdisciplinary, general and emerging computing · 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
1 paper
Image and video processing · 100%
Computer networks
1 paper
Optical networks · 50% Network optimization and economics · 50%

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

TopicWeightPapersLastEvidence papers
Image and video processing
edge detection
0.011997
An Edge Detection Technique Using the Facet Model and Parameterized Relaxation Labeling · IEEE Trans. Pattern Anal. Mach. Intell. 1997
Image and video processing › edge analysis
edge labeling
0.011997
An Edge Detection Technique Using the Facet Model and Parameterized Relaxation Labeling · IEEE Trans. Pattern Anal. Mach. Intell. 1997
Image and video processing
image segmentation
0.011997
An Edge Detection Technique Using the Facet Model and Parameterized Relaxation Labeling · IEEE Trans. Pattern Anal. Mach. Intell. 1997
Network optimization and economics
network design
0.011986
Analysis of Connection Survivability in Complex Strategic Communications Networks · IEEE J. Sel. Areas Commun. 1986
Optical networks
network survivability
0.011986
Analysis of Connection Survivability in Complex Strategic Communications Networks · IEEE J. Sel. Areas Commun. 1986

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

relaxation labeling · 0.0facet model · 0.0adaptive smoothing · 0.0statistical estimation · 0.0combinatorial probability · 0.0
YearPublicationVenuePosition
2011 Antarctic ice shelf 3D cross sectional profile imaging using MIMO radar
abstract
Observation of the thickness of Antarctic ice shelves is vital for predicting the rise in sea levels caused by melting of the world's largest fresh water reservoir. This paper proposes a ground-based radar system using a MIMO phased array antenna layout to accurately monitor thickness changes and provide 2 dimensional cross-range information of the ice shelf. The radar system used to collect data is a Step Frequency (SFCW) Radar using multiple transmitting and receiving antennas which operate orthogonally in time. The MIMO antenna layout is shown together with the beam pattern from the associated virtual array. The aperture synthesis of the MIMO array using digital beamforming technique is discussed. Results of the aperture synthesis, showing the cross-range and depth profile of the ice shelf to be observed will be shown. The study conducted using the MIMO antennas is part of a future plan to replace the SFCW Radar system with an FMCW system that will allow long term deployments to observe variability in the rate of change of the ice shelf thickness. One of the conclusions of the paper is that a linear version of the MIMO array will make more efficient use of the antennas than a 2D version of the array.
Arvind Hari Narayanan, Paul V. Brennan, Ralph Benjamin, Fabien Gillet-Chaulet, Keith W. Nicholls
IGARSS3
2007 3D surface point and wireframe reconstruction from multiview photographic images
Simant Prakoonwit, Ralph Benjamin
Image Vis. Comput.2
1997 An Edge Detection Technique Using the Facet Model and Parameterized Relaxation Labeling
abstract
We present a method for detecting and labeling the edge structures in digital gray-scale images in two distinct stages: First, a variant of the cubic facet model is applied to detect the location, orientation and curvature of the putative edge points. Next, a relaxation labeling network is used to reinforce meaningful edge structures and suppress noisy edges. Each node label of this network is a 3D vector parameterizing the orientation and curvature information of the corresponding edge point. A hysteresis step in the relaxation process maximizes connected contours. For certain types of images, prefiltering by adaptive smoothing improves robustness against noise and spatial blurring.
Ioannis Matalas, Ralph Benjamin, Richard Kitney
IEEE Trans. Pattern Anal. Mach. Intell.2
1994 Edge detection and curve enhancement using the facet model and parametrized relaxation labelling
abstract
We present a method for detecting and labeling the edge structures in digital grey-scale images in two distinct stages: 1) a variant of the cubic facet model detects location, orientation and curvature of the putative edge points; and 2) a relaxation labeling network reinforces meaningful edge structures and suppresses noisy edges. Each node label of this network is a 3D vector parametrizing the orientation and curvature of the corresponding edge point. A hysteresis step in the relaxation process maximizes connected contours. For certain images, prefiltering by adaptive smoothing improves robustness against noise and spatial blurring.
Ioannis Matalas, Ralph Benjamin, Richard Kitney
ICPR (1)2
1986 Analysis of Connection Survivability in Complex Strategic Communications Networks
abstract
Military communications networks have to retain their connectivity when subject to quite severe damage. The "survivability" of such networks is conveniently defined by the probability of retaining a connection between representative pairs of terminals. Many methods of calculating this parameter analytically, or of estimating it statistically, have been published. However, because of the "combinatorial explosion," none have so far proved viable except for relatively simple networks (and often also unjustifiable implicit assumptions). A new approach is therefore developed in this paper, which reduces the computational load by several orders of magnitude, and makes significant practical networks amenable to analysis.
Ralph Benjamin
IEEE J. Sel. Areas Commun.1