• Journal of the Korea Society of Computer and Information
• /
• v.14 no.9
• /
• pp.95-104
• /
• 2009

This paper proposes the noise robust algorithm to detect the starting point of music. Detection of starting point of music is necessary to solve computational-waste problem and retrieval-comparison problem with inconsistent input data in music content based retrieval system. In particular, such detection is even more necessary in time sequential retrieval method that compares data in the sequential order of time in contents based music retrieval system. Whereas it has the long point that the retrieval is fast since it executes simple comparison in the order of time, time sequential retrieval method has the short point that data starting time to be compared should be the same. However, digitalized music cannot guarantee the equity of starting time by bit rate conversion. Therefore, this paper ensured that recognition rate shall not decrease even while executing high speed retrieval by applying time sequential retrieval method through detection of music starting point in the pre-processing stage of retrieval. Starting point detection used minimum wave model that can detect effective sound, and for strength against noise, the noises existing in mute sound were swapped. The proposed algorithm was confirmed to produce about 38% more excellent performance than the results to which starting point detection was not applied, and was verified for the strength against noise.

• Proceedings of the Korea Institute of Convergence Signal Processing
• /
• 2000.12a
• /
• pp.153-156
• /
• 2000

Recently, there has been studied on feature extraction method for efficient content-based image retrieval. Especially, Many researchers have been studying on extracting feature from color Information, because of its advantages. This paper proposes a feature and its extraction method based on color correlogram that is extracted from color information in an image. the proposed method is computed from the image segmented into two parts; the complex part and the plain part. Our experiments show that the performance of the proposed method is better as compared with that of the original color correlogram method.

• Journal of Korea Multimedia Society
• /
• v.8 no.3
• /
• pp.355-361
• /
• 2005

This paper proposed a system collecting image information by agents in multi-threaded environment and then retrieving them with content based image retrieval. This system uses multi threads to retrieve web information effectively, then improves efficiency of CPU cycles to reduce latency time, which is the time requesting queries, executing communication processing 4hat the retrieval agents perform and filtering the retrieval results. Also, the agents for image retrieval use Java language, which is platform independent, to be suitable for distributed environment. Using JDBC to save the retrieved images, the agents are connected to database. The images themselves are stored in distributed agents' databases, and only the image indexes are stored in an index server so that the efficiency of storage and retrieval time can be improved.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.12
• /
• pp.2931-2946
• /
• 1997

In multimedia information retrieval applications, content-based image retrieval is essential for retrieving relevant multimedia documents. The purpose of our paper is to provide effective representation and efficient retrieval of images when a pixel-level original image is automatically or manually transformaed into its iconic image containing meaningful graphic descriptions, called icon objects. For this, we first propose new spatial match representationschemes to describe spatial relationships between icon objects accurately by expressing them as rectangles, rather than as points. In order to accelerate image searching, we also design an efficient retrieval method using a two-dimensional signature file organization. Finally, we show from our experiment that the proposed representation schemes achieve better retrieval effectiveness than the 9-DLT (Direction Lower Triangular) scheme.

• Journal of KIISE
• /
• v.42 no.1
• /
• pp.33-43
• /
• 2015

Recently, patent images are growing importance and thus patent image retrieval is a growing area of research. However, most existing patent image retrieval systems use edges extracted in the images, whose performance is affected by the quality of edge detection in the image pre-processing step. To overcome this disadvantage, we propose a SURF-based patent image retrieval method which uses the morphological characteristics of the images. The proposed method detects SURF interest points with directions and computes regional histograms. We apply the proposed method to a patent image database with 2000 binary images and we show the proposed retrieval system achieves excellent results, even when the images have some loss or degradation.

• Journal of Internet Computing and Services
• /
• v.10 no.6
• /
• pp.113-121
• /
• 2009

In order to retrieve images with different emotions in regions of the images, this paper proposes the image retrieval system using emotion sketch. The proposed retrieval system divides an image into $17{\times}17$ sub-regions and extracts emotion features in each sub-region. In order to extract the emotion features, this paper uses emotion colors on 160 emotion words from H. Nagumo's color scheme imaging chart. We calculate a histogram of each sub-region and consider one emotion word having the maximal value as a representative emotion word of the sub-region. The system demonstrates the effectiveness of the proposed emotion sketch and our experimental results show that the system successfully retrieves on the Corel image database.

• Journal of KIISE:Databases
• /
• v.27 no.2
• /
• pp.199-208
• /
• 2000

The k-nearest neighbor search query based on similarity is very important for content-based multimedia information retrieval(MIR). The conventional exact k-nearest neighbor search algorithm is not efficient for the MIR application because multimedia data should be represented as high dimensional feature vectors. Thus, an approximate k-nearest neighbor search algorithm is required for the MIR applications because the performance increase may outweigh the drawback of receiving approximate results. For this, we propose a new approximate k-nearest neighbor search algorithm for high dimensional data. In addition, the comparison of the conventional algorithm with our approximate k-nearest neighbor search algorithm is performed in terms of retrieval performance. Results show that our algorithm is more efficient than the conventional ones.

• Journal of the Korea Computer Industry Society
• /
• v.3 no.7
• /
• pp.901-914
• /
• 2002

In this paper, We propose an efficient automatic caption detection and location method, caption recognition using FE-MCBP(Feature Extraction based Multichained BackPropagation) neural network for content based retrieval of video. Frames are selected at fixed time interval from video and key frames are selected by gray scale histogram method. for each key frames, segmentation is performed and caption lines are detected using line scan method. lastly each characters are separated. This research improves speed and efficiency by color segmentation using local maximum analysis method before line scanning. Caption detection is a first stage of multimedia database organization and detected captions are used as input of text recognition system. Recognized captions can be searched by content based retrieval method.

• Journal of information and communication convergence engineering
• /
• v.8 no.2
• /
• pp.185-190
• /
• 2010

In this paper we propose the CBIR algorithm which is based on a novel image block method that combined both color and edge feature. The main drawback of global histogram representation is dependent of the color without spatial or shape information, a new image block method that divided the image to 8 related blocks which contained more information of the image is utilized to extract image feature. Based on these 8 blocks, histogram equalization and edge detection techniques are also used for image retrieval. The experimental results show that the proposed image block method has better ability of characterizing the image contents than traditional block method and can perform the retrieval system efficiently.

• KIEE International Transaction on Systems and Control
• /
• v.12D no.1
• /
• pp.7-11
• /
• 2002

In this study, fur the shape-based image retrieval, a method using local differential invariants is proposed. This method calculates the differential invariant feature vector at every feature point extracted by Harris comer point detector. Then through vector quantization using LBG algorithm, all feature vectors are represented by a codebook index. All images are indexed by the histogram of codebook index, and by comparing the histograms the similarity between images is obtained. The proposed method is compared with the existing method by performing experiments for image database including various 1100 trademarks.