• Journal of applied mathematics & informatics
• /
• v.32 no.1_2
• /
• pp.255-266
• /
• 2014

For a connected graph G = (V,E) of order at least two, a set S of vertices of G is a monophonic set of G if each vertex v of G lies on an x - y monophonic path for some elements x and y in S. The minimum cardinality of a monophonic set of G is the monophonic number of G, denoted by m(G). Certain general properties satisfied by the monophonic sets are studied. Graphs G of order p with m(G) = 2 or p or p - 1 are characterized. For every pair a, b of positive integers with $2{\leq}a{\leq}b$, there is a connected graph G with m(G) = a and g(G) = b, where g(G) is the geodetic number of G. Also we study how the monophonic number of a graph is affected when pendant edges are added to the graph.

• Journal of applied mathematics & informatics
• /
• v.42 no.1
• /
• pp.77-83
• /
• 2024

Chung defined a pebbling move on a graph G as the removal of two pebbles from one vertex and the addition of one pebble to an adjacent vertex. The monophonic pebbling number guarantees that a pebble can be shifted in the chordless and the longest path possible if there are any hurdles in the process of the supply chain. For a connected graph G a monophonic path between any two vertices x and y contains no chords. The monophonic pebbling number, µ(G), is the least positive integer n such that for any distribution of µ(G) pebbles it is possible to move on G allowing one pebble to be carried to any specified but arbitrary vertex using monophonic a path by a sequence of pebbling operations. The aim of this study is to find out the monophonic pebbling numbers of the sun graphs, (C_n × P₂) + K₁ graph, the spherical graph, the anti-prism graphs, and an n-crossed prism graph.

• The Journal of the Korea Contents Association
• /
• v.9 no.10
• /
• pp.1-12
• /
• 2009

There exist some regular multiple relations in the intervals of notes when they are combined within one measure. This paper presents a method to find the exact measure positions in monophonic song based on those relations. In the proposed method the individual intervals are segmented at first and the rules that state the multiple relations are used to find the measure position. The measures can be applied as the foundational information for extracting beat and tempo of a song which can be used as background knowledge of automatic music transcription system. The proposed method exactly detected the measure positions of 11 songs out of 12 songs except one song which consist of monophonic voice song of the men and women. Also one can extract the information of beat and tempo of a song using the information about extracted measure positions with music theory.

• Proceedings of the IEEK Conference
• /
• 1999.06a
• /
• pp.712-715
• /
• 1999

In this paper we propose high quality audio coding algorithm using psychoacoustic modelling and the adaptive wavelet Packet decomposition. The bit allocation scheme exploits the remnants of temporal correlations that exist in the wavelet packet coefficients by SPIHT. The proposed algorithm achieve almost transparent coding of monophonic compact disk(CD) quality signals at about 44 kbps.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.23 no.4
• /
• pp.371-377
• /
• 2013

This paper proposes three methods for improving the accuracy of auto-music transcription considering with time-varying tempo from monophonic sound. The first one that uses TV(Total Variation) filter for smoothing the pitch data reduces the fragmentation in the pitch segmentation result. Also, the measure finding method that combines three different ways based on pitch and energy of sound data, respectively as well as based on rules produces more stable result. In addition the temporal result of note-length encoding is corrected in optimal way that the resulted encoding minimizes the sum of quantization error in a measure while the sum of note-lengths is equal to the number of beats. In the experiment with 16 children songs, we obtained the improved result in which measure finding was complete, the accuracy of encoding for note-length and pitch was about 91.3 and 86.7, respectively.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.2
• /
• pp.723-736
• /
• 2014

This paper proposes a matching engine for a query-by-singing/humming (QbSH) system with polyphonic music files like MP3 files. The pitch sequences extracted from polyphonic recordings may be distorted. So we use chroma-scale representation, pre-processing, compensation, and asymmetric dynamic time warping to reduce the influence of the distortions. From the experiment with 28 hour music DB, the performance of our QbSH system based on polyphonic database is very promising in comparison with the published QbSH system based on monophonic database. It shows 0.725 in MRR(Mean Reciprocal Rank). Our matching engine can be used for the QbSH system based on MIDI DB also and that performance was verified by MIREX 2011.

• Proceedings of the Acoustical Society of Korea Conference
• /
• 1998.06c
• /
• pp.245-248
• /
• 1998

In this paper, a new variable wavelet packet decomposition audio coder, based on the time varying characteristic of the audio signals, is proposed and presents a technique to incorporate psychoacoustic models into an adaptive wave let packet scheme. The proposed filterbank improves the defect of the polyphase filterbank that could not properly represent the critical band and the defect of QMF-tree filter that need high complexity to implement. The filterbank consists of varying number of subband from 4 to 26 bands and use Daubechies 6-order wave let. The codec yields excellent quality at total bit rates of about 128kbps for monophonic CD-quality signals with an sampling frequency of 44.1kHz and reduces complexity by 19% for various bit-rates and sources with encoding and decoding process.

• ETRI Journal
• /
• v.39 no.6
• /
• pp.832-840
• /
• 2017

Recently, deep recurrent neural networks have achieved great success in various machine learning tasks, and have also been applied for sound event detection. The detection of temporally overlapping sound events in realistic environments is much more challenging than in monophonic detection problems. In this paper, we present an approach to improve the accuracy of polyphonic sound event detection in multichannel audio based on gated recurrent neural networks in combination with auditory spectral features. In the proposed method, human hearing perception-based spatial and spectral-domain noise-reduced harmonic features are extracted from multichannel audio and used as high-resolution spectral inputs to train gated recurrent neural networks. This provides a fast and stable convergence rate compared to long short-term memory recurrent neural networks. Our evaluation reveals that the proposed method outperforms the conventional approaches.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.59 no.2
• /
• pp.445-451
• /
• 2010

This paper presents a threshold adaptation based voice query transcription scheme for music information retrieval. The proposed scheme analyzes monophonic voice signal and generates its transcription for diverse music retrieval applications. For accurate transcription, we propose several advanced features including (i) Energetic Feature eXtractor (EFX) for onset, peak, and transient area detection; (ii) Modified Windowed Average Energy (MWAE) for defining multiple small but coherent windows with local threshold values as offset detector; and finally (iii) Circular Average Magnitude Difference Function (CAMDF) for accurate acquisition of fundamental frequency (F0) of each frame. In order to evaluate the performance of our proposed scheme, we implemented a prototype music transcription system called AMT2 (Automatic Music Transcriber version 2) and carried out various experiments. In the experiment, we used QBSH corpus [1], adapted in MIREX 2006 contest data set. Experimental result shows that our proposed scheme can improve the transcription performance.

• 한국HCI학회:학술대회논문집
• /
• 2008.02a
• /
• pp.618-622
• /
• 2008

In this paper, we suggest new music composition algorithm based on fractal theory. User can define and control fractal shape by setting an initial state and production rules in L-System. We generate an asymmetric fractal tree based on L-System and probability. Then a music is generated by the fractal tree image using sonification techniques. We introduce two composition algorithm using the fractal tree. First, monophonic music can be generated by mapping x and y axis to velocity and pitch, respectively Second, harmonic music also can be generated by mapping x and y axis to time and pitch, respectively Using our composition algorithm, user can easily generate a music which has repeated pattern created by recursive feature of fractal, and a music which has structure similar to fractal tree image.