• 제목/요약/키워드: Advanced Search

검색결과 699건 처리시간 0.029초

공력 Buffet 하증을 고려한 헬리콥터 탐색등의 구조진동해석 (Structural Vibration Analysis of Helicopter Search Light Considering Aerodynamic Buffet Load)

  • 김요한;김동만;김동현;최희주;박용석;김종건
    • 한국소음진동공학회:학술대회논문집
    • /
    • 한국소음진동공학회 2008년도 추계학술대회논문집
    • /
    • pp.175-179
    • /
    • 2008
  • In this study, computational structural vibration analysis of helicopter search light exposing unsteady buffet load have been conducted using combined advanced numerical methods. Unsteady CFD method based on Navier-Stokes equations is used to predict viscous buffet load due to flow separation effects. Full three-dimensional finite element model is constructed in order to conduct static and structural dynamic analyses of the search light model for two different typical flight speeds. Also, the correct performance of the search light can be physically estimated to examine the actual lighting area considering the effects of structural deformations.

  • PDF

Fast Motion Estimation Based on a Modified Median Operation for Efficient Video Compression

  • Kim, Jongho
    • Journal of information and communication convergence engineering
    • /
    • 제12권1호
    • /
    • pp.53-59
    • /
    • 2014
  • Motion estimation is a core part of most video compression systems since it directly affects the output video quality and the encoding time. The full search (FS) technique gives the highest visual quality but has the problem of a significant computational load. To solve this problem, we present in this paper a modified median (MMED) operation and advanced search strategies for fast motion estimation. The proposed MMED operation includes a temporally co-located motion vector (MV) to select an appropriate initial candidate. Moreover, we introduce a search procedure that reduces the number of thresholds and simplifies the early termination conditions for the determination of a final MV. The experimental results show that the proposed approach achieves substantial speedup compared with the conventional methods including the motion vector field adaptive search technique (MVFAST) and predictive MVFAST (PMVFAST). The proposed algorithm also improves the PSNR values by increasing the correlation between the MVs, compared with the FS method.

A modified tabu search for redundancy allocation problem of complex systems of ships

  • Kim, Jae-Hwan;Jang, Kil-Woong
    • Journal of Advanced Marine Engineering and Technology
    • /
    • 제38권2호
    • /
    • pp.225-232
    • /
    • 2014
  • The traditional RAP (Redundancy Allocation Problem) of complex systems has considered only the redundancy of subsystem with homogeneous components. In this paper we extend it as a RAP of complex systems with heterogeneous components which is more flexible than the case of homogeneous components. We model this problem as a nonlinear integer programming problem, find its optimal solution by tabu search, and suggest an example of the efficient reliability design with heterogeneous components. In order to improve the quality of the solution of the tabu search, we suggest a modified tabu search to employ an adaptive procedure (1-opt or 2-opt exchange) to generate the efficient neighborhood solutions. Computational results show that our modified procedure obtains better solutions as the size of problem increases from 30 to 50, even though it requires rather more computing time. With some adjustment of the parameters of the proposed method, it can be applied to the optimal reliability designs of complex systems of ships.

The Dynamic Allocated Bees Algorithms for Multi-objective Problem

  • Lee, Ji-Young;Oh, Jin-Seok
    • Journal of Advanced Marine Engineering and Technology
    • /
    • 제33권3호
    • /
    • pp.403-410
    • /
    • 2009
  • The aim of this research is to develop the Bees Algorithm named 'the dynamic allocated Bees Algorithm' for multi-objective problem, especially in order to be suit for Pareto optimality. In addition two new neighbourhood search methods have been developed to produce enhanced solutions for a multi-objective problem named 'random selection neighbourhood search' and 'weighted sum neighbourhood search' and they were compared with the basic neighbourhood search in the dynamic allocated Bees Algorithm. They were successfully applied to an Environmental/Economic (electric power) dispatch (EED) problem and simulation results presented for the standard IEEE 30-bus system and they were compared to those obtained using other approaches. The comparison shows the superiority of the proposed dynamic allocated Bees Algorithms and confirms its suitability for solving the multi-objective EED problem.

