Convex room geometry estimation from acoustic echoes using iterative convex hull expansion technique반복적 컨벡스 헐 확장 기법을 사용한 음향 에코 기반 볼록 방 형상 추정

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 50
  • Download : 0
This thesis proposes a methodology to estimate room geometry from times of arrival of early reflections in room impulse responses measured at multiple microphones. Room shape can be inferred by estimating the wall positions constituting a room, and several methods have been proposed for estimating the wall positions. The conventional methods to estimate wall positions require the times of arrival of the first-order reflections from the same wall. However, when microphones are widely distributed in space, the times of arrival from the same wall arrive at each microphone in a different order, which induces the echo labeling problem. Thus, in order to estimate wall positions, the echo labeling problem, which can be solved by associating the times of arrival with each wall, is the most critical problem for room geometry inference. In this thesis, the echo labeling problem is tackled by proposing the iterative echo labeling algorithm. The iterative echo labeling algorithm constructs ellipses using the first-arriving reflections between all loudspeakers and microphones in the first iteration and estimates the walls tangent to the convex hull calculated by the ellipses. In the next iteration, the convex hull is expanded by utilizing subsequent times of arrival. The tangents of the intersection between the expanded convex hull and the estimated room in the previous iteration are investigated to estimate other walls. As this iteration is repeated, the convex hull is continuously expanded in space, and walls tangent to the convex hull are estimated in each iteration. In some iteration, the convex hull contains the estimated room in the previous iteration. In this iteration, the estimated room becomes the real room, and the iterative echo labeling algorithm is terminated. As a result, the iterative echo labeling algorithm can efficiently solve the echo labeling problem within a reasonable time, compared to previous research. Besides, the search space is greatly reduced by the geometrical constraints induced by the proposed method, which results in improved echo labeling performance. However, there is a limitation that the iterative echo labeling algorithm cannot solve the echo labeling problem if all microphones do not acquire all times of arrival of the first-order reflections from each wall. The reason for this is that the iterative echo labeling algorithm always expands the convex hull. To address the problem induced by undetected times of arrival of the first-order reflections, the inner convex hull search algorithm is proposed. The inner convex hull search algorithm contracts the convex hull constructed by the iterative echo labeling algorithm from the outermost convex hull to the inner convex hull to estimate walls possibly missed by the iterative echo labeling algorithm in subiterations. The simulation and experiment results show that room geometry can be estimated even when some undetected times of arrival exist.
Advisors
Choi, Jung-Wooresearcher최정우researcher
Description
한국과학기술원 :전기및전자공학부,
Publisher
한국과학기술원
Issue Date
2021
Identifier
325007
Language
eng
Description

학위논문(박사) - 한국과학기술원 : 전기및전자공학부, 2021.2,[v, 96 p. :]

Keywords

Room shape estimation▼aconvex hull geometry▼aecho labeling problem▼areflector localization▼aTOA disambiguation; 방 형상 추정▼a컨벡스 헐 기하학▼a에코 라벨링 문제▼a반사체 위치 추정▼a시간 지연 명확성

URI
http://hdl.handle.net/10203/295706
Link
http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=959245&flag=dissertation
Appears in Collection
EE-Theses_Ph.D.(박사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0