MétaCan
Menu
Back to cohort
Record W2148310803 · doi:10.1109/lsp.2009.2036654

KPAC: A Kernel-Based Parametric Active Contour Method for Fast Image Segmentation

2009· article· en· W2148310803 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueIEEE Signal Processing Letters · 2009
Typearticle
Languageen
FieldComputer Science
TopicMedical Image Segmentation Techniques
Canadian institutionsUniversity of Waterloo
Fundersnot available
KeywordsActive contour modelArtificial intelligenceKernel (algebra)Computer visionComputer scienceImage segmentationParametric statisticsSegmentationScale-space segmentationPattern recognition (psychology)MathematicsStatistics

Abstract

fetched live from OpenAlex

Object boundary detection has been a topic of keen interest to the signal processing and pattern recognition community. A popular approach for object boundary detection is parametric active contours. Existing parametric active contour approaches often suffer from slower convergence rates, difficulty dealing with complex high curvature boundaries, and are prone to being trapped in local optima in the presence of noise and background clutter. To address these problems, this paper proposes a novel kernel-based active contour (KPAC) approach, which replaces the conventional internal energy term used in existing approaches by incorporating an adaptive kernel derived for the underlying image characteristics. Experimental results demonstrate that the KPAC approach achieves state-of-the-art performance when compared to two other state-of-the-art parametric active contour approaches.

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.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Bench or experimental · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.517
Threshold uncertainty score0.937

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

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.

Opus teacher head0.020
GPT teacher head0.329
Teacher spread0.309 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it