George W. Rogers

dblp:34/5807 · DBLP profile ↗
← Back
7ranked-venue papers
2as 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 · 5Human-computer interaction and ubiquitous computing · 2 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 2 · 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
1 paper
Image recognition and object detection · 77% 3D vision · 23%
Computer graphics and multimedia
1 paper
Image and video processing · 77% Visualization and visual analytics · 23%

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

TopicWeightPapersLastEvidence papers
Computer vision › Image recognition and object detection › region localization
region of interest detection
0.011998
Identification of Man-Made Regions in Unmanned Aerial Vehicle Imagery and Videos · IEEE Trans. Pattern Anal. Mach. Intell. 1998
Image and video processing
image segmentation
0.011997
Segmentation of Random Fields Via Borrowed Strength Density Estimation · IEEE Trans. Pattern Anal. Mach. Intell. 1997
Computer vision › 3D vision
aerial image analysis
0.011998
Identification of Man-Made Regions in Unmanned Aerial Vehicle Imagery and Videos · IEEE Trans. Pattern Anal. Mach. Intell. 1998
Visualization and visual analytics
clustering
0.011997
Segmentation of Random Fields Via Borrowed Strength Density Estimation · IEEE Trans. Pattern Anal. Mach. Intell. 1997

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

wavelet boundaries · 0.0semiparametric probability density estimation · 0.0fractal dimension · 0.0similarity matrix clustering · 0.0marginal probability density estimation · 0.0
YearPublicationVenuePosition
2014 Polarimetric SAR Signature Detection Using the Cameron Decomposition
abstract
An approach to the detection of specific polarimetric SAR signatures is presented. The polarimetric response in a resolution cell can be viewed as a sample of the electromagnetic scattering matrix for that resolution cell. Through the use of multiple coherent apertures, multiple samples of the scattering matrix can be obtained. With the use of a suitable decomposition and a weighted log-likelihood formulation, it is possible to estimate the relative likelihoods that the observed scattering matrix responses match known electromagnetic signatures.
George W. Rogers, Houra Rais, William L. Cameron
IEEE Trans. Geosci. Remote. Sens.1
1998 Identification of Man-Made Regions in Unmanned Aerial Vehicle Imagery and Videos
abstract
Details work in our group on the use of low-level features for the identification of man-made regions in unmanned aerial vehicle (UAV) imagery. The feature sets that we have examined include classical statistical features such as the coefficient of variation in a window about a pixel, locally computed fractal dimension, and fractal dimension computed in the presence of wavelet boundaries. We discuss these techniques of feature extraction along with our approach to the classification of the features. Our classification work has focused on the use of a semiparametric probability density estimation technique. In addition, we present classification results for region of interest identification based on a set of test images from an UAV test flight.
Jeffrey L. Solka, David J. Marchette, B. C. Wallet, V. L. Irwin, George W. Rogers
IEEE Trans. Pattern Anal. Mach. Intell.5
1997 Segmentation of Random Fields Via Borrowed Strength Density Estimation
abstract
In many applications, spatial observations must be segmented into homogeneous regions and the number, positions, and shapes of the regions are unknown a priori. Information about the underlying probability distributions are often unknown. Furthermore, the anticipated regions of interest may be small with few observations from the individual regions. This paper presents a technique designed to address these difficulties. A simple segmentation procedure can be obtained as a clustering of the disjoint subregions obtained through an initial low-level partitioning procedure. Clustering of these subregions based upon a similarity matrix derived from estimates of their marginal probability density functions yields the resultant segmentation. It is shown that this segmentation is improved through the use of a "borrowed strength" density estimation procedure wherein potential similarities between the density functions for the subregions are exploited. The borrowed strength technique is described and the performance of segmentation based on these estimates is investigated through an example from statistical image analysis.
Carey E. Priebe, David J. Marchette, George W. Rogers
IEEE Trans. Pattern Anal. Mach. Intell.3
1995 Fast computation of optimal paths using a parallel Dijkstra algorithm with embedded constraints
Jeffrey L. Solka, James C. Perry, Brian R. Poellinger, George W. Rogers
Neurocomputing4
1994 The detection of micro-calcifications in mammographic images using high dimensional features
abstract
This paper examines techniques for the efficient use of high dimensional feature sets in the detection of micro-calcifications in mammograms. The paper focuses on techniques for dimensionality reduction and discriminant analysis. The paper examines the use of principal components and Fisher's linear discriminant for dimensionality reduction along with parametric and nonparametric statistical techniques for discriminant analysis.>
Jeffrey L. Solka, Wendy L. Poston, Carey E. Priebe, George W. Rogers, Richard A. Lorey, David J. Marchette, Kevin S. Woods, Kevin W. Bowyer
CBMS4
1994 A qualitative analysis of the resistive grid kernel estimator
Wendy L. Poston, George W. Rogers, Carey E. Priebe, Jeffrey L. Solka
Pattern Recognit. Lett.2
1993 A self-organizing network for computing a posteriori conditional class probability
abstract
A neural network architecture whose goal is the computation of a posteriori conditional class probabilities for input vectors that belong to one of two input classes is described. The network architecture has been designed to adaptively produce Voronoi tessellation partitions of the input vectors in R/sup n/ based on the Euclidean distance metric, without regard to the actual a priori class probabilities of the input vectors. These prior probabilities are then used by the network to adaptively compute the a posteriori conditional class probability for the two classes for each tessellation partition. The network presented is thus a connectionist model for vector quantization clustering and includes the process of automatic node creation necessary for many unsupervised learning applications.>
George W. Rogers, Jeffrey L. Solka, D. Stephen Malyevac, Carey E. Priebe
IEEE Trans. Syst. Man Cybern.1