• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.37 no.4
• /
• pp.29-34
• /
• 2000

This paper presents a new indexing technique, for the fast content-based image browsing and retrieval in a database. By applying the rosette pattern that has more sample lines in the vicinity of center than those m the outer parts, we can get global gray distribution features as well as local positional information. These features are transformed into histogram and used as database indices. From the simulation results, the proposed method clearly shows the validity and the efficiency in respect of memory space as well as a good retrieval performance.

• Journal of KIISE:Databases
• /
• v.31 no.2
• /
• pp.174-182
• /
• 2004

In order to produce information the author usually reference other authors' work. A citation index leads users to papers by citations. Citations lead the user to desired information. In this paper, KSCI(Korea Science Citation Index) which defines the relationships between citing documents and cited documents has been constructed. KSCI System is to solve problems for recursive retrieval in ISI's SCI(Science Citation Index) Path Encoding Indexing technique was used to solve the problems. From the analysis of data, this system has efficiency about 8.98% in the aspect of data storage. In the aspect of retrieval, there was efficiency between citing documents and cited documents, especially there was over 40% of efficiency in the retrieval of cited documents. It is concluded that suggested KSCI system will provide efficient storage and retrieval system.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.4
• /
• pp.1-9
• /
• 2010

In the new generation of Web, commonly called "Web 2.0", blogging has facilitated the publishing information or his/her opinion on the web. Various blog retrieval algorithms have been proposed to search for blogs more effectively. However, actually keyword-based searching or link-analysis blog ranking system cannot satisfy the user's requirement. In this paper, we suggest a topic-based weighting blog retrieval system in which the links between blog writings and searching words are considered to improve the search results. Our system extracts topics from each blog and weights them much higher than other guide words. In the comparison with other systems, we see that the proposed topic-base system has better recall rate of search results.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.3A
• /
• pp.211-220
• /
• 2002

In this paper, we propose an efficient algorithm to compress simple computer cell animation at very low bit rate. The structure of proposed algorithm consists of intra frame coding and inter frame coding. In inter frame coding, animation is encoded by color quantization using a palette, rearrangement of index, ADPCM used in JPEG-LS, mapping, classification, and entropy coding. In interframe coding, classifying the characteristics of motion, animation is encoded by block based motion replenishment. Experimental results show that the proposed methods turns out to outperform conventional methods including Flash, FLC, Motion-JPEG, MPEG-1, and MPEG-4.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2012.11a
• /
• pp.984-986
• /
• 2012

디지털 정보량의 증가 추세에 맞추어 네트워크를 통해 자신의 데이터를 원격 저장소에 저장하고, 이를 다양한 디바이스를 통해 언제 어디서나 접근할 수 있는 클라우드스토리지 서비스가 등장하게 되었다. 이는 기존에 데이터를 휴대하기 위해 사용되던 이동식 저장매체와 달리 저장용량의 크기 제한이 없고, 저장매체를 소지해야 하는 문제점이 없어 많은 사용자로부터 사용되고 있다. 이러한 클라우드 스토리지에 여러 사용자의 데이터가 저장됨에 따라 클라우드 스토리지의 신뢰성 문제가 이슈화 되고 있다. 비윤리적인 관리자 및 공격자로부터 클라우드에 저장된 데이터를 안전하게 보호하기 위해 다양한 암호 기술을 클라우드 스토리지에 적용하려는 연구가 진행되고 있다. 하지만 기존의 검색가능 암호기술은 사용자가 저장하고자 하는 데이터를 직접 업로드하고, 해당 자료를 필요에 따라 공유 하고, 공유대상이 변화되는 클라우드 스토리지 환경에서 비효율성을 가지고 있어 실제 서비스에 적용하기 힘든 단점을 가지고 있다. 따라서 본 논문에서는 클라우드 컴퓨팅 환경을 고려하여 검색 가능한 암호화 색인 생성 및 이를 재암호화해 다른 사용자와 안전하게 공유할 수 있는 색인 관리 기법을 제안한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2013.11a
• /
• pp.1563-1566
• /
• 2013

