• 제목/요약/키워드: recursive

검색결과 1,608건 처리시간 0.029초

A Random Deflected Subgradient Algorithm for Energy-Efficient Real-time Multicast in Wireless Networks

  • Tan, Guoping;Liu, Jianjun;Li, Yueheng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제10권10호
    • /
    • pp.4864-4882
    • /
    • 2016
  • In this work, we consider the optimization problem of minimizing energy consumption for real-time multicast over wireless multi-hop networks. Previously, a distributed primal-dual subgradient algorithm was used for finding a solution to the optimization problem. However, the traditional subgradient algorithms have drawbacks in terms of i) sensitivity to iteration parameters; ii) need for saving previous iteration results for computing the optimization results at the current iteration. To overcome these drawbacks, using a joint network coding and scheduling optimization framework, we propose a novel distributed primal-dual Random Deflected Subgradient (RDS) algorithm for solving the optimization problem. Furthermore, we derive the corresponding recursive formulas for the proposed RDS algorithm, which are useful for practical applications. In comparison with the traditional subgradient algorithms, the illustrated performance results show that the proposed RDS algorithm can achieve an improved optimal solution. Moreover, the proposed algorithm is stable and robust against the choice of parameter values used in the algorithm.

메쉬 연결망의 강한 해밀톤 laceability (Strongly Hamiltonian Laceability of Mesh Networks)

  • 박경욱;임형석
    • 한국정보과학회논문지:시스템및이론
    • /
    • 제32권8호
    • /
    • pp.393-398
    • /
    • 2005
  • 상호 연결망에서 해밀톤 경로는 선형 배열 구현이나 멀티캐스팅과 같은 여러 응용에서 활용된다. 본 논문에서는 여러 병렬 시스템의 상호연결망으로 사용되는 메쉬 연결망의 해밀톤 성질에 대해 고려한다. 연결망이 강한 해밀톤 laceable이면 그 연결망은 임의의 두 노드를 잇는 가능한 가장 긴 길이의 경로를 지닌다. 2차원 메쉬 M(m, n)은 노드의 수가 짝수이면 $m{\geq}4,\;n{\geq}4$일 때, 노드의 수가 홀수이면 $m{\geq}3,\;n{\geq}3$일 때 강한 해밀톤 laceable 그래프임을 보인다. 메쉬는 토러스, k-ary n-큐브, 하이퍼큐브, 재귀원형군과 같은 여러 상호 연결망들의 스패닝 부 그래프이므로 본 논문의 결과는 이들 연결망들의 고장 해밀톤 성질을 밝히는데 활용될 수 있다.

TWO KINDS OF STATIC AND DYNAMIC STATE ESTIMATION METHODS BY USING WIND SPEED INFORMATION IN ENVIRONMENTAL LOW-FREQUENCY NOISE MEASUREMENT

  • Takakuwa, Y.;Ohta, M.;Nishimura, M.;Minamihara, H.
    • 한국음향학회:학술대회논문집
    • /
    • 한국음향학회 1994년도 FIFTH WESTERN PACIFIC REGIONAL ACOUSTICS CONFERENCE SEOUL KOREA
    • /
    • pp.806-811
    • /
    • 1994
  • Two kinds of static and dynamic state estimation methods are newly discussed for the problem of the measurement disturbance of environmental low-frequency noise in the presence of wind-induced noise. First, the probability characteristics of wind-induced noise are discussed in the form of probability distribution conditioned by wind speed, based on the simultaneous observation of the wind-induced noise and wind speed near a microphone. Next, especially form the viewpoint of simplicity for practical use, two kinds of static and dynamic state estimation methods are discussed. The static estimation method using the information on wind speed is fundamentally supported by the conservation principle of energy sum. The dynamic one is the method by using a recursive digital filter with the parameters successively renewed by the information on wind speed. This can be also simplified by using well-know Kalman filter under the assumption of the Gaussian distribution. The effectiveness of proposed two estimation methods are shown through experiments under a breezy condition in the open filed.

  • PDF

