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

Search Result 1,901, Processing Time 0.031 seconds

Complexity and Performance Analysis of SVC(Scalable Video Coding) Encoder Models for T-DMB/AT-DMB Video Service (T-DMB/AT-DMB 비디오 서비스를 위한 스케일러블 부호화기 모델에 따른 복잡도 및 성능 분석)

  • Kim, Jin-Soo;Kim, Kyu-Seok;Kim, Pil-Joong;Lee, Si-Woong;Kim, Jae-Gon;Choi, Hae-Chul
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.11 no.11
    • /
    • pp.2015-2020
    • /
    • 2007
  • This paper presents the SVC(Scalable Video Coding) scheme which enables the AT-DMB(Advanced Terrestrial-DMB) video service in enhancement layer, while keeping the current T-DMB video service in base layer. But, it is very complicate to implement the SVC encoder and so it is necessary to analyze the complexity and performance for SVC encoder#s structures and coding parameters. In this paper, through computer simulations, SVC coding parameters are tested and then, based on these results, three types of SVC encoder models are compared from the viewpoint of the complexity and performance.

Design of Serial-Parallel Multiplier for GF($2^n$) (GF($2^n$)에서의 직렬-병렬 곱셈기 구조)

  • 정석원;윤중철;이선옥
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.13 no.3
    • /
    • pp.27-34
    • /
    • 2003
  • Recently, an efficient hardware development for a cryptosystem is concerned. The efficiency of a multiplier for GF($2^n$)is directly related to the efficiency of some cryptosystem. This paper, considering the trade-off between time complexity andsize complexity, proposes a new multiplier architecture having n[n/2] AND gates and n([n/2]+1)- $$\Delta$_n$ = XOR gates, where $$\Delta$_n$=1 if n is even, $$\Delta$_n$=0 otherwise. This size complexity is less than that of existing ${multipliers}^{[5][12]}$which are $n^2$ AND gates and $n^2$-1 XOR gates. While a new multiplier is a serial-parallel multiplier to output a result of multiplication of two elements of GF($2^n$) after 2 clock cycles, the suggested multiplier is more suitable for some cryptographic device having space limitations.

Fractal Analysis of Urban Morphology Considering Distributed Situation of Buildings (건물분포를 고려한 도시형태의 프랙털(Fractal) 해석)

  • Moon, Tae-Heon
    • Journal of the Korean Association of Geographic Information Studies
    • /
    • v.8 no.3
    • /
    • pp.1-10
    • /
    • 2005
  • The purpose of this paper is to conduct an experimental measurement and analysis of cities' morphology. Fractal theory that is an effective tool for evaluating self-similarity and complexity of objects was applied. For the comparative analysis of fractailities and computational verification, two totally different cities in Japan were selected. They are Kitakyushu City, which is a big and fully developed city, and Jinguu Machi of which almost all the area is covered with agricultural land use. After converting vector data to raster data within GIS, fractal dimensions of two cases in Kitakyushu City and one case in Jinguu Machi were calculated. The calculation showed that two parts of Kitakyushu City were already fractal. Jinguu Machi, however, was difficult to find fractality. As a conclusion, fractal was proved to be an useful tool to estimate the shape of cities reflecting their internal spatial structure, that is self-similarity and complexity.

  • PDF

ViStoryNet: Neural Networks with Successive Event Order Embedding and BiLSTMs for Video Story Regeneration (ViStoryNet: 비디오 스토리 재현을 위한 연속 이벤트 임베딩 및 BiLSTM 기반 신경망)

  • Heo, Min-Oh;Kim, Kyung-Min;Zhang, Byoung-Tak
    • KIISE Transactions on Computing Practices
    • /
    • v.24 no.3
    • /
    • pp.138-144
    • /
    • 2018
  • A video is a vivid medium similar to human's visual-linguistic experiences, since it can inculcate a sequence of situations, actions or dialogues that can be told as a story. In this study, we propose story learning/regeneration frameworks from videos with successive event order supervision for contextual coherence. The supervision induces each episode to have a form of trajectory in the latent space, which constructs a composite representation of ordering and semantics. In this study, we incorporated the use of kids videos as a training data. Some of the advantages associated with the kids videos include omnibus style, simple/explicit storyline in short, chronological narrative order, and relatively limited number of characters and spatial environments. We build the encoder-decoder structure with successive event order embedding, and train bi-directional LSTMs as sequence models considering multi-step sequence prediction. Using a series of approximately 200 episodes of kids videos named 'Pororo the Little Penguin', we give empirical results for story regeneration tasks and SEOE. In addition, each episode shows a trajectory-like shape on the latent space of the model, which gives the geometric information for the sequence models.

A Spatial Error Concealment Technique with Low Complexity for Intra-frame in the H.264 Standard (H.264 인트라 프레임을 위한 저복잡도(低複雜度) 공간적 에러은닉 기법)

  • Kim Dong-Hyung;Cho Sang-Hyup;Jeong Je-Chang
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.5C
    • /
    • pp.503-511
    • /
    • 2006
  • H.264 adopts new coding tools such as intra-prediction, loop filter, etc. The adoption of these tools enables an H.264-coded bitstream to have more information compared with previous standards. In this paper we proposed an effective spatial error concealment method for H.264. Among the information included in an H.264-coded bitstream, we use intra-mode for recovering a damaged block. This is because prediction direction in intra-mode is highly correlated to the edge direction of a lost macroblock. We first estimate the edge direction using intra-modes of blocks adjacent to a lost macroblock, and classify the area in a damaged macroblock into the edge and the flat area. And then our method recovers pixel values in the edge area using edge-directed interpolation, and recovers pixel values in the flat area using weighted interpolation. Simulation results show the proposed method yields better video quality than conventional approaches by 0.35 to 5.48 dB.

