• Title/Summary/Keyword: Music Database

Search Result 76, Processing Time 0.025 seconds

The Graphical User Interface Design for Optimal MRI Operation (MRI 시스템의 최적화 운용을 위한 GUI 디자인)

  • Moon, J.Y.;Kang, S.H.;Kim, K.S.;Kim, J.S.;Im, H.J.
    • Proceedings of the KOSOMBE Conference
    • /
    • v.1997 no.05
    • /
    • pp.235-238
    • /
    • 1997
  • The Graphical User Interface (GUI) software is developed for 0.3 Tesla Permanent Magnet Resonance Imaging (MRI) system and the state of art of designing GUI system is discussed in this paper. The Object-Oriented concepts are applied for designing GUI software utilizing Interbase ODBC Database layer. Also, Multimedia concepts such as voice, sound and music are integrated in GUI system to enhance the efficiency of MRI operation.

  • PDF

The embodiment of tree construction program for the composition by cord basis (코드기반 작곡을 위한 트리구조 프로그램 구현)

  • 조재영;김윤호;강희조;이명길
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2003.10a
    • /
    • pp.272-276
    • /
    • 2003
  • The appearance of the computer composition system(MIDI) expects that non-musicians can make musics easily, but, in fact, non-musicians still compose hard. This thesis shows that a computer makes lord progress through a database, which in-putted all practicable cord progress. In other words, non-musicians just makes some melodies over the settled cord progress, so they can make a music more easely.

  • PDF

A Study on the Implementation of a Message Transfer Protocol with Document Classification (문서의 등급을 고려한 메시지전송 프로토콜 구현에 관한 연구)

  • 신승중;김현수
    • The Journal of Information Technology and Database
    • /
    • v.7 no.1
    • /
    • pp.67-82
    • /
    • 2000
  • In this paper we have developed a message transfer protocol, CMP, which improves MSP's message processing capability. The proposed method has taken into account document classification to improve the efficiency of message processing. The difference between the conventional MSP and CMP has been addressed. The CMP's performance has been shown by various experiments including number, alphabet, Korean letter, Chinese letter, music sound and compression file transmission. And security capability of both protocols has been compared based on the specification of FIPS 140-2. The CMP's overall performance is shown to be superior to that of MSP on the processing speed in the performance perspective and on the function of cryptographic module interface and cryptographic key management in the security perspective respectively.

  • PDF

Tree Structure Utilization for the Harmonious composition by using cord basis (코드기반의 조화로운 작곡을 위한 트리구조 응용)

  • 조재영;김윤호;강희조;이명길
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.7 no.7
    • /
    • pp.1545-1550
    • /
    • 2003
  • In this Paper, systematic quad-tree array method for easy composition is proposed, which is based on music cord. The appearance of the computer composition system, so called MIDI, expects that non-musicians can make musics easily, but, in fact. non-musicians still compose hard. This approach shows that a computer makes cord progress through a database, which in-putted all practicable cord progress. Experimental results showed that this method is superior to conventional method such as. composition time as well as that of method.

Greeting, Function, and Music: How Users Chat with Voice Assistants

  • Wang, Ji;Zhang, Han;Zhang, Cen;Xiao, Junjun;Lee, Seung Hee
    • Science of Emotion and Sensibility
    • /
    • v.23 no.2
    • /
    • pp.61-74
    • /
    • 2020
  • Voice user interface has become a commercially viable and extensive interaction mechanism with the development of voice assistants. Despite the popularity of voice assistants, the academic community does not utterly understand about what, when, and how users chat with them. Chatting with a voice assistant is crucial as it defines how a user will seek the help of the assistant in the future. This study aims to cover the essence and construct of conversational AI, to develop a classification method to deal with user utterances, and, most importantly, to understand about what, when, and how Chinese users chat with voice assistants. We collected user utterances from the real conventional database of a commercial voice assistant, NetEase Sing in China. We also identified different utterance categories on the basis of previous studies and real usage conditions and annotated the utterances with 17 labels. Furthermore, we found that the three top reasons for the usage of voice assistants in China are the following: (1) greeting, (2) function, and (3) music. Chinese users like to interact with voice assistants at night from 7 PM to 10 PM, and they are polite toward the assistants. The whole percentage of negative feedback utterances is less than 6%, which is considerably low. These findings appear to be useful in voice interaction designs for intelligent hardware.

Additive Data Insertion into MP3 Bitstream Using linbits Characteristics (Linbits 특성을 이용하여 MP3 비트스트림에 부가적인 정보를 삽입하는 방법에 관한 연구)

  • 김도형;양승진;정재호
    • The Journal of the Acoustical Society of Korea
    • /
    • v.22 no.7
    • /
    • pp.612-621
    • /
    • 2003
  • As the use of MP3 audio compression increased, the demand for the insertion of additive data about copyright or information on music contents has been groved and the related research has been progressed actively. When an additive data is inserted into MP3 bitstream, it should not to happen any distortion of music quality or the change of file size, due to the modification of MP3 bitstream structure. In our study, to make these conditions satisfied, we inserted some additive data to bitstream by modifying some bits of linbits among the quantized integer coefficients having big values. At this time, we consider the characteristics of linbits and their distributions. As a result of subjective sound quality test through MOS test, we confirmed that the quality of MOS 4.6 can be achieved at the data insertion rate of 60 bytes/sec. Using the proposed method, it is possible to effectively insert an additive data such as copyright information or information about media itself, so that various applications like audio database management can be realized.

