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

Lori A. Overturf

dblp:88/3223 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1995
—ORCID · none

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

Graphics, 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 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Image and video coding › image compression › lossy image compression
block truncation coding
0.011995
Color image coding using morphological pyramid decomposition · IEEE Trans. Image Process. 1995
Image and video coding › image compression
color image compression
0.011995
Color image coding using morphological pyramid decomposition · IEEE Trans. Image Process. 1995
Image and video coding › image compression
lossy image compression
0.011995
Color image coding using morphological pyramid decomposition · IEEE Trans. Image Process. 1995

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

pyramid decomposition · 0.0mathematical morphology · 0.0
YearPublicationVenuePosition
1995 Color image coding using morphological pyramid decomposition
abstract
Presents a new algorithm that utilizes mathematical morphology for pyramidal coding of color images. The authors obtain lossy color image compression by using block truncation coding at the pyramid levels to attain reduced data rates. The pyramid approach is attractive due to low computational complexity, simple parallel implementation, and the ability to produce acceptable color images at moderate data rates. In many applications, the progressive transmission capability of the algorithm is very useful. The authors show experimental results for color images at data rates of 1.89 bits/pixel.
Lori A. Overturf, Mary L. Comer, Edward J. Delp
IEEE Trans. Image Process.1