• 한국정보통신설비학회:학술대회논문집
• /
• 2008.08a
• /
• pp.531-534
• /
• 2008

Image Hash specifies as a descriptor that can be used to measure similarity in images. Among all image Hash methods, histogram based image Hash has robustness to common noise-like operation and various geometric except histogram _equalization. In this_paper an improved histogram based Image Hash that is using "Imadjust" filter I together is proposed. This paper has achieved a satisfactory performance level on histogram equalization as well as geometric deformation.

• Journal of KIISE:Databases
• /
• v.34 no.6
• /
• pp.546-553
• /
• 2007

As ontologies are used widely, interest for semantic similarity search is also increasing. In this paper, we suggest a query evaluation scheme for k-nearest neighbor query, which retrieves k most similar objects to the query object. We use the best match method to calculate the semantic similarity between objects and use the signature tree to index annotation information of objects in database. The signature tree is usually used for the set similarity search. When we use the signature tree in similarity search, we are required to predict the upper-bound of similarity for a node; the highest similarity value which can be found when we traverse into the node. So we suggest a prediction function for the best match similarity function and prove the correctness of the prediction. And we modify the original signature tree structure for same signatures not to be stored redundantly. This improved structure of signature tree not only reduces the size of signature tree but also increases the efficiency of query evaluation. We use the Gene Ontology(GO) for our experiments, which provides large ontologies and large amount of annotation data. Using GO, we show that proposed method improves query efficiency and present several experimental results varying the page size and using several node-splitting methods.

• International Journal of Contents
• /
• v.11 no.2
• /
• pp.15-19
• /
• 2015

In this paper, we propose an efficient document layout analysis algorithm that includes table detection. Typical methods of document layout analysis use the height and gap between words or columns. To correspond to the various styles and sizes of documents, we propose an algorithm that uses the mean value of the distance transform representing thickness and compare with components in the local area. With this algorithm, we combine a table detection algorithm using the same feature as that of the text classifier. Table candidates, separators, and big components are isolated from the image using Connected Component Analysis (CCA) and distance transform. The key idea of text classification is that the characteristics of the text parallel components that have a similar thickness and height. In order to estimate local similarity, we detect a text region using an adaptive searching window size. An improved adaptive run-length smoothing algorithm (ARLSA) was proposed to create the proper boundary of a text zone and non-text zone. Results from experiments on the ICDAR2009 page segmentation competition test set and our dataset demonstrate the superiority of our dataset through f-measure comparison with other algorithms.

• Journal of the Institute of Convergence Signal Processing
• /
• v.3 no.1
• /
• pp.1-7
• /
• 2002

In this paper, when users choose a query image, we implemented a content-based image retrieval system that users can simply choose and extract a object region of query wanted with not only a whole image but various objects in it. Histogram is obtained by improved HSV transformations from query image and then candidate images are retrieved rapidly by a 1st similarity measure with histogram intersection using representative colors of query image. And finally retrieved images are extracted since 2nd similarity measure with banded autocorrelogram is performed so that recall and precision are improved by combining two retrieval methods that can make up for respective weak points. Moreover images in the database are indexed automatically within feature library that makes possible to retrieve images rapidly.

• The Journal of the Acoustical Society of Korea
• /
• v.40 no.2
• /
• pp.121-129
• /
• 2021

This paper deals with a super-resolution that improves the resolution of side scan sonar images using learning-based compressive sensing. Learning-based compressive sensing combined with deep learning and compressive sensing takes a structure of a feed-forward network and parameters are set automatically through learning. In particular, we propose a method that can effectively extract additional information required in the super-resolution process through various initialization methods. Representative experimental results show that the proposed method provides improved performance in terms of Peak Signal-to-Noise Ratio (PSNR) and Structure Similarity Index Measure (SSIM) than conventional methods.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.34 no.4
• /
• pp.391-402
• /
• 2016

Among the various remote sensing sensors compared to the electro-optical sensors, SAR (Synthetic Aperture Radar) is very suitable for assessing damaged areas induced by disaster events owing to its all-weather day and night acquisition capability and sensitivity to geometric variables. The conventional CD (Change Detection) method that uses two-date data is typically used for mapping damage over extensive areas in a short time, but because data from only two dates are used, the information used in the conventional CD is limited. In this paper, we propose a novel CD method that is extended to use data consisting of two pre-disaster SAR data and one post-disaster SAR data. The proposed CD method detects changes by using a similarity weight image derived from the neighborhood information of a pixel in the data from the three dates. We conducted an experiment using three single polarization ALOS PALSAR (Advanced Land Observing Satellite/Phased Array Type L-Band) data collected over Miyagi, Japan which was seriously damaged by the 2011 east Japan tsunami. The results demonstrated that the mapping accuracy for damaged areas can be improved by about 26% with an increase of the g-mean compared to the conventional CD method. These improved results prove the performance of our proposed CD method and show that the proposed CD method is more suitable than the conventional CD method for detecting damaged areas induced by disaster.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.16 no.12
• /
• pp.8649-8653
• /
• 2015

