苏科华
Supervisor of Doctorate Candidates
Supervisor of Master's Candidates
E-Mail:
Date of Employment:2008-11-02
School/Department:计算机学院
Education Level:研究生毕业
Business Address:D203
Gender:Male
Contact Information:13517299596
Status:Employed
Discipline:Computer Applications Technology
Communications and Information Systems
Other specialties in Software Engineering
Cyberspace Security
Hits:
DOI number:10.1109/ICDH57206.2022.00042
Affiliation of Author(s):Institute of Electrical and Electronics Engineers Inc.
Journal:Proceedings - 2022 9th International Conference on Digital Home, ICDH 2022
Abstract:Reflector with freeform pattern has been proved to be more challenging to design, which suffered from the inefficiency of solving nonlinear differential equations. In this paper, we propose a discrete computational algorithm for designing a reflective surface that can generate a prescribed irradiance distribution on a certain region of receiver plane for a given point light source. Fig. 1 shows an example of our results. The algorithm is based on the framework of the Monge-Kantorovich optimal mass transport theory. We use the geodesic polyhedron to discretize the spherical domain. The reflector is determined by a finite number of confocal paraboloids of revolution and is obtained via optimizing the Wassertein distance between light source and receiver plane. We incorporate two tricky strategies to accelerate the optimization process: the multi-level discretization and the cache of candidate paraboloids.
Co-author:Liu Bailve,Zhou Yuming,Gu Xianfeng
First Author:Su Kehua
Indexed by:Journal paper
Correspondence Author:Lei Na
Document Type:J
Page Number:224-232
Translation or Not:no
Date of Publication:2022-12-01
Included Journals:EI
苏科华,男,武汉大学计算机学院教授、博导;武汉大学科技成果转化中心(技术转移中心)副主任。研究主要集中在最优传输(Optimal Transport)领域,它是研究概率测度间最优变换的一类优化问题。在计算机图形学、机器视觉、人工智能、医学图像处理等领域有着广泛的应用。本人主要研究最优传输的几何计算理论和高效算法,并将其应用于网格保测参数化、三维场景优化、智能烧伤评估和卫星互联网任务优化中。主持包括国家自然科学基金、中央军科委、航天5院、华为公司等20多个项目支持,发表论文50余篇,获批发明专利10余项。为CCF计算机辅助设计与图形学(CAD/CG)和虚拟现实与可视化(TCVRV)专委会的执行委员。