• Kyungpook Mathematical Journal
• /
• 제55권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
• /
• 제32권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
• /
• 제8권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.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1992년도 하계학술대회 논문집 A
• /
• 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
• /
• 제58권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.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1998년도 하계학술대회 논문집 G
• /
• 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
• /
• 제16권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
• /
• 제33권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.

• 한국광학회지
• /
• 제20권1호
• /
• pp.16-22
• /
• 2009

본 논문에서는 2차원 동영상을 normalized cut과 optical flow를 이용하여 3차원 동영상으로 변환하는 방법을 제안하였다. 이를 통해 특정 디스플레이 장치와 특정 동영상 포맷에 국한되지 않는 2차원 동영상의 3차원 동영상 변환 방법을 제안하였다. 본 연구에서는 2차원 동영상의 3차원 변환을 위하여 먼저 영상을 객체로 분할하고, 분할된 객체의 깊이를 추정하는 방법을 사용하였다. Normalized cut은 영상분할의 한 방법으로, 본 연구에서는 연산속도 향상을 위하여 기존 방법에 watershed 알고리즘을 적용하였고, 정확도 향상을 위하여 가중치에 optical flow를 추가하였다. Normalized cut을 이용하여 분할된 영상의 깊이 정보를 추정하기 위하여 optical flow를 이용하였다. Optical flow의 차이를 통해 정의할 수 있는 가려진 영역의 분할 영상 변화를 통해 순서적 깊이 정보를 추정한다. 추정된 순서적 깊이를 보정하기 위해 optical flow의 절대적 크기를 이용해 운동시차로 상대적 깊이를 추정하였다. 최종적으로 추정된 깊이 정보는 순서적 깊이와 상대적 깊이의 곱을 평균 optical flow로 나누어, 순서적 깊이의 차이를 보정하였다. 제안한 방법의 검증을 위하여 2차원 동영상을 3차원 동영상으로 변환하여 깊이 정보가 추정됨을 확인하였다.

• 대한수학회논문집
• /
• 제24권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.