• 대한수학회논문집
• /
• 제10권1호
• /
• pp.49-55
• /
• 1995

This paper is the third of a series in which smoothness properties of function in several variables are discussed. The germ of the whole theory was laid in the works by Folland and Stein [4]. On nilpotent Lie groups, they difined analogues of the classical $L^p$ Sobolev or potential spaces in terms of fractional powers of sub-Laplacian, L and extended several basic theorems from the Euclidean theory of differentaiability to these spaces: interpolation properties, boundedness of singular integrals,..., and imbeding theorems. In this paper we study the analogue to the extension theorem for the Folland-Stein spaces. The analogue to Stein's restriction theorem were studied by M. Mekias [5] and Y.M. Kim [6]. First, we have the space of Bessel potentials on the Heisenberg group introduced by Folland [4].

• Current Optics and Photonics
• /
• 제2권1호
• /
• pp.69-78
• /
• 2018

This paper presents a precise edge detection algorithm for the critical dimension (CD) measurement of a Thin-Film Transistor Liquid-Crystal Display (TFT-LCD) pattern. The sigmoid surface function is proposed to model the blurred step edge. This model can simultaneously find the position and geometry of the edge precisely. The nonlinear least squares fitting method (Levenberg-Marquardt method) is used to model the image intensity distribution into the proposed sigmoid blurred edge model. The suggested algorithm is verified by comparing the CD measurement repeatability from high-magnified blurry and noisy TFT-LCD images with those from the previous Laplacian of Gaussian (LoG) based sub-pixel edge detection algorithm and error function fitting method. The proposed fitting-based edge detection algorithm produces more precise results than the previous method. The suggested algorithm can be applied to in-line precision CD measurement for high-resolution display devices.

• 한국통신학회논문지
• /
• 제17권7호
• /
• pp.709-718
• /
• 1992

본 논문에서는 준최적 계단 에지 검출기로 알려진 1차 미분 가우스 연산자(DroG)의 등가형으로 2개의 가우스 여파기를 합성한 새로운 에지 검출 연산자를 제안하였다. 이 에지 검출기는 성능면(신호대 잡음비,에지위치와 다중에지 발생률)에서 DroG와 거의 대등함을 보였다. 또한, 이 에지 검출기는 DroG와 LoG(Laplscian of Gaussian)시스템에서 공통으로 2차원 저역 여파기를 사용하기 때문에, 기존의 DroG시스템 연산량의 절반 정도로 계산량을 줄일 수 있었다.

• ETRI Journal
• /
• 제39권1호
• /
• pp.1-12
• /
• 2017

In this paper, we present a new approach for the progressive compression of three-dimensional (3D) mesh geometry using redundant frame dictionaries and sparse approximation techniques. We construct the proposed frames from redundant linear combinations of the eigenvectors of a combinatorial mesh Laplacian matrix. We achieve a sparse synthesis of the mesh geometry by selecting atoms from a frame using matching pursuit. Experimental results show that the resulting rate-distortion performance compares favorably with other progressive mesh compression algorithms in the same category, even when a very simple, sub-optimal encoding strategy is used for the transmitted data. The proposed frames also have the desirable property of being able to be applied directly to a manifold mesh having arbitrary topology and connectivity types; thus, no initial remeshing is required and the original mesh connectivity is preserved.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2004년도 ICEIC The International Conference on Electronics Informations and Communications
• /
• pp.137-142
• /
• 2004

In this paper, we propose a new scheme for geometry coding of three-dimensional (3-D) mesh models using a fixed spectral basis. In order to code the mesh geometry information, we generate a fixed spectral basis using the dual graph derived from the 3-D mesh topology. After we partition a 3-D mesh model into several independent sub-meshes to reduce coding complexity, the mesh geometry information is projected onto the generated orthonormal bases which are the eigenvectors of the Laplacian matrix of the 3-D mesh. Finally, spectral coefficients are coded by a quantizer and a variable length coder. The proposed scheme can not only overcome difficulty of generating a fixed spectral basis, but also reduce coding complexity. Moreover, we can provide an efficient multi-resolution representation of 3-D meshes.

• 대한수학회지
• /
• 제57권3호
• /
• pp.747-775
• /
• 2020

In this work we investigate the nonlocal elliptic equation with critical Hardy-Sobolev exponents as follows, $$(P)\;\{(-{\Delta}_p)^su={\lambda}{\mid}u{\mid}^{q-2}u+{\frac{{\mid}u{\mid}^{p{^*_s}(t)-2}u}{{\mid}x{\mid}^t}}{\hspace{10}}in\;{\Omega},\\u=0{\hspace{217}}in\;{\mathbb{R}}^N{\backslash}{\Omega},$$ where Ω ⊂ ℝ^N is an open bounded domain with Lipschitz boundary, 0 < s < 1, λ > 0 is a parameter, 0 < t < sp < N, 1 < q < p < p^∗_s where $p^*_s={\frac{N_p}{N-sp}}$, $p^*_s(t)={\frac{p(N-t)}{N-sp}}$, are the fractional critical Sobolev and Hardy-Sobolev exponents respectively. The fractional p-laplacian (-∆_p)^su with s ∈ (0, 1) is the nonlinear nonlocal operator defined on smooth functions by $\displaystyle(-{\Delta}_p)^su(x)=2{\lim_{{\epsilon}{\searrow}0}}\int{_{{\mathbb{R}}^N{\backslash}{B_{\epsilon}}}}\;\frac{{\mid}u(x)-u(y){\mid}^{p-2}(u(x)-u(y))}{{\mid}x-y{\mid}^{N+ps}}dy$, x ∈ ℝ^N. The main goal of this work is to show how the usual variational methods and some analysis techniques can be extended to deal with nonlocal problems involving Sobolev and Hardy nonlinearities. We also prove that for some α ∈ (0, 1), the weak solution to the problem (P) is in C^1,α(${\bar{\Omega}}$).

• 대한원격탐사학회지
• /
• 제19권1호
• /
• pp.61-70
• /
• 2003

This paper proposes an autonomous approach to localize the center of fiducial marks included in aerial photographs without precise geometric information and human interactions. For this localization, we present a conceptual model based on two assumptions representing symmetric characteristics of fiducial area and fiducial mark. The model makes it possible to locate exact center of a fiducial mark by checking the symmetric characteristics of pixel value distribution around the mark. The proposed approach is composed of three steps: (a) determining the symmetric center of fiducial area, (b) finding the center of a fiducial mark with unit pixel accuracy, and finally (c) localizing the exact center up to sub-pixel accuracy. The symmetric center of the mark is calculated tv successively applying three geometric filters: simplified ${\nabla}^2$G (Laplacian of Gaussian) filter, symmetry enhancement filter, and high pass filter. By introducing a self-diagnosis function based on the self-similarity measurement, a way of rejecting unreliable cases of center calculation is proposed, as well. The experiments were done with respect to 284 samples of fiducial marks composed of RMK- and RC-style ones extracted from 51 scanned aerial photographs. It was evaluated in the visual inspection that the proposed approach had resulted the erroneous identification with respect to only one mark. Although the proposed approach is based on weak constraints, being free from the exact geometric model of the fiducial marks, experimental results showed that the proposed approach is sufficiently robust and reliable.