• Journal of information and communication convergence engineering
• /
• v.7 no.4
• /
• pp.539-544
• /
• 2009

An estimation of 3D velocity field including occluded parts without maxing tracer to the fluid had not only never been proposed but also impossible by the conventional computer vision algorithm. In this paper, we propose a new method of three dimensional optical flow of the fluid based on physical model, where some boundary conditions are given from a priori knowledge of the flow configuration. Optical flow is obtained by minimizing the mean square errors of a basic constraint and the matching error terms with visual data using Euler equations. Here, Navier-Stokes motion equations and the differences between occluded data and observable data are employed as the basic constrains. we verify the effectiveness of our proposed method by applying our algorithm to simulated data with partly artificially deleted and recovering the lacking data. Next, applying our method to the fluid of observable surface data and the knowledge of boundary conditions, we demonstrate that 3D optical flow are obtained by proposed algorithm.

• Bulletin of the Korean Mathematical Society
• /
• v.52 no.6
• /
• pp.1945-1962
• /
• 2015

This paper is mainly concerned with the formation of delta standing wave for the scalar conservation law with a linear flux function involving discontinuous coefficients by using the self-similar viscosity vanishing method. More precisely, we use the self-similar viscosity to smooth out the discontinuous coefficient such that the existence of approximate viscous solutions to the delta standing wave for the Riemann problem is established and then the convergence to the delta standing wave solution is also obtained when the viscosity parameter tends to zero. In addition, the Riemann problem is also solved with the standard method and the instability of Riemann solutions with respect to the specific small perturbation of initial data is pointed out in some particular situations.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.11
• /
• pp.4463-4482
• /
• 2020

Mesh model generated from 3D reconstruction usually comes with lots of noise, which challenges the performance and robustness of mesh simplification approaches. To overcome this problem, we present a novel method for mesh simplification which could preserve structure and improve the accuracy. Our algorithm considers both the planar structures and linear features. In the preprocessing step, it automatically detects a set of planar structures through an iterative diffusion approach based on Region Seed Growing algorithm; then robust linear features of the mesh model are extracted by exploiting image information and planar structures jointly; finally we simplify the mesh model with plane constraint QEM and linear feature preserving strategies. The proposed method can overcome the known problem that current simplification methods usually degrade the structural characteristics, especially when the decimation is extreme. Our experimental results demonstrate that the proposed method, compared to other simplification algorithms, can effectively improve the quality of mesh and yield an increased robustness on noisy input mesh.

• Journal of Information Processing Systems
• /
• v.18 no.1
• /
• pp.48-58
• /
• 2022

Blind restoration for motion-blurred images is always the research hotspot, and the key for the blind restoration is the accurate blur kernel (BK) estimation. Therefore, to achieve high-quality blind image restoration, this thesis presents a novel windowed-total-variation method. The proposed method is based on the spatial scale of edges but not amplitude, and the proposed method thus can extract useful image edges for accurate BK estimation, and then recover high-quality clear images. A large number of experiments prove the superiority.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.19 no.4
• /
• pp.161-166
• /
• 2018

In this paper, we propose a method for the random selection of pooling operations for the regularization and reduction of cross validation in convolutional neural networks. The pooling operation in convolutional neural networks is used to reduce the size of the feature map and for its shift invariant properties. In the existing pooling method, one pooling operation is applied in each pooling layer. Because this method fixes the convolution network, the network suffers from overfitting, which means that it excessively fits the models to the training samples. In addition, to find the best combination of pooling operations to maximize the performance, cross validation must be performed. To solve these problems, we introduce the probability concept into the pooling layers. The proposed method does not select one pooling operation in each pooling layer. Instead, we randomly select one pooling operation among multiple pooling operations in each pooling region during training, and for testing purposes, we use probabilistic weighting to produce the expected output. The proposed method can be seen as a technique in which many networks are approximately averaged using a different pooling operation in each pooling region. Therefore, this method avoids the overfitting problem, as well as reducing the amount of cross validation. The experimental results show that the proposed method can achieve better generalization performance and reduce the need for cross validation.

• Structural Engineering and Mechanics
• /
• v.56 no.5
• /
• pp.871-897
• /
• 2015

This paper presents a novel method based on sensitivity of structural response for identifying both the system parameters and input excitation force of a bridge. This method, referred to as "Adjoint Variable Method", is a sensitivity-based finite element model updating method. The computational cost of sensitivity analyses is the main concern associated with damage detection by these methods. The main advantage of proposed method is inclusion of an analytical method to augment the accuracy and speed of the solution. The reliable performance of the method to precisely indentify the location and intensity of all types of predetermined single, multiple and random damages over the whole domain of moving vehicle speed is shown. A comparison study is also carried out to demonstrate the relative effectiveness and upgraded performance of the proposed method in comparison to the similar ordinary sensitivity analysis methods. Moreover, various sources of error including the effects of noise and primary errors on the numerical stability of the proposed method are discussed.

• Communications for Statistical Applications and Methods
• /
• v.15 no.5
• /
• pp.753-764
• /
• 2008

The $L_1$ regularized estimator in quantile problems conduct parameter estimation and model selection simultaneously and have been shown to enjoy nice performance. However, $L_1$ regularized estimator has a drawback: when there are several highly correlated variables, it tends to pick only a few of them. To make up for it, the proposed method adopts doubly regularized framework with the mixture of $L_1$ and $L_2$ norms. As a result, the proposed method can select significant variables and encourage the highly correlated variables to be selected together. One of the most appealing features of the new algorithm is to construct the entire solution path of doubly regularized quantile estimator. From simulations and real data analysis, we investigate its performance.

• Journal of the Korean Mathematical Society
• /
• v.44 no.6
• /
• pp.1397-1415
• /
• 2007

We consider an inverse heat conduction problem(IHCP) in a quarter plane which appears in some applied subjects. We want to determine the heat flux on the surface of a body from a measured temperature history at a fixed location inside the body. This is a severely ill-posed problem in the sense that arbitrarily "small" differences in the input temperature data may lead to arbitrarily "large" differences in the surface flux. A semi-discrete central difference scheme in time is employed to deal with the ill posed problem. We obtain some error estimates which also give the information about how to choose the step length in time. Some numerical examples illustrate the effects of the proposed method.

• Journal of the Korean Mathematical Society
• /
• v.55 no.3
• /
• pp.719-734
• /
• 2018

An image restoration problem with Poisson noise arises in many applications of medical imaging, astronomy, and microscopy. To overcome ill-posedness, Total Variation (TV) model is commonly used owing to edge preserving property. Since staircase artifacts are observed in restored smooth regions, higher-order TV regularization is introduced. However, sharpness of edges in the image is also attenuated. To compromise benefits of TV and higher-order TV, the weighted sum of the non-convex TV and non-convex higher order TV is used as a regularizer in the proposed variational model. The proposed model is non-convex and non-smooth, and so it is very challenging to solve the model. We propose an iterative reweighted algorithm with the proximal linearized alternating direction method of multipliers to solve the proposed model and study convergence properties of the algorithm.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.985-986
• /
• 2008

In this paper, we introduce a novel variant of LDA for face renition. The proposed method is derived by regularizing the eigenvalue of nonlinear LDA. We evaluated the proposed method using AR face database, and it showed outstanding and stable performance over the preceding LDA variants.