• Title/Summary/Keyword: 공간 복잡도

Search Result 1,901, Processing Time 0.024 seconds

Symbol Based Rate Adaptation in Coded MIMO-OFDM Systems (심볼 기반의 적응 변조 기법을 이용한 채널 부호화된 MIMO-OFDM 시스템)

  • Sung, Chang-Kyung;Kim, Ji-Hoon;Lee, In-Kyu
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.1A
    • /
    • pp.50-58
    • /
    • 2008
  • The use of space-division multiple access(SDMA) in the downlink of multiuser multi-input/multi-output(MIMO) wireless transmission systems can provide substantial gains in system throughput. When the channel state information(CSI) is available at the transmitter, a considerable performance improvement can be attained by adapting the transmission rates to the reported CSI. In addition, to combat frequency selective fadings in wideband wireless channels, bit-interleaved coded OFDM(BIC-OFDM) modulation schemes are employed to provide reliable packet delivery by utilizing frequency diversity through channel coding. In this paper, we propose an adaptive modulation and coding(AMC) scheme combined with an opportunistic scheduling technique for the MIMO BIC-OFDM with bandwidth-limited feedback channels. The proposed scheme enhances the link performance by exploiting both the frequency diversity and the multiuser diversity. To reduce the feedback information, the proposed AMC scheme employs rate adaptation methods based on an OFDM symbol rather than on the whole subchannels. Simulation results show that the proposed scheme exhibits a substantial performance gain with a reasonable complexity over single antenna systems.

Development and Application of An Adaptive Web Site Construction Algorithm (적응형 웹 사이트 구축을 위한 연관규칙 알고리즘 개발과 적용)

  • Choi, Yun-Hee;Jun, Woo-Chun
    • The KIPS Transactions:PartD
    • /
    • v.16D no.3
    • /
    • pp.423-432
    • /
    • 2009
  • Advances in information and communication technologies are changing our society greatly. In knowledge-based society, information can be obtained easily via communication tools such as web and e-mail. However, obtaining right and up-to-date information is difficult in spite of overflowing information. The concept of adaptive web site has been initiated recently. The purpose of the site is to provide information only users want out of tons of data gathered. In this paper, an algorithm is developed for adaptive web site construction. The proposed algorithm is based on association rules that are major principle in adaptive web site construction. The algorithm is constructed by analysing log data in web server and extracting meaning documents through finding behavior patterns of users. The proposed algorithm has the following characteristics. First, it is superior to existing algorithms using association rules in time complexity. Its superiority is proved theoretically. Second, the proposed algorithm is effective in space complexity. This is due to that it does not need any intermediate products except a linked list that is essential for finding frequent item sets.

Touching Pigs Segmentation and Tracking Verification Using Motion Information (움직임 정보를 이용한 근접 돼지 분리와 추적 검증)

  • Park, Changhyun;Sa, Jaewon;Kim, Heegon;Chung, Yongwha;Park, Daihee;Kim, Hakjae
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.7 no.4
    • /
    • pp.135-144
    • /
    • 2018
  • The domestic pigsty environment is highly vulnerable to the spread of respiratory diseases such as foot-and-mouth disease because of the small space. In order to manage this issue, a variety of studies have been conducted to automatically analyze behavior of individual pigs in a pig pen through a video surveillance system using a camera. Even though it is required to correctly segment touching pigs for tracking each pig in complex situations such as aggressive behavior, detecting the correct boundaries among touching pigs using Kinect's depth information of lower accuracy is a challenging issue. In this paper, we propose a segmentation method using motion information of the touching pigs. In addition, our proposed method can be applied for detecting tracking errors in case of tracking individual pigs in the complex environment. In the experimental results, we confirmed that the touching pigs in a pig farm were separated with the accuracy of 86%, and also confirmed that the tracking errors were detected accurately.

Implementation of Low Cost Interactive WhiteBoard System for Improving Teaching-Learning Environment (교수-학습 환경 개선을 위한 저비용 전자칠판 시스템 구현)

  • Kim, Kyung Yeul;Park, Ji Su
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.9 no.9
    • /
    • pp.291-296
    • /
    • 2020
  • With the recent development of IT technology, various digital media to which new information technology is applied are being developed. In classroom lessons, the learning environment centered on lectures has changed to a learning environment in which learners participate. In particular, Interactive WhiteBoard (IWB) are used as an effective digital medium for teacher-learners to collaborate for interaction. However, existing IWB are expensive to purchase and maintain, and provide various and complicated functions to operate the IWB, which imposes a heavy burden on users. In this paper, we develop a low-cost IWB that supports collaborative learning to facilitate interaction in the space where projectors are installed to improve the teaching-learning environment. In addition, it is implemented so that learning activities using the IWB are interlocked and stored in the learning management system.

Image Coding Using LOT and FSVQ with Two-Channel Conjugate Codebooks (LOT와 2-채널 결합 코드북을 갖은 FSVQ를 이용한 영상 부호화)

  • 채종길;황찬식
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.19 no.4
    • /
    • pp.772-780
    • /
    • 1994
  • Vector quantization with two-channel conjugate codebook has been researched as an efficient coding technique that can reduce the computational complexity and codebook storage. This paper proposes FSVQ using two-channel conjugate codebook in order to reduce the number of state codebooks. Input vector in the two-channel conjugate FSVQ is coded with state codebook of a seperated state according to each codebook. In addition, LOT is adopted to obtain to obtain a high coding gain and to reduce blocking effect which appears in the block coding. As a result, although FSVQ can achieve higher data compression ratio than general vector quantization, it has a disadvantage of having a very large number of state codebooks. However FSVQ with two-channel conjugate codebooks can employ a significantly reduced number of state codebooks, even though it has a small loss in the PSNR compared with the conventional FSVQ using one codebook. Moreover FSVQ in the LOT domain can reduce blocking effect and high coding gain compared with FSVQ in the spatial domain.

  • PDF

