• Title/Summary/Keyword: memory compression

Search Result 255, Processing Time 0.025 seconds

A PCA-based Data Stream Reduction Scheme for Sensor Networks (센서 네트워크를 위한 PCA 기반의 데이터 스트림 감소 기법)

  • Fedoseev, Alexander;Choi, Young-Hwan;Hwang, Een-Jun
    • Journal of Internet Computing and Services
    • /
    • v.10 no.4
    • /
    • pp.35-44
    • /
    • 2009
  • The emerging notion of data stream has brought many new challenges to the research communities as a consequence of its conceptual difference with conventional concepts of just data. One typical example is data stream processing in sensor networks. The range of data processing considerations in a sensor network is very wide, from physical resource restrictions such as bandwidth, energy, and memory to the peculiarities of query processing including continuous and specific types of queries. In this paper, as one of the physical constraints in data stream processing, we consider the problem of limited memory and propose a new scheme for data stream reduction based on the Principal Component Analysis (PCA) technique. PCA can transform a number of (possibly) correlated variables into a (smaller) number of uncorrelated variables. We adapt PCA for the data stream of a sensor network assuming the cooperation of a query engine (or application) with a network base station. Our method exploits the spatio-temporal correlation among multiple measurements from different sensors. Finally, we present a new framework for data processing and describe a number of experiments under this framework. We compare our scheme with the wavelet transform and observe the effect of time stamps on the compression ratio. We report on some of the results.

  • PDF

Functional Improvement of the Compressed Data Management System for Mobile DBMS (모바일 DBMS를 위한 압축 데이터 관리 시스템의 기능 고도화)

  • Hwang, Jin-Ho;Lee, Jeong-Wha;Kim, Gun-Woo;Shin, Young-Jae;Son, Jin-Hyun
    • The KIPS Transactions:PartD
    • /
    • v.15D no.6
    • /
    • pp.733-740
    • /
    • 2008
  • Recently, mobile computing devices are used popularly. And quantity of information on mobile computing devices is being increased due to digitalization of information. So it needs an embedded DBMS for effective information management. Furthermore, since flash memory having a restriction on the number of partial write cycles is rapidly deployed on mobile computing devices as data storage and is more expensive than the conventional magnetic hard disk, the compressed data management system(CDMS) has been considered as an effective storage management technique for mobile computing devices in previous research. However, the research of CDMS is at the initial stage and has several problems. Hence, in this paper, we present additional storage management methods to solve the problems and improve the effectiveness of the CDMS for embedded DBMS.

WAP Protocol Adaptation Requirements for Internet Service of Portable Handset in the Wireless Environment (무선 휴대 단말기 환경에서의 인터넷 서비스를 위한 WAP 프로토콜 수용방안)

  • 권영미;조웅기
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 1999.11a
    • /
    • pp.363-367
    • /
    • 1999
  • As the subscription rate to both Internet services and wireless communications services increases rapidly, traffic in the future wireless communications will be dominated by Internet applications. Current research for wireless technology is focused to the multimedia data transmission mainly for the personal computer or notebook whose display which has large display and abundant memory. But in the near future, Internet access request from the handphone or PDA device which is already spreaded in the world will be large. Special handset terminals which has small display monitor, low capacity memory and poor processing power has to be managed differently from torrent wireless communications protocols. So, WAP Forum is organized with wireless handset manufacturers in the world and the standardization process for wireless application is being actively developed. In this paper, basic model and architecture of WAP is introduced and adaptation requirements for change from HTML documents to WML formats are proposed. Also, compression ratio gained in the transform from the existing web documents to WML is shown.

  • PDF

Real-time Optimized Composition and Broadcasting of Multimedia Information (다중 미디어 정보의 실시간 최적화 합성 및 방송)

  • Lee, Sang-Yeob;Park, Seong-Won
    • Journal of the Korea Society of Computer and Information
    • /
    • v.17 no.2
    • /
    • pp.177-185
    • /
    • 2012
  • In this paper, we developed the composition system that it can efficiently edit camera recording data, images, office document such as powerpoint data, MS word data etc in real-time and broadcasting system that the file is made by the composition system. In this Study, we developed two kinds of algorithm; Approximate Composition for Optimization (ACFO) and Sequence Composition using Memory Que (SCUMQ). Especially, the system is inexpensive and useful because the system is based on mobile devices and PCs when lectures hope to make video institutional contents. Therefore, it can be contributed for e-learning and m-learning. In addition, the system can be applied to various fields, different kinds of multimedia creation, remote conferencing, and e-commerce.

An Efficient Test Compression Scheme based on LFSR Reseeding (효율적인 LFSR 리시딩 기반의 테스트 압축 기법)

  • Kim, Hong-Sik;Kim, Hyun-Jin;Ahn, Jin-Ho;Kang, Sung-Ho
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.46 no.3
    • /
    • pp.26-31
    • /
    • 2009
  • A new LFSR based test compression scheme is proposed by reducing the maximum number of specified bits in the test cube set, smax, virtually. The performance of a conventional LFSR reseeding scheme highly depends on smax. In this paper, by using different clock frequencies between an LFSR and scan chains, and grouping the scan cells, we could reduce smax virtually. H the clock frequency which is slower than the clock frequency for the scan chain by n times is used for LFSR, successive n scan cells are filled with the same data; such that the number of specified bits can be reduced with an efficient grouping of scan cells. Since the efficiency of the proposed scheme depends on the grouping mechanism, a new graph-based scan cell grouping heuristic has been proposed. The simulation results on the largest ISCAS 89 benchmark circuit show that the proposed scheme requires less memory storage with significantly smaller area overhead compared to the previous test compression schemes.

