• The Journal of the Acoustical Society of Korea
• /
• v.28 no.2
• /
• pp.112-118
• /
• 2009

This paper proposes a rapid detection algorithm of a salient region for music video browsing system, which can be applied to mobile device and digital video recorder (DVR). The input music video is decomposed into the music and video tracks. For the music track, the music highlight including musical chorus is detected based on structure analysis using energy-based peak position detection. Using the emotional models generated by SVM-AdaBoost learning algorithm, the music signal of the music videos is classified into one of the predefined emotional classes of the music automatically. For the video track, the face scene including the singer or actor/actress is detected based on a boosted cascade of simple features. Finally, the salient region is generated based on the alignment of boundaries of the music highlight and the visual face scene. First, the users select their favorite music videos from various music videos in the mobile devices or DVR with the information of a music video's emotion and thereafter they can browse the salient region with a length of 30-seconds using the proposed algorithm quickly. A mean opinion score (MOS) test with a database of 200 music videos is conducted to compare the detected salient region with the predefined manual part. The MOS test results show that the detected salient region using the proposed method performed much better than the predefined manual part without audiovisual processing.

• The Journal of the Acoustical Society of Korea
• /
• v.28 no.6
• /
• pp.572-577
• /
• 2009

Large corpus-based concatenating Text-to-Speech (TTS) systems can generate natural synthetic speech without additional signal processing. To prune the redundant speech segments in a large speech segment DB, we can utilize a decision-tree based triphone clustering algorithm widely used in speech recognition area. But, the conventional methods have problems in representing the acoustic transitional characteristics of the phones and in applying context questions with hierarchic priority. In this paper, we propose a new clustering algorithm to downsize the speech DB. Firstly, three 13th order MFCC vectors from first, medial, and final frame of a phone are combined into a 39 dimensional vector to represent the transitional characteristics of a phone. And then the hierarchically grouped three question sets are used to construct the triphone trees. For the performance test, we used DTW algorithm to calculate the acoustic similarity between the target triphone and the triphone from the tree search result. Experimental results show that the proposed method can reduce the size of speech DB by 23% and select better phones with higher acoustic similarity. Therefore the proposed method can be applied to make a small sized TTS.

• Journal of Korean Tunnelling and Underground Space Association
• /
• v.25 no.6
• /
• pp.479-493
• /
• 2023

The need for safety management has arisen due to the increasing number of years of operated underground structures, such as tunnels and utility tunnels, and accidents caused by those aging infrastructures. However, in the case of privately managed underground utility ducts, there is a lack of detailed guidelines for facility safety and maintenance, resulting in inadequate safety management. Furthermore, the absence of basic design information and the limited space for safety assessments make applying currently used non-destructive testing methods challenging. Therefore, this study suggests non-destructive inspection methods using ultrasonic and impact-echo techniques to assess the quality of underground structures. Thickness, presence of rebars, depth of rebars, and the presence and depth of internal defects are assessed to provide fundamental data for the safety assessment of box-type general underground structures. To validate the proposed methodology, different conditions of concrete specimens are designed and cured to simulate actual field conditions. Applying ultrasonic and impact signals and collecting data through multi-channel accelerometers determine the thickness of the simulated specimens, the depth of embedded rebar, and the extent of defects. The predicted results are well agreed upon compared with actual measurements. The proposed methodology is expected to contribute to developing safety diagnostic methods applicable to general underground structures in practical field conditions.

• Journal of Korea Water Resources Association
• /
• v.57 no.3
• /
• pp.209-223
• /
• 2024

