MétaCan
Menu
Back to cohort
Record W1944439395 · doi:10.1002/sec.644

Unified phase and magnitude speech spectra data hiding algorithm

2013· article· en· W1944439395 on OpenAlexaff
Fatiha Djebbar, Beghdad Ayad, Karim Abed‐Meraim, Habib Hamam

Bibliographic record

VenueSecurity and Communication Networks · 2013
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Steganography and Watermarking Techniques
Canadian institutionsUniversité de Moncton
Fundersnot available
KeywordsComputer scienceCommunication sourceAlgorithmInformation hidingMagnitude (astronomy)Set (abstract data type)Distortion (music)EmbeddingExploitPhase (matter)Speech recognitionData miningArtificial intelligenceComputer networkBandwidth (computing)Computer security

Abstract

fetched live from OpenAlex

ABSTRACT In this paper, we present a unified algorithm for phase and magnitude speech spectra data hiding. The phase and the magnitude speech spectra are concurrently investigated to increase the capacity and the security of the embedded information. The proposed algorithm in this paper is based on finding secure spectral embedding areas in wideband magnitude speech spectrum. Our approach exploits these areas to hide data in both speech components (i.e., phase and magnitude). The embedding locations and hiding capacity are defined according to a controlled acceptable distortion in the magnitude spectrum. The latter is expressed as a set of parameters controlled by the sender. Consequently, the hiding capacity and the locations of concealed data change for each data communication instance to further prevent malicious intrusions. Objective results show that the presented algorithm in this paper secures hidden data and achieves interesting tradeoffs between the hiding capacity and the speech quality. Copyright © 2013 John Wiley & Sons, Ltd.

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 imitation

Not 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.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.002
Version: metacan-v3-hybrid-931329e0061cValidation 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: Methods
Teacher disagreement score0.003
Threshold uncertainty score0.009

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.002
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0000.001
Scholarly communication0.0010.002
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0030.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.

Opus teacher head0.023
GPT teacher head0.280
Teacher spread0.257 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreMethods

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".

Quick stats

Citations31
Published2013
Admission routes1
Has abstractyes

Explore more

Same venueSecurity and Communication NetworksSame topicAdvanced Steganography and Watermarking TechniquesFrench-language works237,207