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

Howard M. Dreizen

dblp:20/4939 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
0since 2021 · last 1992
—ORCID · none

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

Graphics, computer vision, multimedia, augmented reality and games · 2Computer networks · 1 · 1 first-authorDatabases, data management, data science and information retrieval · 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
2 papers
Image and video coding · 75% Multimedia systems and quality of experience · 22% Image and video processing · 3%
Databases, data mining, and information retrieval
1 paper
Data models and query languages · 33% Database theory · 33% Query processing and optimization · 33%

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

TopicWeightPapersLastEvidence papers
Image and video coding › transform coding
discrete cosine transform coding
0.011992
Prioritized DCT for compression and progressive transmission of images · IEEE Trans. Image Process. 1992
Image and video coding
image compression
0.011992
Prioritized DCT for compression and progressive transmission of images · IEEE Trans. Image Process. 1992
Multimedia systems and quality of experience › image transmission
progressive image transmission
0.011992
Prioritized DCT for compression and progressive transmission of images · IEEE Trans. Image Process. 1992
Image and video coding
transform coding
0.011992
Prioritized DCT for compression and progressive transmission of images · IEEE Trans. Image Process. 1992
Data models and query languages › relational model
nested relational model
0.011989
Imprecise Schema: A Rationale for Relations with Embedded Subrelations · ACM Trans. Database Syst. 1989
Database theory
normalization
0.011989
Imprecise Schema: A Rationale for Relations with Embedded Subrelations · ACM Trans. Database Syst. 1989

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

partition priority coding · 0.0multiple distribution entropy coding · 0.0arithmetic coding · 0.0relational algebra extension · 0.0null value semantics · 0.0information content decomposition · 0.0geometric decomposition · 0.0
YearPublicationVenuePosition
1992 Prioritized DCT for compression and progressive transmission of images
abstract
An approach is based on the block discrete cosine transform (DCT). The novelty of this approach is that the transform coefficients of all image blocks are coded and transmitted in absolute magnitude order. The resulting ordered-by-magnitude transmission is accomplished without sacrificing coding efficiency by using partition priority coding. Coding and transmission are adaptive to the characteristics of each individual image. and therefore, very efficient. Another advantage of this approach is its high progression effectiveness. Since the largest transform coefficients that capture the most important characteristics of images are coded and transmitted first, this method is well suited for progressive image transmission. Further compression of the image-data is achieved by multiple distribution entropy coding, a technique based on arithmetic coding. Experiments show that the approach compares favorably with previously reported DCT and subband image codecs.
Yunming Huang, Howard M. Dreizen, Nikolas P. Galatsanos
IEEE Trans. Image Process.2
1991 Priority DCT coding for image sequences
abstract
A new DCT (discrete cosine transform) based coding method for image sequences is presented. This technique utilizes the between frame difference of the DCT coefficients which are coded and transmitted progressively according to their magnitude (large values first). This is achieved without any overhead for the position information of the ordered samples using priority progressive coding (PPC). PPC is a new method that allows the ordered transmission of data sources without any overhead for the position information. Experiments were performed to test this method. The results from these experiments show improvement over previously reported DCT based methods.>
Yunming Huang, Nikolas P. Galatsanos, Howard M. Dreizen
ICASSP3
1989 Imprecise Schema: A Rationale for Relations with Embedded Subrelations
abstract
Exceptional conditions are anomalous data which meet the intent of a schema but not the schema definition, represent a small proportion of the database extension, and may become known only after the schema is in use. Admission of exceptional conditions is argued to suggest a representation that locally stretches the schema definition by use of relations with embedded subrelations. Attempted normalization of these relations to 1NF does not yield the static schema typically associated with such transformations. A class of relations, termed Exceptional Condition Nested Form (ECNF), is defined which allows the necessary representation of exceptional conditions while containing sufficient restrictions to prevent arbitrary and chaotic inclusion of embedded subrelations. Queries on a subset of exceptional conditions, the exceptional constraints , are provided an interpretation via an algorithm that transforms ECNF relations into 1NF relations containing two types of null values. Extensions of relational algebraic operators, suitable for interactive query navigation, are defined for use with ECNF relations containing all forms of exceptional conditions.
Howard M. Dreizen, Shi-Kuo Chang
ACM Trans. Database Syst.1
1987 Content-Driven Progressive Transmission of Grey-Scale Images
abstract
A lossless progressive transmission method for grey-scale images which concentrates early transmission efforts on areas of greater image information content is described. The receiver does not have a priori knowledge of which image areas are to receive preferential treatment, and the preferential level of resolution is the pixel. The method makes use of simultaneous geometric and information content decompositions. The method is computationally simple with a complexity which grows linearly with the number of pixels. Compression achieved approaches that obtained by nonprogressive lossless methods, and is approximately the same as for homogeneous progressive lossless methods. Extensions of the method for progressive transmission with limited distortion and greater compression are also discussed.
Howard M. Dreizen
IEEE Trans. Commun.1