• Title/Summary/Keyword: multimedia processing

Search Result 2,473, Processing Time 0.031 seconds

Detection of Complex Event Patterns over Interval-based Events (기간기반 복합 이벤트 패턴 검출)

  • Kang, Man-Mo;Park, Sang-Mu;Kim, Sank-Rak;Kim, Kang-Hyun;Lee, Dong-Hyeong
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.12 no.4
    • /
    • pp.201-209
    • /
    • 2012
  • The point-based complex event processing handled an instantaneous event by using one time stamp in each event. However, the activity period of the event plays the important role in the field which is the same as the finance, multimedia, medicine, and meteorology. The point-based event is insufficient for expressing the complex temporal relationship in this field. In the application field of the real-time world, the event has the period. The events more than two kinds can be temporally overlapped. In addition, one event can include the other event. The relation about the events of kind of these can not be successive like the point-based event. This thesis designs and implements the method detecting the patterns of the complex event by using the interval-based events. The interval-based events can express the overlapping relation between events. Furthermore, it can include the others. By using the end point of beginning and end point of the termination, the operator of interval-based events shows the interval-based events. It expresses the sequence of the interval-based events and can detect the complex event patterns. This thesis proposes the algorithm using the active instance stack in order to raise efficiency of detection of the complex event patterns. When comprising the event sequence, this thesis applies the window push down technique in order to reduce the number of intermediate results. It raises the utility factor of the running time and memory.

Implementation of High-Throughput SHA-1 Hash Algorithm using Multiple Unfolding Technique (다중 언폴딩 기법을 이용한 SHA-1 해쉬 알고리즘 고속 구현)

  • Lee, Eun-Hee;Lee, Je-Hoon;Jang, Young-Jo;Cho, Kyoung-Rok
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.47 no.4
    • /
    • pp.41-49
    • /
    • 2010
  • This paper proposes a new high speed SHA-1 architecture using multiple unfolding and pre-computation techniques. We unfolds iterative hash operations to 2 continuos hash stage and reschedules computation timing. Then, the part of critical path is computed at the previous hash operation round and the rest is performed in the present round. These techniques reduce 3 additions to 2 additions on the critical path. It makes the maximum clock frequency of 118 MHz which provides throughput rate of 5.9 Gbps. The proposed architecture shows 26% higher throughput with a 32% smaller hardware size compared to other counterparts. This paper also introduces a analytical model of multiple SHA-1 architecture at the system level that maps a large input data on SHA-1 block in parallel. The model gives us the required number of SHA-1 blocks for a large multimedia data processing that it helps to make decision hardware configuration. The hs fospeed SHA-1 is useful to generate a condensed message and may strengthen the security of mobile communication and internet service.

Implementation of a QoS routing path control based on KREONET OpenFlow Network Test-bed (KREONET OpenFlow 네트워크 테스트베드 기반의 QoS 라우팅 경로 제어 구현)

  • Kim, Seung-Ju;Min, Seok-Hong;Kim, Byung-Chul;Lee, Jae-Yong;Hong, Won-Taek
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.48 no.9
    • /
    • pp.35-46
    • /
    • 2011
  • Future Internet should support more efficient mobility management, flexible traffic engineering and various emerging new services. So, lots of traffic engineering techniques have been suggested and developed, but it's impossible to apply them on the current running commercial Internet. To overcome this problem, OpenFlow protocol was proposed as a technique to control network equipments using network controller with various networking applications. It is a software defined network, so researchers can verify their own traffic engineering techniques by applying them on the controller. In addition, for high-speed packet processing in the OpenFlow network, programmable NetFPGA card with four 1G-interfaces and commercial Procurve OpenFlow switches can be used. In this paper, we implement an OpenFlow test-bed using hardware-accelerated NetFPGA cards and Procurve switches on the KREONET, and implement CSPF (Constraint-based Shortest Path First) algorithm, which is one of popular QoS routing algorithms, and apply it on the large-scale testbed to verify performance and efficiency of multimedia traffic engineering scheme in Future Internet.

Dynamic Distributed Adaptation Framework for Quality Assurance of Web Service in Mobile Environment (모바일 환경에서 웹 서비스 품질보장을 위한 동적 분산적응 프레임워크)

  • Lee, Seung-Hwa;Cho, Jae-Woo;Lee, Eun-Seok
    • The KIPS Transactions:PartD
    • /
    • v.13D no.6 s.109
    • /
    • pp.839-846
    • /
    • 2006
  • Context-aware adaptive service for overcoming the limitations of wireless devices and maintaining adequate service levels in changing environments is becoming an important issue. However, most existing studies concentrate on an adaptation module on the client, proxy, or server. These existing studies thus suffer from the problem of having the workload concentrated on a single system when the number of users increases md, and as a result, increases the response time to a user's request. Therefore, in this paper the adaptation module is dispersed and arranged over the client, proxy, and server. The module monitors the contort of the system and creates a proposition as to the dispersed adaptation system in which the most adequate system for conducting operations. Through this method faster adaptation work will be made possible even when the numbers of users increase, and more stable system operation is made possible as the workload is divided. In order to evaluate the proposed system, a prototype is constructed and dispersed operations are tested using multimedia based learning content, simulating server overload and compared the response times and system stability with the existing server based adaptation method. The effectiveness of the system is confirmed through this results.

