41 39

Full metadata record

DC FieldValueLanguage
dc.contributor.authorJun Zhang-
dc.contributor.authorGong, Yue-Jiao-
dc.contributor.authorXiao, Xiao-Lin-
dc.contributor.authorZhou, Yi-Cong-
dc.contributor.authorZhang, Jun-
dc.date.accessioned2024-04-01T02:47:32Z-
dc.date.available2024-04-01T02:47:32Z-
dc.date.issued2024-03-27-
dc.identifier.citationACM Transactions on Multimedia Computing, Communications and Applicationsen_US
dc.identifier.issn1551-6857en_US
dc.identifier.issn1551-6865en_US
dc.identifier.urihttps://dl.acm.org/doi/full/10.1145/3649138en_US
dc.identifier.urihttps://repository.hanyang.ac.kr/handle/20.500.11754/189527-
dc.description.abstractNatural image matting has garnered increasing attention in various computer vision applications. The matting problem aims to find the optimal foreground/background (F/B) color pair for each unknown pixel and thus obtain an alpha matte indicating the opacity of the foreground object. This problem is typically modeled as a large-scale pixel pair combinatorial optimization (PPCO) problem. Heuristic optimization is widely employed to tackle the PPCO problem owing to its gradient-free property and promising search ability. However, traditional heuristic methods often encode F/B solutions to a one-dimensional (1D) representation and then evolve the solutions in a 1D manner. This 1D representation destroys the intrinsic two-dimensional (2D) structure of images, where the significant spatial correlations among pixels are ignored. Moreover, the 1D representation also brings operation inefficiency. To address the above issues, this article develops a spatial-aware tensorial evolutionary image matting (TEIM) method. Specifically, the matting problem is modeled as a 2D Spatial-PPCO (S-PPCO) problem, and a global tensorial evolutionary optimizer is proposed to tackle the S-PPCO problem. The entire population is represented as a whole by a third-order tensor, in which individuals are classified into two types: F and B individuals for denoting the 2D F/B solutions, respectively. The evolution process, consisting of three tensorial evolutionary operators, is implemented based on pure tensor computation for efficiently seeking F/B solutions. The local spatial smoothness of images is also integrated into the evaluation process for obtaining a high-quality alpha matte. Experimental results compared with state-of-the-art methods validate the effectiveness of TEIM.en_US
dc.languageen_USen_US
dc.publisherAssociation for Computing Machinery (ACM)en_US
dc.relation.ispartofseriesVolume 20, Issue 7;1-14-
dc.subjectnatural image mattingen_US
dc.subjecttensorial evolutionary algorithmen_US
dc.subjectheuristic optimizationen_US
dc.titleTensorial Evolutionary Optimization for Natural Image Mattingen_US
dc.typeArticleen_US
dc.identifier.doi10.1145/3649138en_US
dc.relation.page1-14-
dc.relation.journalACM Transactions on Multimedia Computing, Communications and Applications-
dc.contributor.googleauthorLei, Si-chao-
dc.relation.code2024017835-
dc.sector.campusE-
dc.sector.daehakCOLLEGE OF ENGINEERING SCIENCES[E]-
dc.sector.departmentSCHOOL OF ELECTRICAL ENGINEERING-
dc.identifier.pidjunzhanghk-


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE