{"id":899040,"date":"2022-11-18T12:11:43","date_gmt":"2022-11-18T20:11:43","guid":{"rendered":"https:\/\/www.microsoft.com\/en-us\/research\/?post_type=msr-academic-program&#038;p=899040"},"modified":"2023-03-01T01:42:29","modified_gmt":"2023-03-01T09:42:29","slug":"acoustic-echo-cancellation-challenge-icassp-2023","status":"publish","type":"msr-academic-program","link":"https:\/\/www.microsoft.com\/en-us\/research\/academic-program\/acoustic-echo-cancellation-challenge-icassp-2023\/","title":{"rendered":"Acoustic Echo Cancellation Challenge &#8211; ICASSP 2023"},"content":{"rendered":"\n\n<p><\/p>\n\n\n\n\n\n\n<p><strong>Program dates:<\/strong>&nbsp;December 2022-February 2023<\/p>\n\n\n\n<p>The <a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" href=\"https:\/\/2023.ieeeicassp.org\/\" target=\"_blank\" rel=\"noopener noreferrer\">ICASSP 2023<span class=\"sr-only\"> (opens in new tab)<\/span><\/a> Acoustic Echo Cancellation Challenge is intended to stimulate research in the area of\u202facoustic echo cancellation\u202f(AEC), which is an important part of speech enhancement and is still a top issue in audio communication and conferencing systems. This is the fourth AEC challenge. The winners of this challenge are selected based on the average Mean Opinion Score achieved across all different single talk and double talk scenarios, and the speech recognition rate.<\/p>\n\n\n\n<h3 id=\"registration-procedure\">Registration procedure<\/h3>\n\n\n\n<p>To register for the challenge,\u202fparticipants are required to email Acoustic Echo Cancellation Challenge&nbsp;<a href=\"mailto:aec_challenge@microsoft.com\">aec_challenge@microsoft.com<\/a>&nbsp;with the name of their team members, emails, affiliations, team name, and tentative paper title. Participants also need to register on the&nbsp;<a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" href=\"https:\/\/cmt3.research.microsoft.com\/AECChallenge2023\/\" target=\"_blank\" rel=\"noopener noreferrer\">Challenge CMT<span class=\"sr-only\"> (opens in new tab)<\/span><\/a>&nbsp;site where they can submit the enhanced clips.<\/p>\n\n\n\n<h3 id=\"challenge-tracks\">Challenge tracks<\/h3>\n\n\n\n<p>There are two tracks for this challenge:<\/p>\n\n\n\n<ol class=\"wp-block-list\">\n<li>Non-personalized AEC. This is similar to the ICASSP 2022 AEC Challenge.<\/li>\n\n\n\n<li>Personalized AEC. This adds speaker enrollment for the near end speaker. A speaker enrollment is a 15-25 second recording of the near end speaker that can be used for adopting the AEC for personalized echo cancellation.&nbsp;For training and model evaluation, the datasets in <a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" rel=\"noopener noreferrer\" target=\"_blank\" href=\"https:\/\/github.com\/microsoft\/AEC-Challenge\">AEC-Challenge Github page <span class=\"sr-only\"> (opens in new tab)<\/span><\/a>can be used, which include both echo and near-end only clips from users. For the blind test set, the enrollment clips will be provided.<\/li>\n<\/ol>\n\n\n\n<h3 id=\"latency-and-runtime-requirements\">Latency and runtime requirements<\/h3>\n\n\n\n<p><strong><em>Algorithmic&nbsp;<\/em><\/strong><strong><em>laten<\/em><\/strong><strong><em>cy:<\/em><\/strong>&nbsp;The offset introduced by the whole processing chain including STFT, iSTFT, overlap-add, additional lookahead frames, etc., compared to just passing the signal through without modification. But this doesn\u2019t include buffering latency.<\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li>Ex.1: A STFT-based processing with window length = 20 ms and hop length = 10 ms introduces an algorithmic delay of window length \u2013 hop length = 10 ms.<\/li>\n\n\n\n<li>Ex.2: A STFT-based processing with window length = 32 ms and hop length = 8 ms introduces an algorithmic delay of window length \u2013 hop length = 24 ms.<\/li>\n\n\n\n<li>Ex.3: An overlap-save-based processing algorithm introduces no additional algorithmic latency.<\/li>\n\n\n\n<li>Ex.4: A time-domain convolution with a filter kernel size = 16 samples introduces an algorithmic latency of kernel size \u2013 1 = 15 samples. Using one-sided padding, the operation can be made fully \u201ccausal\u201d, i.e. a left-sided padding with kernel size-1 samples would result in no algorithmic latency.<\/li>\n\n\n\n<li>Ex.5: A STFT-based processing with window_length = 20 ms and hop_length = 10 ms using 2 future frames information introduce an algorithmic latency of (window_length \u2013 hop_length) + 2*hop_length = 30 ms.<\/li>\n<\/ul>\n\n\n\n<p><strong><em>Buffering latency:<\/em><\/strong>&nbsp;It is defined as the latency introduced by block-wise processing, often referred to as hop-size, frame-shift, or temporal stride.<\/p>\n\n\n\n<p>\u2022 Ex.1: A STFT-based processing has a buffering latency corresponding to the hop size<br>\u2022 Ex.2: A overlap-save processing has a buffering latency corresponding to the frame size.<br>\u2022 Ex.3: A time-domain convolution with stride 1 introduces a buffering latency of 1 sample.<\/p>\n\n\n\n<p><strong><em>Real-time factor (RTF):<\/em><\/strong>&nbsp;RTF is defined as the fraction of time it takes to execute one processing step. For a STFT-based algorithm, one processing step is the hop-size. For a time-domain convolution, one processing step is 1 sample. RTF = compute time\/time step.<\/p>\n\n\n\n<p><strong>All models submitted to this challenge must meet all of the below requirements.<\/strong><\/p>\n\n\n\n<ol class=\"wp-block-list\">\n<li>To be able to execute an algorithm in real-time, and to accommodate for variance in compute time which occurs in practice, we require RTF <= 0.5 in the challenge on an Intel Core i5 Quadcore clocked at 2.4 GHz using a single thread.<\/li>\n\n\n\n<li>Algorithmic latency + buffering latency <= 20ms.<\/li>\n\n\n\n<li>No future information can be used during model inference.<\/li>\n<\/ol>\n\n\n\n<h3 id=\"submission-instructions\">Submission instructions<\/h3>\n\n\n\n<p>Please use&nbsp;<a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" href=\"https:\/\/cmt3.research.microsoft.com\/AECChallenge2023\/\" target=\"_blank\" rel=\"noopener noreferrer\">Microsoft Conference Management Toolkit<span class=\"sr-only\"> (opens in new tab)<\/span><\/a>&nbsp;for submitting the results. After logging in, complete the following steps to submit the results:<\/p>\n\n\n\n<ol class=\"wp-block-list\">\n<li>Choose \u201cCreate new submission\u201d in the Author Console.<\/li>\n\n\n\n<li>Enter title, abstract and co-authors, and upload a&nbsp;<em>lastname<\/em>.txt file (can be empty or contain additional information regarding the submission).<\/li>\n\n\n\n<li>Compress the enhanced results files to a single&nbsp;<em>lastname<\/em>.zip file, retaining the same folder and file names as the blind test set (max file size: 1.8 GB).<\/li>\n\n\n\n<li>After creating the submission, return to the \u201cAuthor Console\u201d (by clicking on \u201cSubmissions\u201d at the top of the page) and upload the&nbsp;<em>lastname<\/em>.zip file via \u201cUpload Supplementary Material\u201d.<\/li>\n<\/ol>\n\n\n\n<p><\/p>\n\n\n\n<p><strong>Contact us:<\/strong>&nbsp;For questions, please contact&nbsp;<a href=\"mailto:aec_challenge@microsoft.com\">aec_challenge@microsoft.com<\/a><\/p>\n\n\n\n<p><\/p>\n\n\n\n\n\n<h2 id=\"official-rules\">Official rules<\/h2>\n\n\n\n<h3 id=\"sponsor\">Sponsor<\/h3>\n\n\n\n<p>These Official Rules (\u201cRules\u201d) govern the operation of the Microsoft ICASSP 2023 AEC (see overview) Event Contest (\u201cContest\u201d). Microsoft Corporation, One Microsoft Way, Redmond, WA, 98052, USA, is the Contest sponsor (\u201cSponsor\u201d).<\/p>\n\n\n\n<h3 id=\"definitions\">Definitions<\/h3>\n\n\n\n<p>In these Rules, \u201cMicrosoft\u201d, \u201cwe\u201d, \u201cour\u201d, and \u201cus\u201d, refer to Sponsor and \u201cyou\u201d and \u201cyourself\u201d refers to a Contest participant, or the parent\/legal guardian of any Contest entrant who has not reached the age of majority to contractually obligate themselves in their legal place of residence. \u201cEvent\u201d refers to the ICASSP 2023 AEC Challenge (the \u201cEvent\u201d). By entering you (your parent\/legal guardian if you are not the age of majority in your legal place of residence) agree to be bound by these Rules.<\/p>\n\n\n\n<h3 id=\"entry-period\">Entry period<\/h3>\n\n\n\n<p>The Contest will operate from December 1, 2022 to February 3, 2023 (\u201cEntry Period\u201d). The Entry Period is divided into several periods as described in section How to Enter.<\/p>\n\n\n\n<h3 id=\"eligibility\">Eligibility<\/h3>\n\n\n\n<p>Open to any registered Event attendee 18 years of age or older. If you are 18 years of age or older but have not reached the age of majority in your legal place of residence, then you must have consent of a parent\/legal guardian. Employees and directors of Microsoft Corporation and its subsidiaries, affiliates, advertising agencies, and Contest Parties are not eligible, nor are persons involved in the execution or administration of this promotion, or the family members of each above (parents, children, siblings, spouse\/domestic partners, or individuals residing in the same household). Void in Cuba, Iran, North Korea, Sudan, Syria, Region of Crimea, and where prohibited. For business\/tradeshow events: If you are attending the Event in your capacity as an employee, it is your sole responsibility to comply with your employer\u2019s gift policies. Microsoft will not be party to any disputes or actions related to this matter.<\/p>\n\n\n\n<h3 id=\"how-to-enter\">How to enter<\/h3>\n\n\n\n<p>The Contest Objective is to promote collaborative research in real-time single-channel Speech Enhancement aimed to maximize the subjective (perceptual) quality of the enhanced speech. Winners will be determined based on the speech quality of AEC models using the online subjective evaluation framework ITU-T P.831. Only models described in accepted ICASSP 2023 Grand Challenge papers will be eligible for winning the Contest. See&nbsp;<a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" rel=\"noopener noreferrer\" target=\"_blank\" href=\"https:\/\/www.researchgate.net\/publication\/356204168_ICASSP_2022_Acoustic_Echo_Cancellation_Challenge\">ICASSP 2022 Acoustic Echo Cancellation Challenge<span class=\"sr-only\"> (opens in new tab)<\/span><\/a>&nbsp;for additional Contest details. You may participate as an individual or a team. If forming a team, you must designate a \u201cTeam Captain\u201d who will submit all entry materials on behalf of the team. Once you register as part of a Team, you cannot change Teams or alter your current team (either by adding or removing members) after the submission of your Entry. Limit one Entry per person and per team. You may not compete on multiple teams and you may not enter individually and on a team. We are not responsible for Entries that we do not receive for any reason, or for Entries that we receive but are not decipherable or not functional for any reason. Each Team is solely responsible for its own cooperation and teamwork. In no event will Microsoft officiate in any dispute regarding the conduct or cooperation of any Team or its members. The Contest will operate as follows: Registration \/ Development Period: December 1, 2022 to January 15, 2023. To register, please send an email to&nbsp;<a href=\"mailto:aec_challenge@microsoft.com\">aec_challenge@microsoft.com<\/a>&nbsp;stating that you are interested to participate in the challenge. Please include the following details in your email:<\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li>Names of the participants and name of the team captain<\/li>\n\n\n\n<li>Institution\/Company<\/li>\n\n\n\n<li>Email<\/li>\n<\/ul>\n\n\n\n<p>Then, i. develop a speech enhancement model that best meets the Contest Objective as described more fully at&nbsp;<a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" rel=\"noopener noreferrer\" target=\"_blank\" href=\"https:\/\/www.researchgate.net\/publication\/356204168_ICASSP_2022_Acoustic_Echo_Cancellation_Challenge\">ICASSP 2022 Acoustic Echo Cancellation Challenge<span class=\"sr-only\"> (opens in new tab)<\/span><\/a>&nbsp;and ii. submit a ICASSP 2023 Grand Challenge paper via&nbsp;<a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" rel=\"noopener noreferrer\" target=\"_blank\" href=\"https:\/\/cmt3.research.microsoft.com\/AECChallenge2023\/\">Microsoft Conference Management Toolkit<span class=\"sr-only\"> (opens in new tab)<\/span><\/a>&nbsp;which reports the computational complexity of the model in terms of the number of parameters and the time it takes to infer a frame on a particular CPU (preferably Intel Core i5 quad core machine clocked at 2.4 GHz). To develop your model, use any publicly available dataset for training data, including the Contest datasets provided for training and developing models. You may augment your datasets with the Contest dataset. You can augment your data in any way that improves the performance of your model. The final evaluation will be conducted on a blind test set that is similar to the open sourced test set. Testing \/ Entry Period: January 15 \u2013 January 20, 2023. On January 15, the blind test dataset will be made available. You will have until 11:59 PM PT on January 20 to test your model against this dataset and create a set of enhanced clips to submit for judging (your \u201cEntry\u201d). The rules of the challenge are as follows:<\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li>For real-time track, the AEC must take less than the stride time&nbsp;<em>T_s<\/em>&nbsp;(in ms) to process a frame of size&nbsp;<em>T<\/em>&nbsp;(in ms) on an Intel Core i5 quad-core machine clocked at 2.4 GHz or equivalent processors. For example,&nbsp;<em>T_s = T\/2<\/em>&nbsp;for 50% overlap between frames. <\/li>\n\n\n\n<li>Algorithmic latency + buffering latency <= 20ms.<\/li>\n\n\n\n<li>The AEC can be a deep model, a traditional signal processing algorithm, or a mix of the two. There are no restrictions on the AEC aside from the run time and algorithmic delay described above.<\/li>\n\n\n\n<li>Submissions must follow instructions on overview.<\/li>\n\n\n\n<li>Winners will be picked based on the subjective echo MOS evaluated on the blind test set using ITU-T P.831 framework, as well as word error rate using Microsoft Azure Cognitive Services.<\/li>\n\n\n\n<li>The blind test set will be made available to the participants on January 15, 2023. Participants must send the results (audio clips) achieved by their developed models to the organizers. We will use the submitted clips to conduct ITU-T P.831 subjective evaluation and pick the winners based on the results. Participants are forbidden from using the blind test set to retrain or tune their models. They should not submit results using other AEC methods that they are not submitting to ICASSP 2023. Failing to adhere to these rules will lead to disqualification from the challenge.<\/li>\n\n\n\n<li>Participants should report the computational complexity of their model in terms of the number of parameters and the time it takes to infer a frame on a particular CPU (preferably Intel Core i5 quad-core machine clocked at 2.4 GHz).<\/li>\n\n\n\n<li>Each participating team must submit an ICASSP paper that summarizes the research efforts and provide all the details to ensure reproducibility. Authors may choose to report additional objective\/subjective metrics in their paper. The papers need to be in ICASSP format as outlined in&nbsp;<a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" rel=\"noopener noreferrer\" target=\"_blank\" href=\"https:\/\/2023.ieeeicassp.org\/paper-submission-guidelines\/\">ICASSP 2023 Paper Kit<span class=\"sr-only\"> (opens in new tab)<\/span><\/a><\/li>\n\n\n\n<li>Submitted papers will undergo the standard peer-review process of ICASSP 2023. The paper needs to be accepted to the conference for the participants to be eligible for the challenge.<\/li>\n<\/ul>\n\n\n\n<p>ICASSP 2023 Grand Challenge Paper Submission and Judging Period: January 27, 2023 \u2013 11:59 PM PT February 3, 2023. To submit a paper, visit&nbsp;<a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" rel=\"noopener noreferrer\" target=\"_blank\" href=\"https:\/\/cmt3.research.microsoft.com\/AECChallenge2023\/\">Microsoft Conference Management Toolkit<span class=\"sr-only\"> (opens in new tab)<\/span><\/a>. The entry limit is one per person during the Entry Period. Any attempt to obtain more than the stated number of entries by using multiple\/different accounts, identities, registrations, logins, or any other methods will void your entries and you may be disqualified. Use of any automated system to participate is prohibited. We are not responsible for excess, lost, late, or incomplete entries. If disputed, entries will be deemed submitted by the \u201cauthorized account holder\u201d of the email address, social media account, or other method used to enter. The \u201cauthorized account holder\u201d is the natural person assigned to an email address by an internet or online service provider, or other organization responsible for assigning email addresses.<\/p>\n\n\n\n<h3 id=\"eligible-entry\">Eligible entry<\/h3>\n\n\n\n<p>To be eligible, an entry must meet the following content\/technical requirements:<\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li>Your Entry must be the method described in a paper accepted as ICASSP 2023 Grand Challenge paper.<\/li>\n\n\n\n<li>Your entry must be your own original work; and<\/li>\n\n\n\n<li>Your entry cannot have been selected as a winner in any other contest; and<\/li>\n\n\n\n<li>You must have obtained any and all consents, approvals, or licenses required for you to submit your entry; and<\/li>\n\n\n\n<li>To the extent that entry requires the submission of user-generated content such as software, photos, videos, music, artwork, essays, etc., entrants warrant that their entry is their original work, has not been copied from others without permission or apparent rights, and does not violate the privacy, intellectual property rights, or other rights of any other person or entity. You may include Microsoft trademarks, logos, and designs, for which Microsoft grants you a limited license to use for the sole purposes of submitting an entry into this Contest; and<\/li>\n\n\n\n<li>Your entry may NOT contain, as determined by us in our sole and absolute discretion, any content that is obscene or offensive, violent, defamatory, disparaging or illegal, or that promotes alcohol, illegal drugs, tobacco or a particular political agenda, or that communicates messages that may reflect negatively on the goodwill of Microsoft.<\/li>\n\n\n\n<li>Your entry must NOT include enhanced clips using other AEC methods that you are not submitting to ICASSP 2023.<\/li>\n<\/ul>\n\n\n\n<h3 id=\"use-of-entries\">Use of entries<\/h3>\n\n\n\n<p>We are not claiming ownership rights to your Submission. However, by submitting an entry, you grant us an irrevocable, royalty-free, worldwide right and license to use, review, assess, test and otherwise analyze your entry and all its content in connection with this Contest and use your entry in any media whatsoever now known or later invented for any non-commercial or commercial purpose, including, but not limited to, the marketing, sale or promotion of Microsoft products or services, without further permission from you. You will not receive any compensation or credit for use of your entry, other than what is described in these Official Rules. By entering you acknowledge that the we may have developed or commissioned materials similar or identical to your entry and you waive any claims resulting from any similarities to your entry. Further you understand that we will not restrict work assignments of representatives who have had access to your entry and you agree that use of information in our representatives\u2019 unaided memories in the development or deployment of our products or services does not create liability for us under this agreement or copyright or trade secret law. Your entry may be posted on a public website. We are not responsible for any unauthorized use of your entry by visitors to this website. We are not obligated to use your entry for any purpose, even if it has been selected as a winning entry.<\/p>\n\n\n\n<h3 id=\"winner-selection-and-notification\">Winner selection and notification<\/h3>\n\n\n\n<p>Pending confirmation of eligibility, potential winners will be selected by Microsoft or their Agent or a qualified judging panel from among all eligible entries received based on the following judging criteria: 99% \u2013 The subjective speech quality evaluated on the blind test set using ITU-T P.831 framework. We will use the submitted clips with no alteration to conduct ITU-T P.831 subjective evaluation and pick the winners based on the results.&nbsp;See for additional Contest details. 1% \u2013 The Entry was described in an accepted ICASSP 2023 Grand Challenge paper. Winners will be selected within 7 days following the event. Winners will be notified within 7 days following the Event. In the event of a tie between any eligible entries, an additional judge will break the tie based on the judging criteria described above. The decisions of the judges are final and binding. If public vote determines winners, it is prohibited for any person to obtain votes by any fraudulent or inappropriate means, including offering prizes or other inducements in exchange for votes, automated programs or fraudulent ID\u2019s. Microsoft will void any questionable votes.<\/p>\n\n\n\n<h3 id=\"odds\">Odds<\/h3>\n\n\n\n<p>The odds of winning are based on the number and quality of eligible entries received.<\/p>\n\n\n\n<h3 id=\"general-conditions-and-release-of-liability\">General conditions and release of liability<\/h3>\n\n\n\n<p>To the extent allowed by law, by entering you agree to release and hold harmless Microsoft and its respective parents, partners, subsidiaries, affiliates, employees, and agents from any and all liability or any injury, loss, or damage of any kind arising in connection with this. All local laws apply. The decisions of Microsoft are final and binding. We reserve the right to cancel, change, or suspend this Contest for any reason, including cheating, technology failure, catastrophe, war, or any other unforeseen or unexpected event that affects the integrity of this Contest, whether human or mechanical. If the integrity of the Contest cannot be restored, we may select winners from among all eligible entries received before we had to cancel, change or suspend the Contest. If you attempt or we have strong reason to believe that you have compromised the integrity or the legitimate operation of this Contest by cheating, hacking, creating a bot or other automated program, or by committing fraud in any way, we may seek damages from you to the full extent of the law and you may be banned from participation in future Microsoft promotions.<\/p>\n\n\n\n<h3 id=\"governing-law\">Governing law<\/h3>\n\n\n\n<p>This Contest will be governed by the laws of the State of Washington, and you consent to the exclusive jurisdiction and venue of the courts of the State of Washington for any disputes arising out of this Contest.<\/p>\n\n\n\n<h3 id=\"privacy\">Privacy<\/h3>\n\n\n\n<p>At Microsoft, we are committed to protecting your privacy. Microsoft uses the information you provide on this form to notify you of important information about our products, upgrades and enhancements, and to send you information about other Microsoft products and services. Microsoft will not share the information you provide with third parties without your permission except where necessary to complete the services or transactions you have requested, or as required by law. Microsoft is committed to protecting the security of your personal information. We use a variety of security technologies and procedures to help protect your personal information from unauthorized access, use, or disclosure. Your personal information is never shared outside the company without your permission, except under conditions explained above. If you believe that Microsoft has not adhered to this statement, please contact Microsoft by sending an email to&nbsp;<a href=\"mailto:privrc@microsoft.com\">privrc@microsoft.com<\/a>&nbsp;or postal mail to Microsoft Privacy Response Center, Microsoft Corporation, One Microsoft Way, Redmond, WA 98052<\/p>\n\n\n\n\n\n<h2 id=\"program-timeline\">Program timeline<\/h2>\n\n\n\n<p>This challenge is to benchmark the performance of real-time algorithms with a real (not simulated) test set. Participants will evaluate their acoustic echo canceller on a test set and submit the results (audio clips) for evaluation. The requirements for each acoustic echo canceller used for submission are:<\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li><strong>December 1, 2022<\/strong>: Challenge start. The datasets and scripts from previous challenges are applicable.<\/li>\n\n\n\n<li><strong>January 15, 2023<\/strong>: Blind test set released to participants<\/li>\n\n\n\n<li><strong>January 20, 2023<\/strong>: Deadline for participants to submit their results for objective and P.808 subjective evaluation on the blind test set<\/li>\n\n\n\n<li><strong>February 3, 2023<\/strong>: Subjective and objective results released by the organizers<\/li>\n\n\n\n<li><strong>February 20, 2023<\/strong>: Grand Challenge 2-page Papers Due (by invitation only)<\/li>\n\n\n\n<li><strong>March 7, 2023<\/strong>: Grand Challenge 2-page Paper Acceptance Notification<\/li>\n\n\n\n<li><strong>March 14, 2023<\/strong>: Camera-ready Grand Challenge 2-page Papers Due<\/li>\n\n\n\n<li><strong>August 8, 2023<\/strong>: Grand Challenge OJ-SP Papers Due (by invitation only)<\/li>\n<\/ul>\n\n\n\n\n\n<h2 id=\"organizers\">Organizers<\/h2>\n\n\n\n<ul class=\"wp-block-list\">\n<li><a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/rcutler\/\">Ross Cutler<\/a>, Microsoft, USA<\/li>\n\n\n\n<li>Ando Saabas, Microsoft, Estonia<\/li>\n\n\n\n<li>Tanel P\u00e4rnamaa, Microsoft, Estonia<\/li>\n\n\n\n<li>Marju Purin, Microsoft, Estonia<\/li>\n\n\n\n<li>Evgenii Indenbom, Microsoft, Estonia<\/li>\n\n\n\n<li>Nicolae-Catalin Ristea, Microsoft, Estonia<\/li>\n\n\n\n<li>Jegor Guzhvin, Microsoft, Estonia<\/li>\n\n\n\n<li><a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/raichner\/\">Robert Aichner<\/a>, Microsoft, USA<\/li>\n\n\n\n<li><a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/sebraun\/\">Sebastian Braun<\/a>, Microsoft Research, USA<\/li>\n\n\n\n<li><a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/hagamper\/\">Hannes Gamper<\/a>, Microsoft Research, USA<\/li>\n<\/ul>\n\n\n\n\n\n<h2 id=\"related-links\">Related links<\/h2>\n\n\n\n<ul class=\"wp-block-list\">\n<li><a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" rel=\"noopener noreferrer\" target=\"_blank\" href=\"https:\/\/aecchallengepublic.blob.core.windows.net\/icassp2023\/blind_test_set_icassp2023.zip\">Blind test set <span class=\"sr-only\"> (opens in new tab)<\/span><\/a>for ICASSP 2023<\/li>\n\n\n\n<li><a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" href=\"https:\/\/github.com\/microsoft\/AEC-Challenge\" target=\"_blank\" rel=\"noopener noreferrer\">Training and test datasets<span class=\"sr-only\"> (opens in new tab)<\/span><\/a><\/li>\n\n\n\n<li><a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" rel=\"noopener noreferrer\" target=\"_blank\" href=\"https:\/\/www.researchgate.net\/publication\/356204168_ICASSP_2022_Acoustic_Echo_Cancellation_Challenge\">ICASSP 2022 Acoustic Echo Cancellation Challenge<span class=\"sr-only\"> (opens in new tab)<\/span><\/a>&nbsp;(paper)<\/li>\n\n\n\n<li>Previous challenge papers:\n<ul class=\"wp-block-list\">\n<li><a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" rel=\"noopener noreferrer\" target=\"_blank\" href=\"https:\/\/arxiv.org\/pdf\/2009.04972.pdf\">Acoustic Echo Cancellation Challenge: Datasets and Testing Framework<span class=\"sr-only\"> (opens in new tab)<\/span><\/a>&nbsp;(ICASSP 2021 paper)<\/li>\n\n\n\n<li><a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" rel=\"noopener noreferrer\" target=\"_blank\" href=\"https:\/\/www.isca-speech.org\/archive\/pdfs\/interspeech_2021\/cutler21_interspeech.pdf\">INTERSPEECH 2021 Acoustic Echo Cancellation Challenge<span class=\"sr-only\"> (opens in new tab)<\/span><\/a>&nbsp;(InterSpeech 2021 paper)<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n\n\n\n<h3 id=\"other-challenges\">Other challenges<\/h3>\n\n\n\n<ul class=\"wp-block-list\">\n<li><a href=\"https:\/\/www.microsoft.com\/en-us\/research\/academic-program\/audio-deep-packet-loss-concealment-challenge-interspeech-2022\/\">Audio Deep Packet Loss Concealment Challenge \u2013 INTERSPEECH 2022<\/a><\/li>\n\n\n\n<li><a href=\"https:\/\/www.microsoft.com\/en-us\/research\/academic-program\/deep-noise-suppression-challenge-icassp-2022\/\">Deep Noise Suppression Challenge \u2013 ICASSP 2022<\/a><\/li>\n\n\n\n<li><a href=\"https:\/\/www.microsoft.com\/en-us\/research\/academic-program\/acoustic-echo-cancellation-challenge-icassp-2022\/\">Acoustic Echo Cancellation Challenge \u2013 ICASSP 2022<\/a><\/li>\n\n\n\n<li><a href=\"https:\/\/www.microsoft.com\/en-us\/research\/academic-program\/acoustic-echo-cancellation-challenge-icassp-2021\/\">Acoustic Echo Cancellation Challenge \u2013 ICASSP 2021<\/a><\/li>\n\n\n\n<li><a href=\"https:\/\/www.microsoft.com\/en-us\/research\/academic-program\/deep-noise-suppression-challenge-icassp-2021\/\">Deep Noise Suppression Challenge \u2013 ICASSP 2021<\/a><\/li>\n\n\n\n<li><a href=\"https:\/\/www.microsoft.com\/en-us\/research\/academic-program\/acoustic-echo-cancellation-challenge-interspeech-2021\/\">Acoustic Echo Cancellation Challenge \u2013 INTERSPEECH 2021<\/a><\/li>\n\n\n\n<li><a href=\"https:\/\/www.microsoft.com\/en-us\/research\/academic-program\/deep-noise-suppression-challenge-interspeech-2020\/\">Deep Noise Suppression Challenge \u2013 INTERSPEECH 2020<\/a><\/li>\n<\/ul>\n\n\n\n\n\n<p>Evaluation results and final standings<\/p>\n\n\n\n<figure class=\"wp-block-image size-full\"><img loading=\"lazy\" decoding=\"async\" width=\"2050\" height=\"952\" src=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2023\/03\/image-63ff1c0faea02.png\" alt=\"Challenge results\" class=\"wp-image-923691\" srcset=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2023\/03\/image-63ff1c0faea02.png 2050w, https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2023\/03\/image-63ff1c0faea02-300x139.png 300w, https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2023\/03\/image-63ff1c0faea02-1024x476.png 1024w, https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2023\/03\/image-63ff1c0faea02-768x357.png 768w, https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2023\/03\/image-63ff1c0faea02-1536x713.png 1536w, https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2023\/03\/image-63ff1c0faea02-2048x951.png 2048w, https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2023\/03\/image-63ff1c0faea02-240x111.png 240w\" sizes=\"auto, (max-width: 2050px) 100vw, 2050px\" \/><\/figure>\n\n\n\n<div style=\"height:100px\" aria-hidden=\"true\" class=\"wp-block-spacer\"><\/div>\n\n\n\n<p>Anova for the top teams<\/p>\n\n\n\n<figure class=\"wp-block-image size-full\"><img loading=\"lazy\" decoding=\"async\" width=\"752\" height=\"211\" src=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2023\/02\/image.png\" alt=\"Anova for top teams\" class=\"wp-image-916368\" srcset=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2023\/02\/image.png 752w, https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2023\/02\/image-300x84.png 300w, https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2023\/02\/image-240x67.png 240w\" sizes=\"auto, (max-width: 752px) 100vw, 752px\" \/><\/figure>\n\n\n","protected":false},"featured_media":0,"template":"","meta":{"msr-url-field":"","msr-podcast-episode":"","msrModifiedDate":"","msrModifiedDateEnabled":false,"ep_exclude_from_search":false,"_classifai_error":"","msr_hide_image_in_river":0,"footnotes":""},"msr-opportunity-type":[187426],"msr-region":[256048],"msr-locale":[268875],"msr-program-audience":[],"msr-post-option":[],"msr-impact-theme":[],"class_list":["post-899040","msr-academic-program","type-msr-academic-program","status-publish","hentry","msr-opportunity-type-challenges","msr-region-global","msr-locale-en_us"],"msr_description":"","msr_social_media":[],"related-researchers":[{"type":"user_nicename","display_name":"Ross Cutler","user_id":40660,"people_section":"Section name 0","alias":"rcutler"},{"type":"user_nicename","display_name":"Babak Naderi","user_id":42525,"people_section":"Section name 0","alias":"babaknaderi"}],"tab-content":[],"msr_impact_theme":[],"_links":{"self":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-academic-program\/899040","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-academic-program"}],"about":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/types\/msr-academic-program"}],"version-history":[{"count":32,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-academic-program\/899040\/revisions"}],"predecessor-version":[{"id":958908,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-academic-program\/899040\/revisions\/958908"}],"wp:attachment":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/media?parent=899040"}],"wp:term":[{"taxonomy":"msr-opportunity-type","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-opportunity-type?post=899040"},{"taxonomy":"msr-region","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-region?post=899040"},{"taxonomy":"msr-locale","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-locale?post=899040"},{"taxonomy":"msr-program-audience","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-program-audience?post=899040"},{"taxonomy":"msr-post-option","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-post-option?post=899040"},{"taxonomy":"msr-impact-theme","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-impact-theme?post=899040"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}