• MALSORI
• /
• no.56
• /
• pp.225-235
• /
• 2005

Speech unit concatenation with a large database is presently the most popular method for speech synthesis. In this approach, the mismatches at the unit boundaries are unavoidable and become one of the reasons for quality degradation. This paper proposes an algorithm to reduce undesired discontinuities between the subsequent units. Optimal matching points are calculated in two steps. Firstly, the fullback-Leibler distance measurement is utilized for the spectral matching, then the unit sliding and the overlap windowing are used for the waveform matching. The proposed algorithm is implemented for the corpus-based unit concatenating Korean text-to-speech system that has an automatically labeled database. Experimental results show that our algorithm is fairly better than the raw concatenation or the overlap smoothing method.

• Journal of the Earthquake Engineering Society of Korea
• /
• v.25 no.1
• /
• pp.43-52
• /
• 2021

According to several seismic design standards, a ground motion time history should be selected similar to the design response spectrum, or a ground motion time history should be modified by matching procedure to the design response spectrum through the time-domain method. For the response spectrum matching procedure, appropriate seed ground motions need to be selected to maintain recorded earthquake accelerogram characteristics. However, there are no specific criteria for selecting the seed ground motions for applying this methodology. In this study, the characteristics of ground motion time histories between seed motions and spectral matched motions were compared. Intensity measures used in the design were compared, and their change by spectral matching procedure was quantified. In addition, the seed ground motion sets were determined according to the response spectrum shape, and these sets analyzed the response of nonlinear and equivalent linear single degrees of freedom systems to present the seed motion selection conditions for spectral matching. As a result, several considerations for applying the time domain spectral matching method were presented.

• Korean Journal of Remote Sensing
• /
• v.25 no.3
• /
• pp.263-270
• /
• 2009

Noise band removal is a crucial step before spectral matching since the noise bands can distort the typical shape of spectral reflectance, leading to degradation on the matching results. This paper proposes a statistical noise band removal method for hyperspectral data using the correlation coefficient between two bands. The correlation coefficient measures the strength and direction of a linear relationship between two random variables. Considering each band of the hyperspectral data as a random variable, the correlation between two signal bands is high; existence of a noisy band will produce a low correlation due to ill-correlativeness and undirected ness. The unsupervised k-nearest neighbor clustering method is implemented in accordance with three well-accepted spectral matching measures, namely ED, SAM and SID in order to evaluate the validation of the proposed method. This paper also proposes a hierarchical scheme of combining those measures. Finally, a separability assessment based on the between-class and the within-class scatter matrices is followed to evaluate the applicability of the proposed noise band removal method. Also, the paper brings out a comparison for spectral matching measures. The experimental results conducted on a 228-band hyperspectral data show that while the SAM measure is rather resistant, the performance of SID measure is more sensitive to noise.

• Bulletin of the Korean Mathematical Society
• /
• v.60 no.4
• /
• pp.873-893
• /
• 2023

In 2017, Nikiforov proposed the A_𝛼-matrix of a graph G. This novel matrix is defined as A_𝛼(G) = 𝛼D(G) + (1 - 𝛼)A(G), 𝛼 ∈ [0, 1], where D(G) and A(G) are the degree diagonal matrix and adjacency matrix of G, respectively. Recently, Zhai, Xue and Liu [39] considered the Brualdi-Hoffman-type problem for Q-spectra of graphs with given matching number. As a continuance of it, in this contribution we consider the Brualdi-Hoffman-type problem for A_𝛼-spectra of graphs with given matching number. We identify the graphs with given size and matching number having the largest A_𝛼-spectral radius for ${\alpha}{\in}[{\frac{1}{2}},1)$.

• Journal of the Optical Society of Korea
• /
• v.20 no.4
• /
• pp.515-523
• /
• 2016

Spectral reflectance is sparse in space, and while the traditional spectral-reconstruction algorithm does not make full use of this characteristic sparseness, the compressive sensing algorithm can make full use of it. In this paper, on the basis of analyzing compressive sensing based on the orthogonal matching pursuit algorithm, a new algorithm based on the Dice matching criterion is proposed. The Dice similarity coefficient is introduced, to calculate the correlation coefficient of the atoms and the residual error, and is used to select the atoms from a library. The accuracy of Spectral reconstruction based on the pseudo-inverse method, Wiener estimation method, OMP algorithm, and DOMP algorithm is compared by simulation on the MATLAB platform and experimental testing. The result is that spectral-reconstruction accuracy based on the DOMP algorithm is higher than for the other three methods. The root-mean-square error and color difference decreases with an increasing number of principal components. The reconstruction error decreases as the number of iterations increases. Spectral reconstruction based on the DOMP algorithm can improve the accuracy of color-information replication effectively, and high-accuracy color-information reproduction can be realized.

