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

Bryan G. Talbot

dblp:13/367 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
0since 2021 · last 2002
—ORCID · none

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

Artificial intelligence and machine learning · 1 · 1 first-authorDatabases, data management, data science and information retrieval · 1 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 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 graphics and multimedia
1 paper
Image and video coding · 100%

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

TopicWeightPapersLastEvidence papers
Image and video coding
entropy coding
0.011998
Source coding with a permutation-based reversible memory-binding transform for data compression in categorical data domains · IEEE Trans. Image Process. 1998
Image and video coding › entropy coding
huffman coding
0.011998
Source coding with a permutation-based reversible memory-binding transform for data compression in categorical data domains · IEEE Trans. Image Process. 1998

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

vector quantization · 0.0permutation transform · 0.0
YearPublicationVenuePosition
2002 Metric Estimation via a Fuzzy Grade-of-Membership Model Applied to Analysis of Business Opportunities
abstract
This paper describes a technique for estimating business opportunity metrics from mixed numeric and categorical type databases by using a fuzzy Grade-of-Membership clustering model. The technique is applied to the problem of opportunity analysis for business decision-making. We propose two metrics called unfamiliarity and follow-on importance. Real business contract data are used to demonstrate the technique. This general approach could be adapted to many other applications where a decision agent needs to assess the value of items from a set of opportunities with respect to a reference set representing its business.
Bryan G. Talbot, Bruce B. Whitehead, Lisa M. Talbot
ICTAI1
1998 Source coding with a permutation-based reversible memory-binding transform for data compression in categorical data domains
abstract
A general purpose reversible memory-binding transform (MBT) is developed, which uses a permutation transform technique to bind memory information to a transformed signal alphabet. The algorithm performs well in conjunction with a Huffman coder for both ordered sources, such as pixel intensities, and categorical sources, such as vector quantized codebook indices.
Bryan G. Talbot, Lisa M. Talbot
IEEE Trans. Image Process.1
1997 A Polygon Reduction Algorithm for Enhancing Graphics Performance with Application to Fast Rendering of Geophysical and Ionospheric Model Data
abstract
Many scientific applications employ computer graphics as a means of interactively visualizing two-dimensional geophysical data sets. This paper presents an algorithm for improving rendering performance by using an image segmentation approach to reduce the number of rendered polygons while maintaining complete display fidelity. Though applied here specifically to the output from a numerical ionosphere model, the algorithm is broadly applicable to many other two-dimensional cellular data sets, geophysical and otherwise. In an ionospheric context, this algorithm demonstrates the ability to reduce the number of rendered polygons by 95 per cent or more with a corresponding reduction in rendering time.
Bryan G. Talbot, Robert E. Peterson
Int. J. Geogr. Inf. Sci.1