• Journal of the Institute of Convergence Signal Processing
• /
• v.4 no.1
• /
• pp.1-8
• /
• 2003

Various methods have been studying to maintain and apply the multimedia inform abruptly increasing over all social fields, in recent years. For retrieval of still images, we is implemented content-based image retrieval system in this paper that make possible to retrieve similar objects from image database after segmenting query object from background if user request query. Query image is processed median filtering to remove noise first and then object edge is detected it by canny edge detection. And query object is segmented from background by using convex hull. Similarity value can be obtained by means of histogram intersection with database image after securing color histogram from segmented image. Also segmented image is processed gray convert and wavelet transform to extract spacial gray distribution and texture feature. After that, Similarity value can be obtained by means of banded autocorrelogram and energy. Final similar image can be retrieved by adding upper similarity values that it make possible to not only robust in background but also better correct object retrieval by using object segmentation method.

• Journal of Convergence Society for SMB
• /
• v.1 no.1
• /
• pp.39-44
• /
• 2011

Recently, due to people's incontinent use all over the world, fossil fuels such as coal, oil, and natural gas were nearly to be exhausted and also causes serious environment pollutions. Therefore, there is a strong need to develop solar, wind, hydro, biomass, geothermal to replace fossil fuels to prevent suffering from above problems. Wish advances in sensor technology, such data is collected as a kind of stream data which arrives in an online manner so that it is characterized as high- speed, real-time and unbounded and it requires fast data processing to get the up-to-date results. Therefore, the traditional data processing techniques are not fit to deal with stream data. In this paper, we propose a kalman filter-based algorithm to process renewable stream data.

• Journal of KIISE:Databases
• /
• v.37 no.3
• /
• pp.165-170
• /
• 2010

This paper proposes an in-network join strategy SBJ(Semi & Bloom Join), an efficient join strategy for sensor networks, that minimizes communication cost. SBJ is a hybrid join strategy that can reduce energy consumption by using a bloom filter to reduce the size of data that needs to be sent or received in sensor network. The key to reducing the communication cost in SBJ is to eliminate data not involved in the join result in the early stages of join processing. Through simulation, the paper shows that compared to other join strategies in sensor network, SBJ join strategy is more efficient in reducing the communication cost resulting in a significant reduction in battery consumption.

• The KIPS Transactions:PartD
• /
• v.15D no.3
• /
• pp.399-410
• /
• 2008

This paper suggests a new retrieval method using weighted vector sum to resolve a problem of traditional location-based retrieval method, nearest neighbor (NN) query, and NN query using direction. The proposed method filters out data with the radius, and then the remained retrieval area is filtered by a direction information compounded of a user's moving direction, a pre-fixed interesting direction, and a pre-fixed retrieval angle. The moving direction is computed from a vector or a weighted vector sum of several vectors using a weight to adopt several cases. The retrieval angle can be set from traditional $360^{\circ}$ to any degree you want. The retrieval data for this method can be a still and moving image recorded shooting location, and also several type of media like text, web, picture offering to customer with location of company or resort. The suggested method guarantees more accurate retrieval than traditional location-based retrieval methods because that the method selects data within the radius and then removes data of useless areas like passed areas or an area of different direction. Moreover, this method is more flexible and includes the direction based NN.

• The Journal of Society for e-Business Studies
• /
• v.15 no.3
• /
• pp.131-145
• /
• 2010

Until now, popular paradigms to provide e-catalog documents that are adapted to users' needs are keyword search or collaborative filtering based recommendation. Since users' queries are too short to represent what users want, it is hard to provide the users with e-catalog documents that are adapted to their needs(i.e., queries and preferences). Although various techniques have beenproposed to overcome this problem, they are based on index term matching. A conventional Bayesian belief network-based approach represents the users' needs and e-catalog documents with their corresponding concepts. However, since the concepts are the index terms that are extracted from the e-catalog documents, it is hard to represent relationships between concepts. In our work, we extend the conventional Bayesian belief network based approach to represent users' needs and e-catalog documents with a concept network which is derived from the Web directory. By exploiting the concept network, it is possible to search conceptually relevant e-catalog documents although they do not contain the index terms of queries. Furthermore, by computing the conceptual similarity between users, we can exploit a semantic collaborative filtering technique for recommending e-catalog documents.

