• Journal of the Korean earth science society
• /
• v.27 no.1
• /
• pp.83-94
• /
• 2006

The objective of this paper is to extract and analyze the sediment environment change information in the Sachencheon, Gangneung, Korea that was seriously damaged as a result of typhoon Rusa aftermath early in September, 2002 using multi-temporal remote sensing data. For the extraction of change information, an unsupervised approach based on the automatic determination of thresholding values was applied. As the change detection results, turbidity changes right after typhoon Rusa, the decrease of wetlands, the increase of dry sand and channel width and changes of relative level in the stream due to seasonal variation were observed. Sedimentation in the cultivated areas and restoration works also affected the change near the Sacheoncheon. In addition to the change detection analysis, several environmental thematic maps including microtopographic map, distributions of estimated amount of flood deposits and flood hazard landform classification map were generated by using remote sensing and field survey data. In conclusion, multi-temporal remote sensing data can be effectively used for natural hazard analysis and damage information extraction and specific data processing techniques for high-resolution remote sensing data should also be developed.

• The KIPS Transactions:PartB
• /
• v.12B no.6 s.102
• /
• pp.637-646
• /
• 2005

Most of the multimedia contents for DBM services art provided as MPEG-2 bit streams. However, they have to be transcoded to H.264 bit streams for practical services because the standard video codec for DMB is H.264. The existing transcoder architecture is Cascaded Pixel-Domain Transcoding Architecture, which consists of the MPEG-2 dacoding phase and the H.264 encoding phase. This architecture can be easily implemented using MPEG-2 decoder and H.264 encoder without source modifying. However. It has disadvantages in transcoding time and DCT-mismatch problem. In this paper, we propose two kinds of transcoder architecture, DCT-OPEN and DCT-CLOSED, to complement the CPDT architecture. Although DCT-OPEN has lower PSNR than CPDT due to drift problem, it is efficient for real-time transcoding. On the contrary, the DCT-CLOSED architecture has the advantage of PSNR over CPDT at the cost of transcoding time.

• The KIPS Transactions:PartB
• /
• v.11B no.1
• /
• pp.27-34
• /
• 2004

This paper proposes a method to trace and interpret a moving object based on the information which can be directly obtained from MPEG-2 compressed video stream without decoding process. In the proposed method, the motion flow is constructed from the motion vectors included in compressed video. We calculate the amount of pan, tilt, and zoom associated with camera operations using generalized Hough transform. The local object motion can be extracted from the motion flow after the compensation with the parameters related to the global camera motion. Initially, a moving object to be traced is designated by user via bounding box. After then automatic tracking Is performed based on the accumulated motion flows according to the area contributions. Also, in order to reduce the cumulative tracking error, the object area is reshaped in the first I-frame of a GOP by matching the DCT coefficients. The proposed method can improve the computation speed because the information can be directly obtained from the MPEG-2 compressed video, but the object boundary is limited by macro-blocks rather than pixels. Also, the proposed method is proper for approximate object tracking rather than accurate tracing of an object because of limited information available in the compressed video data.

• Journal of KIISE:Databases
• /
• v.37 no.1
• /
• pp.1-11
• /
• 2010

Recently, there has been a growing interest in the processing of continuous queries over multiple data streams. When the arrival rates of tuples exceed the memory capacity of the system, a load shedding technique is used to avoid the system becoming overloaded by dropping some subset of input tuples. In this paper, we propose an effective load shedding algorithm for multi-way windowed joins over multiple data streams. Most previous load shedding algorithms estimate the productivity of each tuple, i.e., the number of join output tuples produced by the tuple, based on its "join attribute value" and drop tuples with the lowest productivity. However, the productivity of a tuple cannot be accurately estimated from its join attribute value when the join attribute values are unique and do not repeat, or the distribution of the join attribute values changes over time. For these cases, we estimate the productivity of a tuple based on its "arrival order" on data streams, rather than its join attribute value. The proposed method can effectively estimate the productivity of a tuple even when the productivity of a tuple cannot be accurately estimated from its join attribute value. Through extensive experiments and analysis, we show that our proposed method outperforms the previous methods in terms of effectiveness and efficiency.

• KIPS Transactions on Software and Data Engineering
• /
• v.7 no.3
• /
• pp.113-120
• /
• 2018

In this study, we proposed a monitoring system for identifying and handling faulty sensing stream data on manufacturing equipments where low-cost sensors can be safely used. Low cost sensors will lessen the cost of implementing distributed monitoring system, but suffer from sensor noises and inaccurate sensed data. Therefore, a distributed monitoring system with low cost sensors should identify faulty signal data as either of sensor fault or machine fault, and filter out faulty signals from sensing fault. To this end, we adopted a fourier transform based diagnostic approach mixed with a weighed moving averaging method, in order to identify faulty signals. We measured how effective our approach is and found out our approach can filter out one-third faulty signals from our experimental environment. In addition, we attached wireless communication modules to reduce sensor and network installation cost. To handle massive sensor data efficiently, we employed unstructured data format with NoSQL based database.

• The KIPS Transactions:PartA
• /
• v.10A no.6
• /
• pp.691-700
• /
• 2003