Feature-Based Image Retrieval using SOM-Based R*-Tree

  • Shin, Min-Hwa;Kwon, Chang-Hee;Bae, Sang-Hyun
    • Proceedings of the KAIS Fall Conference
    • /
    • 2003.11a
    • /
    • pp.223-230
    • /
    • 2003
  • Feature-based similarity retrieval has become an important research issue in multimedia database systems. The features of multimedia data are useful for discriminating between multimedia objects (e 'g', documents, images, video, music score, etc.). For example, images are represented by their color histograms, texture vectors, and shape descriptors, and are usually high-dimensional data. The performance of conventional multidimensional data structures(e'g', R- Tree family, K-D-B tree, grid file, TV-tree) tends to deteriorate as the number of dimensions of feature vectors increases. The R*-tree is the most successful variant of the R-tree. In this paper, we propose a SOM-based R*-tree as a new indexing method for high-dimensional feature vectors.The SOM-based R*-tree combines SOM and R*-tree to achieve search performance more scalable to high dimensionalities. Self-Organizing Maps (SOMs) provide mapping from high-dimensional feature vectors onto a two dimensional space. The mapping preserves the topology of the feature vectors. The map is called a topological of the feature map, and preserves the mutual relationship (similarity) in the feature spaces of input data, clustering mutually similar feature vectors in neighboring nodes. Each node of the topological feature map holds a codebook vector. A best-matching-image-list. (BMIL) holds similar images that are closest to each codebook vector. In a topological feature map, there are empty nodes in which no image is classified. When we build an R*-tree, we use codebook vectors of topological feature map which eliminates the empty nodes that cause unnecessary disk access and degrade retrieval performance. We experimentally compare the retrieval time cost of a SOM-based R*-tree with that of an SOM and an R*-tree using color feature vectors extracted from 40, 000 images. The result show that the SOM-based R*-tree outperforms both the SOM and R*-tree due to the reduction of the number of nodes required to build R*-tree and retrieval time cost.

  • PDF

Mask Estimation Based on Band-Independent Bayesian Classifler for Missing-Feature Reconstruction (Missing-Feature 복구를 위한 대역 독립 방식의 베이시안 분류기 기반 마스크 예측 기법)

  • Kim Wooil;Stern Richard M.;Ko Hanseok
    • The Journal of the Acoustical Society of Korea
    • /
    • v.25 no.2
    • /
    • pp.78-87
    • /
    • 2006
  • In this paper. we propose an effective mask estimation scheme for missing-feature reconstruction in order to achieve robust speech recognition under unknown noise environments. In the previous work. colored noise is used for training the mask classifer, which is generated from the entire frequency Partitioned signals. However it gives a limited performance under the restricted number of training database. To reflect the spectral events of more various background noise and improve the performance simultaneously. a new Bayesian classifier for mask estimation is proposed, which works independent of other frequency bands. In the proposed method, we employ the colored noise which is obtained by combining colored noises generated from each frequency band in order to reflect more various noise environments and mitigate the 'sparse' database problem. Combined with the cluster-based missing-feature reconstruction. the performance of the proposed method is evaluated on a task of noisy speech recognition. The results show that the proposed method has improved performance compared to the Previous method under white noise. car noise and background music conditions.

A Study on the e-Business Marketing Strategy of Digital Age (디지털 시대의 효율적인 e비지니스 마케팅 전략에 관한 연구)

  • 조원길
    • The Journal of Information Technology
    • /
    • v.3 no.4
    • /
    • pp.89-105
    • /
    • 2000
  • Electronic commerce includes the tasks that support the buying and selling of goods and services, and interactions among those tasks. Electronic commerce enables companies to close stores, reduce inventory requirements, and distribute products over the internet. Electronic commerce can simplify communication and change relationships The expanding global e-marketplace has triggered an evolution with powerful implications. The introduction of interactive media and the online environment has made real-time, customized one-to-one advertising, marketing and commerce possible. I-marketing is the most rapidly growing channel being explored today. Users of this expanding medium include a range of service providers, publishers, marketers of music, s/w, other products that cross an increasing number of industry lines. Thus, the opportunities for e-business marketing strategy, and new businesses based on interactivity and sophisticated database technology are vast. This study explores the e-business marketing strategy of digital age. Strategic e-marketing can harness the power of today's technology to propel a company of any size farther into the worldwide market than ay any other time in history, increasing potential profits and productivity.

  • PDF

The Study of Bio Emotion Cognition follow Stress Index Number by Multiplex SVM Algorithm (다중 SVM 알고리즘을 이용한 스트레스 지수에 따른 생체 감성 인식에 관한 연구)

  • Kim, Tae-Yeun;Seo, Dae-Woong;Bae, Sang-Hyun
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.5 no.1
    • /
    • pp.45-51
    • /
    • 2012
  • In this paper, it's a system which recognize the user's emotions after obtaining the biological informations(pulse sensor, blood pressure sensor, blood sugar sensor etc.) about user's bio informations through wireless sensors in accordance of previously collected informations about user's stress index and classification the Colors & Music. This system collects the inputs, saves in the database and finally, classifies emotions according to the stress quotient by using multiple SVM(Support Vector Machine) algorithm. The experiment of multiple SVM algorithm was conducted by using 2,000 data sets. The experiment has approximately 87.7% accuracy.