• Journal of KIISE:Databases
• /
• v.35 no.2
• /
• pp.143-154
• /
• 2008

RFID events are large volume of stream data which come out continuously. Many studies have been done to detect a business event in RFID stream. However, the existing methods have many problems which increase unnecessary operations when business events do not satisfy minimum conditions. In this paper, to remove unnecessary operations, we define the minimum condition of business events and propose an efficient method that detects business events only when the minimum condition is satisfied. To check the minimum condition of business events, we register business queries in a query index. We detect business events using the query index and bitmap. It is shown through various experiment that the proposed method outperforms the existing methods.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.1
• /
• pp.31-40
• /
• 2012

u-GIS DSMSs have been researched to deal with various sensor data from GeoSensors in ubiquitous environment. Also, they has been more important for high availability. The data from GeoSensors have some characteristics that increase explosively. This characteristic could lead memory overflow and data loss. To solve the problem, various load shedding methods have been researched. Traditional methods drop the overloaded tuples according to a particular criteria in a single server. Tuple deletion sensitive queries such as aggregation is hard to satisfy accuracy. In this paper a dual processing load shedding method is suggested to improve the accuracy of aggregation in clustering environment. In this method two nodes use replicated stream data for high availability. They process a stream in two nodes by using a characteristic they share stream data. Stream data are synchronized between them with a window as a unit. Then, processed results are merged. We gain improved query accuracy without data loss.

• Journal of Intelligence and Information Systems
• /
• v.13 no.1
• /
• pp.1-14
• /
• 2007

Character images for the background screen of cell phones are one of the fast growing sectors of the mobile content market. However, character image buyers currently experience tremendous difficulties in searching for desired images due to the awkward image search process. Content-based image retrieval (CBIR) widely used for image retrieval could be a good candidate as a solution to this problem, but it needs to overcome the limitation of the mobile Internet environment where an initial query set (IQS) cannot be easily provided as in the PC-based environment. We propose a new approach, IQS-AutoGen, which automatically generates an initial query set for CBIR on the mobile Internet. The approach applies the collaborative filtering (CF), a well-known recommendation technique, to the CBIR process by using users' preference information collected during the relevance feedback process of CBIR. The results of the experiment using a PC-based prototype system show that the proposed approach successfully satisfies the initial query requirement of CBIR in the mobile Internet environment, thereby outperforming the current image search process on the mobile Internet.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.12
• /
• pp.938-942
• /
• 2009

In this paper, we propose a novel filtering method for processing continuous skyline queries on wireless sensor network environments. The existing filtering methods use the filter based on router paths. However, because these filters are applied not to a whole area but to a partial area, these methods send almost data of sensor nodes to transmit to the base station and have no sufficient effect in terms of energy efficiency. Therefore, we propose an efficient method to dramatically reduce the transmission data of sensors through applying a low-cost and effective filter to all sensor nodes. The proposed effective filter is generated by using characteristics such as the data locality and the clustering of sensors. An extensive performance study verifies the merits of our new method.

• Journal of the Korean Society for information Management
• /
• v.30 no.3
• /
• pp.23-48
• /
• 2013

This study compared and analyzed 15 CBMR (Content-based Music Retrieval) systems accessible on the web in terms of DB size and type, query type, access point, input and output type, and search functions, with reviewing features of music information and techniques used for transforming or transcribing of music sources, extracting and segmenting melodies, extracting and indexing features of music, and matching algorithms for CBMR systems. Application of text information retrieval techniques such as inverted indexing, N-gram indexing, Boolean search, truncation, keyword and phrase search, normalization, filtering, browsing, exact matching, similarity measure using edit distance, sorting, etc. to enhancing the CBMR; effort for increasing DB size and usability; and problems in extracting melodies, deleting stop notes in queries, and using solfege as pitch information were found as the results of analysis.