그레이 레이블링 및 퍼지 추론 규칙을 이용한 흰색 자동차 번호판 추출 기법 (License Plate Extraction Using Gray Labeling and fuzzy Membership Function)

  • 김도현;차의영
    • 한국정보통신학회논문지
    • /
    • 제12권8호
    • /
    • pp.1495-1504
    • /
    • 2008
  • 2007년부터 흰색 바탕의 자동차 번호판이 등록되어 사용되고 있다. 본 논문은 그레이 레이블링 기법과 퍼지 추론 방법을 이용하여 새롭게 사용되고 있는 흰색 번호판을 추출하기 위 한 방법을 제안한다. 먼저 비재귀 Flood-filling 알고리즘을 개선한 그레이 레이블링(labeling) 기법으로 번호판 후보 영역을 추출한다. 추출된 레이블에 대한 적합도를 퍼지 추론 시스템에 의해 산출한 후 후보 레이블 중에서 가장 적합도가 높은 레이블 영역을 최종 번호판 영역으로 추출한다. 실내외 주차장 및 거리에서 핸드폰 및 디지털 카메라로 획득한 다양한 자동차 번호판 영상을 대상으로 실험한 결과 94%의 추출 성공율을 나타내었다.

지형분석을 이용한 산지토양 탄소의 분포 예측과 불확실성 (Spatial Prediction of Soil Carbon Using Terrain Analysis in a Steep Mountainous Area and the Associated Uncertainties)

  • 정관용
    • 한국지형학회지
    • /
    • 제23권3호
    • /
    • pp.67-78
    • /
    • 2016
  • Soil carbon(C) is an essential property for characterizing soil quality. Understanding spatial patterns of soil C is particularly limited for mountain areas. This study aims to predict the spatial pattern of soil C using terrain analysis in a steep mountainous area. Specifically, model performances and prediction uncertainties were investigated based on the number of resampling repetitions. Further, important predictors for soil C were also identified. Finally, the spatial distribution of uncertainty was analyzed. A total of 91 soil samples were collected via conditioned latin hypercube sampling and a digital soil C map was developed using support vector regression which is one of the powerful machine learning methods. Results showed that there were no distinct differences of model performances depending on the number of repetitions except for 10-fold cross validation. For soil C, elevation and surface curvature were selected as important predictors by recursive feature elimination. Soil C showed higher values in higher elevation and concave slopes. The spatial pattern of soil C might possibly reflect lateral movement of water and materials along the surface configuration of the study area. The higher values of uncertainty in higher elevation and concave slopes might be related to geomorphological characteristics of the research area and the sampling design. This study is believed to provide a better understanding of the relationship between geomorphology and soil C in the mountainous ecosystem.

Upward Trajectory of the Accommodation Sharing Economy & Distributional Values

  • LEE, Eun-Joo;CHO, Yooncheong
    • 유통과학연구
    • /
    • 제19권10호
    • /
    • pp.75-86
    • /
    • 2021
  • Purpose: The purpose of this study is to address policy preparation and amendments on regulations in accommodation sharing for resource distribution by fostering better adjustment in a society, since previous studies are rarely investigated in those issues. After conduct exploratory research about laws and regulations of accommodation sharing, this study investigates how effective policy instruments improve trust in accommodation sharing and potential growth by investigating the perceptions of individuals and by applying policymaking procedures. Research design, data and methodology: The data is collected via online survey. Structural equation modeling with confirmatory factor analysis and non-recursive model with multiple regression analysis were applied. Results: The results of this study found that among proposed policy instruments, individuals perceive local ordinances, government publicizing and campaign, trust marks, taxation, penalties, and government controls are effective to build trust in accommodation sharing. Policies geared toward the majority of the public are more effective, while governments should establish a strategic approach as to which policies are introduced in public and which role the government plays in the departments. Conclusions: The results provide policy and managerial implications how to enhance distributional values of accommodation sharing economy with proper preparations and amendments of laws and regulations.

반복형 위너 필터 방법에 기반한 재귀적 완전 최소 제곱 방법을 사용한 시간 지연 추정 알고리즘 (Time delay estimation by iterative Wiener filter based recursive total least squares algorithm)

  • 임준석
    • 한국음향학회지
    • /
    • 제40권5호
    • /
    • pp.452-459
    • /
    • 2021
  • 서로 떨어져 설치된 두 개의 음향 수신기에 도달하는 신호의 상호 지연 시간을 추정하는 것은 실내 음향과 소나 등에서 목표물 위치 추정 문제나 추적 등 여러 방면에서 쓰이고 있다. 시간 지연을 구하는 방법에서는 두 수신 신호 사이의 상호 상관을 이용한 방법으로 대표되는 비 파라메트릭 방법과 시스템 인식을 기반으로 하는 파라메트릭 방법이 있다. 본 논문에서는 파라메트릭 방법에 기반을 둔 시간 지연 추정 방법을 제안한다. 특히 음향 수신기에 잡음이 부과되는 것을 고려한 방법을 제안한다. 그리고 백색 잡음 및 잔향 환경에서 기존의 일반 상호 상관법과 적응 고유치 분석법과 비교를 통해서 새로 제안한 알고리즘이 더 우수함을 확인한다.

