Zobrazeno 1 - 10
of 12
pro vyhledávání: '"Feiying Ma"'
Publikováno v:
Petroleum, Vol 8, Iss 1, Pp 84-91 (2022)
In view of the classical Lucas-Washburn equation, which can only describe the spontaneous imbibition of single wetted capillary, a tilted composite capillary model with circular cross section, composed of different wettability capillary wall was esta
Externí odkaz:
https://doaj.org/article/d2d238d07563459a8ff71cff545d4b3b
Autor:
Chunyan Miao, Shijian Lu, Fangneng Zhan, Kaiwen Cui, Xuansong Xie, Jianxiong Pan, Gongjie Zhang, Feiying Ma, Yingchen Yu, Changgong Zhang
Publikováno v:
CVPR
Despite the great success of GANs in images translation with different conditioned inputs such as semantic segmentation and edge maps, generating high-fidelity realistic images with reference styles remains a grand challenge in conditional image-to-i
Autor:
Jianxiong Pan, Xuansong Xie, Fangneng Zhan, Kaiwen Cui, Chunyan Miao, Feiying Ma, Shijian Lu, Yingchen Yu, Rongliang Wu
Publikováno v:
ACM Multimedia
Image inpainting is an underdetermined inverse problem, which naturally allows diverse contents to fill up the missing or corrupted regions realistically. Prevalent approaches using convolutional neural networks (CNNs) can synthesize visually pleasan
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5f1d271be25721d6dff839df8aa697c6
http://arxiv.org/abs/2104.12335
http://arxiv.org/abs/2104.12335
Autor:
Fangneng Zhan, Yingchen Yu, Changgong Zhang, Rongliang Wu, Wenbo Hu, Shijian Lu, Feiying Ma, Xuansong Xie, Ling Shao
Inferring the scene illumination from a single image is an essential yet challenging task in computer vision and computer graphics. Existing works estimate lighting by regressing representative illumination parameters or generating illumination maps
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d61d7997d8ffda2333fca99e7d889003
Publikováno v:
Computer Vision – ACCV 2020 ISBN: 9783030695316
ACCV (2)
ACCV (2)
Dealing with the inconsistency between a foreground object and a background image is a challenging task in high-fidelity image composition. State-of-the-art methods strive to harmonize the composed image by adapting the style of foreground objects to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c88d5ce5bbae91fe6ff88e6ef45110ab
https://doi.org/10.1007/978-3-030-69532-3_15
https://doi.org/10.1007/978-3-030-69532-3_15
Autor:
Fangneng Zhan, Changgong Zhang, Yingchen Yu, Yuan Chang, Shijian Lu, Feiying Ma, Xuansong Xie
Illumination estimation from a single image is critical in 3D rendering and it has been investigated extensively in the computer vision and computer graphic research community. On the other hand, existing works estimate illumination by either regress
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9afaed6485e7c2ff50ffefb9ba920bb9
Publikováno v:
Chemistry and Technology of Fuels and Oils. 50:344-353
Based on the Langmuir adsorption isotherm, we have determined coalbed methane desorption efficiency. Three key pressure points are observed on the desorption efficiency curves: turning pressure, transition pressure, and sensitive pressure. Based on d
Publikováno v:
Chemistry and Technology of Fuels and Oils. 49:348-354
We examine a new technology for shale gas recovery: high-temperature supercritical carbon dioxide flooding. We analyze the physical and chemical properties of supercritical carbon dioxide, the characteristics of shale gas reservoirs, the adsorption/d
Autor:
Hanyuan Deng, Feiying Ma
Publikováno v:
Journal of Computational and Theoretical Nanoscience. 8:1878-1881
The general connectivity index Rα(G) of a graph G = (V,E) is defined as ∑ uv∈E(d(u)d(v)) α, where d(v) denotes the degree of a vertex v and α = 0 is a real number. In this paper, we give the expressions for computing the general connectivity i
Autor:
Hanyuan Deng, Feiying Ma
Publikováno v:
Mathematical and Computer Modelling. 54:497-507
For a simple connected graph G=(V,E), X(G)=@?"u"v"@?"E1d"u+d"v is its sum-connectivity index, where d"u denotes the degree of a vertex u. A connected graph G is a cactus if any two of its cycles have at most one common vertex. Let G(n,r) be the set o