MétaCan
Menu
Back to cohort
Record W2341289911 · doi:10.1109/taslp.2016.2556860

Comparison of Loudspeaker Placement Methods for Sound Field Reproduction

2016· article· en· W2341289911 on OpenAlexaff
Hanieh Khalilian, Ivan V. Bajić, Rodney G. Vaughan

Bibliographic record

VenueIEEE/ACM Transactions on Audio Speech and Language Processing · 2016
Typearticle
Languageen
FieldNeuroscience
TopicHearing Loss and Rehabilitation
Canadian institutionsSimon Fraser University
FundersVictoria University
KeywordsLoudspeakerDirectional soundBenchmark (surveying)Computer scienceSingular value decompositionAcousticsField (mathematics)Matrix (chemical analysis)Sound recording and reproductionMathematicsAlgorithmPhysics

Abstract

fetched live from OpenAlex

This paper presents a comparison between several loudspeaker placement methods for sound field reproduction (SFR). The goal of these placement methods is to reduce the SFR error under a power constraint by selecting suitable locations for the loudspeakers. The first method is based on singular value decomposition of the acoustic transfer function (ATF) matrix. Depending on the configuration, an ideal ATF matrix is created and, then, approximated by selecting the appropriate locations for the loudspeakers. Another method is based on the constrained matching pursuit (CMP) algorithm, in which candidate locations of the loudspeakers are selected iteratively to minimize the approximation error of the desired sound field. The third method is based on sparsity-promoting sound field approximation using the least absolute shrinkage and selection operator. Loudspeaker placements obtained using these methods are compared against benchmark configuration of uniformly distributed loudspeakers. The comparison indicates that for constrained power, the CMP-based placement has the least reproduction error.

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.005
Version: metacan-v3-hybrid-931329e0061cValidation 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: Empirical · Consensus signal: none
Teacher disagreement score0.006
Threshold uncertainty score0.021

Distilled classifier scores by category (both heads)

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

Opus teacher head0.063
GPT teacher head0.414
Teacher spread0.351 · 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 designBench or experimental
Domainnot available
GenreEmpirical

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

Citations30
Published2016
Admission routes1
Has abstractyes

Explore more

Same venueIEEE/ACM Transactions on Audio Speech and Language ProcessingSame topicHearing Loss and RehabilitationFrench-language works237,207