Demo Data from SIGIR 2026 / reviewers in the wild / expert
Neng H. Ching
dblp:16/6008
· DBLP profile ↗
1ranked-venue papers
1as 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 · 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% | |
| Theoretical computer science
1 paper |
Graph algorithms and graph theory · 100% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Image and video processing › image restoration › inverse problem › signal reconstruction
phase unwrapping |
0.0 | 1 | 1992 | Two-dimensional phase unwrapping using a minimum spanning tree algorithm · IEEE Trans. Image Process. 1992 |
Graph algorithms and graph theory › spanning tree
minimum spanning tree |
0.0 | 1 | 1992 | Two-dimensional phase unwrapping using a minimum spanning tree algorithm · IEEE Trans. Image Process. 1992 |
Methods — techniques the papers use, named apart from their topics
taylor series expansion · 0.0segmentation · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1992 | Two-dimensional phase unwrapping using a minimum spanning tree algorithmabstractPhase unwrapping refers to the determination of phase from modulo 2pi data, some of which may not be reliable. In 2D, this is equivalent to confining the support of the phase function to one or more arbitrarily shaped regions. A phase unwrapping algorithm is presented which works for 2D data known only within a set of nonconnected regions with possibly nonconvex boundaries. The algorithm includes the following steps: segmentation to identify connectivity, phase unwrapping within each segment using a Taylor series expansion, phase unwrapping between disconnected segments along an optimum path, and filling of phase information voids. The optimum path for intersegment unwrapping is determined by a minimum spanning tree algorithm. Although the algorithm is applicable to any 2D data, the main application addressed is magnetic resonance imaging (MRI) where phase maps are useful. Neng H. Ching, Dov Rosenfeld, Michael Braun 0001 |
IEEE Trans. Image Process. | 1 |