• Title/Summary/Keyword: 메모리 효율

Search Result 1,789, Processing Time 0.031 seconds

A Slice Information Based Labeling Algorithm for 3-D Volume Data (Slice 정보에 기반한 3차원 볼륨 데이터의 레이블링 알고리즘)

  • 최익환;최현주;이병일;최흥국
    • Journal of KIISE:Software and Applications
    • /
    • v.31 no.7
    • /
    • pp.922-928
    • /
    • 2004
  • We propose a new 3 dimensional labeling method based on slice information for the volume data. This method is named SIL (Slice Information based Labeling). Compare to the conventional algorithms, it has advantages that the use of memory is efficient and it Is possible to combine with a variety of 2 dimensional labeling algorithms for finding an appropriate labeling algorithm to its application. In this study, we applied SIL to confocal microscopy images of cervix cancer cell and compared the results of labeling. According to the measurement, we found that the speed of Sd combined with, CCCL (Contour based Connected Component Labeling) is almost 2 times higher than that of other methods. In conclusion, considering that the performance of labeling depends on a kind of image, we obtained that the proposed method provide better result for the confocal microscopy cell volume data.

An Optimal Resource Configuration Method based on Probability Model for VBR Video Server (VBR 비디오 서버를 위한 확률 모델 기반의 최적 자원 구성)

  • Cho, Dae-Hyun;Son, Jin-Hyun;Kim, Myoung-Ho;Lee, Yoon-Joon
    • Journal of KIISE:Databases
    • /
    • v.28 no.3
    • /
    • pp.334-343
    • /
    • 2001
  • Most of currently used videos have variable bit rate(VBR) characteristics. Since the display rate of VBR videos compared to CBR videos vary with time, it is not proper to configure resources of the VBR video server using the method proposed for the CBR video server. In this paper we propose an optimal resource configuration method for the VBR video server which is based on the probability model. The proposed method decides the amount of disk and memory, and the disk access cycle of the video server with the lowest hardware cost, while preserving the throughput of the video server. In addition, we show the usefulness of the method through the various experiments.

  • PDF

A Data Protection Scheme based on Hilbert Curve for Data Aggregation in Wireless Sensor Network (센서 네트워크에서 데이터 집계를 위한 힐버트 커브 기반 데이터 보호 기법)

  • Yoon, Min;Kim, Yong-Ki;Chang, Jae-Woo
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.16 no.11
    • /
    • pp.1071-1075
    • /
    • 2010
  • Because a sensor node in wireless sensor networks(WSNs) has limited resources, such as battery capacity and memory, data aggregation techniques have been studied to manage the limited resources efficiently. Because sensor network uses wireless communication, a data can be disclosed by attacker. Thus, the study on data protection schemes for data aggregation is essential in WSNs. But the existing data aggregation methods require both a large number of computation and communication, in case of network construction and data aggregation processing. To solve the problem, we propose a data protection scheme based on Hilbert-curve for data aggregation. Our scheme can minimizes communications among neighboring sensor nodes by using tree-based routing. Moreover, it can protect the data from attacker by doing encryption through a Hilbert-curve technique based on a private seed, Finally, we show that our scheme outperforms the existing methods in terms of message transmission and average sensor node lifetime.

Design and Implementation of Multimedia Education System on Mobile Device (모바일 단말에서의 SMIL을 이용한 멀티미디어 교육 시스템 설계 및 구현)

  • Lim Young-Jin;Seo Jung-Hee;Park Hung-Bog
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2006.05a
    • /
    • pp.581-584
    • /
    • 2006
  • Cellular phones have been popularized and some of them even have access to the Internet. But the utilization of mobile phones has not been for education but only focused on particular services due to the text-based low capacity. This thesis proposes a multimedia education system using cell phones with SMIL. We can decrease the size of the parser and refute the resources of CPU by designing SMIL tag only, which is needed for multimedia education. In addition, the macro method for producing information for lectures will make possible decreased transmission quantity of multimedia contents and increased transmission efficiency. This will lead to overcoming the matter of insufficient CPU and memory, which is common to most mobile phone terminals.

  • PDF

Hardware Implementation of Rasterizer with SIMD Architecture Applicable to Mobile 3D Graphics System (모바일 3차원 그래픽스 시스템에 적용 가능한 SIMD 구조를 갖는 래스터라이저의 하드웨어 구현)

  • Ha, Chang-Soo;Sung, Kwang-Ju;Choi, Byeong-Yoon
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2010.05a
    • /
    • pp.313-315
    • /
    • 2010
  • In this paper, we describe research results of developing hardware rasterizer that is applicable to mobile 3D graphics system, designed in SIMD architecture and verified in FPGA. Tile-based scan conversion unit is designed like SIMD architecture running four tiles simultaneously and each tile traverses pixels hierarchical in 3-level so that visiting counts is minimized. As experimental results, $8{\times}8$ is the most efficient size of tile and the last step of tile traversing is performed on $2{\times}2$ sized subtile. The rasterizer supports flat shading and gouraud shading and texture mapper supports affine mapping and perspective corrected mapping. Also, texture mapper supports point sampling mode and bilinear interpolating sampling mode and two types of wrapping modes and various blending modes. The rasterzer operates as 120Mhz on xilinx vertex4 $l{\times}100$ device. To easy verification, texture memory and frame buffer are generated as block rom and block ram.

  • PDF

