• The Journal of the Acoustical Society of Korea
• /
• v.24 no.1
• /
• pp.29-37
• /
• 2005

This paper proposes an automatic genre classification system for Korean traditional music. The Proposed system accepts and classifies queried input music as one of the six musical genres such as Royal Shrine Music, Classcal Chamber Music, Folk Song, Folk Music, Buddhist Music, Shamanist Music based on music contents. In general, content-based music genre classification consists of two stages - music feature vector extraction and Pattern classification. For feature extraction. the system extracts 58 dimensional feature vectors including spectral centroid, spectral rolloff and spectral flux based on STFT and also the coefficient domain features such as LPC, MFCC, and then these features are further optimized using SFS method. For Pattern or genre classification, k-NN, Gaussian, GMM and SVM algorithms are considered. In addition, the proposed system adopts MFC method to settle down the uncertainty problem of the system performance due to the different query Patterns (or portions). From the experimental results. we verify the successful genre classification performance over $97{\%}$ for both the k-NN and SVM classifier, however SVM classifier provides almost three times faster classification performance than the k-NN.

• The Journal of the Acoustical Society of Korea
• /
• v.20 no.6
• /
• pp.34-39
• /
• 2001

An adaptive multi-rate (AMR) speech coder was adopted as a standard of W-CDMA by 3GPP and ETSI. The AMR coder is based on the CELP algorithm operating at rates ranging from 12.2 kbps down to 4.75 kbps, and it is a source controlled codec according to the channel error conditions and the traffic loading. In this paper, we implement the DSP S/W of the AMR coder using OakDSPCore. The implementation is based on the CSD17C00A chip developed by C&S Technology, and it is tested using test vectors, for the AMR speech codec, provided by ETSI for the bit exact implementation. The DSP B/W requires 20.6 MIPS for the encoder and 2.7 MIPS for the decoder. Memories required by the Am coder were 21.97 kwords, 6.64 kwords and 15.1 kwords for code, data sections and data ROM, respectively. Also, actual sound input/output test using microphone and speaker demonstrates its proper real-time operation without distortions or delays.

• The Journal of the Acoustical Society of Korea
• /
• v.19 no.3
• /
• pp.35-44
• /
• 2000

In this paper, we propose a new trajectory model for characterizing segmental features and their interaction based upon a general framework of hidden Markov models. Each segment, a sequence of vectors, is represented by a trajectory of observed sequences. This trajectory is obtained by applying a new design matrix which includes transitional information on contiguous frames, and is characterized as a polynomial regression function. To apply the trajectory to the segmental HMM, the frame features are replaced with the trajectory of a given segment. We also propose the likelihood of a given segment and the estimation of trajectory parameters. The obervation probability of a given segment is represented as the relation between the segment likelihood and the estimation error of the trajectories. The estimation error of a trajectory is considered as the weight of the likelihood of a given segment in a state. This weight represents the probability of how well the corresponding trajectory characterize the segment. The proposed model can be regarded as a generalization of a conventional HMM and a parametric trajectory model. The experimental results are reported on the TIMIT corpus and performance is show to improve significantly over that of the conventional HMM.

• The KIPS Transactions:PartB
• /
• v.10B no.2
• /
• pp.143-150
• /
• 2003

Error concealment plays an important role in combating transmission errors. Methods of error concealment which produce better quality are generally of higher complexity, thus making some of the more sophisticated algorithms is not suitable for real-time applications. In this paper, we develop temporal and spatial error resilient video encoding and data hiding approach to facilitate the error concealment at the decoder. Block interleaving scheme is introduced to isolate erroneous blocks caused by packet losses for spatial area of error resilience. For temporal area of error resilience, data hiding is applied to the transmission of parity bits to protect motion vectors. To do error concealment quickly, a set of edge features extracted from a block is embedded imperceptibly using data hiding into the host media and transmitted to decoder. If some part of the media data is damaged during transmission, the embedded features are used for concealment of lost data at decoder. This method decreases a complexity of error concealment by reducing the estimation process of lost data from neighbor blocks. The proposed data hiding method of parity bits and block features is not influence much to the complexity of standard encoder. Experimental results show that proposed method conceals properly and effectively burst errors occurred on transmission channel like Internet.

