• International journal of advanced smart convergence
• /
• v.11 no.2
• /
• pp.185-193
• /
• 2022

There have been various studies in Korea to develop a %IMF(Intramuscular Fat Percentage) estimation method suitable for Hanwoo. Recently, a %IMF estimation method using a convolutional neural network (CNN), a kind of deep learning method among artificial intelligence methods, has been studied. In this study, we performed a performance comparison when various preprocessing methods were applied to the %IMF estimation of ultrasound images using CNN as mentioned above. The preprocessing methods used in this study are normalization, histogram equalization, edge enhancement, and a method combining normalization and edge enhancement. When estimating the %IMF of Hanwoo by the conventional method that did not apply preprocessing in the experiment, the accuracy was 98.2%. The other hand, we found that the accuracy improved to 99.5% when using preprocessing with histogram equalization alone or combined regularization and edge enhancement.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.5
• /
• pp.1569-1586
• /
• 2015

This paper considers the optimal cell association and resource allocation for load balancing in a heterogeneous cellular network subject to user's quality-of-service (QoS) constraints. We adopt the proportional fairness (PF) utility maximization formulation which also accommodates the QoS constraints in terms of minimum rate requirements. With equal resource allocation this joint optimization problem is either infeasible or requires relaxation that yields a solution which is difficult to implement. Nevertheless, we show that this joint optimization problem can be effectively solved without any priori assumption on resource allocation and yields a cell association scheme which enforces single BS association for each user. We re-formulated the joint optimization problem as a network-wide resource allocation problem with cardinality constraints. A reweighted heuristic l₁-norm regularization method is used to obtain a sparse solution to the re-formulated problem. The cell association scheme is then derived from the sparsity pattern of the solution, which guarantees a single BS association for each user. Compared with the previously proposed method based on equal resource allocation, the proposed framework results in a feasible cell association scheme and yields a robust solution on resource allocation that satisfies the QoS constraints. Our simulations illustrate the impact of user's minimum rate requirements on cell association and demonstrate that the proposed approach achieves load balancing and enforces single BS association for users.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.22 no.6
• /
• pp.17-31
• /
• 2023

An activity-based model requires detailed population information to model individual travel behavior in a disaggregated manner. The recent innovative approach developed deep generative models with novel regularization terms that improves fidelity and diversity for population synthesis. Since the method relies on measuring the distance between distribution boundaries of the sample data and the generated sample, it is crucial to obtain well-defined continuous representation from the discretized dataset. Therefore, we propose an improved entity embedding models to enhance the performance of the regularization terms, which indirectly supports the synthesis in terms of feasible and diverse populations. Our results show a 28.87% improvement in the F1 score compared to the baseline method.

• Journal of Electrical Engineering and Technology
• /
• v.4 no.3
• /
• pp.365-369
• /
• 2009

Identification is considered to be among the main applications of inverse theory and its objective for a given physical system is to use data which is easily observable, to infer some of the geometric parameters which are not directly observable. In this paper, a parameter identification method using inverse problem methodology is proposed. The minimisation of the objective function with respect to the desired vector of design parameters is the most important procedure in solving the inverse problem. The conjugate gradient method is used to determine the unknown parameters, and Tikhonov's regularization method is then used to replace the original ill-posed problem with a well-posed problem. The simulation and experimental results are presented and compared.

• Journal of Multimedia Information System
• /
• v.1 no.1
• /
• pp.87-93
• /
• 2014

The aim of microscopic image restoration is to recover the image by applying the inverse process of degradation, and the results facilitate automated and improved analysis of the image. In this work, we consider the problem of image restoration as a minimization problem of convex cost function, which consists of a least-squares fitting term and regularization terms with non-negative constraints. The finite step method is proposed to solve this constrained convex optimization problem. We demonstrate the convergence of this method. Efficiency and restoration capability of the proposed method were tested and illustrated through numerical experiments.

• IEIE Transactions on Smart Processing and Computing
• /
• v.5 no.5
• /
• pp.319-322
• /
• 2016

We propose a parametric blind deconvolution method for bi-level images with unknown intensity levels that estimates unknown parameters for point spread functions and images by minimizing a penalized nonlinear least squares objective function based on normalized correlation coefficients and two regularization functions. Unlike conventional methods, the proposed method does not require knowledge about true intensity values. Moreover, the objective function of the proposed method can be effectively minimized, since it has the special structure of nonlinear least squares. We demonstrate the effectiveness of the proposed method through simulations and experiments.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.57 no.4
• /
• pp.718-724
• /
• 2008

We present a novel joint barcode deblurring and nonuniform illumination compensation algorithm for barcode signals whose number of modules is known. The proposed algorithm is based on a penalized least squares method using a roughness penalty function for an illumination model and a double well penalty function for a barcode signal model. In simulations, the proposed method shows an improved performance compared with a conventional method without compensating nonuniform illumination effects. In addition, the proposed method converges quickly during optimization(within 15 iterations), thereby showing strong possibility for real time decoding of barcode signals.

• Communications for Statistical Applications and Methods
• /
• v.28 no.6
• /
• pp.583-594
• /
• 2021

In this paper, we propose wavelet-based procedures to identify the difference between images, including portraits and handwriting. The proposed methods are based on a novel combination of multiscale methods with a regularization technique. The multiscale method extracts the local characteristics of an image, and the distinct features are obtained through the regularized regression of the local characteristics. The regularized regression approach copes with the high-dimensional problem to build the relation between the local characteristics. Lytle and Yang (2006) introduced the detection method of forged handwriting via wavelets and summary statistics. We expand the scope of their method to the general image and significantly improve the results. We demonstrate the promising empirical evidence of the proposed method through various experiments.

• Bulletin of the Korean Mathematical Society
• /
• v.56 no.3
• /
• pp.757-777
• /
• 2019

In this paper, we study the convergence analysis of the sequences generated by the proximal point method for an infinite family of pseudo-monotone equilibrium problems in Banach spaces. We first prove the weak convergence of the generated sequence to a common solution of the infinite family of equilibrium problems with summable errors. Then, we show the strong convergence of the generated sequence to a common equilibrium point by some various additional assumptions. We also consider two variants for which we establish the strong convergence without any additional assumption. For both of them, each iteration consists of a proximal step followed by a computationally inexpensive step which ensures the strong convergence of the generated sequence. Also, for this two variants we are able to characterize the strong limit of the sequence: for the first variant it is the solution lying closest to an arbitrarily selected point, and for the second one it is the solution of the problem which lies closest to the initial iterate. Finally, we give a concrete example where the main results can be applied.

• The Journal of the Acoustical Society of Korea
• /
• v.39 no.3
• /
• pp.200-206
• /
• 2020

In this paper, we propose a broadband beamforming method using the Spatial Response Variation (SRV) which is defined to measure the fluctuation of the array spatial response within the desired frequency band. By applying the SRV to regularization term, we achieve a good quality main beam width variation less than 1 degree within the desired frequency band. In design experiments, we show that the proposed method is better than the existing method.