Revisit Liu & Katz (2006) And Zigunov & Charonko (2024): On The Equivalency Of Omni-Directional Integration And Pressure Poisson Equation
Bibliographic record
Abstract
In this paper we demonstrate the equivalency of Omni-Directional Integration (ODI) and the Pressure Poisson Equation (PPE) for pressure field reconstruction from corrupted image velocimetry data. Over the years, it has been long debated which of the two families of methods is better for pressure reconstruction, direct pressure gradient integration (particularly ODI) versus PPE. Some have claimed that ODI is fundamentally different, and far more accurate than PPE; while other studies observed similar reconstruction accuracy between ODI and PPE (McClure & Yarusevych, 2017). This debate has been filled with confusion and conflicting results until a recent breakthrough by Zigunov & Charonko (2023, 2024) while trying to improve the computational efficiency of ODI. In a series of works, Zigunov & Charonko (2023, 2024) reformulated the iterative integration process of ODI into a system of linear equations resembling the discretized PPE, alluding to a deep connection between ODI and PPE. With careful numerical treatment, we show that ODI can be viewed as pursuing the minimal norm solution to a Poisson equation with pure Neumann boundary conditions. We provide a detailed and physical explanation for why some have reported poor robustness of the PPE, highlighting critical nuances in its numerical implementation, and explain why the ODI is more robust to random noise in the data. We hope to put an end to the PPE versus ODI debate and clear up the confusion surrounding how these and when these methods perform well. With these new comprehensions, we can leverage the established regularization techniques and efficient numerical algorithms of elliptic equations to improve PPE/ODI-based pressure field reconstruction.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.003 | 0.008 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.005 |
| Scholarly communication | 0.003 | 0.005 |
| Open science | 0.002 | 0.004 |
| Research integrity | 0.002 | 0.005 |
| Insufficient payload (model declined to judge) | 0.003 | 0.002 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".