English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 78728/78728 (100%)
造訪人次 : 33347203      線上人數 : 441
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋


    請使用永久網址來引用或連結此文件: http://ir.lib.ncu.edu.tw/handle/987654321/75301


    題名: 複數矩陣分解法及其應用;Complex Matrix Factorization and Its Applications
    作者: 段薇虹;Hang, Duong Viet
    貢獻者: 資訊工程學系
    關鍵詞: 計算機視覺;特徵提取;复矩陣分解;Computer vision;Feature extraction;Complex matrix factorization
    日期: 2017-11-15
    上傳時間: 2018-01-16 11:03:55 (UTC+8)
    出版者: 國立中央大學
    摘要: 在這個工作中,我們構造了一個新的用於學習複雜領域的低秩投影的降維模型,以在實際應用中獲得直觀特徵和高性能,特別是面部表情識別和圖像聚類。複數矩陣分解(CMF)是一種將復數矩陣分解為兩個複矩陣因子的矩陣分解方法。建議的模型可以在不限制數據符號的情況下執行。這些建議的框架可以應用於負面和正面的數據,從而在實際應用中產生擴展性和有效性。因此,能夠提取諸如短時傅立葉變換之類的複雜特徵的多個操作將被直接使用,而不是其絕對值(幅度/功率譜圖)。
    從基本框架CMF開始,我們通過添加圖和稀疏約束來獲得圖的正則化复矩陣分解(GraCMF)和具有稀疏約束的複矩陣分解(SpaCMF),從而開發了兩個約束CMF框架。
    此外,我們修改了標準CMF的結構以提供更多的擴展。其中之一就是學習基礎在原始空間(示例)中的示例嵌入复矩陣分解(EE-CMF)。投影复矩陣分解(ProCMF)是作為一種新的學習子空間方法開發的,每個數據點的係數位於一個投影複數矩陣的列向量所跨越的子空間內。簡化的複雜矩陣分解(SiCMF)是一種新的模型,通過凸組合潛在的組件來重構原始實例。
    為了滿足非負性要求,非負矩陣分解(NMF)通常使用各種策略來使函數最小化,這導致計算複雜度。相反,與所提出的複雜模型的NMF方法相比,其顯著的優越性在於構建一個無約束優化問題,簡化了提取基礎和內在特徵的框架。
    Wirtinger的微積分被用來計算成本函數的導數。梯度下降法被用來解決複雜的優化問題。提出的算法被證明為人臉和麵部表情識別以及圖像聚類提供了有效的特徵。對這些任務的實驗表明,所提出的複雜域上的矩陣分解方法比標準NMF提供一致的更好的識別結果。;In this work, we construct new dimension reduction models for learning low rank projection in the complex domain to obtain both intuitive features and high performance in real applications, particularly face, facial expression recognition and image clustering. Complex matrix factorization (CMF) is a matrix factorization method that decomposes a complex matrix into two complex matrix factors. The proposed models can be performed without limiting the sign of data. These proposed frameworks can be applied to both negative and positive data which yield extension and effectiveness on real-world applications. Therefore, several operations that can extract complex features, such as the short-time Fourier transform, are going to be utilized directly instead of their absolute values (magnitude/power spectrogram).
    From the basic framework, CMF, we developed two constrained CMF frameworks by adding graph and sparse constraints to obtain graph regularized complex matrix factorization (GraCMF) and complex matrix factorization with sparsity constraint (SpaCMF).
    Besides, we modified the structure of standard CMF to provide more extensions. One of them is exemplar-embed complex matrix factorization (EE-CMF) which a learned base lies within original space (exemplar). Projective complex matrix factorization (ProCMF) was developed as a new learning subspace method that the coefficient of each data point lies within the subspace spanned by the column vectors of one projection complex matrix. Simplical complex matrix factorization (SiCMF), a new model was figured out by convex combining the latent components to reconstruct the original instances.
    To satisfy nonnegative requirement, nonnegative matrix factorization (NMF) usually uses various strategies on minimizing a function, which lead to computational complexity. On the contrary, the significant superiority compared to NMF approaches of the proposed complex models is to construct an unconstraint optimization problem that simplified the framework of extracting the basis and intrinsic features.
    Wirtinger′s calculus is used to compute the derivative of the cost functions. The gradient descent method is used to solve complex optimization problems. The proposed algorithms are proved to provide effective features for a face and facial expression recognition as well as image clustering. Experiments on these tasks reveal that the proposed methods of matrix factorization on complex domain provide consistently better recognition results than standard NMFs.
    顯示於類別:[資訊工程研究所] 博碩士論文

    文件中的檔案:

    檔案 描述 大小格式瀏覽次數
    index.html0KbHTML300檢視/開啟


    在NCUIR中所有的資料項目都受到原著作權保護.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 隱私權政策聲明