• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.47 no.1
• /
• pp.120-127
• /
• 2010

This paper presents a SR method using adaptive interpolation based on local gradient features to obtain a high quality SR image. In this method, the distance between the interpolated pixel and the neighboring valid pixel is considered by using local gradient properties. The interpolation coefficients take the local gradient of the LR images into account. The smaller the local gradient of a pixel is, the more influence it should have on the interpolated pixel. And the median filter is finally applied to reduce the blurring and noise of the interpolated HR image. Experiment results show the effectiveness of the proposed method in comparison with other methods, especially in the edge areas of the images.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.10C
• /
• pp.1000-1009
• /
• 2007

This paper presents a content adaptive interpolation (CAI) for intra deinterlacing. The CAI consists of three steps: pre-processing, content classification, and adaptive interpolation. There are also three main interpolation methods in our proposed CAI, i.e. modified edge-based line averaging (M-ELA), gradient directed interpolation (GDI), and window matching method (WMM). Each proposed method shows different performances according to spatial local features. Therefore, we analyze the local region feature using the gradient detection and classify each missing pixel into four categories. And then, based on the classification result, a different do-interlacing algorithm is activated in order to obtain the best performance. Experimental results demonstrate that the CAI method performs better than previous techniques.

• Proceedings of the KSME Conference
• /
• 2002.08a
• /
• pp.553-556
• /
• 2002

A numerical study on the use of the momentum interpolation mettled for flows with a large body force is presented. The inherent problems of the momentum interpolation method are discussed first. Numerical experiments are performed for a typical flow involving a large body force. The tact that the momentum interpolation method may result in physically unrealistic solutions is demonstrated. Numerical experiments changing the numerical grid have shown that a simple way of removing the physically unrealistic solution is a proper grid refinement where there is a large pressure gradient. An effective way of specifying the pressure and pressure correction at the boundary by a local mass conservation near the boundary is proposed, and it is shown that this method can effectively remove the inherent problem of the specification of pressure and pressure correction at the boundary when one uses the momentum interpolation method.

• Journal of computational fluids engineering
• /
• v.7 no.2
• /
• pp.8-16
• /
• 2002

A numerical study on the use of the momentum interpolation method for flows with a large body force is presented. The inherent problems of the momentum interpolation method are discussed first. The origins of problems of the momentum interpolation methods are the validity of linear assumptions employed for the evaluation of the cell-face velocities, the enforcement of mass conservation for the cell-centered velocities and the specification of pressure and pressure correction at the boundary. Numerical experiments are performed for a typical flow involving a large body force. The numerical results are compared with those by the staggered grid method. The fact that the momentum interpolation method may result in physically unrealistic solutions is demonstrated. Numerical experiments changing the numerical grid have shown that a simple way of removing the physically unrealistic solution is a proper grid refinement where there is a large pressure gradient. An effective way of specifying the pressure and pressure correction at the boundary by a local mass conservation near the boundary is proposed, and it is shown that this method can effectively remove the inherent problem of the specification of pressure and pressure correction at the boundary when one uses the momentum interpolation method.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.8
• /
• pp.536-546
• /
• 2006

Painterly animation is a method that expresses painterly images with a hand-painted appearance from a video, and the most crucial element for it is the temporal coherence of brush strokes between frames. A motion map is proposed in this paper as a solution to the issue of maintaining the temporal coherence in the brush strokes between the frames. A motion map is the region that frame-to-frame motions have occurred. Namely, this map refers to the region frame-to-frame edges move by the motion information with the motion occurred edges as a starting point. In this paper, we employ the optical flow method and block-based method to estimate the motion information. The method that yielded the biggest PSNR using the motion information (the directions and magnitudes) acquired by various methods of motion estimation has been chosen as the final motion information to form a motion map. The created motion map determine the part of the frame that should be re-painted. In order to express painterly images with a hand- painted appearance and maintain the temporal coherence of brush strokes, the motion information was applied to only the strong edges that determine the directions of the brush strokes. Also, this paper seek to reduce the flickering phenomenon between the frames by using the multiple exposure method and the difference map created by the difference between images of the source and the canvas. Maintenance of the coherence in the direction of the brush strokes was also attempted by a local gradient interpolation to maintain the structural coherence.

• Journal of Korean Port Research
• /
• v.13 no.1
• /
• pp.167-174
• /
• 1999

