• 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.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.8
• /
• pp.1729-1735
• /
• 2009

The hierarchical routing could cause a lot of energy consumption for transferring data by assigning hierarchical routes although actual nodes could be located in physically near spots. Also, when Node Failure or Association Error occurs, the Hierarchical routing could waste more energy to deliver the control messages. This paper evaluate performance of SHP(Shortest Hop Routing) algorithm that suggests short-cut routing algorithm using NL(Neighbor List) and Redirect_ACK message to improve problem of hierarchical routing algorithm. We do a computer simulation by the size of network, deployment of sensor nodes, sink position and POS. As a result of simulation, SHP has better performance than Zigbee Hierarchical routing and HiLow.

• Journal of Korea Multimedia Society
• /
• v.13 no.11
• /
• pp.1621-1629
• /
• 2010

This paper presents an improved fast MSRCR algorithm that MSRs are commonly adopted at tone mapping in color vision. Conventional MSRs consist of three SSRs, which use three Gaussian functions with different scales as those surround ones. This convolution processes require much computation load. Therefore, the proposed algorithm adopts a hierarchical discrete correlation which is equivalent to Gaussian function and the Retinex process is only applied to the luminance channel in order to get a fast processing. A simple color preservation scheme is applied to the Retinex output from the luminance channel in the proposed MSRCR algorithm. Experimental results show that the proposed algorithm required less number of oprations and computation time about 1/9.5 and 1/3.5 times, respectively, than those of the simplest MSR and was equivalent to conventional MSRs.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.2
• /
• pp.344-358
• /
• 2011

Wireless tactical network (WTN) is the most important present-day technology enabling modern network centric warfare. It inherits many features from WMNs, since the WTN is based on existing wireless mesh networks (WMNs). However, it also has distinctive characteristics, such as hierarchical structures and tight QoS (Quality-of-Service) requirements. Little research has been conducted on hierarchical protocols to support various QoS in WMN. We require new protocols specifically optimized for WTNs. Control packets are generally required to find paths and reserve resources for QoS requirements, so data throughput is not degraded due to overhead. The fundamental solution is to adopt topology aggregation, in which a low tier node aggregates and simplifies the topology information and delivers it to a high tier node. The overhead from control packet exchange can be reduced greatly due to decreased information size. Although topology aggregation is effective for low overhead, it also causes the inaccuracy of topology information; thus, incurring low QoS support capability. Therefore, we need a new topology aggregation algorithm to achieve high accuracy. In this paper, we propose a new aggregation algorithm based on star topology. Noting the hierarchical characteristics in military and hierarchical networks, star topology aggregation can be used effectively. Our algorithm uses a limited number of bypasses to increase the exactness of the star topology aggregation. It adjusts topology parameters whenever it adds a bypass. Consequently, the result is highly accurate and has low computational complexity.

• Korean Management Science Review
• /
• v.19 no.1
• /
• pp.189-196
• /
• 2002

Data clustering is often one of the first steps in data mining analysis. It Identifies groups of related objects that can be used as a starling point for exploring further relationships. This technique supports the development of population segmentation models, such as demographic-based customer segmentation. This paper Purpose to present the development of two phase hierarchical clustering algorithm for group formation. Applications of the algorithm for product-customer group formation in customer relationahip management are also discussed. As a result of computer simulations, suggested algorithm outperforms single link method and k-means clustering.

• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10c
• /
• pp.360-362
• /
• 1998

In the original mixtures of experts framework, the parameters of the network are determined by gradient descent, which is naturally slow. In [2], the Expectation-Maximization(EM) algorithm is used instead, to obtain the network parameters, resulting in substantially reduced training times. This paper presents the new EM algorithm for prediction. We show that an Efficient training algorithm may be derived for the HME network. To verify the utility of the algorithm we look at specific examples in time series prediction. The application of the new EM algorithm to time series prediction has been quiet successful.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1996.06b
• /
• pp.41-44
• /
• 1996

A new three step hierarchical search algorithm for motion estimation is proposed. The proposed algorithm exploits the motion correlation of spatially neighboring blocks and the motion continuity of temporally neighboring blocks to alleviate the local minimum problem in the first step of the three step hierarchical search algorithm (3SHS). Simulation results show that the proposed scheme achieves significant improvements in both estimation accuracy and performance reliability compared with the existing fast block matching algorithm including 3SHS, while maintaining almost the same computational complexity as 3SHS. The proposed scheme also possesses the regularity and simplicity of hardware-oriented features.

• IE interfaces
• /
• v.16 no.spc
• /
• pp.14-20
• /
• 2003

This paper presents a multi-criteria decision model and Multi-Criteria Generic Algorithm(MCGA) approach to improve backbone topology by leveraging the Virtual Link(VL) system in an hierarchical Link-State(LS) routing domain. Given that the sound backbone topology structure has a great impact on the overall routing performance in an hierarchical LS domain, the importance of this research is evident. The proposed decision model is to find an optimal configuration of VLs that properly meets two-pronged engineering goals in installing and maintaining VLs: i.e., operational costs and network reliability. The experiment results clearly indicates that it is essential to the effective operations of hierarchical LS routing domain to consider not only engineering aspects but also specific benefits from systematical layout of VLs, thereby presenting the validity of the decision model and MCGA.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.3
• /
• pp.1013-1020
• /
• 2000

In this paper, we propose an algorithm which segments hierarchically blocks of image using discrete cosine transform(DCT) and execute finite-state vector quantization (FSVQ) for each block. Using DCT coefficient feature, image is segmented hierarchically to large smooth block and small edge block, then the block hierarchy informations are transmitted. The codebooks are respectively constructed for each hierarchical blocks, the encoder transmits codeword index using FSVQ for reducing encoded bit with hierarchical segmentation. Compared with side match VQ(SMVQ) and hierarchical FSVQ(HFSVQ) algorithm, about Zelda and Boat image, the new algorithm shows better picture quality with 1.97dB and 2.85 dB difference as to SMVQ, 1.78dB and 1.85dB diffences as to HFSVQ respectively.

• Journal of the Institute of Convergence Signal Processing
• /
• v.7 no.4
• /
• pp.155-160
• /
• 2006

This paper presents the hierarchical block matching algorithm using the 4 subbands of the wavelet transformation and the thresholding method. The proposed algorithm improves the PSNR performance of the reconstructed image using the 4 subbands of the wavelet transformation and reduces the computational complexity by thresholding the motion vector. The experimental results of the proposed algorithm for 'Carphone' image and 'Mother and Daughter' image show that if the thresholding value is 0, the computational complexity is increasing up to 16% and the PSNR performance of the reconstructed image improves the 0.16dB in comparison with that of the existing. hierarchical motion estimation algorithm. In addition, as the thresholding value is increasing, the computational complexity reduces up to 8% and the PSNR performance of the reconstructed image is similar.