• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
Advanced Search
Zhu Kuaikuai, Tian Qing, Chen Songcan. A Fast Discriminant Feature Extraction Framework Combining Implicit Spatial Smoothness with Explicit One for Two-Dimensional Image[J]. Journal of Computer Research and Development, 2017, 54(5): 1057-1066. DOI: 10.7544/issn1000-1239.2017.20160158
Citation: Zhu Kuaikuai, Tian Qing, Chen Songcan. A Fast Discriminant Feature Extraction Framework Combining Implicit Spatial Smoothness with Explicit One for Two-Dimensional Image[J]. Journal of Computer Research and Development, 2017, 54(5): 1057-1066. DOI: 10.7544/issn1000-1239.2017.20160158

A Fast Discriminant Feature Extraction Framework Combining Implicit Spatial Smoothness with Explicit One for Two-Dimensional Image

More Information
  • Published Date: April 30, 2017
  • Images have two-dimensional inherent spatial structures, and the pixels spatially close to each other have similar gray values, which means images are locally spatially smooth. To extract features, traditional methods usually convert an original image into a vector, resulting in the destruction of spatial structure. Thus 2D image-based feature extraction methods emerge, typically, such as 2DLDA and 2DPCA, which reduce time complexity significantly. However,2D-based methods manipulate on the whole raw (or column) of an image, leading to spatially under-smoothing. To overcome such shortcomings, spatial regularization is proposed by explicitly imposing a Laplacian penalty to constrain the projection coefficients to be spatially smooth and has achieved better performance than 2D-based methods, but sharing the genetic high computing cost with 1D methods. Implicit spatial regularization (ISR) constrains spatial smoothness within each local image region by dividing and reshaping image and then executing 2D-based feature extraction methods, resulting in a performance improvement of the typical bi-side 2DLDA over SSSL (a typical ESR method). However, ISR obtains the spatial smooth implicitly but has lack of explicit spatial constraints such that the feature space obtained by ISR is still not smooth enough. The optimization criteria of bi-side 2DLDA are not jointly convex simultaneously, resulting in high computing cost and globally optimal solution cannot be guaranteed. Inspired by statements above, we introduce a novel linear discriminant model called fast discriminant feature extraction framework combining implicit spatial smoothness with explicit one for two-dimensional image recognition (2D-CISSE). The key step of 2D-CISSE is to preprocess spatial smooth for images, then ISR is executed. 2D-CISSE not only retains spatial smooth explicitly, but also reinforces the explicit spatial constraints. Not only can it achieve globally optimal solution, but it also have generality, i.e. any out-of-shelf image smoothing methods and 2D-based feature extraction methods can be embedded into our framework. Finally, experimental results on four face datasets (Yale, ORL, CMU PIE and AR) and handwritten digit datasets (MNIST and USPS) demonstrate the effectiveness and superiority of our 2D-CISSE.
  • Related Articles

    [1]Fu Liguo, Pang Jianmin, Wang Jun, Zhang Jiahao, Yue Feng. Formal Model of Correctness and Optimization on Binary Translation[J]. Journal of Computer Research and Development, 2019, 56(9): 2001-2011. DOI: 10.7544/issn1000-1239.2019.20180513
    [2]Zhou Zhibin, Wang Guojun, Liu Qin, Jia Weijia. A RFID Anonymous Grouping Proof Protocol Using Dual-Layer Verification[J]. Journal of Computer Research and Development, 2018, 55(12): 2674-2684. DOI: 10.7544/issn1000-1239.2018.20170787
    [3]Fu Yanyan, Zhang Min, Chen Kaiqu, Feng Dengguo. Proofs of Data Possession of Multiple Copies[J]. Journal of Computer Research and Development, 2014, 51(7): 1410-1416.
    [4]Li Tao, Zhang Jingzhong. Machine Proofs in Geometry Based on Complex Number Method[J]. Journal of Computer Research and Development, 2013, 50(9): 1963-1969.
    [5]Ma Yanfang, Zhang Min, Chen Yixiang. Formal Description of Software Dynamic Correctness[J]. Journal of Computer Research and Development, 2013, 50(3): 626-635.
    [6]Wang Yong, Fang Juan, Ren Xingtian, and Lin Li. Formal Verification of TCG Remote Attestation Protocols Based on Process Algebra[J]. Journal of Computer Research and Development, 2013, 50(2): 325-331.
    [7]Wang Changjing. Verifying the Correctness of Loop Optimization Based on Extended Logic Transformation System μTS[J]. Journal of Computer Research and Development, 2012, 49(9): 1863-1873.
    [8]Jing Shuxu, He Fazhi, Cai Xiantao, Cheng Yuan. A Method for Object Reference in Collaborative Modeling System[J]. Journal of Computer Research and Development, 2011, 48(11): 2031-2038.
    [9]Si Tiange, Tan Zhiyong, and Dai Yiqi. A Security Proof Method for Multilevel Security Models[J]. Journal of Computer Research and Development, 2008, 45(10): 1711-1717.
    [10]Wang Guilin, Qing Sihan. Security Notes on Two Cheat-Proof Secret Sharing Schemes[J]. Journal of Computer Research and Development, 2005, 42(11): 1924-1927.

Catalog

    Article views (1069) PDF downloads (560) Cited by()

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return