• 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 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.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2003년도 컴퓨터소사이어티 추계학술대회논문집
• /
• pp.255-258
• /
• 2003

This paper defines Normalized Term Frequency Weighting method for automatic text categorization by using Box-Cox, and then it applies automatic text categorization. Box-Cox transformation is statistical transformation method which makes normalized data. This paper applies that and suggests new term frequency weighting method. Because Normalized Term Frequency is different from every term compared by existing term frequency weighting method, it is general method more than fixed weighting method such as log or root. Normalized term frequency weighting method's reasonability has been proved though experiments, used 8000 newspapers divided in 4 groups, which resulted high categorization correctness in all cases.

• 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.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 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.

• Journal of Multimedia Information System
• /
• 제6권2호
• /
• pp.75-80
• /
• 2019

In machine learning, the performance of the system depends upon the nature of input data. The efficiency of the system improves when the behavior of the input data changes from un-normalized to normalized form. This paper experimentally demonstrated the performance of KNN, SVM, LDA and NB on Alzheimer's dataset. The dataset undertaken for the study consisted of 3 classes, i.e. Demented, Converted and Non-Demented. Analysis shows that LDA and NB gave an accuracy of 89.83% and 88.19% respectively in both the cases whereas the accuracy of KNN and SVM improved from 46.87% to 82.80% and 53.40% to 88.75% respectively when input data changed from un-normalized to normalized state. From the above results it was observed that KNN and SVM show significant improvement in classification accuracy on normalized data as compared to un-normalized data, whereas LDA and NB reflect no such change in their performance.

• 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.

• 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.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 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

• 한국초지조사료학회지
• /
• 제40권4호
• /
• pp.196-202
• /
• 2020

본 연구는 동계사료작물의 무인기기반 생육모니터링을 위하여 호밀, 총체보리, IRG를 대상으로 다중분광영상으로 건물수량을 예측하기 위한 최적식생지수를 테스트하였다. 2019년 2월부터 4월까지 나주의 실경작지에서 무인기 다중분광카메라로 분광영상을 수집하여 4종류의 식생지수(Normalized Difference Vegetation Index; NDVI, Green Normalized Difference Vegetation Index; GNDVI, Normalized Green Red Difference Index; NGRDI and Normalized Difference Red Edge Index; NDREI)를 산출하고 지상에서 건물수량을 조사하여 식생지수와 건물수량의 상관관계를 조사하였다. 호밀, 총체보리, IRG에 대하여 건물수량과 NDVI의 상관관계(R2)는 0.91~0.92, GNDVI는 0.92~0.94, NGRDI는 0.71~0.85, NDREI는 0.84~0.91로 GNDVI가 가장 효과적이었다.