Fuliang Yin

Bio: Fuliang Yin is an academic researcher from Dalian University of Technology. The author has contributed to research in topics: MIMO & Blind signal separation. The author has an hindex of 13, co-authored 48 publications receiving 408 citations.

A Region-Growing Permutation Alignment Approach in Frequency-Domain Blind Source Separation of Speech Mixtures

Abstract: The convolutive blind source separation (BSS) problem can be solved efficiently in the frequency domain, where instantaneous BSS is performed separately in each frequency bin. However, the permutation ambiguity in each frequency bin should be resolved so that the separated frequency components from the same source are grouped together. To solve the permutation problem, this paper presents a new alignment method based on an inter-frequency dependence measure: the powers of separated signals. Bin-wise permutation alignment is applied first across all frequency bins, using the correlation of separated signal powers; then the full frequency band is partitioned into small regions based on the bin-wise permutation alignment result. Finally, region-wise permutation alignment is performed in a region-growing manner. The region-wise permutation correction scheme minimizes the spreading of the misalignment at isolated frequency bins to others, hence to improve permutation alignment. Experiment results in simulated and real environments verify the effectiveness of the proposed method. Analysis demonstrates that the proposed frequency-domain BSS method is computationally efficient.

Combining superdirective beamforming and frequency-domain blind source separation for highly reverberant signals

Abstract: Frequency-domain blind source separation (BSS) performs poorly in high reverberation because the independence assumption collapses at each frequency bins when the number of bins increases. To improve the separation result, this paper proposes a method which combines two techniques by using beamforming as a preprocessor of blind source separation. With the sound source locations supposed to be known, the mixed signals are dereverberated and enhanced by beamforming; then the beamformed signals are further separated by blind source separation. To implement the proposed method, a superdirective fixed beamformer is designed for beamforming, and an interfrequency dependence-based permutation alignment scheme is presented for frequency-domain blind source separation. With beamforming shortening mixing filters and reducing noise before blind source separation, the combined method works better in reverberation. The performance of the proposed method is investigated by separating up to 4 sources in different environments with reverberation time from 100 ms to 700 ms. Simulation results verify the outperformance of the proposed method over using beamforming or blind source separation alone. Analysis demonstrates that the proposed method is computationally efficient and appropriate for real-time processing.

A Harmonic Suppression Method Based on Fractional Lower Order Statistics for Power System

Abstract: Impulse noise in power systems would seriously degrade the harmonic suppression performance. To remedy this problem, a novel harmonic suppression method based on fractional lower order statistics (FLOS) is proposed in this paper. In the proposed method, impulse noise is modeled by alpha-stable distribution. Then, the ESPRIT spectrum estimation algorithm is improved by FLOS for impulse noise and used to estimate the fundamental frequency of power signal, and the frequency of each harmonic component is obtained from this estimated frequency. Next, the amplitude of each harmonic component is estimated by a modified recursive least squares (RLS) algorithm. Finally, a harmonic compensation signal is generated by the active power filter based on the estimated frequencies and amplitudes to cancel original harmonics. The proposed method has a competitive advantage that it can suppress harmonics well even if the impulse noise activating and has a fast tracking ability for changing harmonics. Also, due to the use of self-sensing actuator principle, the proposed method can not only guarantee the performance of suppressing harmonics at normal operation states, but also ensure not to amplify harmonics in case of malfunction. The simulation results show that the proposed method has a better harmonic suppression performance than the existing ones under the impulse noise environment. The real experiments are also presented to verify the feasibility of the proposed method.

Extreme Learning Machine 기반 퍼지 패턴 분류기 설계

Abstract: 본 논문에서는 인공 신경망의 일종인 Extreme Learning Machine의 학습 알고리즘을 기반으로 하여 노이즈에 강한 특성을 보이는 퍼지 집합 이론을 이용한 새로운 패턴 분류기를 제안 한다. 기존 인공 신경망에 비해 학습속도가 매우 빠르며, 모델의 일반화 성능이 우수하다고 알려진 Extreme Learning Machine의 학습 알고리즘을 퍼지 패턴 분류기에 적용하여 퍼지 패턴 분류기의 학습 속도와 패턴 분류 일반화 성능을 개선 한다. 제안된 퍼지 패턴 분류기의 학습 속도와 일반화 성능을 평가하기 위하여, 다양한 머신 러닝 데이터 집합을 사용한다.

Auditory Scene Analysis: The Perceptual Organization of Sound by Albert Bregman (review)

Abstract: The title of this technical report says almost everything: this is indeed \"a short bibliography on AI and the arts\". It is presented in four sections: General Arguments, Proposals, and Approaches (31 references); Artificial Intelligence in Music (124 references); Artificial Intelligence in Literature and the Performing Arts (13 references), and Artificial Intelligence and Visual Art (57 references). About a quarter of these have short abstracts. Creating a bibliography can be a monumental task, and this bibliography should be viewed as a good and useful start, though it is by no means complete. For comparison, consider the 4,585-entry bibliography Computer Applications in Music by Deta Davis (A-REditions). No direct comparison is intended (or possible), but my point is that many more papers are likely to exist. As a rough check, I looked for several pre-1990 AI and Music articles and books (including my own, of course) in the bibliography. Out of five papers from well-known sources, only one was listed. On the other hand, I discovered a number of papers in this report that were unknown to me, so I am grateful to have a new source of references. In their introduction, the authors acknowledge the need for more references and even offer.a cup of coffee in reward for each new one. I will be sending a number of contributions, so the next time anyone is in Vienna, the coffee is on me. I hope the authors will continue to collect abstracts and publish an updated report in the future.

The 2018 Signal Separation Evaluation Campaign

Abstract: This paper reports the organization and results for the 2018 community-based Signal Separation Evaluation Campaign (SiSEC 2018). This year’s edition was focused on audio and pursued the effort towards scaling up and making it easier to prototype audio separation software in an era of machine-learning based systems. For this purpose, we prepared a new music separation database: MUSDB18, featuring close to 10 h of audio. Additionally, open-source software was released to automatically load, process and report performance on MUSDB18. Furthermore, a new official Python version for the BSS Eval toolbox was released, along with reference implementations for three oracle separation methods: ideal binary mask, ideal ratio mask, and multichannel Wiener filter. We finally report the results obtained by the participants.

A multi objective Tabu particle swarm optimization for effective cluster head selection in WSN

Abstract: The advent of sensors that are light in weight, small-sized, low power and are enabled by wireless network has led to growth of wireless sensor networks (WSNs) in multiple areas of applications. The key problems faced in WSNs are decreased network lifetime and time delay in transmission of data. In many critical applications such as military and monitoring the eco system, disaster management, etc., data routing is very crucial. Multi hop low-energy adaptive clustering hierarchy protocol has been proposed in literature but is proved to be inefficient. Cluster head optimization is a NP hard. This paper deals with selection of optimal path in routing which improves network lifespan, as well as network’s energy efficiency. Various meta-heuristic techniques particularly particle swarm optimization (PSO) has been effectively used but with poor local optima problem. The proposed method is on the basis of PSO as well as Tabu search algorithms. Results show the efficiency of the proposed Tabu PSO by enhancing the number of clusters formed, percentage of nodes alive and shows the reduction of average packet loss rate and average end to end delay.