LOCALITY CONSTRAINT NEIGHBOUR EMBEDDING VIA REFERENCE PATCH

被引:0
|
作者
Javaria, Ikram [1 ]
Yao, Lu [1 ]
Wan, Danfeng [1 ]
Li, Jianwu [1 ]
机构
[1] Beijing Inst Technol, Beijing Lab Intelligent Informat Technol, Sch Comp Sci, Beijing 100081, Peoples R China
关键词
Face hallucination; super-resolution; position patch; reference patch; locality constraints; FACE-HALLUCINATION;
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Recently, face hallucination (FH) methods using position priors have gained popularity; however position priors might not always be the best due to the intrinsic rigidness of faces collected from uncontrollable environment. Therefore, we improve the search criteria for K-nearest neighbors (K-NN) to address the variations in human facial features. Meanwhile, the limitations of the manifold assumption are taken into consideration to refine the neighborhood of the low-resolution (LR) patch by using the information from the high-resolution (HR) patches. For each input patch, we search the local neighborhood of its corresponding position patch in each training image to find the best-matched neighbor "Reference Patches". Reference patches and their HR counterparts are taken to construct LR and HR patch dictionaries. The proposed method is composed of two steps. For an input LR patch, first we construct its initial HR patch using conventional FH methods. Secondly, we search the initial HR patch's nearest neighbors in HR manifold to extract the discriminant locality constraints. Then the corresponding LR reference patches are taken as refined K-NN of the input patch. These refined reference patches better optimize the reconstruction weights, thus the performance is improved. Extensive experiments show that our method outperforms recent position patch schemes in reconstruction error and visual quality.
引用
收藏
页数:6
相关论文
共 50 条
  • [41] CONSTRAINT EMBEDDING FOR VEHICLE SUSPENSION DYNAMICS
    Jain, Abhinandan
    Kuo, Calvin
    Jayakumar, Paramsothy
    Cameron, Jonathan
    ARCHIVE OF MECHANICAL ENGINEERING, 2016, 63 (02) : 193 - 213
  • [42] Reference distance as a metric for data locality
    Pyo, C
    Lee, G
    Lee, KW
    Han, HK
    HIGH PERFORMANCE COMPUTING ON THE INFORMATION SUPERHIGHWAY - HPC ASIA '97, PROCEEDINGS, 1997, : 151 - 156
  • [43] Leveraging Locality of Reference for Certificate Revocation
    Dickinson, Luke
    Smith, Trevor
    Seamons, Kent
    35TH ANNUAL COMPUTER SECURITY APPLICATIONS CONFERENCE (ACSA), 2019, : 514 - 528
  • [44] PROCESS DECOMPOSITION THROUGH LOCALITY OF REFERENCE
    ROGERS, A
    PINGALI, K
    SIGPLAN NOTICES, 1989, 24 (07): : 69 - 81
  • [45] Quantifying Competitiveness in Paging with Locality of Reference
    Albers, Susanne
    Frascaria, Dario
    ALGORITHMICA, 2018, 80 (12) : 3563 - 3596
  • [46] Locality of reference in an hierarchy of Web caches
    Duarte, Fernando
    Benevenuto, Fabricio
    Almeida, Virgilio
    Almeida, Jussara
    NETWORKING 2006: NETWORKING TECHNOLOGIES, SERVICES, AND PROTOCOLS; PERFORMANCE OF COMPUTER AND COMMUNICATION NETWORKS; MOBILE AND WIRELESS COMMUNICATIONS SYSTEMS, 2006, 3976 : 344 - 354
  • [47] Process decomposition through locality of reference
    Rogers, Anne
    Pingali, Keshav
    SIGPLAN Notices (ACM Special Interest Group on Programming Languages), 1989, 24 (07): : 69 - 80
  • [48] Fast Locality Discriminant Analysis With Adaptive Manifold Embedding
    Nie, Feiping
    Zhao, Xiaowei
    Wang, Rong
    Li, Xuelong
    IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2022, 44 (12) : 9315 - 9330
  • [49] Global-locality preserving projection for word embedding
    Bolin Wang
    Yuanyuan Sun
    Yonghe Chu
    Zhihao Yang
    Hongfei Lin
    International Journal of Machine Learning and Cybernetics, 2022, 13 : 2943 - 2956
  • [50] Quantifying Competitiveness in Paging with Locality of Reference
    Susanne Albers
    Dario Frascaria
    Algorithmica, 2018, 80 : 3563 - 3596