• 제목/요약/키워드: 공간 복잡도

검색결과 1,912건 처리시간 0.026초

Cascade AOA Estimation Algorithm Based on FMCCA Antenna (FMCCA 안테나 기반 캐스케이드 도래각 추정 알고리즘)

  • Kim, Tae-Yun;Hwang, Suk-Seung
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • 제16권6호
    • /
    • pp.1081-1088
    • /
    • 2021
  • The modern wireless communication system employes the beamforming technique based on a massive array antenna with a number of elements, for supporting the smooth communication services. A reliable beamforming technology requires the Angle-of-Arrival(: AOA) information for the signal incident to the receiving antenna, which is generally estimated by the high-resolution AOA estimation algorithm such as Multiple Signal Classification(: MUSIC). Although the MUSIC algorithm has the excellent estimation performance, it is difficult to estimate AOA in real time for the massive array antenna due to the extremely high computational complexity. In order to enhance this problem, in this paper, we propose the cascade AOA estimation algorithm based on a Flexible Massive Concentric Circular Array(: FMCCA) antenna with the On/Off function for antenna elements. The proposed cascade algorithm consists of the CAPON algorithm using some elements among entire antenna elements and the Beamspace MUSIC algorithm using entire elements. We provide computer simulation results for various scenarios to demonstrate the AOA estimation performance of the proposed approach.

Estimation of Urban Traffic State Using Black Box Camera (차량 블랙박스 카메라를 이용한 도시부 교통상태 추정)

  • Haechan Cho;Yeohwan Yoon;Hwasoo Yeo
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • 제22권2호
    • /
    • pp.133-146
    • /
    • 2023
  • Traffic states in urban areas are essential to implement effective traffic operation and traffic control. However, installing traffic sensors on numerous road sections is extremely expensive. Accordingly, estimating the traffic state using a vehicle-mounted camera, which shows a high penetration rate, is a more effective solution. However, the previously proposed methodology using object tracking or optical flow has a high computational cost and requires consecutive frames to obtain traffic states. Accordingly, we propose a method to detect vehicles and lanes by object detection networks and set the region between lanes as a region of interest to estimate the traffic density of the corresponding area. The proposed method only uses less computationally expensive object detection models and can estimate traffic states from sampled frames rather than consecutive frames. In addition, the traffic density estimation accuracy was over 90% on the black box videos collected from two buses having different characteristics.

Multi-Region based Radial GCN algorithm for Human action Recognition (행동인식을 위한 다중 영역 기반 방사형 GCN 알고리즘)

  • Jang, Han Byul;Lee, Chil Woo
    • Smart Media Journal
    • /
    • 제11권1호
    • /
    • pp.46-57
    • /
    • 2022
  • In this paper, multi-region based Radial Graph Convolutional Network (MRGCN) algorithm which can perform end-to-end action recognition using the optical flow and gradient of input image is described. Because this method does not use information of skeleton that is difficult to acquire and complicated to estimate, it can be used in general CCTV environment in which only video camera is used. The novelty of MRGCN is that it expresses the optical flow and gradient of the input image as directional histograms and then converts it into six feature vectors to reduce the amount of computational load and uses a newly developed radial type network model to hierarchically propagate the deformation and shape change of the human body in spatio-temporal space. Another important feature is that the data input areas are arranged being overlapped each other, so that information is not spatially disconnected among input nodes. As a result of performing MRGCN's action recognition performance evaluation experiment for 30 actions, it was possible to obtain Top-1 accuracy of 84.78%, which is superior to the existing GCN-based action recognition method using skeleton data as an input.