An Effective Memory Compression Scheme for Embedded System (임베디드 시스템을 위한 효율적인 메모리 압축 기법)

  • Woo JangBok;Choi ByeongChang;Suh Hyo-Joong
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2005.11a
    • /
    • pp.871-873
    • /
    • 2005
  • 최근 임베디스 시스템의 성능이 향상됨에 따라, 임베디드 시스템을 구성하는 CPU와 주변 장치들의 성능 격차를 해소하는 문제가 점차 중요해지고 있다. 그 중에서 시스템의 성능에 가장 큰 영향을 미치는 것이 CPU와 메모리간의 통신이다. 고성능 컴퓨터 시스템에서는 그동안 CPU와 메모리간의 성능 격차를 줄이기 위한 여러 가지 연구들이 활발하게 진행되었는데, 여러 가지 연구들 중에서 메모리를 압축하여 메모리의 기억공간을 효율적으로 확장하는 방법이 효과적으로 사용되고 있다. 임베디드 시스템에서도 이러한 기법을 적절하게 적용하면 메모리를 압축함으로써 동일 공간에 보다 많은 데이터를 저장할 수 있고, 버스를 이용하여 데이터를 전송할 때, 보다 많은 정보를 전송할 수 있게 된다. 또한, CPU와 메모리 간의 전송되는 정보의 크기를 줄일 수 있으므로 임베디드 시스템에서 전력소모의 대부분을 차지하고 있는 CPU와 메모리 간의 전력소모를 크게 줄일 수 있는 장점이 있다. 본 논문에서는 빈발 패턴 압축 기법을 적절하게 변형하여 임베디드 시스템을 위한 효율적인 메모리 압축 기법을 제시하고자 한다.

  • PDF

The Vocabulary Recognition Optimize using Acoustic and Lexical Search (음향학적 및 언어적 탐색을 이용한 어휘 인식 최적화)

  • Ahn, Chan-Shik;Oh, Sang-Yeob
    • Journal of Korea Multimedia Society
    • /
    • v.13 no.4
    • /
    • pp.496-503
    • /
    • 2010
  • Speech recognition system is developed of standalone, In case of a mobile terminal using that low recognition rate represent because of limitation of memory size and audio compression. This study suggest vocabulary recognition highest performance improvement system for separate acoustic search and lexical search. Acoustic search is carry out in mobile terminal, lexical search is carry out in server processing system. feature vector of speech signal extract using GMM a phoneme execution, recognition a phoneme list transmission server using Lexical Tree Search algorithm lexical search recognition execution. System performance as a result of represent vocabulary dependence recognition rate of 98.01%, vocabulary independence recognition rate of 97.71%, represent recognition speed of 1.58 second.

A Submode Selection Method for Advanced Intra Coding in H.263 (H.263 Advanced Intra Coding 모드 선택 방법)

  • 박운기;이상희;전병우
    • Journal of Broadcast Engineering
    • /
    • v.6 no.2
    • /
    • pp.187-194
    • /
    • 2001
  • The Advanced Intra Coding(AIC) mode included in the H.263+ which is for video ceding at low bit rates, selects one prediction direction of DCT coefficients among three directions for every intra macroblock. Based ()n the selected direction, It uses a different DCT scanning order, quantization scheme, and VLC table. The use of the AIC mode brings higher compression ratio and improved PSNR than the H.263 baseline. This paper proposes a simplified submode selection method for a direction of the DCT coefficient prediction for advanced ultra coding in H.263. Compared to the conventional method the proposed simplified method can achieve a similar coding Performance at computational complexity reduced to 1/7 and with much less memory requirement. The proposed method will be useful in implementing a simplified H.263 system.

  • PDF

Estimation of Lifetime Data Storage Capacity for Human Senses (인간 감각 정보를 위한 평생 기억용량 평가)

  • You, Young-Gap;Song, Young-Jun;Kim, Dong-Woo
    • The Journal of the Korea Contents Association
    • /
    • v.9 no.1
    • /
    • pp.23-29
    • /
    • 2009
  • This paper presents a capacity estimation of a storage system accumulating all data sensed during the lifetime of an individual human being. The calculation assumes modern data compression and data collection schemes based on wearable or implanted devices under ubiquitous environment. More than 76% of the storage area is found to be used for video data storage of common TV image quality. The remaining storage area is for data from other sensing organs including audio, taste, olfactory and tactual systems in addition to indexing information. Total storage area of around 600 tera bytes is needed to cover 100 years of human life including his fetal period.

3D Volumetric Medical Image Coding Using Unbalanced Tree (3차원 불균형 트리 구조를 가진 의료 영상 압축에 대한 연구)

  • Kim, Young-Seop;Cho, Jae-Hoon
    • Journal of the Semiconductor & Display Technology
    • /
    • v.5 no.2 s.15
    • /
    • pp.19-25
    • /
    • 2006
  • This paper focuses on lossy medical image compression methods for medical images that operate on three-dimensional(3-D) irreversible integer wavelet transform. We offer an application of unbalanced tree structure algorithm to medical images, using a 3-D unbalanced wavelet decomposition and a 3-D unbalanced spatial dependence tree. The wavelet decomposition is accomplished with integer wavelet filters implemented with the lifting method. We have tested our encoder on volumetric medical images using different integer filters and coding unit sizes. The coding unit sizes of 16 slices save considerable dynamic memory(RAM) and coding delay from full sequence coding units used in previous works. If we allow the formation of trees of different lengths, then we can accomodate more transaxial scales than three. The encoder and decoder can then keep track of the length of the tree in which each pixel resides through the sequence of decompositions. Results show that, even with these small coding units, our algorithm with certain filters performs as well and better in lossy coding than previous coding systems using 3-D integer unbalanced wavelet transforms on volumetric medical images.

  • PDF