최근 네트워크와 멀티미디어 관련 기술의 발달로 이미지 및 동영상과 같은 대용량 멀티미디어 데이터가 증가하고 있다. 이에 따라 대용량의 데이터에서 영상 정보의 효율적인 검색 방법이 요구 되고 있다. 하지만 기존의 전통적인 색인기술은 관리자가 영상을 직접 보면서 적절한 텍스트 내용을 입력하는 방법으로 시간이 많이 소요되며, 관리자의 성향에 따라 색인어의 입력이 다를 수 있어 검색시 오류를 발생시킬 수 있다. 따라서 본 논문에서는 영상으로부터 컬러 특징과 질감 특징을 추출하여 보다 효율적으로 내용 기반 영상 검색을 수행하는 방법을 제안한다. 실험을 통하여 다른 기존의 영상 검색 방법보다 검색 효율성에서 안정적이며 보다 나은 결과를 얻음을 확인한다.

• Journal of the Korean Society for Library and Information Science
• /
• v.38 no.1
• /
• pp.35-50
• /
• 2004

This study evaluated the applicability of the static hierarchic clustering model to clustering query results in OPAC. Two clustering methods(Between Average Linkage(BAL) and Complete Linkage(CL)) and two similarity coefficients(Dice and Jaccard) were tested on the query results retrieved from 16 title-based keyword searchings. The precision of optimal dusters was improved more than 100% compared with title-word searching. There was no difference between similarity coefficients but clustering methods in optimal cluster effectiveness. CL method is better in precision ratio but BAL is better in recall ratio at the optimal top-level and bottom-level clusters. However the differences are not significant except higher recall ratio of BAL at the top-level duster. Small number of clusters and long chain of hierarchy for optimal cluster resulted from BAL could not be desirable and efficient.

• The KIPS Transactions:PartD
• /
• v.13D no.1 s.104
• /
• pp.23-28
• /
• 2006

In this paper, a power-aware query processing using optimized distributed R-tree in a sensor network is proposed. The proposed technique is a new approach for processing range queries that uses spatial indexing. Range queries are most often encountered under sensor networks for computing aggregation values. The previous work just addressed the importance but didn't provide any efficient technique for processing range queries. A query processing scheme is thus designed for efficiently processing them. Each node in the sensor network has the MBR of the region where its children nodes and the node itself are located. The range query is evaluated over the region which intersects the geographic location of sensors. It ensures the maximum power savings by avoiding the communication of nodes not participating over the evaluation of the query.

• Journal of KIISE:Databases
• /
• v.33 no.7
• /
• pp.682-692
• /
• 2006

Searching for gene products which have similar biological functions are crucial for bioinformatics. Modern day biological databases provide the functional description of gene products using Gene Ontology(GO). In this paper, we propose a technique for semantic similarity search for gene products using the GO annotation information. For this purpose, an information-theoretic measure for semantic similarity between gene products is defined. And an algorithm for semantic similarity search using this measure is proposed. We adapt Fagin's Threshold Algorithm to process the semantic similarity query as follows. First, we redefine the threshold for our measure. This is because our similarity function is not monotonic. Then cluster-skipping and the access ordering of the inverted index lists are proposed to reduce the number of disk accesses. Experiments with real GO and annotation data show that GORank is efficient and scalable.

• Journal of KIISE
• /
• v.44 no.6
• /
• pp.613-620
• /
• 2017

Skyline queries are used extensively to solve various problems, such as in decision-making, because they find data that meet a variety of user criteria. Recent research has focused on skyline queries by using the MapReduce framework for large database processing, mainly in terms of applying existing index structures to MapReduce. In a skyline, data closer to the origin dominate more area. However, the existing index structure does not reflect such characteristics of the skyline. In this paper, we propose a grid-block structure that groups grid cells to match the characteristics of a skyline, and a two-level grid-block structure that can be used even when there are no data close to the origin. We also propose an efficient skyline-query algorithm that uses the two-level grid-block structure.