Tidal flow variation in Han river mouth (한강 하구의 조석변화 특성)

  • Kim, Won
    • Proceedings of the Korea Water Resources Association Conference
    • /
    • 한국수자원학회 2020년도 학술발표회
    • /
    • pp.19-19
    • /
    • 2020
  • 한강 하구는 매우 다이나믹한 공간이다. 서해의 조석변화가 한강과 임진강에 영향을 미치는 동시에 한강과 임진강의 영향이 조석에도 영향을 미친다. 한강과 임진강의 유량은 서로에게도 영향을 미친다. 결과적으로 한강, 임진강, 조석이 서로 밀접하게 영향을 미치는 곳이 한강 하구이다. 그러나 지금까지 군사적인 문제로 인해 한강 하구에 대한 조사나 분석은 많이 이루어질 수 없었다. 그로인해 하구의 수리적인 영향이 정확하게 분석되지 못하였다. 본 연구에서는 한강 하구의 흐름 모의 결과를 바탕으로 조석변화의 특성을 분석하였다. 또한 신곡수중보 주위의 흐름 조사 결과를 바탕으로 하구에서 발생하는 조석 변화의 영향도 분석하였다. 한강 본류의 경우 평상시 조석이 영향을 미치는 범위는 잠실수중보 직하류까지이다. 한강 본류에 계획홍수량이 흐르는 경우 한강대교 지점에는 조석의 영향이 나타나지 않으며, 약 10,000cms 이상의 홍수량에서는 조석영향이 거의 나타나지 않는 것으로 분석되었다. 임진강의 경우에도 계획 홍수량이 흐를 경우 조석이 영향을 미치는 범위는 하구부 일정 구간에 한정된다. 한강 하구부에서 홍수시 조석의 영향으로 인해 홍수위가 상승될 수 있는 경우는 제한적이라고 할 수 있다. 임진강의 유량은 한강의 조석변화에도 영향을 미친다. 임진강에 평상시 유량이 흐르는 경우와 홍수량이 흐르는 경우에 나타나는 한강의 조석영향 범위 및 크기는 다르다. 반대로 한강의 유량은 임진강의 흐름에도 영향을 미치게 된다. 이와 같은 상호간의 영향은 매우 밀접하게 발생하게 된다. 한강 하구부에 설치되어 있는 신곡수중보는 조석의 변화에 큰 영향을 미치고 있다. 조석으로 인해 발생하는 수위의 변화가 수중보로 인해 줄어들게 되어 이 지점을 기준으로 수위차가 발생하게 된다. 만조시에는 수중보를 월류하는 흐름이 발생하는데 상류방향의 유속이 빠르게 나타난다. 수심방향의 유속변화도 크게 나타나는데 상류 및 하류 방향의 유속이 시간과 장소에 따라 매우 다양하고 복잡하게 나타나게 된다. 한강 하구부의 수리현상은 매우 복잡하지만 지금까지 조사되거나 분석되지 못한 것이 사실이다. 하구부의 지속가능한 관리를 위해서는 의사결정을 할 수 있는 기초자료와 분석 결과가 매우 중요하다. 본 연구의 결과는 한강 하구 조사와 분석을 위해 활용될 수 있으리라 기대된다.

  • PDF

Grover-Based Quantum Security Analysis Using width Efficient QuantumCircuit of ASCON (Width 효율적 ASCON 양자 회로를 이용한 Grover기반 양자 보안비도 분석)

  • Jinseob Oh;Chanho Choi;Dooho Choi
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • 제34권6호
    • /
    • pp.1189-1199
    • /
    • 2024
  • This paper discusses the need to reevaluate the security of existing cryptographic systems due to the advancement of quantum computing, and analyzes the security level of the NIST lightweight cipher ASCON based on the Grover key search algorithm. In particular, we present a novel quantum circuit implementation of ASCON-128 with a consist of clifford+T gates, which solves the problem of initializing the auxiliary qubit value. We simplified ASCON's cryptographic structure and measured the resource consumption to analyze the security level based on Grover's key discovery algorithm, and found that the cost associated with the space-time complexity, Td-M and Fd-M, was reduced by 85.65% and 83.73%, respectively, despite solving the secondary qubit initialization problem.

Improvement of White Shark Algorithms Combining Logistic Maps and Gaussian Variations for Underground Logistics Network System Optimization (지하 물류 네트워크 시스템 최적화를 위한 로지스틱 맵과 가우스 변이를 결합한 화이트 샤크 알고리즘 개선)

  • Zhou Bing;Byung-Won Min
    • Journal of Internet of Things and Convergence
    • /
    • 제10권6호
    • /
    • pp.151-165
    • /
    • 2024
  • The planning of underground logistics pipeline networks is a crucial component of urban underground logistics systems, aiming to find the optimal construction path for the logistics network, improve logistics efficiency, and reduce operational costs. However, due to the complexity and uncertainty of the underground environment, traditional planning methods often fall short. This paper proposes a improved underground logistics pipeline network planning method based on the White Shark Optimization(WSO) algorithm, referred to as LGWSO(White Shark Algorithms Combining Logistic Maps and Gaussian Variations). The proposed method first establishes an underground space model and then uses the LGWSO algorithm for path planning. By adopting chaos initialization method and Gaussian mutation strategy, the performance of the algorithm has been effectively improved. Through simulation experiments, the algorithm has demonstrated significant advantages in optimization accuracy, convergence speed, and robustness. Compared to traditional planning methods, the proposed approach is better suited to handle the complex underground environment, providing an optimized strategy for the construction of urban logistics system underground networks.

Crowd Density Prediction Using convLSTM Combined with Multi-Head Attention (다중 헤드 어텐션과 결합한 convLSTM을 활용한 군중 밀도 예측)

  • Patel Dhanshree Suresh;Nusrat Jahan Tahira;Sheilla Wesonga;Jang-Sik Park
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • 제19권6호
    • /
    • pp.1319-1326
    • /
    • 2024
  • Accurate crowd density prediction is crucial for applications such as crowd management, public safety, and urban planning. Traditional methods often struggle with capturing temporal dependencies and dynamic changes in video sequences, leading to less reliable forecasts. Dense and dynamic crowds present additional challenges, including occlusions, motion blur, and varied perspectives, which complicate accurate density estimation. To address these issues, we propose a novel approach that integrates convolutional Long Short-Term Memory (convLSTM) networks with Multi-Head Attention mechanisms. This combined model improves prediction accuracy by effectively capturing temporal patterns and spatial relationships, even in complex scenarios. Extensive experiments show that our method significantly outperforms traditional techniques, offering a robust solution for precise crowd density prediction in real-world applications.