Due to the fast development of wire&wireless internet and computer hardware, more and more internet services are being developed, such as Internet broadcast, VoD (Video On Demand), etc. So QoS (Qualify of Service) is essentially needed to guarantee the quality of these services. Traditional Internet is Best-Effort service in which all packets are transported in FIFO (First In First Out) style. However, FIFO is not suitable to guarantee the quality of some services, so more research in QoS router and QoS protocol are needed. Researched QoS router and protocol are high cost and inefficient because the existing infra is not used. To solve this problem, a new QoS control method, named Network Adaptive QoS, is introduced and applied to client/server-based streaming systems. Based on network bandwidth monitoring mechanism, network adaptive QoS control method can be used in wire&wireless networks to support QoS in real-time streaming system. In order to reduce application cost, the existing streaming service is used in NAQoS. A new module is integrated into the existing server and client. So the router and network line are not changed. By simulation in heavy traffic network conditions, we proved that stream cannot be seamless without network adaptive QoS method.

• The KIPS Transactions:PartC
• /
• v.15C no.6
• /
• pp.573-586
• /
• 2008

The improved performance and miniaturization of computer and the improvement of wireless communication technology have enabled the emergence of many high quality services. Among them multicast services are receiving much attention and their usage is increasing due to the increase of Internet multimedia services such as video conference, multimedia stream, internet TV, etc. Security plays an important role in mobile multicast services. In this paper, we proposed a secure multicast protocol for a hierarchical micro-mobility environment. The proposed secure multicast protocol provides security services such as authentication, access control, confidentiality and integrity using mechanisms including symmetric/asymmetric key crypto-algorithms and capabilities. To provide forward/backward secrecy and scalability, we used sub-group keys based on the hierarchical micro-mobility environment. With this security services, it is possible to guard against all kinds of security attacks performed by illegal mobile nodes. Attacks executed by internal nodes can be thwarted except those attacks which delete packet or cause network resources to be wasted. We used simulator to measure the performance of proposed protocol. As a result, the simulation showed that effect of these security mechanisms on the multicast protocol was not too high.

• KIPS Transactions on Software and Data Engineering
• /
• v.5 no.4
• /
• pp.171-180
• /
• 2016

As social networking services such as twitter become increasingly popular, data streams are widely prevalent these days. In order to search data accumulated from data streams efficiently, the use of an index structure is essential. In this paper, we propose an update-efficient, disk-based inverted index structure for efficient keyword search on data streams. When new data arrive at the data stream, the index needs to be updated to incorporate the new data. The traditional inverted index is very inefficient to update in terms of disk I/O, because all index data stored in the disk need to be read and written to the disk each time the index is updated. To solve this problem, we divide the whole inverted index into a sequence of inverted indices with exponentially increasing size. When new data arrives, it is first inserted into the smallest index and, later, the small indices are merged with the larger indices, which leads to a small amortize update cost for each new data. Furthermore, when indices stored in the disk are merged with each other, we minimize the disk I/O cost incurred for the merge operation, resulting in an even smaller update cost. Through various experiments, we compare the update efficiency of the proposed index structure with the previous one, and show the performance advantage of the proposed structure in terms of the update cost.

• Journal of The Korean Digital Architecture Interior Association
• /
• v.2 no.1
• /
• pp.9-15
• /
• 2002

As architectural forms tend to be large-scaled, high-storied and complicated, use of computer for processing design information has been generalized. However, CAD use in the process of developing architectural design has been neglected greatly in the educational field of architectural field due to the surging of recognition that it may limit the essential property of architectural design. It may be resulted from the limitation of CAD system, that is, it is because of tardy speed of application development for the related areas with the lack of simplicity and clarity of flexibility to be secured on the drawing and user interface. Recent CAD systems, however, overcome such a limitation, convert into object-based design from entity-based drawing, drafting and modeling for implementing design concept of architects and it connects with internet linked to superspeed information communication network and changes process and stream of architectural design. Therefore, this study deals with utility of object based CAD system with products of Autodesk Co. and consequently obtain the following conclusions. First, it expands architect's design areas by supporting cooperative design system based on model-based architectural design and internet. Second, it reduces consumption of personal and material resources and time in the process of drawing production for improving architectural design works. Third, it can reduce the frequent design changes by improving understanding of architectural space with visualization of immediate 3D information, escaping from traditional methods to deliver design information to building owner through 2D drawing or model and perspective drawing requiring much cost and time. Fourth, it keeps exactness without omission or duplication of design information and generate and renew information of all related drawings on a drawing. Fifth, it is possible to change difficult and boring architectural design work into a pleasure owing to immediate modeling and drawing of design idea. In addition, digital drawing generated by using object-based CAD system can playa role of establishing Urban Information System to be used for protecting from building in disaster and urban disasters in connection with GIS numerical map and be used for reference of all kinds of information required fro post-management of buildings. However, what is more important is that surplus time from introduction of object-based CAD system should be used for consideration to be recognized as a good space and building built as a product of this project for comfort to urban people.

• Journal of KIISE:Databases
• /
• v.34 no.2
• /
• pp.166-178
• /
• 2007

The ALE specification of EPCglobal is leading the development of RFID standards, includes the Event Cycle Specification (ECSpec) describing how long a cycle is, how to filter RFID tag data and which reader is interested in. The ECSpec is a specification for filtering and collecting RFID tag data. It is registered to a middleware for long time and is evaluated to return results satisfying the requirements included in it. Thus, it is quite similar to the continuous query. It can be transformed into a continuous query as its predicate in WHERE clause is characterized by the long interval. Long intervals cause problems deteriorating insertion and search performance of existing query indices. In this paper, we propose a TLC-index as a new query index structure for long interval data. The TLC-index has hybrid structure that uses the cell construct of CQI-index with the virtual construct of VCR-index for partitioning long intervals. The TLC-index can reduce the storage cost and improve the insertion performance through decomposing long intervals into one or more cell constructs that have long size. It can also improve the search performance through decomposing short intervals into one or more virtual constructs that have short size enough to fit into those intervals.