Numerical analysis of two-fluid flows for both water and air is carried out. Free-Surface flows with an arbitrary deformation have been simulated around two dimensional submerged hydrofoil. The computation is performed using a finite volume method with unstructured meshes and an interface capturing scheme to determine the shape of the free surface. The method uses control volumes with an arbitrary number of faces and allows cell-wise local mesh refinement. the integration in space is of second order based on midpoint rule integration and linear interpolation. The method is fully implicit and uses quadratic interpolation in time through three time levels The linear equation systems are solved by conjugate gradient type solvers and the non-linearity of equations is accounted for through picard iterations. The solution method is of pressure-correction type and solves sequentially the linearized momentum equations the continuity equation the conservation equation of one species and the equations or two turbulence quantities.

• Journal of Mechanical Science and Technology
• /
• v.14 no.7
• /
• pp.789-795
• /
• 2000

Free-surface flows with an arbitrary deformation, induced by a submerged hydrofoil, are simulated numerically, considering two-fluid flows of both water and air. The computation is performed by a finite volume method using unstructured meshes and an interface capturing scheme to determine the shape of the free surface. The method uses control volumes with an arbitrary number of faces and allows cell wise local mesh refinement. The integration in space is of second order, based on midpoint rule integration and linear interpolation. The method is fully implicit and uses quadratic interpolation in time through three time levels. The linear equations are solved by conjugate gradient type solvers, and the non-linearity of equations is accounted for through Picard iterations. The solution method is of pressure-correction type and solves sequentially the linearized momentum equations, the continuity equation, the conservation equation of one species, and the equations for two turbulence quantities. Finally, a comparison is quantitatively made at the same speed between the computation and experiment in which the grid sensitivity is numerically checked.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.42 no.5 s.305
• /
• pp.41-46
• /
• 2005

Deinterlacing is the conversion from interlaced to progressive scan image that is considered to be 2 times image interpolation. In this paper, the simple and effective deinterlacing method is proposed based on the local gradient information of neighborhood pixels. In the proposed method, the weights for directions around the pixel to be interpolated are estimated, and the weighted sum for the neighborhood pixels is the final intensity value of the pixel to be interpolated. The proposed method has the structure suitable to practical implementation and can avoid the artifacts due to the wrong detection of edge direction. In the simulation, it showed improved subjective and objective performance than the ELA method and comparable performance compared with the variation of ELA method which has more complex structure and requires a couple of parameters that is determined by experience.

• Proceedings of the KSME Conference
• /
• 2001.06c
• /
• pp.537-542
• /
• 2001

In recent engineering, the designer has become more and more dependent on computer simulation. But defining exact model using computer simulation is too expensive and time consuming in the complicate systems. Thus, designers often use approximation models, which express the relation between design variables and response variables. These models are called metamodel. In this paper, we introduce one of the metamodel, named Kriging. This model employs an interpolation scheme and is developed in the fields of spatial statistics and geostatistics. This class of interpolating model has flexibility to model response data with multiple local extreme. By reason of this multi modality, we can't use any gradient-based optimization algorithm to find global extreme value of this model. Thus we have to introduce global optimization algorithm. To do this, we introduce DE(Differential Evolution). DE algorithm is developed by Ken Price and Rainer Storn, and it has recently proven to be an efficient method for optimizing real-valued multi-modal objective functions. This algorithm is similar to GA(Genetic Algorithm) in populating points, crossing over, and mutating. But it introduces vector concept in populating process. So it is very simple and easy to use. Finally, we show how we determine Kriging metamodel and find global extreme value through two mathematical examples.

• Journal of Korea Multimedia Society
• /
• v.8 no.2
• /
• pp.164-173
• /
• 2005

Painterly rendering may bring various results through the parameters that determine the characteristics of brush strokes such as, color, orientation, size, and shape. In this paper, we propose the most adaptive brush stroke generation for source images, using reference data. Our algorithm used Colors formed by actual palette colors from artists. To create the palette, we have referred mostly to colors used in Van Gogh's works and determined the color of brush strokes by transferring it to the most similar one, through comparing colors used in source images and the palette colors. Also, In order to emulate a brush stroke with dynamic properties like Van Gogh styles we have applied a brush stroke orientation that surrounds the edges by referring to the edge orientation of source images. The sizes were determined depending on the different sizes of the objects from wide to narrow brushes. Finally, we applied spline curve shapes to simulate curves and swirls like Van Gogh styles. The brush strokes created in such method, were applied separately according to its segmented images, and composed after rendering.