Geomorphic development and distributional system of marine terrace in the eastern part of Seopo-myeon, Sacheon-si, Gyeongnam Province (경남 사천시 서포면 동쪽 해안단구 지형 발달과 분포 체계)

  • Yoon, Soon-Ock;Kang, Bong;Park, Chung-Sun;Hwang, Sangill
    • Journal of the Korean association of regional geographers
    • /
    • v.22 no.4
    • /
    • pp.875-886
    • /
    • 2016
  • The eastern coast of Seopo-myeon, Sancheon-si in the South Coast is a bay almost completely separated from open sea by Changseon and Namhae Islands. Marine terraces in this area can be classified into geomorphic surfaces with elevations of 10~12m, 15~18m, 20~24m, 25~28m, 30~33m, 35~38m, 40~45m, 45~50m and 54m. This marine terrace system is similar to the Boryeong area in the West Coast. The geomorphic surfaces distribute along ridges and show relatively small areas. The young and old surfaces show a mixed distributional pattern. This distributional pattern contrasts to the East Coast where the oldest surface farthest from the coastline is parallel to the coast and age of the surfaces increases with a distance from the coast. These seem to result in high energy waves by typhoon that developed wave-cut platform on hill areas with relatively complex relief in a short time.

  • PDF

An Efficient Motion Search Algorithm for a Media Processor (미디어 프로세서에 적합한 효율적인 움직임 탐색 알고리즘)

  • Noh Dae-Young;Kim Seang-Hoon;Sohn Chae-Bong;Oh Seoung-Jun;Ahn Chang-Beam
    • Journal of Broadcast Engineering
    • /
    • v.9 no.4 s.25
    • /
    • pp.434-445
    • /
    • 2004
  • Motion Estimation is an essential module in video encoders based on international standards such as H.263 and MPEG. Many fast motion estimation algorithms have been proposed in order to reduce the computational complexity of a well-known full search algorithms(FS). However, these fast algorithms can not work efficiently in DSP processors recently developed for video processing. To solve for this. we propose an efficient motion estimation scheme optimized in the DSP processor like Philips TM1300. A motion vector predictor is pre-estimated and a small search range is chosen in the proposed scheme using strong motion vector correlation between a current macro block (MB) and its neighboring MB's to reduce computation time. An MPEG-4 SP@L3(Simple Profile at Level 3) encoding system is implemented in Philips TM1300 to verify the effectiveness of the proposed method. In that processor, we can achieve better performance using our method than other conventional ones while keeping visual quality as good as that of the FS.

Integrated Management Middleware for the Servers supporting the terminal-independent (단말기 독립형 서버 통합 관리 미들웨어)

  • Kim Jeong-Hee;Kwak Ho-Young
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.10 no.6
    • /
    • pp.1106-1118
    • /
    • 2006
  • The Internet has become an important instrument for providing many pieces of information to us. And server systems offer the various services after processing a volume of information, it's network topology also has been complex for providing information. Therefore this expansion means the importance of fast and sustained management of server systems. But most of server systems are located in fire-walls to allow only restricted access. Moreover, due to the difference of management based on the different operating system of each server system, management of server system is not to efficiency. That is, sever administrators have to manage by themselves many kinds of servers by using local-based or socket-based single access applications. Therefore, we design and implement a middleware system which allows to manage many kinds of severs integrally ruling XML-based Web Services which have distributed object technology such as CORBA, Java RMI and DCOM, but are free from platforms or development languages. System also provides location transparency and terminal independence and calls a server system management command to manage systems.

How to Construct Spatio-Temporal Ontologies for U-City Contents (유시티 콘텐츠를 위한 시공간 온톨로지 구축 방법)

  • Nah, Bang-Hyun;Kwon, Chang-Hee;Park, Rae-Hoon;Yoon, Hyung-Goog
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.11 no.7
    • /
    • pp.2632-2637
    • /
    • 2010
  • Information in UbiComp Environment are transformed to knowledge by relationship in a spatio-temporal location, and then became intelligent contents with task procedures or application models. The entities in U-City has lots of relationships. It is important in U-City contents to provide intelligent and personalized response to meet the intention of users. We extend the spatial ontology model of SPIRIT to other domain. Domain ontologies are consist of type, relation, and instance ontologies. When the relationship model by shared concepts are not defined, we used the spatio-temporal events to find relationships. So we proposed the methods to recommend semantically related terms, not syntactically.

Constant Time Algorithm for Computing Block Location of Linear Quadtree on RMESH (RMESH에서 선형 사진트리의 블록 위치 계산을 위한 상수시간 알고리즘)

  • Han, Seon-Mi;Woo, Jin-Woon
    • The KIPS Transactions:PartA
    • /
    • v.14A no.3 s.107
    • /
    • pp.151-158
    • /
    • 2007
  • Quadtree, which is a hierarchical data structure, is a very important data structure to represent images. The linear quadtree representation as a way to store a quadtree is efficient to save space compared with other representations. Therefore, it has been widely studied to develop efficient algorithms to execute operations related with quadtrees. The computation of block location is one of important geometry operations in image processing, which extracts a component completely including a given block. In this paper, we present a constant time algorithm to compute the block location of images represented by quadtrees, using three-dimensional $n\times n\times n$ processors on RMESH(Reconfigurable MESH). This algorithm has constant-time complexity by using efficient basic operations to deal with the locational codes of quardtree on the hierarchical structure of $n\times n\times n$ RMESH.