• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.11
• /
• pp.5692-5716
• /
• 2019

One of the best means to safeguard the confidentiality, security, and privacy of an image within the IoT-Cloud is through encryption. However, looking through encrypted data is a difficult process. Several techniques for searching encrypted data have been devised, but certain security solutions may not be used in IoT-Cloud because such solutions are not lightweight. We propose a lightweight scheme that can perform a content-based search of encrypted images, namely EEIRI. In this scheme, the images are represented using local features. We develop and validate a secure scheme for measuring the Euclidean distance between two descriptor sets. To improve the search efficiency, we employ the k-means clustering technique to construct a searchable tree-based index. Our index construction process ensures the privacy of the stored data and search requests. When compared with more familiar techniques of searching images over plaintexts, EEIRI is considered to be more efficient, demonstrating a higher search cost of 7% and a decrease in search accuracy of 1.7%. Numerous empirical investigations are carried out in relation to real image collections so as to evidence our work.

• The Journal of the Korea Contents Association
• /
• v.16 no.10
• /
• pp.687-692
• /
• 2016

Conventional way to search documents is keyword-based queries using vector space model, like tf-idf. Searching process of documents which is based on keywords can make some problems. it cannot recogize the difference of lexically different but semantically same words. This paper studies a scheme of document search based on document queries. In particular, it uses centrality vectors, instead of tf-idf vectors, to represent query documents, combined with the Word2vec method to capture the semantic similarity in contained words. This scheme improves the performance of document search and provides a way to find documents not only lexically, but semantically close to a query document.

• Journal of Korea Spatial Information System Society
• /
• v.10 no.1
• /
• pp.29-40
• /
• 2008

With the spread of mobile devices and advances in communication techknowledges, the needs of application which uses the movement patterns of moving objects in history trajectory data of moving objects gets Increasing. Especially, to design public transportation route or road network of the new city, we can use the similar patterns in the trajectories of moving objects that move on the spatial network such as road and railway. In this paper, we propose a spatio-temporal similar trajectory search algorithm for moving objects on road network. For this, we define a spatio-temporal similarity measure based on the real road network distance and propose a grid-based index structure for similar trajectory search. Finally, we analyze the performance of the proposed similar trajectory search algorithm in order to show its efficiency.

• The KIPS Transactions:PartB
• /
• v.16B no.2
• /
• pp.181-194
• /
• 2009

With the increased interest on the document copyright, many of researches related to the document plagiarism have been done up to now. The plagiarism problem of newspaper articles has attracted much interest because the plagiarism cases of the articles having much commercial values in market are currently happened very often. Many researches related to the document plagiarism have been so hard to be applied to the newspaper articles because they have strong real-time characteristics. So to detect the plagiarism of the articles, many human detectors have to read every single thousands of articles published by hundreds of newspaper companies manually. In this paper, we firstly sorted out the articles with high possibility of being copied by utilizing OpenAPI modules supported by web search companies such as Naver and Daum. Then, we measured the document similarity between selected articles and the original article and made the system decide whether the article was plagiarized or not. In experiment, we used YonHap News articles as the original articles and we also made the system select the suspicious articles from all searched articles by Naver and Daum news search services.

• Journal of KIISE:Databases
• /
• v.28 no.4
• /
• pp.643-654
• /
• 2001

This paper discusses an effective processing of similarity search that supports time warping in large sequence database. Time warping enables finding sequences with similar patterns even when they are of different length, Previous methods fail to employ multi-dimensional indexes without false dismissal since the time warping distance does not satisfy the triangular inequality. They have to scan all the database, thus suffer from serious performance degradation in large database. Another method that hires the suffix tree also shows poor performance due to the large tree size. In this paper we propose a new novel method for similarity search that supports time warping Our primary goal is to innovate on search performance in large database without false dismissal. to attain this goal ,we devise a new distance function $D_{tw-Ib}$ consistently underestimates the time warping distance and also satisfies the triangular inequality, $D_{tw-Ib}$ uses a 4-tuple feature vector extracted from each sequence and is invariant to time warping, For efficient processing, we employ a distance function, We prove that our method does not incur false dismissal. To verify the superiority of our method, we perform extensive experiments . The results reveal that our method achieves significant speedup up to 43 times with real-world S&P 500 stock data and up to 720 times with very large synthetic data.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.1
• /
• pp.203-213
• /
• 2014

