Please use this identifier to cite or link to this item: http://hdl.handle.net/10603/76765
Title: On Large Scale near Independent Blind Source Separation
Researcher: Dharmani, Bhaveshkumar Choithram
Guide(s): Mitra, Suman Kumar
Keywords: Blind Source Separation
Large Scale, Reference Information Potential
Kernel Density Estimation
Integrated Mean Square Error
Search Algorithms, Search Trees
University: Dhirubhai Ambani Institute of Information and Communication Technology (DA-IICT)
Completed Date: 2015
Abstract: The thesis addresses Blind Source Separation (BSS) in Large Scale (LS) and near-Independent newline(nI) sources scenario. The large scale in BSS imply number of unknown sources ranging from 15 to 140, so that the corresponding number of unknowns to be optimized range from 100 to 10000. The real world sources producing either an added spurious local optima or a shift of global optima or both are defined to be near-independent with respect to the used BSS contrast as an optimization criteria. The exponentially increasing solution space with linearly increasing dimensions for optimization and added complexity in the optimization landscape due to the near-independent sources make the Large Scale near-Independent BSS (LSnIBSS) to be a more difficult problem than the BSS. As a solution to the LSnIBSS problem, the thesis derives suitable optimization criteria and a Large Scale Global Optimization (LSGO) technique. Looking Probability Density Function (PDF) as a generalized multivariate differentiable function, there is derived L2-Norm of Gradient of Function Difference (GFD) as a BSS contrast, where, GFD is the difference between gradient of product of marginal PDFs and gradient of joint PDF. A nonparametric estimation of the derived contrast is achieved through least squares based kernel method in a single stage directly, instead of a two stages indirect estimation method. The contrast estimation is a particular demonstration of a derived more general method for information field analysis through a newly introduced concept of Reference Information Potential (RIP). The performance of kernel methods depend upon the choice of kernel bandwidth parameter. There is derived Extended Rule-of-thumb (ExROT) for bandwidth parameter selection in Kernel Density Estimation (KDE). The method is based on Gram-Charlier A-Series expansion as an approximation to the unknown PDF, assuming it being near Gaussian. The ExROT is better, in terms of Integrated Mean Square Error (IMSE) criteria of performance, compare to the Silverman s Rule-of-thum
Pagination: xv, 205 p.
URI: http://hdl.handle.net/10603/76765
Appears in Departments:Department of Information and Communication Technology

Files in This Item:
File Description SizeFormat 
01_title.pdfAttached File121.14 kBAdobe PDFView/Open
02_declaration and certificate.pdf62.06 kBAdobe PDFView/Open
03_acknowledgement.pdf68.08 kBAdobe PDFView/Open
04_abstract.pdf100.54 kBAdobe PDFView/Open
05_contents.pdf182.88 kBAdobe PDFView/Open
06_list of figures.pdf153.75 kBAdobe PDFView/Open
07_chapter 1.pdf247.27 kBAdobe PDFView/Open
08_chapter 2.pdf507.63 kBAdobe PDFView/Open
09_chapter 3.pdf734.39 kBAdobe PDFView/Open
10_chapter 4.pdf1.68 MBAdobe PDFView/Open
11_chapter 5.pdf282.85 kBAdobe PDFView/Open
12_chapter 6.pdf431.18 kBAdobe PDFView/Open
13_chapter 7.pdf139.13 kBAdobe PDFView/Open
14_bibliography.pdf99.31 kBAdobe PDFView/Open
15_appendix.pdf439.2 kBAdobe PDFView/Open
Show full item record


Items in Shodhganga are licensed under Creative Commons Licence Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0).

Altmetric Badge: