• Kyungpook Mathematical Journal
• /
• v.55 no.1
• /
• pp.127-135
• /
• 2015

We determine two-interval normalized tight frame wavelet sets for real dilation $d{\in}(1,{\infty})$, and characterize all symmetric normalized tight frame wavelet sets. We also construct a normalized tight frame wavelet set which has an infinite number of components accumulating at the origin. These normalized tight frame wavelet sets and their closures possess the same measure. Finally an example of a normalized tight frame wavelet set is provided whose measure is strictly less than the measure of its closure.

• Journal of applied mathematics & informatics
• /
• v.32 no.1_2
• /
• pp.227-245
• /
• 2014

Suppose G is a simple graph. The ${\ell}$-eigenvalues ${\delta}_1$, ${\delta}_2$,..., ${\delta}_n$ of G are the eigenvalues of its normalized Laplacian ${\ell}$. The normalized Laplacian Estrada index of the graph G is dened as ${\ell}EE$ = ${\ell}EE$(G) = ${\sum}^n_{i=1}e^{{\delta}_i}$. In this paper the basic properties of ${\ell}EE$ are investigated. Moreover, some lower and upper bounds for the normalized Laplacian Estrada index in terms of the number of vertices, edges and the Randic index are obtained. In addition, some relations between ${\ell}EE$ and graph energy $E_{\ell}$(G) are presented.

• Journal of information and communication convergence engineering
• /
• v.8 no.2
• /
• pp.136-139
• /
• 2010

We derived Stop-and-go normalized DD, dual-mode normalized Sato, dual-mode NCMA blind equalization algorithm for complex data in this research. And then, the convergence characteristics of the proposed SG-NDD, dual-mode NSato blind equalization algorithms are compared with those of SG-DD, dual-mode Sato algorithms. In general, the normalized blind equalization algorithms have better convergence characteristics than the conventional algorithms.

• Proceedings of the KIEE Conference
• /
• 1992.07a
• /
• pp.337-339
• /
• 1992

This paper deals with the tuning method of PID controls for process controls. It introduces the normalized process gain and the normalized process dead-time for processes based on Ziegler-Nichols tuning methods. In the case of PID auto-tuning, the first, this method applies Ziegler-Nichols tuning method and introduces the set-point weighting for reducing overshoot in the large normalized process gain or small normalized process dead-time, the second, this method is modified and includes the set-point weighting in the small normalized process gain or large normalized process dead-time. In the case of PI auto-tuning, this method is modified for reducing overshoot. This paper obtains empirical data with Ziegler-Nichols methods for refined Ziegler-Nichols tuning methods.

• Kyungpook Mathematical Journal
• /
• v.58 no.1
• /
• pp.167-182
• /
• 2018

In this paper, we prove the optimal inequalities for the generalized normalized ${\delta}$-Casorati curvature and the normalized scalar curvature for different submanifolds in generalized (${\kappa},{\mu}$)-space forms. The proof is based on an optimization procedure involving a quadratic polynomial in the components of the second fundamental form. We also characterize the submanifolds on which equalities hold.

• Proceedings of the KIEE Conference
• /
• 1998.07g
• /
• pp.2243-2245
• /
• 1998

In this paper, we treat image segmentation as a graph partitioning problem. and use the normalized cut for segmenting the graph. The normalized cut criterion measures both the total dissimilarity between the different graphs as well as the total similarity within the groups. The minimization of this criterion can formulated as a generalized eigenvalues problem. We have applied this approach to segment static image. This criterion can be shown to be computed efficiently by a generalized eigenvalues problem

• Journal of Mechanical Science and Technology
• /
• v.16 no.2
• /
• pp.203-210
• /
• 2002

For effective response surface modeling during sequential approximate optimization (SAO), the normalized and the augmented D-optimality criteria are presented. The normalized D-optimality criterion uses the normalized Fisher information matrix by its diagonal terms in order to obtain a balance among the linear-order and higher-order terms. Then, it is augmented to directly include other experimental designs or the pre-sampled designs. This augmentation enables the trust region managed sequential approximate optimization to directly use the pre-sampled designs in the overlapped trust regions in constructing the new response surface models. In order to show the effectiveness of the normalized and the augmented D-optimality criteria, following two comparisons are performed. First, the information surface of the normalized D-optimal design is compared with those of the original D-optimal design. Second, a trust-region managed sequential approximate optimizer having three D-optimal designs is developed and three design problems are solved. These comparisons show that the normalized D-optimal design gives more rotatable designs than the original D-optimal design, and the augmented D-optimal design can reduce the number of analyses by 30% - 40% than the original D-optimal design.

• ETRI Journal
• /
• v.33 no.3
• /
• pp.401-406
• /
• 2011

This paper presents a fast block-matching algorithm based on the normalized cross-correlation, where the elimination order is determined based on the gradient magnitudes of subblocks in the current macroblock. Multilevel Cauchy-Schwartz inequality is derived to skip unnecessary block-matching calculations in the proposed algorithm. Also, additional complexity reduction is achieved re-using the normalized cross correlation values for the spatially neighboring macroblock because the search areas of adjacent macroblocks are overlapped. Simulation results show that the proposed algorithm can improve the speed-up ratio up to about 3 times in comparison with the existing algorithm.

• Korean Journal of Optics and Photonics
• /
• v.20 no.1
• /
• pp.16-22
• /
• 2009

We propose a method to convert a two-dimensional movie to a three-dimensional movie using normalized cut and optical flow. In this paper, we segment an image of a two-dimensional movie to objects first, and then estimate the depth of each object. Normalized cut is one of the image segmentation algorithms. For improving speed and accuracy of normalized cut, we used a watershed algorithm and a weight function using optical flow. We estimate the depth of objects which are segmented by improved normalized cut using optical flow. Ordinal depth is estimated by the change of the segmented object label in an occluded region which is the difference of absolute values of optical flow. For compensating ordinal depth, we generate the relational depth which is the absolute value of optical flow as motion parallax. A final depth map is determined by multiplying ordinal depth by relational depth, then dividing by average optical flow. In this research, we propose the two-dimensional/three-dimensional movie conversion method which is applicable to all three-dimensional display devices and all two-dimensional movie formats. We present experimental results using sample two-dimensional movies.

• Communications of the Korean Mathematical Society
• /
• v.24 no.3
• /
• pp.353-360
• /
• 2009

Fuzzy translations, (normalized, maximal) fuzzy extensions and fuzzy multiplications of fuzzy subalgebras in BCK/BCI-algebras are discussed. Relations among fuzzy translations, (normalized, maximal) fuzzy extensions and fuzzy multiplications are investigated.