CNN-based Fast Split Mode Decision Algorithm for Versatile Video Coding (VVC) Inter Prediction

  • Yeo, Woon-Ha;Kim, Byung-Gyu
    • Journal of Multimedia Information System
    • /
    • 제8권3호
    • /
    • pp.147-158
    • /
    • 2021
  • Versatile Video Coding (VVC) is the latest video coding standard developed by Joint Video Exploration Team (JVET). In VVC, the quadtree plus multi-type tree (QT+MTT) structure of coding unit (CU) partition is adopted, and its computational complexity is considerably high due to the brute-force search for recursive rate-distortion (RD) optimization. In this paper, we aim to reduce the time complexity of inter-picture prediction mode since the inter prediction accounts for a large portion of the total encoding time. The problem can be defined as classifying the split mode of each CU. To classify the split mode effectively, a novel convolutional neural network (CNN) called multi-level tree (MLT-CNN) architecture is introduced. For boosting classification performance, we utilize additional information including inter-picture information while training the CNN. The overall algorithm including the MLT-CNN inference process is implemented on VVC Test Model (VTM) 11.0. The CUs of size 128×128 can be the inputs of the CNN. The sequences are encoded at the random access (RA) configuration with five QP values {22, 27, 32, 37, 42}. The experimental results show that the proposed algorithm can reduce the computational complexity by 11.53% on average, and 26.14% for the maximum with an average 1.01% of the increase in Bjøntegaard delta bit rate (BDBR). Especially, the proposed method shows higher performance on the sequences of the A and B classes, reducing 9.81%~26.14% of encoding time with 0.95%~3.28% of the BDBR increase.

Video Expression Recognition Method Based on Spatiotemporal Recurrent Neural Network and Feature Fusion

  • Zhou, Xuan
    • Journal of Information Processing Systems
    • /
    • 제17권2호
    • /
    • pp.337-351
    • /
    • 2021
  • Automatically recognizing facial expressions in video sequences is a challenging task because there is little direct correlation between facial features and subjective emotions in video. To overcome the problem, a video facial expression recognition method using spatiotemporal recurrent neural network and feature fusion is proposed. Firstly, the video is preprocessed. Then, the double-layer cascade structure is used to detect a face in a video image. In addition, two deep convolutional neural networks are used to extract the time-domain and airspace facial features in the video. The spatial convolutional neural network is used to extract the spatial information features from each frame of the static expression images in the video. The temporal convolutional neural network is used to extract the dynamic information features from the optical flow information from multiple frames of expression images in the video. A multiplication fusion is performed with the spatiotemporal features learned by the two deep convolutional neural networks. Finally, the fused features are input to the support vector machine to realize the facial expression classification task. The experimental results on cNTERFACE, RML, and AFEW6.0 datasets show that the recognition rates obtained by the proposed method are as high as 88.67%, 70.32%, and 63.84%, respectively. Comparative experiments show that the proposed method obtains higher recognition accuracy than other recently reported methods.

A MA-plot-based Feature Selection by MRMR in SVM-RFE in RNA-Sequencing Data

  • Kim, Chayoung
    • 한국정보기술학회논문지
    • /
    • 제16권12호
    • /
    • pp.25-30
    • /
    • 2018
  • 유전자 규정 네트워크 (GRN)에 RNA-시퀀싱 데이터를 활용할 때, 해당 유전자와 환경과의 상호 작용에 의해서 생기는 형질들 중에서 연관성이 높은 유전자로 GRN을 구성하는 것은 상당히 어려운 일이다. 본 연구에서는 Big-Data의 RNA-시퀀싱 자료들로, 지지 벡터 머신 회귀 특징 추출(SVM-RFE) 에 근거하여, 연관성이 높은 유전자(maximum-relevancy)는 추출하고, 연관성이 낮은 유전자(minimum-redundancy)는 제거하는 MRMR 필터 방법을 집중도 의존 정규화(intensity-dependent normalization, DEGSEQ)에 기반 하여 데이터의 정밀성을 높여, 소수 연관성 높은 유전자만 판별해 내는 방법을 사용한다. 제안한 방법은 R 언어 패키지를 사용하여 편리함과 동시에, 다른 기존의 방법을 비교하였을 때, Big-Data의 시간 활용도를 높이면서, 동시에 높은 연관성 있는 유전자만을 잘 추출해 냄을 확인하였다.