In the context of the fourth industrial revolution, data-driven decision-making has increasingly become pivotal. However, the integrity of data analysis is compromised if data quality is not adequately ensured, potentially leading to biased interpretations. This is particularly critical for water level data, essential for water resource management, which often encounters quality issues such as missing values, spikes, and noise. This study addresses the challenge of noise-induced data quality deterioration, which complicates trend analysis and may produce anomalous outliers. To mitigate this issue, we propose a noise removal strategy employing Wavelet Transform, a technique renowned for its efficacy in signal processing and noise elimination. The advantage of Wavelet Transform lies in its operational efficiency - it reduces both time and costs as it obviates the need for acquiring the true values of collected data. This study conducted a comparative performance evaluation between our Wavelet Transform-based approach and the Denoising Autoencoder, a prominent machine learning method for noise reduction.. The findings demonstrate that the Coiflets wavelet function outperforms the Denoising Autoencoder across various metrics, including Mean Absolute Error (MAE), Mean Absolute Percentage Error (MAPE), and Mean Squared Error (MSE). The superiority of the Coiflets function suggests that selecting an appropriate wavelet function tailored to the specific application environment can effectively address data quality issues caused by noise. This study underscores the potential of Wavelet Transform as a robust tool for enhancing the quality of water level data, thereby contributing to the reliability of water resource management decisions.

• Korean Journal of Optics and Photonics
• /
• v.35 no.4
• /
• pp.175-183
• /
• 2024

Research into optical signal processing using photonic integrated circuits (PICs) has been actively pursued in various fields, including optical communication, optical sensors, and quantum optics. Among the materials used in PIC fabrication, polymers have attracted significant interest due to their unique characteristics. To fabricate polymer-based PICs, establishing an accurate manufacturing process for the cross-sectional structure of an optical waveguide is crucial. For stable device performance and high yield in mass production, a process with high reproducibility and a wide tolerance for variation is necessary. This study proposes an efficient method for fabricating polymer optical-waveguide devices by introducing the atomic layer deposition (ALD) process. Compared to conventional photoresist or metal-film deposition methods, the ALD process enables more precise fabrication of the optical waveguide's core structure. Polyimide optical waveguides with a core size of 1.8 × 1.6 ㎛² are fabricated using the ALD process, and their propagation losses are measured. Additionally, a multimode interference (MMI) optical-waveguide power-splitter device is fabricated and characterized. Throughout the fabrication, no cracking issues are observed in the etching-mask layer, the vertical profiles of the waveguide patterns are excellent, and the propagation loss is below 1.5 dB/cm. These results confirm that the ALD process is a suitable method for the mass production of high-quality polymer photonic devices.

• Journal of the Korean Academy of Child and Adolescent Psychiatry
• /
• v.12 no.1
• /
• pp.25-50
• /
• 2001

Using Fourier transformation and wavelet analysis, we compared the auditory event-related potentials of the patients with attention deficit-hyperactivity disorders(abbr. ADHD, 13 boys) and normal control children(8 boys). Amplitudes of the event-related potentials which were calculated via Fourier transformation were compared between the groups and between conditions(non-target versus target) in each group. To the non-target stimuli, the patients with ADHD showed significantly greater amplitudes across almost all of the electrode sites and frequencies. To the target stimuli, the incidents which ADHD patients showed much higher amplitudes than normal controls significantly decreased, while those of the reverse results increased significantly. These results were consistent with the comparison results about negative difference wave(abbr. Nd wave) using Fourier transformation. In summary, it was proved that non-target stimulus which should be ignored elicited more robust electrical response from the patients with ADHD than normal children, but the target stimulus which reguired active processing did much less electrical activity in the patients. For the patients, they showed much inhibited electrical response to the target stimuli in some electrodes and frequency ranges. Normal children were more strongly stimulated by the target stimuli in almost all electrodes and frequency ranges than the patients, but less in prefrontal leads and frontal leads. Wavelet analysis results proved that early responses(0-300msec) to the nontarget stimuli of the patients were significantly greater than the normal controls in prefrontal, anterior frontal, some parts of temporal, and occipital lobes and that late response(300-370msec) were significantly lesser than normal children in parietal and central electrodes. Target stimuli elicited significantly higher electrical activity in both group than non-target stimuli did. Prefrontal and frontal lobes showed stronger responses in the patients than normal children irrespective of stimulus condition, but parietal and temporal lobes did higher activities in normal children than the patients only to the target stimuli. In conclusion, the patients with ADHD showed much greater responses to the stimuli which should be ignored, but failed to activated the necessary processes to the target stimuli. Also, we found that the frequency-dimension analysis and wavelet analysis were useful for the signal processing such as event related potentials.

