Demo Data from VLDB 2026 / reviewers in the wild / expert
Patrick C. Chen
dblp:86/9703
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 1983
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 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 processing · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Image and video processing
image segmentation |
0.0 | 1 | 1983 | Segmentation by Texture Using Correlation · IEEE Trans. Pattern Anal. Mach. Intell. 1983 |
Image and video processing › image segmentation › region-based segmentation
split-and-merge segmentation |
0.0 | 1 | 1983 | Segmentation by Texture Using Correlation · IEEE Trans. Pattern Anal. Mach. Intell. 1983 |
Image and video processing › image segmentation
texture segmentation |
0.0 | 1 | 1983 | Segmentation by Texture Using Correlation · IEEE Trans. Pattern Anal. Mach. Intell. 1983 |
Methods — techniques the papers use, named apart from their topics
region adjacency graph · 0.0correlation coefficient · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1983 | Segmentation by Texture Using CorrelationabstractThe correlation coefficients are used for segmentation according to texture. They are first evaluated on a set of square regions forming two levels of the quadratic picture tree (or pyramid). If the coefficients of a square and its four children in the tree are similar, then that region is considered to be of uniform texture. If not, it is replaced by its children. In this way, the split-and-merge algorithm is used to achieve a preliminary segmentation. It is followed by a grouping algorithm using the correlation coefficients and the region adjacency graph, plus a small region elimination step. The latter regions are grouped according to their gray level because texture cannot be defined reliably on very small regions. Examples of implementation on four pictures are included. Patrick C. Chen, Theodosios Pavlidis |
IEEE Trans. Pattern Anal. Mach. Intell. | 1 |