• The Journal of the Acoustical Society of Korea
• /
• v.24 no.3
• /
• pp.178-185
• /
• 2005

This paper presents a new music identification method using probabilistic and dynamic characteristics of melody. The propo3ed method uses pitch and MFCC parameters as feature vectors for the characteristics of music notes and represents melody pattern by pitch histogram and temporal sequence of codeword indices. We also propose a new pattern matching method for the hybrid method. We have tested the proposed algorithm in small (drama OST) and broad (1.005 popular songs) search spaces. The experimental results on search areas of OST and 1,005 popular songs showed better performance of the proposed method over conventional methods. We achieved the performance improvement of average $9.9\%$ and $10.2\%$ in error reduction rate on each search area.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.16 no.3
• /
• pp.407-416
• /
• 2021

An active phased array antennas can not only electrically steer the beam by controlling the weighting of the excitation signal, but can also form a pattern null in the direction of the interference source. The weight of the excitation signal to steer the main beam can be easily calculated based on the position of the radiating element. In addition, the weight of the excited signal for pattern null formation can also be calculated by setting the required radiation pattern and using WLSM(Weighted Least Squares Method). However, in a general wireless communication network environment, the location of the interference source is unknown. Therefore, an adaptive pattern null synthesis is needed. In this paper, it was confirmed that pattern null synthesis according to the required radiation characteristic was possible. And based on this, adaptive pattern null synthesis into the direction of an interference source was studied using a binary search algorithm based on observation area. As a result of conducting a simulation based on the presented technique, it was confirmed that adaptive pattern null forming into the direction of an interference is possible in efficient way.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2013.05a
• /
• pp.213-216
• /
• 2013

Big data, the use of privacy has been increasing to the development of wireless network infrastructure or technology development and wired Internet. By the way, Enforcement of private data preservation law the infringement accident which is still caused by despite with private data outflow occurs. The private data outflow avoids finance and to become the fire tube. Analyzes the pattern of private data from search of private data and detection process and the research which it extracts and the research is necessary in about perfection elimination of the private data which is unnecessary. From the research which it sees it researched a pattern extraction research and a complete elimination method in about private data protection and it did the pattern extraction and a complete elimination experiment of private data.

• IE interfaces
• /
• v.4 no.2
• /
• pp.43-51
• /
• 1991

A line search method is developed to locate all the conerpoints of 2-dimensional polygon images for inspection purposes. This optimization-based method is used to approximate a 2-D curved object by a polygon. This scheme is also developed for inspection of objects in industrial environment. The inspection includes dimensional verification and pattern matching which compares a 2-D image of an object to a pattern image. The method proves to be computationally efficient and accurate for real time application.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1996.04a
• /
• pp.670-674
• /
• 1996

In automated search of a design database to support mechanical design, it is necessaryto recognize a shape pattern which represents a design object. This paper introduces the concept of a surface relation graph (SRG) for recognizing shape patterns from a 3D boundary representation scheme of a solid model(a B-rep model). In SRG, the nodes and arcs correspond to the faces and edges shared by two adjacent faces, respectively. An attribute assigned to an arc is given by an integer which discriminates the relationship between two adjacent faces. The + sign of the integer represents the geometric convexity of the solid, and the -sign the concivity at the shared edge. The input shape is recognized by comparison with the predefined features which are subgraphs of the SRG. A hierarchyof the database for upporting the design is presented. A search for the design database is also discussed. The usefulness of this method is illustrated by some application results.

• The Journal of Korean Association of Computer Education
• /
• v.6 no.1
• /
• pp.1-8
• /
• 2003

We introduce a efficient vertical mining algorithm that reduces searching complexity for frequent k-itemsets significantly. This method includes sorting items by their LSI(Least Support Itemsets) similarity and then searching frequent itemsets in tree-based manner. The search tree structure provides several useful heuristics and therefore, reduces search space significantly at early stages. Experimental results on various data sets shows that the proposed algorithm improves searching performance compared to other algorithms, especially for a database having long pattern.

• Journal of applied mathematics & informatics
• /
• v.16 no.1_2
• /
• pp.195-205
• /
• 2004

To the unconstrained programme of non-convex function, this article give a modified BFGS algorithm. The idea of the algorithm is to modify the approximate Hessian matrix for obtaining the descent direction and guaranteeing the efficacious of the quasi-Newton iteration pattern. We prove the global convergence properties of the algorithm associating with the general form of line search, and prove the quadratic convergence rate of the algorithm under some conditions.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.7
• /
• pp.1187-1192
• /
• 2008

This paper proposes a fast motion estimation using an adaptive search region and a new three step search. The proposed method improved in the quality of motion compensation image as $0.43dB{\sim}2.19dB$, according as it predict motion of current block from motion vector of neigher blocks, and adaptively set up search region using predicted motion information. We show that the proposed method applied a new three step search pattern is able to fast motion estimation, according as it reduce computational complexity per blocks as $1.3%{\sim}1.9%$ than conventional method.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.5 s.43
• /
• pp.69-74
• /
• 2006

The recent development of multimedia content-based retrieval technologies brings great attention of musician retrieval using features of a digital audio data among music information retrieval technologies. But the indexing techniques for music databases have not been studied completely. In this paper, we present a musician retrieval technique for audio features using the space split methods in the time-series pattern index file. We use features of audio to retrieve the musician and a time-series pattern index file to search the candidate musicians. Experimental results show that the time-series pattern index file using the rotational split method is efficient for musician retrievals in the time-series pattern files.

• Journal of Korea Multimedia Society
• /
• v.21 no.10
• /
• pp.1131-1141
• /
• 2018

Motion Estimation which is used to reduce the redundant data plays an important role in video compressions. However, it requires huge computational complexity of the encoder part. And therefore many fast motion estimation methods has been developed to reduce complexity. Multi-view video is obtained by using many cameras at different positions and its complexity increases in proportion to the number of cameras. In this paper, we proposed a fast motion estimation method for multi-view video. The proposed method predicts a search start point by using correlated candidate vectors of the current block. According to the motion size of the start search point, a search start pattern of the current block is decided adaptively. The proposed method proves to be about 2 ~ 5 times faster than existing methods while maintaining similar image quality and bitrates.