• Geophysics and Geophysical Exploration
• /
• v.8 no.2
• /
• pp.145-155
• /
• 2005

A two-dimensional (2-D) interpretation of MT data has been performed for the purpose of fracture detection for geothermal development. Remote stations have been operated in Kyushu, Japan (480 km apart) as well as in Korea (60 km and 165 km apart in 2002 and 2003 data set, respectively). Apparent resistivity and phase curves calculated by remote processing with the Japan remote data showed enough quality for 2-D inversion for the whole frequency range. Remote reference processing with Korea remote reference data also showed quite good continuity in apparent resistivity and phase curves except some noisy frequency bands; around the power frequency, 60 Hz, and around the dead band $10^{-1}Hz\;Hz\;\~1\;Hz$, where the natural EM signal is known to be very weak. Even though the subsurface showed severe three-dimensional (3-D) characteristics in the survey area so that 2-D inversion by itself could not give enough information for deep geological structures, the 2-D inversion for the 5 survey lines showed several common features. The conductive semi-consolidate mudstone layer is dipping from north to south (about 500 m depth on the south and 200 m on the north most part of the survey area). The boundary between the low (L-2) and high (H-2) resistivity anomalies can be thought as a major fault with strike $N15^{\circ}E$, passing through the sites 206, 112 and 414. The shallow (< 1 km) conductive anomalies (L-4) seem to be fracture zones having strike E-W (at site 105) and $N60^{\circ}W$ (at site 434). And there exists a conductive layer in the western and west-southern part of the survey area in the depth below $2\~3\;km$, for which further investigation is to be needed.

• Economic and Environmental Geology
• /
• v.48 no.1
• /
• pp.51-63
• /
• 2015

I produced a secular variation model of geomagnetic field by using the magnetic component data from four geomagnetic observatories located in Northeast Asia during the years between 1997 and 2011. The Earth's magnetic field varies with time and location due to the dynamics of fluid outer core and the magnetic observatories on the surface measure in time series. To adequately represent the magnetic field or secular variations of the Earth, a spatio-temporal model is required. In making a global model, satellite observations as well as limited observatory data are necessary to cover the regions and time intervals. However, you need a considerable work and time to process a huge amount of the dataset with complicated signal separation procedures. When you update the model, the same amount of chores is demanded. Besides, the global model might be affected by the measurement errors of each observatory that are biased and the processing errors in satellite data so that the accuracy of the model would be degraded. In this study, as considered these problems, I introduced a localized method in modeling secular variation of the Earth's magnetic field over Northeast Asia region. Secular variation data from three Japanese observatories and one Chinese observatory that are all in the INTERMAGNET are implemented in the model valid between 1997 to 2011 with the interval of 6 months. With the resulting model, I compared with the global model called CHAOS-4, which includes the main, secular variation and secular acceleration models between 1997 to 2013 by using the three satellites' databases and INTERMAGNET observatory data. Also, the geomagnetic 'jerk' which is known as a sudden change in the time derivatives of the main field of the Earth, was discussed from the localized secular acceleration coefficients derived from spline models.

• The KIPS Transactions:PartA
• /
• v.12A no.5 s.95
• /
• pp.413-420
• /
• 2005