A number of video indexing and retrieval algorithms have been proposed to manage large video databases efficiently. The video similarity measure is one of most important technical factor for video content management system. In this paper, we propose the luminance characteristics model to measure the video similarity efficiently. Most algorithms for video indexing have been commonly used histograms, edges, or motion features, whereas in this paper, the proposed algorithm is employed an efficient similarity measure using the luminance projection. To index the video sequences effectively and to reduce the computational complexity, we calculate video similarity using the key frames extracted by the cumulative measure, and compare the set of key frames using the modified Hausdorff distance. Experimental results show that the proposed luminance projection model yields the remarkable improved accuracy and performance than the conventional algorithm such as the histogram comparison method, with the low computational complexity.

• Journal of Microbiology and Biotechnology
• /
• v.9 no.6
• /
• pp.773-777
• /
• 1999

Scale-up experiments for hydrolysis of beef tallow, fat, and palm kernel with lipase derived from Candida cylindracea were carried out in 1-1, 100-1, and 10,000-1 reactors. The optimum agitation speed for the hydrolysis of the 1-1 reactor was investigated and found to be 350rpm, and this was a basis for the scale-up of agitation speed. The hydrolysis system in this work was the oil-water system in which the hydrolysis seems to process a heterogeneous reaction. An emulsion condition was the most important factor for determining the reaction rate of hydrolysis. Therefore, the scale-up of agitation speed was performed by using the power n = 1/3 in an equation of the rules of thumb method. The geometrical similarity for scaling-up turned out to be unsatisfactory in this study. Thus, the working volume per one agitator was used for the scale-up. In the case of scale-up from a 1-1 reactor to a 100-1 reactor, the hydrolysis of palm kernel was very much scaled-up by initiating the rules of thumb method. However, the hydrolysis of fat and beef tallow in a 100-1 reactor was a little higher than that of the 1-1 reactor because of the difference of geometrical similarity. The scale-up of hydrolysis from the 100-1 reactor to the 10,000-1 reactor was improved compared to that of the 1-1 to 100-1 reactor. The present results indicated that the scale-up of hydrolysis in the oil-water system by the rules of thumb method was more satisfactory under the condition of geometrical similarity. Even in the case where geometrical similarity was not satisfactory, the working volume per one agitator could be used for the scale-up of a heterogeneous enzyme reaction.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.18 no.3
• /
• pp.449-458
• /
• 2023

Many people think that sign language is only for people who are deaf and cannot speak, but of course it is necessary for people who want to talk with them. One of the biggest challenges in ASL(American Sign Language) alphabet recognition is the high inter-class similarities and high intra-class variance. In this paper, we proposed an architecture that can overcome these two problems, which performs similarity learning to reduces inter-class similarities and intra-class variance between images. The proposed architecture consists of the same convolutional neural network with a double configuration that shares parameters (weights and biases) and also applies the Keras API to reduce similarity learning and variance through this pathway. The similarity learning results the use of the dual CNN shows that the accuracy is improved by reducing the similarity and variability between classes by not including the poor results of the two classes.

• The Journal of Society for e-Business Studies
• /
• v.23 no.2
• /
• pp.83-96
• /
• 2018

Extracting keywords representing documents is very important because it can be used for automated services such as document search, classification, recommendation system as well as quickly transmitting document information. However, when extracting keywords based on the frequency of words appearing in a web site documents and graph algorithms based on the co-occurrence of words, the problem of containing various words that are not related to the topic potentially in the web page structure, There is a difficulty in extracting the semantic keyword due to the limit of the performance of the Korean tokenizer. In this paper, we propose a method to select candidate keywords based on semantic similarity, and solve the problem that semantic keyword can not be extracted and the accuracy of Korean tokenizer analysis is poor. Finally, we use the technique of extracting final semantic keywords through filtering process to remove inconsistent keywords. Experimental results through real web pages of small business show that the performance of the proposed method is improved by 34.52% over the statistical similarity based keyword selection technique. Therefore, it is confirmed that the performance of extracting keywords from documents is improved by considering semantic similarity between words and removing inconsistent keywords.