MétaCan
Menu
Back to cohort
Record W2901335737 · doi:10.1109/taslp.2018.2881536

Incoherent Synthesis of Sparse Arrays for Frequency-Invariant Beamforming

2018· article· en· W2901335737 on OpenAlexaff
Yaakov Buchris, Alon Amar, Jacob Benesty, Israel Cohen

Bibliographic record

VenueIEEE/ACM Transactions on Audio Speech and Language Processing · 2018
Typearticle
Languageen
FieldComputer Science
TopicSpeech and Audio Processing
Canadian institutionsInstitut National de la Recherche ScientifiqueUniversité du Québec à Montréal
FundersIsrael Science Foundation
KeywordsSparse arrayBeamformingComputer scienceDirectivityRobustness (evolution)AlgorithmPlanar arraySparse approximationInvariant (physics)Cluster analysisWaveformRadarMathematicsArtificial intelligenceTelecommunications

Abstract

fetched live from OpenAlex

Frequency-invariant beamformers are used to prevent signal waveform distortions in real world applications like audio, underwater acoustics, and radar. Most of existing methods assume uniform arrays, and only few consider sparse designs, which may lead to higher performance in terms of robustness and directivity factor. We propose an incoherent approach that first determines for each frequency bin a sparse set of sensors positions. Subsequently, by using tools of dimensionality reduction and clustering, these selections are merged together yielding the optimal sensors on a sparse array layout. We present design examples of sparse linear and planar superdirective array designs. We show that the proposed incoherent sparse design obtains superior performance in terms of white noise gain, directivity factor, and computational load compared to a uniform array design and compared to a coherent sparse approach, where the sensors' locations and the beamformer coefficients are optimized simultaneously for all frequencies.

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.000
metaresearch head score (Gemma)0.001
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: Empirical · Consensus signal: none
Teacher disagreement score0.002
Threshold uncertainty score0.008

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0000.001
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0000.001
Research integrity0.0000.001
Insufficient payload (model declined to judge)0.0020.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.018
GPT teacher head0.265
Teacher spread0.247 · 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
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

Citations24
Published2018
Admission routes1
Has abstractyes

Explore more

Same venueIEEE/ACM Transactions on Audio Speech and Language ProcessingSame topicSpeech and Audio ProcessingFrench-language works237,207