Design of Quality Evaluation Model for Mobile Application (모바일애플리케이션 품질평가 모델 설계)

  • Suh, Jee-Hoon;Choi, Jae-Hyun;Kim, Jong-Bae;Park, Jea-Won
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.18 no.10
    • /
    • pp.2451-2461
    • /
    • 2014
  • Mobile application is software executing on smart devices regardless of the time and place. Many individuals and companies have provided a lot of mobile applications services. However, there is not certain standard in terms of application's quality evaluation because study is deficient compared with increase amount of development of mobile application. Moreover, mobile application basically has many special characteristics. For these reasons mobile application is required special standard of quality different from general software. To satisfy these needs, I design and propose mobile application evaluation model. Evaluation model is mapped by characteristics of mobile application based on ISO/IEC 25000's quality characteristics and propose each quality characteristics and metrics. For verification, scenario-based studies were applied to quality model and carried out.

xPlaneb: 3-Dimensional Bitmap Index for Index Document Retrieval (xPlaneb: XML문서 검색을 위한 3차원 비트맵 인덱스)

  • 이재민;황병연
    • Journal of KIISE:Databases
    • /
    • v.31 no.3
    • /
    • pp.331-339
    • /
    • 2004
  • XML has got to be a new standard for data representation and exchanging by its many good points, and the core part of many new researches and emerging technologies. However, the self-describing characteristic, which is one of XML's good points, caused the spreading of XML documents with different structures, and so the need of the research for the effective XML-document search has been proposed. This paper is for the analysis of the problem in BitCube, which is a bitmap indexing that shows high performance grounded on its fast retrieval. In addition, to resolve the problem of BitCube, we did design and implement xPlaneb(XML Plane Web) which it a new 3-dimensional bitmap indexing made of linked lists. We propose an effective information retrieval technique by replacing BitCube operations with new ones and reconstructing 3-dimensional array index of BitCube with effective nodes. Performance evaluation shows that the proposed technique is better than BitCube, as the amount of document increases, in terms of memory consumptions and operation speed.

Implementation of a Cluster VOD Server and an Embedded Client based on Linux (리눅스 기반의 클러스터 VOD서버와 내장형에 클라이언트의 구현)

  • Seo Dongmahn;Bang Cheolseok;Lee Joahyoung;Kim Byounggil;Jung Inbum
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.10 no.6
    • /
    • pp.435-447
    • /
    • 2004
  • For VOD systems, it is important to provide QoS to more users under the limited resources. To analyze QoS issues in real environment, we implement clustered VOD server and embedded client system based on the Linux open source platform. The parallel processing of MPEG data, load balancing for nodes and VCR like functions are implemented in the server side. To provide more user friendly interface, the general TV is used for a VOD client's terminal and the embedded board is used supporting for VCR functions. In this paper, we measure the performance of the implemented VOD system under the various user requirement features and evaluate the sources of performance limitations. From these analyses, we propose the dynamic admission control method based on the availability memory and network bandwidth. The proposed method enhances the utilization of the system resource for the more QoS media streams.

High-level Autonomous Navigation Technique of AUV using Fuzzy Relational Products (퍼지관계곱을 이용한 수중운동체의 고수준 자율항행기법)

  • Lee, Young-Il;Kim, Yong-Gi
    • Journal of KIISE:Software and Applications
    • /
    • v.29 no.1_2
    • /
    • pp.91-97
    • /
    • 2002
  • This paper describes a heuristic search technique carrying out collision avoidance for Autonomous Underwater Vehicles(AUVs). Fuzzy relational products are used as the mathematical implement for the analysis and synthesis of relations between obstacles that are met in the navigation environment and available candidate nodes. In this paper, we propose a more effective evaluation function that reflects the heuristic information of domain experts on obstacle clearance, and an advanced heuristic search method performing collision avoidance for AUVs. The search technique adopts fuzzy relational products to conduct path-planning of intelligent navigation system. In order to verify the performance of proposed heuristic search, it is compared with $A^*$ search method through simulation in view of the CPU time, the optimization of path and the amount of memory usage.

A Sequential Pattern Mining based on Dynamic Weight in Data Stream (스트림 데이터에서 동적 가중치를 이용한 순차 패턴 탐사 기법)

  • Choi, Pilsun;Kim, Hwan;Kim, Daein;Hwang, Buhyun
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.2 no.2
    • /
    • pp.137-144
    • /
    • 2013
  • A sequential pattern mining is finding out frequent patterns from the data set in time order. In this field, a dynamic weighted sequential pattern mining is applied to a computing environment that changes depending on the time and it can be utilized in a variety of environments applying changes of dynamic weight. In this paper, we propose a new sequence data mining method to explore the stream data by applying the dynamic weight. This method reduces the candidate patterns that must be navigated by using the dynamic weight according to the relative time sequence, and it can find out frequent sequence patterns quickly as the data input and output using a hash structure. Using this method reduces the memory usage and processing time more than applying the existing methods. We show the importance of dynamic weighted mining through the comparison of different weighting sequential pattern mining techniques.