• Korean Journal of Remote Sensing
• /
• v.34 no.2_1
• /
• pp.301-306
• /
• 2018

Urbanization causes urban floods and urban heat island in the summer, so it is necessary to understanding the changes of the thermal environment through urban climate and energy balance. This can be explained by the energy balance, but in urban areas, unlike the typical energy balance, the storage heat flux saved in the building or artificial land cover should be considered. Since the environment of each city is different, there is a difficulty in applying the method of retrieving the storage heat flux of the previous research. Especially, most of the previous studies are focused on the overseas cities, so it is necessary to study the storage heat retrieval suitable for various land cover and building characteristics of the urban areas in Korea. Therefore, the object of this study, it is to derive the regression formula which can quantitatively retrieve the storage heat using the data of the area where various surface types exist. To this end, nonlinear regression analysis was performed using net radiation and surface temperature data as independent variables and flux tower based storage heat estimates as dependent variables. The retrieved regression coefficients were applied to each independent variable to derive the storage heat retrieval regression formula. As a result of time series analysis with flux tower based storage heat estimates, it was well simulated high peak at day time and the value at night. Moreover storage heat retrieved in this study was possible continuous retrieval than flux tower based storage heat estimates. As a result of scatter plot analysis, accuracy of retrieved storage heat was found to be significant at $50.14Wm^{-2}$ and bias $-0.94Wm^{-2}$.

• Journal of Internet Computing and Services
• /
• v.16 no.4
• /
• pp.39-50
• /
• 2015

In information retrieval process through search engine, some users want to retrieve several documents that are corresponding with specific time period situation. For example, if user wants to search a document that contains the situation before 'Japanese invasions of Korea era', he may use the keyword 'Japanese invasions of Korea' by using searching query. Then, search engine gives all of documents about 'Japanese invasions of Korea' disregarding time period in order. It makes user to do an additional work. In addition, a large percentage of cases which is related to historical documents have different time period between generation date of a document and record time of contents. If time period in document contents can be extracted, it may facilitate effective information for retrieval and various applications. Consequently, we pursue a research extracting time period of Joseon era's historical documents by using historic literature for Joseon era in order to deduct the time period corresponding with document content in this paper. We define historical objects based on historic literature that was collected from web and confirm a possibility of extracting time period of web document by machine learning techniques. In addition to the machine learning techniques, we propose and apply the similarity filtering based on the comparison between the historical objects. Finally, we'll evaluate the result of temporal indexing accuracy and improvement.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.10 no.10
• /
• pp.1145-1156
• /
• 2015

There is a shortage of mobile application systems readily applicable to the field of crop cultivation in relation to diseases and insect pests directly connected to the quality of crops. Most of system have been devoted to diseases and insect pests that would offer full predictions and basic information about diseases and insect pests currently. But for lack of the instant diagnostic functions seriously and the field of crop cultivation, we design and implement a crop cultivation field-oriented smart diseases and insect pests information retrieval system based on mobile for u-Farm. The proposed system had such advantages as providing information about diseases and insect pests in the field of crop cultivation and allowing the users to check the information with their smart-phones real-time based on the Lucene, a search library useful for the specialized analysis of images, and JSON data structure. And it was designed based on object-oriented modeling to increase its expandability and reusability. It was capable of search based on such image characteristic information as colors as well as the meta-information of crops and meta-information-based texts. The system was full of great merits including the implementation of u-Farm, the real-time check, and management of crop yields and diseases and insect pests by both the farmers and cultivation field managers.

• Journal of the Korean BIBLIA Society for library and Information Science
• /
• v.24 no.4
• /
• pp.75-90
• /
• 2013

Given the context that users are actively using social media with multimedia embedded information, the purpose of this study is to demonstrate how images are used within Twitter messages, especially in influential and favorited messages. In order to achieve the purpose of this study, the top 200 influential and favorited messages with images were selected out of 1,589 tweets related to "Boston bombing" in April 2013. The characteristics of the message, image use, and user are analyzed and compared. Two phases of the analysis were conducted on three data sets containing the top 200 influential messages, top 200 favorited messages, and general messages. In the first phase, coding schemes have been developed for conducting three categorical analyses: (1) categorization of tweets, (2) categorization of image use, and (3) categorization of users. The three data sets were then coded using the coding schemes. In the second phase, comparison analyses were conducted among influential, favorited, and general tweets in terms of tweet type, image use, and user. While messages expressing opinion were found to be most favorited, the messages that shared information were recognized as most influential to users. On the other hand, as only four image uses - information dissemination, illustration, emotive/persuasive, and information processing - were found in this data set, the primary image use is likely to be data-driven rather than object-driven. From the perspective of users, the user types such as government, celebrity, and photo-sharing sites were found to be favorited and influential. An improved understanding of how users' image needs, in the context of social media, contribute to the body of knowledge of image needs. This study will also provide valuable insight into practical designs and implications of image retrieval systems or services.