A Study on Framework to offer the differentiated Optical QoS Service in the Next-Generation WDM Optical Internet Backbone Network (차세대 WDM 광 인터넷 백본망에서 차등화된 광 QoS 서비스 제공 프레임워크 연구)

  • Kim Yong-Seoug;Ryu Shi-Kook;Lee Jae-Dong;Kim Sung-Un
    • The KIPS Transactions:PartC
    • /
    • v.12C no.6 s.102
    • /
    • pp.881-890
    • /
    • 2005
  • Over for the past 10 years, the increase in geometric progression for the internet traffic, has allowed the IP protocol framework to be the most important network technology. In addition, the internet service is being developed as a service mode differentiated, aiming to support the new-mode real-time multimedia services such as internet phone, video conference, cyber reality, and internet game, focusing on offering a latest service. These days, aiming to solve the need for broad bandwidth along with guaranteeing QoS, the WDM technology of offering multiple gigabit wavelengths is emerging as the core technology of next-generation optical internet backbone network. In the next-generation optical internet backbone network based on WDM, the QoS framework is one of fore subjects aiming to offer a service of guaranteeing QoS This study analyzes the requirements of performance related to QoS framework in IP Subnet and in WDM optical backbone network, and suggests optical QoS service framework differentiated. in order to guarantee end-to-end QoS through the next-generation optical internet backbone network, using GMPLS control protocol.

An Efficient P2P Based Proxy Patching Scheme for Large Scale VOD Systems (대규모 VOD 시스템을 위한 효율적인 P2P 기반의 프록시 패칭 기법)

  • Kwon, Chun-Ja;Choi, Hwang-Kyu
    • The KIPS Transactions:PartA
    • /
    • v.12A no.5 s.95
    • /
    • pp.341-354
    • /
    • 2005
  • The main bottleneck for large scale VOD systems is bandwidth of storage or network I/O due to the large number of client requests simultaneously, and then efficient techniques are required to solve the bottleneck problem of the VOD system. Patching is one of the most efficient techniques to overcome the bottleneck of the VOD system through the use of multicast scheme. In this paper, we propose a new patching scheme, called P2P proxy patching, for improving the typical patching technique by jointly using the prefix caching and P2P proxy. In our proposed scheme, each client plays a role in a proxy to multicast a regular stream to other clients that request the same video stream. Due to the use of the P2P proxy and the prefix caching, the client requests that ive out of the patching window range can receive the regular stream from other clients in the previous patching group without allocating the new regular channels from the VOD server to the clients. In the performance study, we show that our patching scheme can reduce the server bandwidth requirement about $33\%$ less than that of the existing patching technique with respect to prefix size and request interval.

Integration of Component Image Information and Design Information by Graph to Support Product Design Information Reuse (제품 설계 정보 재사용을 위한 그래프 기반의 부품 영상 정보와 설계 정보의 병합)

  • Lee, Hyung-Jae;Yang, Hyung-Jeong;Kim, Kyoung-Yun;Kim, Soo-Hyung;Kim, Sun-Hee
    • The KIPS Transactions:PartD
    • /
    • v.13D no.7 s.110
    • /
    • pp.1017-1026
    • /
    • 2006
  • Recently, distributed collaborative development environment has been recognized an alternative environment for product development in which multidisciplinary participants are naturally involving. Reuse of Product design information has long been recognized as one of core requirements for efficient product development. This paper addresses an image-based retrieval system to support product design information reuse. In the system, product images obtained from multi-modal devices are utilized to reuse design information. The proposed system conducts the segmentation of a product image by using a labeling method and generates an attributed relational graph (ARG) that represents properties of segmented regions and their relationships. The generated ARG is extended by integrating corresponding part/assembly information. In this manner, the reuse of assembly design information using a product image has been realized. The main advantages of the presented system are following. First, the system is not dependent to specific design tools, because it utilizes multimedia images that can be obtained easily from peripheral devices. Second ratio-based features extracted from images enable image retrievals that contain various sizes of parts. Third, the system has shown outstanding search performance, because we applied various information of segmented part regions and their relationships between parts.

