• Title/Summary/Keyword: 계수 탐색

Search Result 370, Processing Time 0.031 seconds

3D Range Data Registration Using Corresponding Image (영상정보를 이용한 3차원 정보의 정합)

  • 하승태;한준희
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2000.04b
    • /
    • pp.595-597
    • /
    • 2000
  • 3차원 정보의 올바른 정합을 위해서 3차원 정보 자신 뿐만이 아니라 3차원 정보와 연관된 영상 정보를 이용한다. 먼저 영상의 정합을 수행함에 있어 서로 다른 두 영상간에 상관 윈도우를 씌워 상관계수를 계산하여 최적 정합점을 탐색한다. 본 논문에서는 카메라의 서로 다른 관점으로 인한 상관위도우의 뒤틀림을 3차원 초기 변환 행렬을 이용하여 보정하는 방법을 제안하고, 이에 의해 3차원 변환된 상관 윈도우를 정합에 이용함으로서 상관계수의 정확도를 급격히 향상시킨다. 그 결과로 개선된 특징점 정합 결과로부터 영상 전반에 걸친 3차원 특징점 정합을 통해 이와 대응하는 3차원 정보의 정확한 정합 결과를 얻는다.

  • PDF

A Study on AESA Antenna Performance Advancement for Seeker (탐색기용 AESA 안테나 성능 고도화 연구)

  • Youngwan Kim;Jong-Kyun Back;Hee-Duck Chae;Ji-Han Joo
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.23 no.5
    • /
    • pp.103-108
    • /
    • 2023
  • In this paper, a performance enhancement study of an AESA antenna that can be applied to a seeker that serves as the eye of a missile was conducted, and the performance of the antenna was verified through actual measurement. When designing an AESA antenna, the optimization of the active reflection coefficient must be considered during transmission due to the mutual coupling between radiators that inevitably occurs, and the selection of a radiator that can overcome the space limitation of the seeker with a small size/light weight is an important design consideration. Accordingly, optimization in terms of electrical performance and low-profile structure is required through research on array antennas for application to the AESA structure. The radiator designed and measured in this paper was designed as an SFN that can satisfy the low-profile structure while enhancing the performance of a general vivaldi antenna. Through this paper, it was confirmed that SFN has the same broadband characteristics as general vivaldi antennas and has optimized characteristics required for AESA antennas. The structure optimized through simulation confirmed the pattern characteristics and active reflection coefficient characteristics through the fabrication of actual proto-type antennas.

A method of Fast motion estimation using Motion characteristics of Macro-blocks in Search range (탐색 영역내 매크로 블록 움직임 특성을 이용한 고속 움직임 예측 방법)

  • Jeong, Yong-Jae;Moon, Kwang-Seok;Kim, Jong-Nam
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2009.04a
    • /
    • pp.157-158
    • /
    • 2009
  • 본 논문에서는 움직임 추정을 위한 탐색 영역내의 스캔 방법을 움직임 벡터가 나올 확률에 근거하여 가변적으로 적용하여 불필요한 후보 블록을 제거하는 PDE(patial distortion elimination) 기반의 고속 블록 매칭 알고리즘을 제안한다. 제안한 방법은 기존의 방법보다 불필요한 계수를 효율적으로 제거하기 위하여 탐색 영역 안에서 움직임 벡터가 존재 할 확률이 가장 높은 영역은 전영역 탐색을 적용하고, 움직임 벡터가 존재할 확률이 낮은 영역은 한 픽셀 건너 뛰어서 블록 정합하여 계산 비용을 효율적으로 감소시켯다. 제안한 알고리즘은 극히 낮은 화질 저하를 가지며, 기존의 H.264에서 사용되고 있는 전역 탐색 알고리즘에 비해 P프레임의 경우 85% 이상의 계산 비용 감소가 있어 H.264를 이용하는 비디오 압축 응용 분야에 유용하게 사용될 수 있을 것이다.

Fault Diagnosis using Neural Network by Tabu Search Learning Algorithm (Tabu 탐색학습알고리즘에 의한 신경회로망을 이용한 결함진단)

  • 양보석;신광재;최원호
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 1995.10a
    • /
    • pp.280-283
    • /
    • 1995
  • 계층형 신경회로망은 학습능력이나 비선형사상능력을 가지고 있고, 그 특징을 이용하여 패턴인식이나 동정 및 제어 등에의 적용이 시도되어 성과를 올리고 있다. 현재, 그 학습법으로 널리 이용되고 있는 것이 역전파학습법으로 최급 강하법이나 공액경사법 등의 최적화 방법이 적용되고 있지만, 학습에 많은 시간이 걸리는 점, 국소적 최적해(local minima)에 해의 수렴이 이루어져 오차가 충분히 작게 되지 않는 점 등이 문제점으로 지적되고 있다. 본 논문에서는 Hu에 의해 고안된 random 탐색법과 조합된 random tabu 탐색법으로 최적결합계수를 구하는 학습알고리즘으로, 국소적 최적해에 수렴하는 것을 방지하고, 수렴정도를 개선하는 새로운 방법을 이용하여 회전기계의 이상진동진단에 적용가능성을 검토하고 오차역전파법에 의한 진단결과와 비교검토한다.

  • PDF