• The KIPS Transactions:PartD
• /
• v.12D no.2 s.98
• /
• pp.233-246
• /
• 2005

To enhance the user response time of content-based retrieval service for multimedia information, several multi-dimensional index schemes have been proposed. M-tree, a well-known multidimensional index scheme is of metric space access method, and is based on the distance between objects in the metric space. However, since the overlap between index spaces of nodes might enlarge the number of nodes of M-tree accessed for query processing, the user response time for content-based multimedia information retrieval grows longer. In this paper, we propose a node split algorithm which is able to reduce the sire of overlap between index spaces of nodes in M-tree. In the proposed scheme, we choose a virtual center point as the routing object and entry redistribution as the postprocessing after node split in order to reduce the radius of index space of a node, and finally in order to reduce the overlap between the index spaces of routing nodes. From the experimental results, we can see the proposed split algorithm reduce the overlap between index space of nodes and finally enhance the user response time for similarity-based query processing.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.47 no.2
• /
• pp.21-28
• /
• 2010

This paper reports an experimental result on optimizing dissimilarity-based classification(DBC) by simultaneously using a dynamic time warping(DTW) and a multiple fusion strategy(MFS). DBC is a way of defining classifiers among classes; they are not based on the feature measurements of individual samples, but rather on a suitable dissimilarity measure among the samples. In DTW, the dissimilarity is measured in two steps: first, we adjust the object samples by finding the best warping path with a correlation coefficient-based DTW technique. We then compute the dissimilarity distance between the adjusted objects with conventional measures. In MFS, fusion strategies are repeatedly used in generating dissimilarity matrices as well as in designing classifiers: we first combine the dissimilarity matrices obtained with the DTW technique to a new matrix. After training some base classifiers in the new matrix, we again combine the results of the base classifiers. Our experimental results for well-known benchmark databases demonstrate that the proposed mechanism achieves further improved results in terms of classification accuracy compared with the previous approaches. From this consideration, the method could also be applied to other high-dimensional tasks, such as multimedia information retrieval.

• Journal of KIISE:Computing Practices and Letters
• /
• v.11 no.3
• /
• pp.209-215
• /
• 2005

Conventional ORDBMS vendors provide extension mechanisms for adding user-defined types and functions to their own DBMSs. Here, the extension mechanisms are implemented using a high-level interface. We call this technique loose-coupling. The advantage of loose-coupling is that it is easy to implement. However, it is not preferable for implementing new data types and operations in large databases when high Performance is required. In this paper, we propose to use the notion of tight-coupling to satisfy this requirement. In tight-coupling, new data types and operations are integrated into the core of the DBMS engine. Thus, they are supported in a consistent manner with high performance. This tight-coupling architecture is being used to incorporate information retrieval(IR) features and spatial database features into the Odysseus/IR ORDBMS that has been under development at KAIST/AITrc. In this paper, we introduce Odysseus/IR and explain its tightly-coupled IR features (U.S. patented). We then demonstrate a web search engine that is capable of managing 20 million web pages in a non-parallel configuration using Odysseus/IR.

• The Journal of the Convergence on Culture Technology
• /
• v.8 no.6
• /
• pp.703-708
• /
• 2022

Tables and figures in academic literature contain important and valuable information. Tables and figures represent the essence of the refined study, which is the closest to the raw dataset. If so, can researchers easily access and utilize these image data through the search system? In this study, we try to identify user perceptions and needs for image data through user and case studies. Through this study we also explore expected effects and utilizations of image search systems. It was found that the majority of researchers prefer a system that combines table and figure indexing functions with traditional search functions. They valued the provision of an advanced search function that would allow them to limit their searches to specific object types (pictures and tables). Overall, researchers discovered many potential uses of the system for indexing tables and figures. It has been shown to be helpful in finding special types of information for teaching, presentation, research and learning. It should be also noticed that the usefulness of these systems is highest when features are integrated into existing systems, seamlessly link to fulltexts, and include high-quality images with full captions. Expected effects and utilizations for user-centered image search systems are also discussed.