Design and Implementation of an In-Memory File System Cache with Selective Compression (대용량 파일시스템을 위한 선택적 압축을 지원하는 인-메모리 캐시의 설계와 구현)

  • Choe, Hyeongwon;Seo, Euiseong
    • Journal of KIISE
    • /
    • v.44 no.7
    • /
    • pp.658-667
    • /
    • 2017
  • The demand for large-scale storage systems has continued to grow due to the emergence of multimedia, social-network, and big-data services. In order to improve the response time and reduce the load of such large-scale storage systems, DRAM-based in-memory cache systems are becoming popular. However, the high cost of DRAM severely restricts their capacity. While the method of compressing cache entries has been proposed to deal with the capacity limitation issue, compression and decompression, which are technically difficult to parallelize, induce significant processing overhead and in turn retard the response time. A selective compression scheme is proposed in this paper for in-memory file system caches that rapidly estimates the compression ratio of incoming cache entries with their Shannon entropies and compresses cache entries with low compression ratio. In addition, a description is provided of the design and implementation of an in-kernel in-memory file system cache with the proposed selective compression scheme. The evaluation showed that the proposed scheme reduced the execution time of benchmarks by approximately 18% in comparison to the conventional non-compressing in-memory cache scheme. It also provided a cache hit ratio similar to the all-compressing counterpart and reduced 7.5% of the execution time by reducing the compression overhead. In addition, it was shown that the selective compression scheme can reduce the CPU time used for compression by 28% compared to the case of the all-compressing scheme.

Development of Java/VRML-based 3D GIS's Framework and Its Prototype Model (Java/VRML기반 3차원 GIS의 기본 구조와 프로토타입 모델 개발)

  • Kim, Kyong-Ho;Lee, Ki-Won;Lee, Jong-Hun
    • Journal of Korean Society for Geospatial Information Science
    • /
    • v.6 no.1 s.11
    • /
    • pp.11-17
    • /
    • 1998
  • Recently, 3D GIS based on 3D geo-processing methodology and Internet environment are emerging issues in GIS fields. To design and implement 3D GIS, the strategic linkage of Java and VRML is first regarded: 3D feature format definition in the passion of conventional GIS including aspatial attributes, 3B feature indexing, 3D analytical operators such as selection, buffering, and Near, Metric operation such as distance measurement and statistical description, and 3D visualization. In 3D feature format definition, the following aspects are implemented: spatial information for 3D primitives extended from 2D primitives, multimedia data, object texture or color of VRML specification. DXF-format GIS layers with additional attributes are converted to 3D feature format and imported into this system. While, 3D analytical operators are realized in the form of 3D buffering with respect to user-defined point, line, polygon, and 3D objects, and 3D Near functions; furthermore, 'Lantern operator' is newly introduced in this 3D GIS. Because this system is implemented by Java applet, any client with Java-enable browser including VRML browser plug-in can utilize the new style of 3D GIS function in the virtual space. Conclusively, we present prototype of WWW-based 3D GIS, and this approach will be contribute to development of core modules on the stage of concept establishment and of real application model in future.

  • PDF

Classification of Ultrasonic NDE Signals Using the Expectation Maximization (EM) and Least Mean Square (LMS) Algorithms (최대 추정 기법과 최소 평균 자승 알고리즘을 이용한 초음파 비파괴검사 신호 분류법)

  • Kim, Dae-Won
    • Journal of the Korean Society for Nondestructive Testing
    • /
    • v.25 no.1
    • /
    • pp.27-35
    • /
    • 2005
  • Ultrasonic inspection methods are widely used for detecting flaws in materials. The signal analysis step plays a crucial part in the data interpretation process. A number of signal processing methods have been proposed to classify ultrasonic flaw signals. One of the more popular methods involves the extraction of an appropriate set of features followed by the use of a neural network for the classification of the signals in the feature spare. This paper describes an alternative approach which uses the least mean square (LMS) method and exportation maximization (EM) algorithm with the model based deconvolution which is employed for classifying nondestructive evaluation (NDE) signals from steam generator tubes in a nuclear power plant. The signals due to cracks and deposits are not significantly different. These signals must be discriminated to prevent from happening a huge disaster such as contamination of water or explosion. A model based deconvolution has been described to facilitate comparison of classification results. The method uses the space alternating generalized expectation maximiBation (SAGE) algorithm ill conjunction with the Newton-Raphson method which uses the Hessian parameter resulting in fast convergence to estimate the time of flight and the distance between the tube wall and the ultrasonic sensor. Results using these schemes for the classification of ultrasonic signals from cracks and deposits within steam generator tubes are presented and showed a reasonable performances.