• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.12B
• /
• pp.2369-2381
• /
• 1999

In this paper, we propose an iterative algorithm for reducing the blocking artifact in block transform-coded images by using a wavelet transform. In the proposed method, an image is considered as a set of one-dimensional horizontal and vertical signals and one-dimensional wavelet transform is utilized in which the mother wavelet is the first order derivative of a Gaussian like function. The blocking artifact is reduced by removing the blocking component, that causes the variance at the block boundary position in the first scale wavelet domain to be abnormally higher than those at the other positions, using a minimum mean square error (MMSE) filter in the wavelet domain. This filter minimizes the MSE between the ideal blocking component-free signal and the restored signal in the neighborhood of block boundaries in the wavelet domain. It also uses local variance in the wavelet domain for pixel adaptive processing. The filtering and the projection onto a convex set of quantization constraint are iteratively performed in alternating fashion. Experimental results show that the proposed method yields not only a PSNR improvement of about 0.56-1.07 dB, but also subjective quality nearly free of the blocking artifact and edge blur.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.4
• /
• pp.1837-1860
• /
• 2020

We propose a general framework for studying resource allocation problem and the tradeoff between spectral efficiency (SE) and energy efficiency (EE) for downlink traffic in power domain-non-orthogonal multiple access (PD-NOMA) and device to device (D2D) based heterogeneous cloud radio access networks (H-CRANs) under imperfect channel state information (CSI). The aim is jointly optimize radio remote head (RRH) selection, spectrum allocation and power control, which is formulated as a multi-objective optimization (MOO) problem that can be solved with weighted Tchebycheff method. We propose a low-complexity algorithm to solve user association, spectrum allocation and power coordination separately. We first compute the CSI for RRHs. Then we study allocating the cell users (CUs) and D2D groups to different subchannels by constructing a bipartite graph and Hungrarian algorithm. To solve the power control and EE-SE tradeoff problems, we decompose the target function into two subproblems. Then, we utilize successive convex program approach to lower the computational complexity. Moreover, we use Lagrangian method and KKT conditions to find the global optimum with low complexity, and get a fast convergence by subgradient method. Numerical simulation results demonstrate that by using PD-NOMA technique and H-CRAN with D2D communications, the system gets good EE-SE tradeoff performance.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.30 no.5
• /
• pp.399-406
• /
• 2019

The variation of ground-penetrating radar(GPR) signal characteristics from dielectric-filled nonmetallic pipes buried in inhomogeneous ground are compared through a numerical simulation. The relative permittivity distribution of the ground is generated by using the continuous random media(CRM) technique. As a function of the relative permittivity of the material filling the nonmetallic pipe buried in the ground media, GPR signals are simulated by using the finite-difference time-domain(FDTD) method. We show that, unlike the case for homogeneous ground, the distortion characteristics of the reflected waves caused by the front convex surface and the rear concave surface of the pipe buried in inhomogeneous ground are different depending on the permittivity contrast between the inside and outside of the pipe.

• Bulletin of the Korean Mathematical Society
• /
• v.37 no.4
• /
• pp.729-741
• /
• 2000

In this paper, we study in Banach spaces the existence of fixed points of asymptotically regular mapping T satisfying: for each x, y in the domain and for n=1, 2,…, $$\parallelT^nx-T^ny\parallel\leq$\leq$a_n\parallelx-y\parallel+b_n (\parallelx-T^nx\parallel+\parallely-T^ny\parallely)$$ where $a_n,\; b_n,\; C_n$ are nonnegative constants satisfying certain conditions. We also establish some fixed point theorems for these mappings in a Hibert space, in L(sup)p spaces, in Hardy space H(sup)p, and in Soboleve space $H^{k,p} for 1<\rho<\infty \; and \; k\geq0$. We extend results from papers [10], [11], and others.

• Bulletin of the Korean Mathematical Society
• /
• v.39 no.1
• /
• pp.9-22
• /
• 2002

We consider the hp-version to solve non-constant coefficient elliptic equations with Dirichlet boundary conditions on a bounded, convex polygonal domain $\Omega$ in $R^{2}.$ To compute the integrals in the variational formulation of the discrete problem we need the numerical quadrature rule scheme. In this paler we consider a family $G_{p}= {I_{m}}$ of numerical quadrature rules satisfying certain properties. When the numerical quadrature rules $I_{m}{\in}G_{p}$ are used for calculating the integrals in the stiffness matrix of the variational form we will give its variational fore and derive an error estimate of ${\parallel}u-\tilde{u}^h_p{\parallel}_0,{\Omega}'$.