• Journal of the Korean Geophysical Society
• /
• v.4 no.4
• /
• pp.231-238
• /
• 2001

In this paper, an efficient LP method ofr discrete harmonic spectra is proposed and discussed. A new efficient LP method is a combination of recursive and frequency selective LP. While the recursive LP provides better spectral matching in spectral hills, frequency selective LP eliminates numerical instability and improves spectral matching when the harmonics are confined in the low frequncy region. The proposed LP method is applied to the HILN coder. Simulation results using a verification model(VM) software for real audio signals show a definite trend of significant improvement.

• The Journal of Engineering Research
• /
• v.5 no.1
• /
• pp.37-44
• /
• 2004

n this paper, an efficient LP method for discrete harmonic spectra is proposed and discussed. A new efficient LP method is a combination of recursive and frequency selective LP. While the recursive LP provides better spectral matching in spectral hill, frequency selective LP eliminates numerical instability and improves spectral matching when the harmonics are confined in the low frequency region. The proposed LP method is applied to the HILN coder. Simulation results using a verification model(VM) software for real audio signals show a definite trend of significant improvement.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.29 no.5
• /
• pp.449-457
• /
• 2011

As automated image processing techniques have been required in multi-temporal/multi-sensor geospatial image applications, use of automated but highly invariant image matching technique has been a critical ingredient. Note that there is high possibility of geometric and spectral differences between multi-temporal/multi-sensor geospatial images due to differences in sensor, acquisition geometry, season, and weather, etc. Among many image matching techniques, the SIFT (Scale Invariant Feature Transform) is a popular method since it has been recognized to be very robust to diverse imaging conditions. Therefore, the SIFT has high potential for the geospatial image processing. This paper presents a performance test results of the SIFT on geospatial imagery by simulating various image differences such as shear, scale, rotation, intensity, noise, and spectral differences. Since a geospatial image application often requires a number of good matching points over the images, the number of matching points was analyzed with its matching positional accuracy. The test results show that the SIFT is highly invariant but could not overcome significant image differences. In addition, it guarantees no outlier-free matching such that it is highly recommended to use outlier removal techniques such as RANSAC (RANdom SAmple Consensus).

• Proceedings of the KSRS Conference
• /
• 2008.10a
• /
• pp.111-114
• /
• 2008

The existence of noise bands may deform the typical shape of the spectrum, making the accuracy of clustering degraded. This paper proposes a statistical approach to remove noise bands in hyperspectral data using the correlation coefficient of bands as an indicator. Considering each band as a random variable, two adjacent signal bands in hyperspectral data are highly correlative. On the contrary, existence of a noise band will produce a low correlation. For clustering, the unsupervised ${\kappa}$-nearest neighbor clustering method is implemented in accordance with three well-accepted spectral matching measures, namely ED, SAM and SID. Furthermore, this paper proposes a hierarchical scheme of combining those measures. Finally, a separability assessment based on the between-class and the within-class scatter matrices is followed to evaluate the applicability of the proposed noise band removal method. Also, the paper brings out a comparison for spectral matching measures.

• The Journal of the Acoustical Society of Korea
• /
• v.24 no.7
• /
• pp.402-409
• /
• 2005

In this paper. we propose a coding method using a matching pursuit algorithm in a strongly periodic highband signal. Also. we propose an efficient quantizer for the estimated parameters : spectral magnitude and phase. Based on the error concealment principle and sinusoidal model. the MP algorithm requires the high-precision pitch period estimation. To estimate more accurate pitch period. the refined pitch obtained from lowband speech is used. which increases the efficiency of bit allocation. The spectral magnitude parameters are quantized by the method which is combined with MDCT (Modified Discrete Cosine Transform) and multi-stage structure. The spectral phase quantizer uses the $2{\pi}$ modular characteristic of phases and the weighted function by spectral magnitudes. To evaluate the efficiency of the proposed method. we applied it to analysis-by-synthesis system. Furthermore we suggest the possibillity of scalable wideband speech codecs based on band-split structure.