In this study, we proposed a new model with ISOIA (Insect Search by Observation based on Insect Appearance) method based on observation by insect appearance to improve user satisfaction, and compared it with the ISBC and ISOBC methods. In order to test these three insect search systems with AHP method, we derived three evaluation criteria for user satisfaction and three sub-evaluation criteria by evaluation criterion. In the ecological environment, non-experts need insect search systems to identify insect species and to get u-Learning contents related to the insects. To assist the public the non-experts, ISBC (Insect Search by Biological Classification) method based on biological classification to search insects and ISOBC (Insect Search by Observation based on Biological Classification) method based on the inference that identifies the observed insect through observation according to biological classification have been provided. In the test results, we found the order of priorities was ISOIA, ISOBC, and ISBC. It shows that the ISOIA system proposed in this study is superior in usage and quality compared with the previous insect search systems.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.6A
• /
• pp.584-591
• /
• 2002

In this paper, we proposed a b1ocking artifact reduction algorithm using similarity and linear combination between blocks. In the proposed method, all of the blocks are classified into low frequency block and high frequency block according to the their DCT coefficients. And we defined range block which shows blocking artifacts, as block centered to block boundary and defied domain block as similar block with range block within search range. In the search procedure, we used sub-block's property of range block and similarity for more accurate searching. Finally blocking artifact reduction algorithm is performed using linear combination between searched domain block and blocky range block. The performance of the proposed method is investigated by computer simulation in comparison with the traditional methods. In the experimental results, Ire confirmed the better performance in the subjective by 0.04∼0.4 dB and objective image quality.

• Journal of Korea Multimedia Society
• /
• v.15 no.9
• /
• pp.1149-1155
• /
• 2012

In this paper, we propose cause diagnosis method of semiconductor defects from semiconductor industrial images. Our method constructs feature database (DB) of defect images. Then, defect and input images are subdivided by uniform block. And the block similarity is measured using histogram kai-square distance after color histogram calculation. Then, searched blocks in each image are merged into connected objects using clustering. Finally, the most similar defect image from feature DB is searched with the defect cause by measuring cluster similarity based on features of each cluster. Our method was validated by calculating the search accuracy of n output images having high similarity. With n = 1, 2, 3, the search accuracy was measured to be 100% regardless of defect categories. Our method could be used for the industrial applications.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.4 s.36
• /
• pp.1-16
• /
• 2005

When Web-based special retrieval systems for scientific field extremely restrict the expression of user's information request, the process of the information content analysis and that of the information acquisition become inconsistent. Accordingly, this study suggests the re-ranking retrieval model which reflects the content based similarity between user's inquiry terms and index words by grasping the document knowledge structure. In order to accomplish this, the former constructs a thesaurus and similarity relation matrix to provide the subject analysis mechanism and the latter propose the algorithm which establishes a search model such as query expansion in order to analyze the user's demands. Therefore, the algorithm that this study suggests as retrieval utilizing the information structure of a retrieval system can be content-based retrieval mechanism to establish a 2-step search model for the preservation of recall and improvement of accuracy which was a weak point of the previous fuzzy retrieval model.

• Reproductive and Developmental Biology
• /
• v.28 no.1
• /
• pp.45-52
• /
• 2004

To search a new porcine pheromonal odorants, this research for biostimulation and role of pheromone was augmented by means of "control system technologies" to offer a potentially useful and practical way to improve reproductive efficiency in livestock species. Therefore the 13 physicochemical parameters such as similarity indice (S), hydrophobicity (logP) and van der Waals molecule volume (MV) etc. of 54 steroid analogues, which are analogous of substrate molecules, 5$\alpha$-androst-16-en-3-one (P1) and 5$\alpha$-androst-16-en-3-ol (P2) of lipocalin as receptor of pig pheromones were calculated and discussed. The physicochemical properties of these steroid analogues were mainly followed by steric dissimilar of A and D ring in steroid nucleus. And we found that from correlation with S values and MV constants of molecules, the more MV constants are small, the more S values tend to approach 1. Based on this results, the S-values of 4-androsten-3,17-dione (P1-1) and 5 $\alpha$ -androstan-3-one (P2-1) were 1.0, respectively. The two compounds of them were chosen because they showed the same value each other at a side of hydrophobicity, molar refractivity and molecular volume. It is expected that the new two compounds will be able to substitute for P1 and P2, porcine pheromonal odorants.