• Journal of Digital Convergence
• /
• v.13 no.3
• /
• pp.209-214
• /
• 2015

Social network services such as Facebook and Flickr is a very useful service that was the foundation of the Internet. If a state in which the Internet is connected, music, photos, and us to be able to share it freely post such as documents. However, even when the digital information posted in such social network services the user has died, and have been published, it is also used for people who do not intend the bad purposes some problems can occur. Facebook is trying to apply the findings Jed R. Brubaker of UC Irvine University in order to solve this problem. However, in Korea, such efforts, not much appears for now. Therefore, we proposed a method that can be managed by delegated Facebook, safely a Delegator digital information posted on social networking services such as Flickr. Our proposed system, as compared with Jed R. Brubaker and Jeong-Kyung Moon is executed previous studies, we studied a method proposed by the appropriate compensates points shortage is passed through the future research. And I consider to have been proposed a method to safely use posted digital assets in a social network service.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.17 no.7
• /
• pp.945-951
• /
• 2007

Noise cancellation is essential for the devices which use speech as an interface. In real environments, speech quality and recognition rates are degraded by the auditive noises coming near the microphone. In this paper, we propose a noise cancellation algorithm using stereo microphones basically. The advantage of the use of multiple microphones is that the direction information of the target source could be applied. The proposed noise canceller is based on the Wiener filter. To estimate the filter, noise and target speech frequency responses should be known and they are estimated by the spectral classification in the frequency domain. The performance of the proposed algorithm is compared with that of the well-known Frost algorithm and the generalized sidelobe canceller (GSC) with an adaptation mode controller (AMC). As performance measures, the perceptual evaluation of speech quality (PESQ), which is the most widely used among various objective speech quality methods, and speech recognition rates are adopted.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.2
• /
• pp.77-90
• /
• 2014

In the past composers used to make music with classical instruments such as piano, violin, guitar, flute, drums, and other well-known tools. With the advent of digital technology many software programs were developed which allow musicians to compose tunes using personal computers. Many file formats were introduced such as NIFF, SMDL and MIDI but none besides MIDI has been successful. Recently MusicXML has emerged as a de-facto standard for the computer representation of music. This paper presents a brief description of the structure of the MusicXML format and describes the development of a music score editor based on MusicXML. We implemented a MusicXML-based score editing software using C# language and a feasibility test showed the efficiency of our proposed method.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.1 s.45
• /
• pp.51-56
• /
• 2007

Feature functions were used for the classification of music. The spectral roll-off, variance, average peak level, and class were chosen to make up a feature function vector. Among these, it is the spectral roll-off function that has a low-frequency to high-frequency ratio. To find the optimal roll-off point, the roll-off points from 0.05 to 0.95 were swept. The classification success rate was monitored as the roll-off point was being changed. The data that were used for the experiments were taken from the sounds made by a modern violin and a baroque one. Their shapes and sounds are similar, but they differ slightly in sound texture. As such, the data obtained from the sounds of these two kinds of violin can be useful in finding an adequate roll-off point. The optimal roll-off point, as determined through the experiment, was 0.85. At this point, the classification success rate was 85%, which was the highest.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.12
• /
• pp.2586-2594
• /
• 2009

A digital watermarking technique used as a protection and certifying mechanism of copyrighted creations including music, still images, and videos in terms of finding any loss in data, reproduction and pursuit. This study suggests using a selected geometric invariant point through the whole processing procedure of an image and inserting and extracting based on the invariant point so that it will be robust in a geometric transformation attack. The introduced algorithm here is based on a watershed splitting method in order to make medical images strong against RST(Rotation Scale, Translation) transformation and other processing. It also helps to maintain the watermark in images that are compressed and stored for a period of time. This algorithm also proved that is has robustness against not only JPEG compression attack, but also RST attack and filtering attack.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.10
• /
• pp.1997-2003
• /
• 2009