공력 Buffet 하중을 고려한 헬리콥터 탐색등의 구조진동해석 (Structural Vibration Analysis of a Helicopter Search Light Considering Aerodynamic Buffet Load)

  • 김요한;김동만;김동현;최희주;박용석;김종건
    • 한국소음진동공학회논문집
    • /
    • 제19권9호
    • /
    • pp.870-875
    • /
    • 2009
  • In this study, computational structural vibration analysis of helicopter search light exposing unsteady buffet load have been conducted using combined advanced numerical methods. Unsteady CFD method based on Navier-Stokes equations is used to predict viscous buffet load due to flow separation effects. Full three-dimensional finite element model is constructed in order to conduct static and structural dynamic analyses of the search light model for two different typical flight speeds. Also, the correct performance of the search light can be physically estimated to examine the actual lighting area considering the effects of structural deformations.

A FAST METHOD FOR CODEBOOK SEARCH IN VSELP CODING

  • Sung Joo Kim
    • 한국음향학회:학술대회논문집
    • /
    • 한국음향학회 1994년도 FIFTH WESTERN PACIFIC REGIONAL ACOUSTICS CONFERENCE SEOUL KOREA
    • /
    • pp.943-948
    • /
    • 1994
  • The vector sum excited linear prediction(VSELP) coding gives high quality of synthetic speech at bit rates as low as 4.8kbps, but its computational complexity is prohibitive for real time applications. In this paper, we propose a method to reduce the computations of the VSELP codebook search procedure. The proposed method reduces the search space efficiently, before applying every linear combination of the basis vectors to the codebook search procedure. It decides whether is can fix the combination coefficient of each basis vector using heuristics so that the number of combinations decreases. It has been shown that the proposed method retains good quality of synthetic speech and reduces the computations of codebook search procedure by more than 40% of the origin.

  • PDF

A Hybrid Index of Voronoi and Grid Partition for NN Search

  • Seokjin Im
    • International journal of advanced smart convergence
    • /
    • 제12권1호
    • /
    • pp.1-8
    • /
    • 2023
  • Smart IoT over high speed network and high performance smart devices explodes the ubiquitous services and applications. Nearest Neighbor(NN) query is one of the important type of queries that have to be supported for ubiquitous information services. In order to process efficiently NN queries in the wireless broadcast environment, it is important that the clients determine quickly the search space and filter out NN from the candidates containing the search space. In this paper, we propose a hybrid index of Voronoi and grid partition to provide quick search space decision and rapid filtering out NN from the candidates. Grid partition plays the role of helping quick search space decision and Voronoi partition providing the rapid filtering. We show the effectiveness of the proposed index by comparing the existing indexing schemes in the access time and tuning time. The evaluation shows the proposed index scheme makes the two performance parameters improved than the existing schemes.

CELP 부호화기의 코드북 탐색 시간 개선 (Reduced Search for a CELP Adaptive Codebook)

  • 이지웅;나훈;정대권
    • 한국항행학회논문지
    • /
    • 제4권1호
    • /
    • pp.67-77
    • /
    • 2000
  • 본 논문에서는 웨이블렛 변환계수를 이용하여 CELP 부호기의 코드북 탐색 시간을 개선하는 새로운 방법을 제안하고 있다. CELP 음성 부호화기에서 적응 코드북 탐색시 개루프(open loop) 및 폐루프(closed loop) 탐색을 이용하여 피치를 추출하는 과정은 많은 연산량을 필요로 한다. 특히 개루프 탐색에서 전구간에 걸쳐 자기상관함수를 이용한 피치 추출은 과도한 탐색시간에 비효율적인 것으로 지적되어 왔다. 본 논문에서는 다양한 스케일리 계수에 대한 다이애딕 웨이블렛 변환계수의 최대값의 위치가 변하지 않는 주파수에 피치가 존재하는 특성을 이용하여 새로운 적응코드북 탐색 방법을 제안하고 있다. 제안한 알고리즘은 기존의 적응 코드북 탐색 시간을 25% 감소시켰고, 합성된 음성신호의 음질의 차이는 거의 느낄 수 없었다.

  • PDF