• The KIPS Transactions:PartD
• /
• v.10D no.1
• /
• pp.1-12
• /
• 2003

Recently, there have been many indexing schemes for multimedia data such as image, video data. But recent database applications, for example data mining and multimedia database, are required to support multi-user environment. In order for indexing schemes to be useful in multi-user environment, a concurrency control algorithm is required to handle it. So we propose a concurrency control algorithm that can be applied to CBF (cell-based filtering method), which uses the signature of the cell for alleviating the dimensional curse problem. In addition, we extend the SHORE storage system of Wisconsin university in order to handle high-dimensional data. This extended SHORE storage system provides conventional storage manager functions, guarantees the integrity of high-dimensional data and is flexible to the large scale of feature vectors for preventing the usage of large main memory. Finally, we implement the web-based image retrieval system by using the extended SHORE storage system. The key feature of this system is platform-independent access to the high-dimensional data as well as functionality of efficient content-based queries. Lastly. We evaluate an average response time of point query, range query and k-nearest query in terms of the number of threads.

• The KIPS Transactions:PartB
• /
• v.10B no.6
• /
• pp.673-680
• /
• 2003

In this paper, we study the enhancement of VQ (Vector Quantization) design for text independent speaker recognition. In a concrete way, we present a non-iterative method which makes a vector quantization codebook and this method performs non-iterative learning so that the computational complexity is epochally reduced The proposed Classified Space VQ (CSVQ) design method for text Independent speaker recognition is generalized from Semi-noniterative VQ design method for text dependent speaker recognition. CSVQ contrasts with the existing desiEn method which uses the iterative learninE algorithm for every traininE speaker. The characteristics of a CSVQ design is as follows. First, the proposed method performs the non-iterative learning by using a Classified Space Codebook. Second, a quantization region of each speaker is equivalent for the quantization region of a Classified Space Codebook. And the quantization point of each speaker is the optimal point for the statistical distribution of each speaker in a quantization region of a Classified Space Codebook. Third, Classified Space Codebook (CSC) is constructed through Sample Vector Formation Method (CSVQ1, 2) and Hyper-Lattice Formation Method (CSVQ 3). In the numerical experiment, we use the 12th met-cepstrum feature vectors of 10 speakers and compare it with the existing method, changing the codebook size from 16 to 128 for each Classified Space Codebook. The recognition rate of the proposed method is 100% for CSVQ1, 2. It is equal to the recognition rate of the existing method. Therefore the proposed CSVQ design method is, reducing computational complexity and maintaining the recognition rate, new alternative proposal and CSVQ with CSC can be applied to a general purpose recognition.

• Journal of KIISE:Computer Systems and Theory
• /
• v.37 no.3
• /
• pp.184-193
• /
• 2010

This paper proposes a biological iridescence BRDF(Bidirectional Reflectance Distribution Function) compression and rendering method. In the graphics technology, iridescence sometimes is named structure colors. The main features of these symptoms are shown transform of color and brightness by varying viewpoint. Graphics technology to render this is the BRDF technology. The BRDF methods enable realistic representation of varying view direction, but it requires a lot of computing power because of large data. In this paper, we obtain reflection map from iridescence BRDF, analyze color of reflection map and propose representation method by several colorfully concentric circle. The one concentric circle represents beam width of reflection ray by one normal vector. In this paper, we synthesize rough concentric by using several virtually optical normal vectors. And we obtain spectrum information from concentric circles passing through the center point. The proposed method enables IBR(image based rendering) technique which results is realistic illuminance and spectrum distribution by one texture from reduced BRDF data within spectrum.

• Journal of Microbiology and Biotechnology
• /
• v.23 no.6
• /
• pp.818-825
• /
• 2013

