Youngjoon Cha
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Youngjoon Cha has a total of 2 co-authors. Here are the top co-authors by number of shared publications:
- Seongjai Kim
Department of Mathematics and Statistics, Mississippi State University, Mississippi State, USA
2 shared publications Seongjai Kim
1 shared publication
Latest Publications
- 1 October 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15224880,p. 701-704
Error-Amended Sharp Edge (EASE) Schemes for Image Interpolation
This article proposes a new interpolation method, called the error-amended sharp edge (EASE) scheme. EASE is a modified bilinear method which tries to amend the interpolation error in an edge-adaptive way by employing the interpolation error theorem. The resulting scheme has proved to result in zoomed images having sharper edges than bilinear, C1-bicubic, and C2-bicubic interpolation methods. EASE is similarly efficient as cubic interpolation methods and can be implemented with ease.
- 1 October 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15224880,p. 701-704
Error-Amended Sharp Edge (EASE) Schemes for Image Interpolation
This article proposes a new interpolation method, called the error-amended sharp edge (EASE) scheme. EASE is a modified bilinear method which tries to amend the interpolation error in an edge-adaptive way by employing the interpolation error theorem. The resulting scheme has proved to result in zoomed images having sharper edges than bilinear, C1-bicubic, and C2-bicubic interpolation methods. EASE is similarly efficient as cubic interpolation methods and can be implemented with ease.
- 29 August 2006
- Published by Springer Nature in Journal of Mathematical Imaging and Vision
- Vol. 25 (3) , 353-364
Edge-Forming Methods for Image Zooming
- 29 August 2006
- Published by Springer Nature in Journal of Mathematical Imaging and Vision
- Vol. 25 (3) , 353-364
Edge-Forming Methods for Image Zooming
- 17 July 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Image Processing
- Vol. 15 (8) , 2315-2323
Edge-forming methods for color image zooming
This paper introduces edge-forming schemes for image zooming of color images by general magnification factors. In order to remove/reduce artifacts arising in image interpolation, such as image blur and the checkerboard effect, an edge-forming method is suggested to be applied as a postprocess of standard interpolation methods. The method is based on nonconvex nonlinear partial differential equations. The equations are carefully discretized, incorporating numerical schemes of anisotropic diffusion, to be able to form reliable edges satisfactorily. The alternating direction implicit (ADI) method is employed for an efficient simulation of the model. It has been numerically verified that the resulting algorithm can form clear edges in 2 to 3 ADI iterations. Various results are given to show th effectiveness and reliability of the algorithm.
- 17 July 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Image Processing
- Vol. 15 (8) , 2315-2323
Edge-forming methods for color image zooming
This paper introduces edge-forming schemes for image zooming of color images by general magnification factors. In order to remove/reduce artifacts arising in image interpolation, such as image blur and the checkerboard effect, an edge-forming method is suggested to be applied as a postprocess of standard interpolation methods. The method is based on nonconvex nonlinear partial differential equations. The equations are carefully discretized, incorporating numerical schemes of anisotropic diffusion, to be able to form reliable edges satisfactorily. The alternating direction implicit (ADI) method is employed for an efficient simulation of the model. It has been numerically verified that the resulting algorithm can form clear edges in 2 to 3 ADI iterations. Various results are given to show th effectiveness and reliability of the algorithm.