효율적인 영상 검색을 위한 클러스터링 기반 고속 다 해상도 전역 탐색 기법 (Fast Multi-Resolution Exhaustive Search Algorithm Based on Clustering for Efficient Image Retrieval)

  • 송병철;김명준;라종범
    • 대한전자공학회논문지SP
    • /
    • 제38권2호
    • /
    • pp.117-128
    • /
    • 2001
  • 유사도 측정자 (similarity measure)에 따라 문의자 (query)의 최적 정합자 (the best match)를 찾는 최적 검색 (optimal retrieval)을 위해서는 데이터베이스의 모든 영상들에 대해 전역 탐색 (exhaustive search)을 수행해야 한다. 그러나, 일반적인 전역 탐색은 방대한 계산량을 요구한다. 그 계산량을 줄이기 위해, 본 논문은 영상 데이터베이스의 클러스터링 (clustering)에 기반한 고속 다 해상도 전역 탐색 기법을 제안한다. 먼저 데이터베이스 내의 모든 영상들을 일정 수의 클러스터 (cluster)들로 나눈다. 각 클러스터는 유사한 특징 (feature)을 갖는 영상들로 구성된다. 그리고, 각 클러스터와 문의자 간 거리 (distance)의 하계(lower bound)를 구하고, 가능성이 전혀 없다고 판단될 경우 그 클러스터를 제거한다. 가능성이 있다고 판단된 클러스터들에 속한 후보 영상들 중에서 최적 정합자를 찾는다. 또한, 불필요한 특징 정합 연산을 줄이기 위해 다 해상도 데이터 구조에 기반한 거리 부등식 성질 (distance inequality property)을 유도하여, 탐색 과정에 적용한다. 제안한 기법은 고속 다 해상도 전역 탐색 기법으로서 단일 최적 정합자뿐만 아니라 다수의 상위 최적 정합자들도 정확하게 찾을 수 있다. 가장 보편적인 밝기 히스토그램 (luminance histogram)특징을 사용하여, 제안한 기법이 고속의 탐색 속도와 함께 최적 검색을 보장함을 증명해 보인다.

  • PDF

연속분포 HMM을 이용한 한국어 연속 음성 인식 시스템 개발 (On the Development of a Continuous Speech Recognition System Using Continuous Hidden Markov Model for Korean Language)

  • 김도영;박용규;권오욱;은종관;박성현
    • 한국음향학회지
    • /
    • 제13권1호
    • /
    • pp.24-31
    • /
    • 1994
  • 본 논문에서는 연속분포 hidden Markov모델을 이용한 화자독립 연속 음성 인식 시스템에 관해 기술한다. 연속분포 모델은 평균과 분산 벡터로 구성되며 음성신호를 직접 모델링하여 양자화 왜곡이 없어진다. 특징벡터는 filter bank 계수 및 그 1, 2차 미분계수를 사용하여 음성신호의 동적 특성을 반영하였다. Segmental K-means 알고리즘을 이용하여 학습하였으며, 연속어 인식에서 가장 문제가 되는 조음화 현상으로 인한 인식률 저하를 막기 위해 앞뒤의 음소를 고려해주는 triphone을 인식단위로 사용하였다. Search 알고리즘으로는 시간 면에서 효율이 좋은 one-pass search 알고리즘을 사용하였다 성능 평가를 위한 회자 독립인식 실험에서 문법이 없을 경우 $83\%$, finite state network을 적용한 경우에는 $94\%$의 인식률을 나타내었다.

  • PDF