We isolated and functionally characterized the ${\alpha}$- and ${\beta}$-subunits (ApCpnA and ApCpnB) of a chaperonin from Aeropyrum pernix K1. The constructed vectors pET3d-ApCpnA and pET21a-ApCpnB were transformed into E. coli Rosetta (DE3), BL21 (DE3), or CodonPlus (DE3) cells. The expression of ApCpnA (60.7 kDa) and ApCpnB (61.2 kDa) was confirmed by SDS-PAGE analysis. Recombinant ApCpnA and ApCpnB were purified by heat-shock treatment and anion-exchange chromatography. ApCpnA and ApCpnB were able to hydrolyze not only ATP, but also CTP, GTP, and UTP, albeit with different efficacies. Purified ApCpnA and ApCpnB showed the highest ATPase, CTPase, UTPase, and GTPase activities at $80^{\circ}C$. Furthermore, the addition of ApCpnA and ApCpnB effectively protected citrate synthase (CS) and alcohol dehydrogenase (ADH) from thermal aggregation and inactivation at $43^{\circ}C$ and $50^{\circ}C$, respectively. In particular, the addition of ATP or CTP to ApCpnA and ApCpnB resulted in the most effective prevention of thermal aggregation and inactivation of CS and ADH. The ATPase activity of the two chaperonin subunits was dependent on the salt concentration. Among the ions we examined, potassium ions were the most effective at enhancing the ATP hydrolysis activity of ApCpnA and ApCpnB.

• Journal of Microbiology and Biotechnology
• /
• v.30 no.5
• /
• pp.785-792
• /
• 2020

ʟ-Theanine, found in green tea leaves has been shown to positively affect immunity and relaxation in humans. There have been many attempts to produce ʟ-theanine through enzymatic synthesis to overcome the limitations of traditional methods. Among the many genes coding for enzymes in the ʟ-theanine biosynthesis, glutamylmethylamide synthetase (GMAS) exhibits the greatest possibility of producing large amounts of production. Thus, GMAS from Methylovorus mays No. 9 was overexpressed in several strains including vectors with different copy numbers. BW25113(DE3) cells containing the pET24ma::gmas was selected for strains. The optimal temperature, pH, and metal ion concentration were 50℃, 7, and 5 mM MnCl₂, respectively. Additionally, ATP was found to be an important factor for producing high concentration of ʟ-theanine so several strains were tested during the reaction for ATP regeneration. Baker's yeast was found to decrease the demand for ATP most effectively. Addition of potassium phosphate source was demonstrated by producing 4-fold higher ʟ-theanine. To enhance the conversion yield, GMAS was additionally overexpressed in the system. A maximum of 198 mM ʟ-theanine was produced with 16.5 mmol/l/h productivity. The whole-cell reaction involving GMAS has greatest potential for scale-up production of ʟ-theanine.

• Reproductive and Developmental Biology
• /
• v.32 no.3
• /
• pp.205-209
• /
• 2008

This study was carried out to develop knock-in vector for EGFP (enhanced green fluorescent protein) expression in porcine $\beta$-casein locus. For construction of knock-in vector using porcine $\beta$-casein gene, we cloned the $\beta$-casein genome DNA from porcine fetal fibroblast cells, EGFP and SV40 polyA signal using PCR. The knock-in vectors consisted of a 5-kb fragment as the 5' recombination arm and a 2.7-kb fragment as the 3' recombination arm. We used the neomycin resistance gene ($neo^{r}$) as a positive selectable marker and the diphtheria toxin A (DT-A) gene as a negative selectable marker. To demonstrate EGFP expression from knock-in vector, we are transfected knock-in vector that has EGFP gene in murine mammary epithelial cell line HC11 cells with pSV2 neo plasmid. The EGFP expression was detected in HC11 cells transfected knock-in vector. This result demonstrates that this knock-in vector may be used for the development of knock-in transgenic pig.