A Variable Quantization Coefficient Scanning for Macroblock Considering the Histogram Value of Previous Macroblock's Quantization Coefficient (이전 매크로블록의 양자화계수 누적값을 이용한 매크로블록 마다 가변적인 양자화계수 탐색방법)

  • Hyun, Myung-Han
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.14 no.2
    • /
    • pp.281-288
    • /
    • 2011
  • In this paper, a variable quantization coefficient scanning for macroblock considering the histogram value of previous macroblock's quantization coefficient is proposed. In order to scan a quantization coefficient, the proposed method makes $4{\times}4$ histograms for various prediction modes($16{\times}16$, $16{\times}8$, $8{\times}16$, $8{\times}8$) by adding 1 if the value of quantization coefficient is not 0. After a final mode decision procedure, the $4{\times}4$ histogram of the final mode will be sorted. Then, quantization coefficients in corresponding macroblock of the next frame are scanned using the sorted order. The experimental results show that the proposed scheme reduces the total bits by approximately 0.01~2.25% with similar PSNR performance compared with the previous method.

Development of the Algorithm of a Public Transportation Route Search Considering the Resistance Value of Traffic Safety and Environmental Index (교통안전, 환경지표의 저항값을 고려한 대중교통 경로 탐색 알고리즘 개발)

  • Kim, Eun-Ji;Lee, Seon-Ha;Cheon, Choon-Keun;Yu, Byung-Young
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.16 no.1
    • /
    • pp.78-89
    • /
    • 2017
  • This study derived the algorithm of a public transportation route search that adds safety and environmental costs according to user preference. As the means of an algorithm application and evaluation, Macro Simulation, VISUM was conducted for an analysis. The route using the subway, which is relatively low in safety and environment resistance value was preferred, and it was analyzed to select the safe and environmental route even though it detours. This study can be applicable when to verify the algorithm of route search considering safety and environment, and when introducing the algorithm of route search according to user preference in the smart-phone application in the future, it can provide users with very useful information by choosing a route as for safety and environment, and through this, the quality of user-friendly information provision can be promoted.

Estimation of K-factor according to Road Type and Economic Evaluation on National Highway (일반국도의 도로 유형별 설계시간계수 산정 및 경제성 평가)

  • Kim, Tae-woon;Oh, Ju-sam
    • The Journal of the Korea Contents Association
    • /
    • v.15 no.11
    • /
    • pp.582-590
    • /
    • 2015
  • Road type classification and K-factors are important role when design of number of lane. In this study not only classifies road type and estimating of K-factor but also economic evaluation tries for feasibility verification. Road type analysis results, time of day traffic volume variation, weekend-factor and vacation-factor are large in recreation roads. Weekday traffic volume and weekend traffic volume are similar patterns in provincial roads. AADT is high and time of day traffic volume variation is small in urban roads. In this study compares with economic analysis that designing of number of lane between KHCM's K-factor and this study K-factor. Economic analysis results, designed roads by this study's K-factor reduce cost about 4,708 hundred million won. So this study's K-factor is economical on provincial 4 lane roads.

Exploring interaction using 3-D residual plots in logistic regression model (3차원 잔차산점도를 이용한 로지스틱회귀모형에서 교호작용의 탐색)

  • Kahng, Myung-Wook
    • Journal of the Korean Data and Information Science Society
    • /
    • v.25 no.1
    • /
    • pp.177-185
    • /
    • 2014
  • Under bivariate normal distribution assumptions, the interaction and quadratic terms are needed in the logistic regression model with two predictors. However, depending on the correlation coefficient and the variances of two conditional distributions, the interaction and quadratic terms may not be necessary. Although the need for these terms can be determined by comparing the two scatter plots, it is not as useful for interaction terms. We explore the structure and usefulness of the 3-D residual plot as a tool for dealing with interaction in logistic regression models. If predictors have an interaction effect, a 3-D residual plot can show the effect. This is illustrated by simulated and real data.

A Fast Motion Estimation Algorithm Using Adaptive Elimination of Sub-block Partial Coefficient (서브블록 부분 계수 적응제거를 통한 고속 움직임 추정 알고리즘)

  • Ryu, Tae-Kyung;Moon, Kwang-Seok;Kim, Jong-Nam
    • Journal of Korea Multimedia Society
    • /
    • v.12 no.4
    • /
    • pp.483-491
    • /
    • 2009
  • In this paper, we propose a fast motion estimation algorithm using adaptive elimination of sub-block partial coefficients. The proposed algorithm predicts an adaptive threshold for each sub-block by using relationship of an initial sum of absolute difference(SAD) and a minimum SAD at the current point, and efficiently reduces unnecessary calculation time of the conventional partial distortion elimination(PDE) algorithm with the predicted threshold. Our algorithm reduces about 60% of computations of the conventional PDE algorithm without any degradation of prediction quality compared with the con ventional full search. Additionally, the proposed algorithm can be applied to other fast motion estimation 떠gorithms. the proposed Our proposing algorithm will be useful to real-time video coding applications using MPEG-2 or MPEG-4 AVC standards.

  • PDF

Regression Trees with. Unbiased Variable Selection (변수선택 편향이 없는 회귀나무를 만들기 위한 알고리즘)

  • 김진흠;김민호
    • The Korean Journal of Applied Statistics
    • /
    • v.17 no.3
    • /
    • pp.459-473
    • /
    • 2004
  • It has well known that an exhaustive search algorithm suggested by Breiman et. a1.(1984) has a trend to select the variable having relatively many possible splits as an splitting rule. We propose an algorithm to overcome this variable selection bias problem and then construct unbiased regression trees based on the algorithm. The proposed algorithm runs two steps of selecting a split variable and determining a split rule for binary split based on the split variable. Simulation studies were performed to compare the proposed algorithm with Breiman et a1.(1984)'s CART(Classification and Regression Tree) in terms of degree of variable selection bias, variable selection power, and MSE(Mean Squared Error). Also, we illustrate the proposed algorithm with real data sets.