The Newton-Raphson iterative algorithm for finding a floating point reciprocal square mot calculates it by performing a fixed number of multiplications. In this paper, a variable latency Newton-Raphson's reciprocal square root algorithm is proposed that performs multiplications a variable number of times until the error becomes smaller than a given value. To find the rediprocal square root of a floating point number F, the algorithm repeats the following operations: '$X_{i+1}=\frac{{X_i}(3-e_r-{FX_i}^2)}{2}$, $i\in{0,1,2,{\ldots}n-1}$' with the initial value is '$X_0=\frac{1}{\sqrt{F}}{\pm}e_0$'. The bits to the right of p fractional bits in intermediate multiplication results are truncated and this truncation error is less than '$e_r=2^{-p}$'. The value of p is 28 for the single precision floating point, and 58 for the double precision floating point. Let '$X_i=\frac{1}{\sqrt{F}}{\pm}e_i$, there is '$X_{i+1}=\frac{1}{\sqrt{F}}-e_{i+1}$, where '$e_{i+1}{<}\frac{3{\sqrt{F}}{{e_i}^2}}{2}{\mp}\frac{{Fe_i}^3}{2}+2e_r$'. If '$|\frac{\sqrt{3-e_r-{FX_i}^2}}{2}-1|<2^{\frac{\sqrt{-p}{2}}}$' is true, '$e_{i+1}<8e_r$' is less than the smallest number which is representable by floating point number. So, $X_{i+1}$ is approximate to '$\frac{1}{\sqrt{F}}$. Since the number of multiplications performed by the proposed algorithm is dependent on the input values, the average number of multiplications Per an operation is derived from many reciprocal square root tables ($X_0=\frac{1}{\sqrt{F}}{\pm}e_0$) with varying sizes. The superiority of this algorithm is proved by comparing this average number with the fixed number of multiplications of the conventional algorithm. Since the proposed algorithm only performs the multiplications until the error gets smaller than a given value, it can be used to improve the performance of a reciprocal square root unit. Also, it can be used to construct optimized approximate reciprocal square root tables. The results of this paper can be applied to many areas that utilize floating point numbers, such as digital signal processing, computer graphics, multimedia, scientific computing, etc.

• The KIPS Transactions:PartA
• /
• v.12A no.2 s.92
• /
• pp.95-102
• /
• 2005

The Newton-Raphson iterative algorithm for finding a floating point reciprocal which is widely used for a floating point division, calculates the reciprocal by performing a fixed number of multiplications. In this paper, a variable latency Newton-Raphson's reciprocal algorithm is proposed that performs multiplications a variable number of times until the error becomes smaller than a given value. To find the reciprocal of a floating point number F, the algorithm repeats the following operations: '$'X_{i+1}=X=X_i*(2-e_r-F*X_i),\;i\in\{0,\;1,\;2,...n-1\}'$ with the initial value $'X_0=\frac{1}{F}{\pm}e_0'$. The bits to the right of p fractional bits in intermediate multiplication results are truncated, and this truncation error is less than $'e_r=2^{-p}'$. The value of p is 27 for the single precision floating point, and 57 for the double precision floating point. Let $'X_i=\frac{1}{F}+e_i{'}$, these is $'X_{i+1}=\frac{1}{F}-e_{i+1},\;where\;{'}e_{i+1}, is less than the smallest number which is representable by floating point number. So, $X_{i+1}$ is approximate to $'\frac{1}{F}{'}$. Since the number of multiplications performed by the proposed algorithm is dependent on the input values, the average number of multiplications per an operation is derived from many reciprocal tables $(X_0=\frac{1}{F}{\pm}e_0)$ with varying sizes. The superiority of this algorithm is proved by comparing this average number with the fixed number of multiplications of the conventional algorithm. Since the proposed algorithm only performs the multiplications until the error gets smaller than a given value, it can be used to improve the performance of a reciprocal unit. Also, it can be used to construct optimized approximate reciprocal tables. The results of this paper can be applied to many areas that utilize floating point numbers, such as digital signal processing, computer graphics, multimedia scientific computing, etc.