A Study on the Emotional Reaction to the Interior Design - Focusing on the Worship Space in the Church Buildings - (실내공간 구성요소에 의한 감성반응 연구 - 기독교 예배공간 강단부를 중심으로 -)

  • Lee, Hyun-Jeong;Lee, Gyoo-Baek
    • Archives of design research
    • /
    • 제18권4호
    • /
    • pp.257-266
    • /
    • 2005
  • The purpose of this study is to investigate the psychological reaction to the image of the worship space in the church buildings and to quantify its contribution of the stimulation elements causing such reaction, and finally to suggest basic data for realizing emotional worship space of the church architecture. For this, 143 christians were surveyed to analyze the relationship between 23 emotional expressions extracted from the worship space and 32 images of the worship space. The combined data was described with the two dimensional dispersion using the quantification theory III. The analysis found out that 'simplicity-complexity' of the image consisted of the horizontal axis (the x-axis) and 'creativity' of the image the vertical axis(the y-axis). In addition, to extract the causal relationship between the value of emotional reaction and its stimulation elements quantitatively, the author indicated 4 emotional word groups such as simple, sublime for x-axis and typical creative for y-axis based on its similarity by the cluster analysis, The quantification theory I was also used with total value of equivalent emotional words as the standard variance and the emotional stimulation elements of the worship space as the independent variance. 9 specific examples of the emotional stimulation elements were selected including colors and shapes of the wall and the ceiling, shapes and finish of the floor materials, window shapes, and the use of the symbolic elements. Furthermore, 31 subcategories were also chosen to analyse their contribution on the emotional reaction. As a result, the color and finish of the wall found to be the most effective element on the subjects' emotional reaction, while the symbolic elements and the color of the wall found to be the least effective. It is estimated that the present study would be helpful to increase the emotional satisfaction of the users and to approach a spatial design through satisfying the types and purposes of the space.

  • PDF

Analysis of Characteristics in Ara River Basin Using Fractal Dimension (프랙탈 차원을 이용한 아라천 유역특성 분석)

  • Hwang, Eui-Ho;Lee, Eul-Rae;Lim, Kwang-Suop;Jung, Kwan-Sue
    • Journal of Korea Water Resources Association
    • /
    • 제44권10호
    • /
    • pp.831-841
    • /
    • 2011
  • In this study, with the assumption that the geographical characteristics of the river basin have selfsimilarity, fractal dimensions are used to quantify the complexity of the terrain. For this, Area exponent and hurst exponent was applied to estimate the fractal dimension by using spatial analysis. The result shows that the value of area exponent and hurst exponent calculated by the fractal dimension are 2.008~2.074 and 2.132~2.268 respectively. Also the $R^2$ of area exponent and hurst exponent are 94.9% and 87.1% respectively too. It shows that the $R^2$ is relatively high. After analyzing the spatial self-similarity parameter, it is shown that traditional urban area's moderate slope geographical characteristic closed to 2D fractal in Ara water way. In addition, the relation between fractal dimension and geographical elements are identified. With these results, fractal dimension is the representative value of basin characteristics.

An On-chip Cache and Main Memory Compression System Optimized by Considering the Compression rate Distribution of Compressed Blocks (압축블록의 압축률 분포를 고려해 설계한 내장캐시 및 주 메모리 압축시스템)

  • Yim, Keun-Soo;Lee, Jang-Soo;Hong, In-Pyo;Kim, Ji-Hong;Kim, Shin-Dug;Lee, Yong-Surk;Koh, Kern
    • Journal of KIISE:Computer Systems and Theory
    • /
    • 제31권1_2호
    • /
    • pp.125-134
    • /
    • 2004
  • Recently, an on-chip compressed cache system was presented to alleviate the processor-memory Performance gap by reducing on-chip cache miss rate and expanding memory bandwidth. This research Presents an extended on-chip compressed cache system which also significantly expands main memory capacity. Several techniques are attempted to expand main memory capacity, on-chip cache capacity, and memory bandwidth as well as reduce decompression time and metadata size. To evaluate the performance of our proposed system over existing systems, we use execution-driven simulation method by modifying a superscalar microprocessor simulator. Our experimental methodology has higher accuracy than previous trace-driven simulation method. The simulation results show that our proposed system reduces execution time by 4-23% compared with conventional memory system without considering the benefits obtained from main memory expansion. The expansion rates of data and code areas of main memory are 57-120% and 27-36%, respectively.