MétaCan
Menu
Back to cohort
Record W2559177622 · doi:10.1109/cec.2016.7744409

Speech steganalysis using evolutionary restricted Boltzmann machines

2016· article· en· W2559177622 on OpenAlex
Catherine Paulin, Sid‐Ahmed Selouani, Éric Hervet

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

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicMusic and Audio Processing
Canadian institutionsUniversité de Moncton
Fundersnot available
KeywordsSteganalysisSteganographyParticle swarm optimizationBoltzmann machineComputer scienceEvolutionary computationDivergence (linguistics)Evolutionary algorithmArtificial intelligenceGenetic algorithmAlgorithmPattern recognition (psychology)Machine learningArtificial neural networkEmbedding

Abstract

fetched live from OpenAlex

This paper presents a new method to train Restricted Boltzmann Machines (RBMs) using Evolutionary Algorithms (EAs), where RBMs are used in the first step of a steganalysis tool for speech/audio files. The following EAs have been tested: Particle Swarm Optimization (PSO), Genetic Algorithm (GA), Artificial Bees Colony (ABC) and Cat Swarm Optimization (CSO). Our method has been tested with three steganographic techniques: StegHide, Hide4PGP, and FreqSteg. A fourth technique combining the three steganographic methods has also been tested. The results are compared to the conventional contrastive divergence learning algorithm. All EAs outperform the contrastive divergence algorithm.

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.000
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: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.842
Threshold uncertainty score0.248

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.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.0000.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.024
GPT teacher head0.258
Teacher spread0.235 · 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

Quick stats

Citations13
Published2016
Admission routes1
Has abstractyes

Explore more

Same topicMusic and Audio ProcessingFrench-language works237,207