Methods for effective musical score recognition and efficient editing of musical scores are demanded because functions of computers for researches on musical activities become more and more important parts in recent days. In the conventional methods for handling musical scores manually, there are weak points such as incorrect score symbols in input process and requirement of much time to adjust the incorrect symbols. And also there is another weak point that the scores edited by each application program can be remodified by a specific application program only. In this paper, we proposed a method for automatic musical score recognition of printed musical scores in order to make up for the weak points. In the proposed method, staffs in a scanned score image are eliminated by horizontal histogram, noises are removed by 4 directional edge tracking algorithm, and then musical score symbols are extracted by using Grassfire algorithm. The extracted symbols are recognized by hierarchical ART2 algorithm. In order to evaluate the performance of the proposed method, we used 100 musical scores for experiment. In the experiment, we verified that the proposed method using hierarchical ART2 algorithm is efficient.

• KIPS Transactions on Software and Data Engineering
• /
• v.2 no.2
• /
• pp.119-122
• /
• 2013

Repetitive strings such as periods have been studied vigorously in so diverse fields as data compression, computer-assisted music analysis, bioinformatics, and etc. In bioinformatics, periods are highly related to repetitive patterns in DNA sequences so called tandem repeats. In some cases, quite similar but not the same patterns are repeated and thus we need approximate string matching algorithms to study tandem repeats in DNA sequences. In this paper, we propose a new definition of approximate periods of strings based on distance sum. Given two strings $p({\mid}p{\mid}=m)$ and $x({\mid}x{\mid}=n)$, we propose an algorithm that computes the minimum approximate period distance based on distance sum. Our algorithm runs in $O(mn^2)$ time for the weighted edit distance, and runs in O(mn) time for the edit distance, and runs in O(n) time for the Hamming distance.

• The KIPS Transactions:PartC
• /
• v.13C no.4 s.107
• /
• pp.389-396
• /
• 2006

P2P(Peer To Peer) system, a most attractive file sharing system, is the largest channel of contents distribution and it takes 50% of network traffic. But P2P systems are infamous for used to illegal contents distribution channel not only in music industry, but also in movie industry. But, DRM(Digital Right Management) enabled P2P models are not suggested until now that interrupting illegal contents distribution and keeping advantage of P2P. So in this paper, we suggest a DRM enabled P2P model that can support distributed processing ability and high scalability with no modification in exist P2P model or architecture.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.8
• /
• pp.2061-2074
• /
• 1998

In pattern recognition and image analysis upplications, a graph is a useful tool for complex obect representation and recognition. However it takes much time to pair proper nodes between the prototype graph and an input data graph. Futhermore it is difficult to decide whether the two graphs in a class are the same hecause real images are degradd in general by noise and other distortions. In this paper we propose a matching algorithm using a matrix. The matrix is suiable for simple and easily understood representation and enables the ordering and matching process to be convenient due to its predefined matrix manipulation. The nodes which constitute a gaph are ordered in the matrix by their geometrical positions and this makes it possible to save much comparison time for finding proper node pairs. for the classification, we defined a distance measure thatreflects the symbo's structural aspect that is the sum of the mode distance and the relation distance; the fornet is from the parameters describing the node shapes, the latter from the relations with othes node in the matrix. We also introduced a subdivision operation to compensate node merging which is mainly due t the prepreocessing error. The proposed method is applied to the recognition of musteal symbols and the result is given. The result shows that almost all, except heavily degraded symbols are recognized, and the recognition rate is approximately 95 percent.

• KIISE Transactions on Computing Practices
• /
• v.21 no.4
• /
• pp.275-282
• /
• 2015

The Musical Instrument Digital Interface (MIDI) file format is a typical format for dynamic music that can be used not only for playing, but also for supporting dynamic music activity, such as musical instrument practice. However, almost all of the existing MIDI applications focus only on the playing features. In this paper, therefore, we implement a MIDI file play application that supports various dynamic features such as part-play repeating certain sections that the user wants, tone and speed control while playing a MIDI file, downloading MIDI files from a server, and lastly Digital Rights Management (DRM). By supporting these features, we are confident that our MIDI application will help users who wish to practice musical instruments to do so conveniently, while effectively protecting the copyright of their purchased MIDI files.