Department Seminars & Colloquia
When you're logged in, you can subscribe seminars via e-mail
Variational Models and Fast Numerical Schemes in Image Profcessing and Computer Vision Lecture 2
● Mathematical preliminaries
● Image restoration, inpainting and Deblurring
● Fast numerical schemes
● Image segmentation and geometrical PDEs
Variational Models and Fast Numerical Schemes in Image Profcessing and Computer Vision Lecture 1
● Mathematical preliminaries
● Image restoration, inpainting and Deblurring
● Fast numerical schemes
● Image segmentation and geometrical PDEs
삼성전자 반도체 사업부 세미나
YE팀(Yield Enhancement Team)은 반도체공정에 대한 Metrology & Inspection 기술 개발 및 적용을 담당하는 부서로 Nanometer 영역에 대한 최첨단 기술개발에 도전하고자 하는 능력 있는 우수인재들과 새로운 미래를 열어가고자 합니다.
▶ 세미나 요약 : 반도체 제작 공정에는 수백 개의 계측, 검사 공정이 포함되어 있으며 제작 공정 난이도 증가에 따라 계측 공정의 중요성도 점차 커지고 있습니다. 계측 기술이라 함은 다양한 광학, eBeam, X-ray 등의 source로부터 얻어진 data를 가공하여 원하는 정보를 추출하는 작업이며, 이에 Image processing, Data mining, Electro-magnetic simulation 등의 다양한 수학적 기술이 필요합니다.
본 세미나에서는 이와 같은 다양한 필요 기술을 소개하고자 합니다.
▶ 주요기술
- Simulation Technique (FDTD, RCWA, Monte Carlo Simulation)
- Image processing (Segmentation, Inspection)
- Data mining (Classification, Clustering, Feature extraction)
- Optics System Design (Microscopy, Ellipsometer, Interferometer)
- Mechanical System Design (Stage Control, System Noise Analysis)
세미나 후 별도의 취학 상담도 진행 하오니 관심 있는 학생분들의 많은 참여 바랍니다
자연과학동(E6-1), ROOM 1409
Discrete Math
Jang Soo Kim (School of Mathematics, University of)
Proofs of Two Conjectures of Kenyon and Wilson on Dyck Tilings
Recently, Kenyon and Wilson introduced a certain matrix M in order to compute
pairing probabilities of what they call the double-dimer model. They showed that the absolute value of each entry of the inverse matrix M^-1 is equal to the number of certain Dyck tilings of
a skew shape. They conjectured two formulas on the sum of the absolute values of the entries in a row or a column of M^-1. In this talk we prove the two conjectures. As a consequence
we obtain that the sum of the absolute values of all entries of M^-1 is equal to the number of
complete matchings. We also find a bijection between Dyck tilings and complete matchings.
This talk is based on the following paper: arxiv:1108.5558.
Magnetic resonance electrical impedance tomography (MREIT) aims to visualize a conductivity distribution inside the human body. When we apply the harmonic Bz algorithm to measured Bz data from animal or human subjects, there occur a few technical difficulties that are mainly related with measurement errors in Bz data especially in a local region where MR signals are very small. We investigate sources of the error and its adverse effects on the image reconstruction process. We suggest a new error propagation blocking algorithm to prevent defective data at one local region from influencing badly on conductivity images of other regions. We experimentally examine the performance of the proposed method by comparing reconstructed images with and without applying the error propagation blocking algorithm.
E6-1(자연과학동), ROOM 3433
Discrete Math
Choongbum Lee (Department of Mathematics, UCLA, Los Angeles, USA)
Self-similarity of graphs
자연과학동(E6-1) Room 1409
Discrete Math
Sang June Lee (Emory University, Atlanta, Georgia, USA)
Dynamic coloring and list dynamic coloring of planar graphs
A dynamic coloring of a graph G is a proper coloring of the vertex set V(G) such that for each vertex of degree at least 2, its neighbors receive at least two distinct colors. A dynamic k-coloring of a graph is a dynamic coloring with k colors. Note that the gap χd(G) – χ(G) could be arbitrarily large for some graphs. An interesting problem is to study which graphs have small values of χd(G) – χ(G).
One of the most interesting problems about dynamic chromatic numbers is to find upper bounds of χd(G)$ for planar graphs G. Lin and Zhao (2010) and Fan, Lai, and Chen (recently) showed that for every planar graph G, we have χd(G)≤5, and it was conjectured that χd(G)≤4 if G is a planar graph other than C5. (Note that χd(C5)=5.)
As a partial answer, Meng, Miao, Su, and Li (2006) showed that the dynamic chromatic number of Pseudo-Halin graphs, which are planar graphs, are at most 4, and Kim and Park (2011) showed that χd(G)≤4 if G is a planar graph with girth at least 7.
In this talk we settle the above conjecture that χd≤4 if G is a planar graph other than C5. We also study the corresponding list coloring called a list dynamic coloring.
This is joint work with Seog-Jin Kim and Won-Jin Park.
본 강연은 KMRS(KIAST Math Research Station)에서 제공하는 집중 강연으로 기하학적 입장에서 유도되어지는 편미분 방정식을 소개하는 것을 목적으로 하고 있다. 이제까지 주로 연구 되어진 다양한 편미분 방정식은 주로 물리학적인 문제들에서 유도 되어진 것이다. 본 강연을 통해서 기존의 편미분 방정식을 보다 기하학적인 관점에서 이해할 뿐 아니라 기하학적인 문제를 편미분 방정식의 형태로 소개 하고자 한다. This lecture series is provided by KMRS and aiming to introduce PDEs which are derived from geometry view point. So far PDEs are mostly derived from physical view point. In these lectures PDEs will be understood in geometry view point and PDEs related to geometry will be introduced. |
본 강연은 KMRS(KIAST Math Research Station)에서 제공하는 집중 강연으로 기하학적 입장에서 유도되어지는 편미분 방정식을 소개하는 것을 목적으로 하고 있다. 이제까지 주로 연구 되어진 다양한 편미분 방정식은 주로 물리학적인 문제들에서 유도 되어진 것이다. 본 강연을 통해서 기존의 편미분 방정식을 보다 기하학적인 관점에서 이해할 뿐 아니라 기하학적인 문제를 편미분 방정식의 형태로 소개 하고자 한다.
This lecture series is provided by KMRS and aiming to introduce PDEs which are derived from geometry view point. So far PDEs are mostly derived from physical view point. In these lectures PDEs will be understood in geometry view point and PDEs related to geometry will be introduced.
본 강연은 KMRS(KIAST Math Research Station)에서 제공하는 집중 강연으로 기하학적 입장에서 유도되어지는 편미분 방정식을 소개하는 것을 목적으로 하고 있다. 이제까지 주로 연구 되어진 다양한 편미분 방정식은 주로 물리학적인 문제들에서 유도 되어진 것이다. 본 강연을 통해서 기존의 편미분 방정식을 보다 기하학적인 관점에서 이해할 뿐 아니라 기하학적인 문제를 편미분 방정식의 형태로 소개 하고자 한다.
This lecture series is provided by KMRS and aiming to introduce PDEs which are derived from geometry view point. So far PDEs are mostly derived from physical view point. In these lectures PDEs will be understood in geometry view point and PDEs related to geometry will be introduced.