• Proceedings of the IEEK Conference
• /
• 2005.11a
• /
• pp.427-430
• /
• 2005

In this paper, we propose a new post-processing method, based on the theory of the projection onto convex sets (POCS) to reduce the blocking artifacts in decoded images. We propose a new smoothness constraint set (SCS) and its projection operator in the wavelet transform (WT) domain to remove unnecessary high-frequency components caused by blocking artifacts. We also propose a new method to find and preserve the original high frequency components of the image edge. Experimental results show that the proposed method can not only achieve a significantly enhanced subjective quality, but also have the PSNR improvement in the output image.

• Journal of the Korean Mathematical Society
• /
• v.55 no.5
• /
• pp.1019-1030
• /
• 2018

In [12,13] the researchers introduced universally convex, universally starlike and universally prestarlike functions in the slit domain ${\mathbb{C}}{\backslash}[1,{\infty})$. These papers extended the corresponding notions from the unit disc to other discs and half-planes containing the origin. In this paper, we introduce universally prestarlike generalized functions of order ${\alpha}$ with ${\alpha}{\leq}1$ and we obtain upper bounds of the second Hankel determinant ${\mid}a_2a_4-a^2_3{\mid}$ for such functions.

• Journal of Power System Engineering
• /
• v.4 no.3
• /
• pp.72-80
• /
• 2000

In order to design a stable robust controller, nominal model, and the upper bound about the uncertainty which is the error of the model are needed. The problem to estimate the nominal model of controlled system and the upper bound of uncertainty at the same time is called robust identification. When the nominal model of controlled system and the upper bound of uncertainty in relation to robust identification are given, the evaluation of the validity of the model and the upper bound makes it possible to distinguish whether there is a model which explains observation data including disturbance among the model set. This paper suggests a method to identity the uncertainty which removes disturbance and expounds observation data by giving a probable postulation and plural data set to disturbance. It also examines the suggested method through a numerical computation simulation and validates its effectiveness.

• Journal of the Korean Mathematical Society
• /
• v.57 no.6
• /
• pp.1347-1372
• /
• 2020

We study bifurcation for the following fractional Schrödinger equation $$\{\left.\begin{eqnarray}(-{\Delta})^su+V(x)u&=&{\lambda}f(u)&&{\text{in}}\;{\Omega}\\u&>&0&&{\text{in}}\;{\Omega}\\u&=&0&&{\hspace{32}}{\text{in}}\;{\mathbb{R}}^n{\backslash}{\Omega}\end{eqnarray}\right$$ where 0 < s < 1, n > 2s, Ω is a bounded smooth domain of ℝⁿ, (-∆)^s is the fractional Laplacian of order s, V is the potential energy satisfying suitable assumptions and λ is a positive real parameter. The nonlinear term f is a positive nondecreasing convex function, asymptotically linear that is $\lim_{t{\rightarrow}+{\infty}}\;{\frac{f(t)}{t}}=a{\in}(0,+{\infty})$. We discuss the existence, uniqueness and stability of a positive solution and we also prove the existence of critical value and the uniqueness of extremal solutions. We take into account the types of Bifurcation problem for a class of quasilinear fractional Schrödinger equations, we also establish the asymptotic behavior of the solution around the bifurcation point.

• Bulletin of the Korean Mathematical Society
• /
• v.50 no.4
• /
• pp.1235-1242
• /
• 2013

We give area and height estimates for cmc-graphs over a bounded planar $C^{2,{\alpha}}$ domain ${\Omega}{\subset}\mathbb{R}^3$. For a constant H satisfying $H^2{\mid}{\Omega}{\mid}{\leq}9{\pi}/16$, we show that the height $h$ of H-graphs over ${\Omega}$ with vanishing boundary satisfies ${\mid}h{\mid}$ < $(\tilde{r}/2{\pi})H{\mid}{\Omega}{\mid}$, where $\tilde{r}$ is the middle zero of $(x-1)(H^2{\mid}{\Omega}{\mid}(x+2)^2-9{\pi}(x-1))$. We use this height estimate to prove the following existence result for cmc H-graphs: for a constant H satisfying $H^2{\mid}{\Omega}{\mid}$ < $(\sqrt{297}-13){\pi}/8$, there exists an H-graph with vanishing boundary.