Demo Data from VLDB 2026 / reviewers in the wild / expert
R. Bagdazian
dblp:31/9411
· DBLP profile ↗
2ranked-venue papers
0as first author
0since 2021 · last 1985
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1Human-computer interaction and ubiquitous 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 coding · 50% Image and video processing · 50% |
Topics — the 1 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Image and video coding › transform coding
fourier transform coding |
0.0 | 1 | 1984 | Fourier Coding of Image Boundaries · IEEE Trans. Pattern Anal. Mach. Intell. 1984 |
Methods — techniques the papers use, named apart from their topics
transform coding · 0.0gaussian circular autoregressive model · 0.0discrete fourier transform · 0.0MAX quantizer · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1985 | Texture synthesis and compression using Gaussian-Markov random field modelsabstractThe usefulness is illustrated of two-dimensional (2-D) Gaussian-Markov random field (MRF) models for coding of textures. The MRF models used are noncausal; the mean of observationy(s) at positionsis written as a linear weighted sum of neighboring observations surroundingsin all directions. The method of least squares is used to obtain estimates of the model parameters. The model is then used with periodic boundary conditions to regenerate the original texture. Results obtained indicate that this method could be used to compress textures with low bit rates. Rama Chellappa, Sangit Chatterjee, R. Bagdazian |
IEEE Trans. Syst. Man Cybern. | 3 |
| 1984 | Fourier Coding of Image BoundariesabstractA transform coding scheme for closed image boundaries on a plane is described. The given boundary is approximated by a series of straight line segments. Depending on the shape, the boundary is represented by the (x-y) coordinates of the endpoints of the line segments or by the magnitude of the successive radii vectors that are equispaced in angle around the given boundary. Due to the circularity present in the data, the discrete Fourier transform is used to exactly decorrelate the finite boundary data. By fitting a Gaussian circular autoregressive model to represent the boundary data, estimates of the variances of the Fourier coefficients are obtained. Using the variances of the Fourier coefficients and the MAX quantizer, the coding scheme is implemented. The scheme is illustrated by an example. Rama Chellappa, R. Bagdazian |
IEEE Trans. Pattern Anal. Mach. Intell. | 2 |