• Journal of Intelligence and Information Systems
• /
• v.18 no.2
• /
• pp.47-60
• /
• 2012

Video data comes in the form of the unstructured and the complex structure. As the importance of efficient management and retrieval for video data increases, studies on the video parsing based on the visual features contained in the video contents are researched to reconstruct video data as the meaningful structure. The early studies on video parsing are focused on splitting video data into shots, but detecting the shot boundary defined with the physical boundary does not cosider the semantic association of video data. Recently, studies on structuralizing video shots having the semantic association to the video scene defined with the semantic boundary by utilizing clustering methods are actively progressed. Previous studies on detecting the video scene try to detect video scenes by utilizing clustering algorithms based on the similarity measure between video shots mainly depended on color features. However, the correct identification of a video shot or scene and the detection of the gradual transitions such as dissolve, fade and wipe are difficult because color features of video data contain a noise and are abruptly changed due to the intervention of an unexpected object. In this paper, to solve these problems, we propose the Scene Detector by using Color histogram, corner Edge and Object color histogram (SDCEO) that clusters similar shots organizing same event based on visual features including the color histogram, the corner edge and the object color histogram to detect video scenes. The SDCEO is worthy of notice in a sense that it uses the edge feature with the color feature, and as a result, it effectively detects the gradual transitions as well as the abrupt transitions. The SDCEO consists of the Shot Bound Identifier and the Video Scene Detector. The Shot Bound Identifier is comprised of the Color Histogram Analysis step and the Corner Edge Analysis step. In the Color Histogram Analysis step, SDCEO uses the color histogram feature to organizing shot boundaries. The color histogram, recording the percentage of each quantized color among all pixels in a frame, are chosen for their good performance, as also reported in other work of content-based image and video analysis. To organize shot boundaries, SDCEO joins associated sequential frames into shot boundaries by measuring the similarity of the color histogram between frames. In the Corner Edge Analysis step, SDCEO identifies the final shot boundaries by using the corner edge feature. SDCEO detect associated shot boundaries comparing the corner edge feature between the last frame of previous shot boundary and the first frame of next shot boundary. In the Key-frame Extraction step, SDCEO compares each frame with all frames and measures the similarity by using histogram euclidean distance, and then select the frame the most similar with all frames contained in same shot boundary as the key-frame. Video Scene Detector clusters associated shots organizing same event by utilizing the hierarchical agglomerative clustering method based on the visual features including the color histogram and the object color histogram. After detecting video scenes, SDCEO organizes final video scene by repetitive clustering until the simiarity distance between shot boundaries less than the threshold h. In this paper, we construct the prototype of SDCEO and experiments are carried out with the baseline data that are manually constructed, and the experimental results that the precision of shot boundary detection is 93.3% and the precision of video scene detection is 83.3% are satisfactory.

• Journal of Internet Computing and Services
• /
• v.3 no.1
• /
• pp.81-90
• /
• 2002

Large-scale distributed applications based on Internet and client/server applications have to deal with series of problems. Load balancing, unpredictable communication delays, and networking failures can be the example of the series of problems. Therefore. sophisticated applications such as teleconferencing, video-on-demand, and concurrent software engineering require an abstracted group communication, CORBA does not address these paradigms adequately. It mainly deals with point-to-point communication and does not support the development of reliable applications that include predictable behavior in distributed systems. In this paper, we present our design, implementation and performance analysis of the group communication using the CORBA-ORB. JAVA-RML and Socket based on distributed computing Performance analysis will be estimated latency-lime according to object increment, in case of group communication using ORB of CORBA the average is 14.5172msec, in case of group communication using RMI of Java the average is 21.4085msec, in case of group communication using socket the average is becoming 18.0714msec. Each group communication using multicast and UDP can be estimated 0.2735msec and 0.2157msec. The performance of the CORBA-ORB group communication is increased because of the increased object by the result of this research. This study can be applied to the fault-tolerant client/server system, group-ware. text retrieval system, and financial information systems.