• Korean Journal of Optics and Photonics
• /
• v.31 no.6
• /
• pp.281-289
• /
• 2020

This paper reports a slim mobile lens design using a hybrid refractive/diffractive optical element. Conventionally a wide field of view (FOV) camera-lens design adopts a retrofocus type having a negative (-) lens at the forefront, so that it improves in imaging performance over the wide FOV, but with the sacrifice of longer total track length (TTL). However, we chose a telephoto type as a baseline design layout having a positive (+) lens at the forefront, to achieving slimness, based on the specification analysis of 23 reported optical designs. Following preliminary optimization of a baseline design and aberration analysis based on Zernike-polynomial decomposition, we applied a hybrid refractive/diffractive element to effectively reduce the residual chromatic spherical aberration. The optimized optical design consists of 6 optical elements, including one hybrid element. It results in a very slim telephoto ratio of 1.7, having an f-number of 2.0, FOV of 90°, effective focal length of 2.23 mm, and TTL of 3.7 mm. Compared to a comparable conventional lens design with no hybrid elements, the hybrid design improved the value of the modulation transfer function (MTF) at a spatial frequency of 180 cycles/mm from 63% to 71-73% at zero field (0 F), and about 2-3% at 0.5, 0.7, and 0.9 fields. It was also found that a design with a hybrid lens with only two diffraction zones at the stop achieved the same performance improvement.

• Journal of the Korea Society of Computer and Information
• /
• v.24 no.10
• /
• pp.57-64
• /
• 2019

In this paper, we study a polynomially solvable case of the inverse interval graph coloring problem. Given an interval graph associated with a specific interval system, the inverse interval graph coloring problem is defined with the assumption that there is no proper K-coloring for the given interval graph, where K is a fixed integer. The problem is to modify the system of intervals associated with the given interval graph by shifting some of the intervals in such a way that the resulting interval graph becomes K-colorable and the total modification is minimum with respect to a certain norm. In this paper, we focus on the case K = 1 where all intervals associated with the interval graph have length 1 or 2, and interval displacement is only allowed to the righthand side with respect to its original position. To solve this problem in polynomial time, we propose a two-phase algorithm which consists of the sorting and First Fit procedure.