A New Scheme for Robust Gradient Vector Estimation in Color Images
Bibliographic record
Abstract
Gradient estimators are mostly designed to yield accurate and robust estimates of the gradient magnitude, not the gradient direction. This paper proposes a method for the accurate and robust estimation of both the gradient magnitude and direction. It robustly estimates the gradient in the x- and y-directions. The robustness against noise is achieved by prefiltering and postfiltering of the gradient in each direction. To reduce edge blurring effects introduced by these filters, the gradient in a certain direction is obtained by applying the prefilter and postfilter in the perpendicular direction. The basic elements employed in each window are: highpass, lowpass and aggregation operators. The highpass operator is used as a gradient estimator, the lowpass operator is for prefiltering and postfiltering, and the aggregation operator is for aggregating the prefiltered and postfiltered gradients. Four different combinations of highpass, lowpass and aggregation operators are proposed: MVD-Median-Mean, MVD-Median-Max, RCMG-Median-Mean, and RCMG-Median-Max. Experimental results show that the RCMG-Median-Mean has the best performance in estimating the gradient and detecting the edges in noisy color images. It is computationally more efficient than the state-of-the-art gradient estimators and is able to accurately estimate the gradient direction as well as the gradient magnitude. Computer simulation results show that the proposed method outperforms other recently proposed color gradient estimators and edge detectors.
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.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
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".