Design and Implementation of Event Hierarchy through Extended Spatio-Temporal Complex Event Processing (시공간 복합 이벤트 처리의 확장을 통한 계층적 이벤트 설계 및 구현)

  • Park, Ye Jin;Yom, Jae-Hong
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.30 no.6_1
    • /
    • pp.549-557
    • /
    • 2012
  • Spatial phenomena such as environment pollution, disease and the risk of spreading information need a rapid initial response to perceive spread event. Moving data perceive spread event through real-time processing and analysis. To process and analysis the event, spatial-temporal complex event processing is used. Previous spatialtemporal complex event processing is possible basis spatial operator but insufficient apply to design spatialtemporal complex event processing to perceive spatial phenomena of high complexity. This study proposed hierarchical spatio-temporal CEP design which will efficiently manage the fast growing incoming sensor data. The implementation of the proposed design is evaluated with GPS location data of moving vehicles which are used as the incoming data stream for identifying spatial events. The spatial component of existing CEP software engine has been extended during the implementation phase to broaden the capabilities of processing spatio-temporal events.

Effect of Habitat Diversity through Comparison of Spider Diversity between Upland and Paddy Fields in Agroecosystems of South Korea (농업생태계인 밭과 논에서 거미의 다양성 비교를 통한 서식지 중요성 연구)

  • Nam, Hyung-Kyu;Song, Young-Ju;Eo, Jinu;Kim, Myung-Hyun
    • Korean Journal of Ecology and Environment
    • /
    • v.52 no.2
    • /
    • pp.151-160
    • /
    • 2019
  • The study of spiders that function as predators in agroecosystem can broaden the understanding of agroecosystems. This study investigated the effect of heterogeneity at different spatial scales on richness and abundance of spiders in upland and paddy fields. We collected 48 samples using pitfall traps at upland and paddy fields, respectively. The total species richness of spiders estimated by sample- and coverage-based rarefaction and extrapolation curves. The total species richness was high in the upland fields at the total study sites, whereas the average species richness per study site was high in the paddy fields. We confirmed that the diversity enhancement of spiders was influenced by the structural complexity of habitat at field-scale, and crop diversity at broader scale.

AIC & MDL Algorithm Based on Beamspace, for Efficient Estimation of the Number of Signals (효율적인 신호개수 추정을 위한 빔공간 기반 AIC 및 MDL 알고리즘)

  • Park, Heui-Seon;Hwang, Suk-Seung
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.16 no.4
    • /
    • pp.617-624
    • /
    • 2021
  • The accurate estimation of the number of signals included in the received signal is required for the AOA(: Angle-of-Arrival) estimation, the interference suppression, the signal reception, etc. AIC(: Akaike Information Criterion) and MDL(: Minimum Description Length) algorithms, which are known as the typical algorithms to estimate the signal number, estimate the number of signals according to the minimum of each criterion. As the number of antenna elements increased, the estimation performance is enhanced, but the computational complexity is increased because values of criteria for entire antenna elements should be calculated for finding their minimum. In order to improve this problem, in this paper, we propose AIC and MDL algorithms based on the beamspace, which efficiently estimate the number of signals while reducing the computational complexity by reducing the dimension of an array antenna through the beamspace processing. In addition, we provide computer simulation results based on various scenarios for evaluating and analysing the estimation performance of the proposed algorithms.

Search Space Partitioning-based Receiver for Generalized Spatial Modulation under Channel Information Errors (일반화 공간변조 시스템에서 채널 정보 오차를 고려한 탐색 영역 분할 수신기)

  • Yoon, Hakjoon;Im, Changyong;Lee, Kyungchun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.23 no.12
    • /
    • pp.1631-1637
    • /
    • 2019
  • In this paper, we propose a low-complexity robust maximum likelihood (ML) receiver for generalized spatial modulation. The proposed receiver performs the transmit antenna partition to lower the computational loads. After we divide the transmit antenna combinations into two parts, one of which is "the likely TAC part," and the other of which is "the unlikely TAC part", based on the minimum mean square error (MMSE) filtering output. We first perform the maximum likelihood detection only in the likely TAC part. Then we evaluate the reliability of the solution found in the first search, and based its reliability we decide whether we continue the search in the unlikely TAC part. This partitioned search strategy maintains the performance of the conventional robust maximum likelihood receiver and simultaneously lowers computational loads. Through simulation, we found that our newly-proposed receiver achieves considerable gains over the conventional robust ML detector in terms of the computational loads while providing almost the same performance.

Texture-Spatial Separation based Feature Distillation Network for Single Image Super Resolution (단일 영상 초해상도를 위한 질감-공간 분리 기반의 특징 분류 네트워크)

  • Hyun Ho Han
    • Journal of Digital Policy
    • /
    • v.2 no.3
    • /
    • pp.1-7
    • /
    • 2023
  • In this paper, I proposes a method for performing single image super resolution by separating texture-spatial domains and then classifying features based on detailed information. In CNN (Convolutional Neural Network) based super resolution, the complex procedures and generation of redundant feature information in feature estimation process for enhancing details can lead to quality degradation in super resolution. The proposed method reduced procedural complexity and minimizes generation of redundant feature information by splitting input image into two channels: texture and spatial. In texture channel, a feature refinement process with step-wise skip connections is applied for detail restoration, while in spatial channel, a method is introduced to preserve the structural features of the image. Experimental results using proposed method demonstrate improved performance in terms of PSNR and SSIM evaluations compared to existing super resolution methods, confirmed the enhancement in quality.