• Title/Summary/Keyword: 고속 탐색

Search Result 472, Processing Time 0.02 seconds

Statistical Image Feature Based Block Motion Estimation for Video Sequences (비디오 영상에서 통계적 영상특징에 의한 블록 모션 측정)

  • Bae, Young-Lae;Cho, Dong-Uk;Chun, Byung-Tae
    • The Journal of the Korea Contents Association
    • /
    • v.3 no.1
    • /
    • pp.9-13
    • /
    • 2003
  • We propose a block motion estimation algorithm based on a statistical image feature for video sequences. The statistical feature of the reference block is obtained, then applied to select the candidate starting points (SPs) in the regular starting points pattern (SPP) by comparing the statistical feature of reference block with that of blocks which are spread ower regular SPP. The final SPs are obtained by their Mean Absolute Difference(MAD) value among the candidate SPs. Finally, one of conventional fast search algorithms, such as BRGDS, DS, and three-step search (TSS), has been applied to generate the motion vector of reference block using the final SPs as its starting points. The experimental results showed that the starting points from fine SPs were as dose as to the global minimum as we expected.

  • PDF

Fast Decoder Algorithm Using Hybrid Beam Search and Variable Flooring for Large Vocabulary Speech Recognition (대용량 음성인식을 위한 하이브리드 빔 탐색 방법과 가변 플로링 기법을 이용한 고속 디코더 알고리듬 연구)

  • Kim, Yong-Min;Kim, Jin-Young;Kim, Dong-Hwa;Kwon, Oh-Il
    • Speech Sciences
    • /
    • v.8 no.4
    • /
    • pp.17-33
    • /
    • 2001
  • In this paper, we implement the large variable vocabulary speech recognition system, which is characterized by no additional pre-training process and no limitation of recognized word list. We have designed the system in order to achieve the high recognition rate using the decision tree based state tying algorithm and in order to reduce the processing time using the gaussian selection based variable flooring algorithm, the limitation algorithm of the number of nodes and ENNS algorithm. The gaussian selection based variable flooring algorithm shows that it can reduce the total processing time by more than half of the recognition time, but it brings about the reduction of recognition rate. In other words, there is a trade off between the recognition rate and the processing time. The limitation algorithm of the number of nodes shows the best performance when the number of gaussian mixtures is a three. Both of the off-line and on-line experiments show the same performance. In our experiments, there are some differences of the recognition rate and the average recognition time according to the distinction of genders, speakers, and the number of vocabulary.

  • PDF

An Effective Reduction of Association Rules using a T-Algorithm (T-알고리즘을 이용한 연관규칙의 효과적인 감축)

  • Park, Jin-Hee;Chung, Hwan-Mook
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.19 no.2
    • /
    • pp.285-290
    • /
    • 2009
  • An association rule mining has been studied to find hidden data pattern in data mining. A realization of fast processing method have became a big issue because it treated a great number of transaction data. The time which is derived by association rule finding method geometrically increase according to a number of item included data. Accordingly, the process to reduce the number of rules is necessarily needed. We propose the T-algorithm that is efficient rule reduction algorithm. The T-algorithm can reduce effectively the number of association rules. Because that the T-algorithm compares transaction data item with binary format. And improves a support and a confidence between items. The performance of the proposed T-algorithm is evaluated from a simulation.

Analysis of Kronecker Sequence with Partial-Period Correlation in a Multiple-dwell Serical Serarch System (복수적분 시구간 직렬탐색 시스템에서 부분 상관기를 이용한 Kronecker 부호의 특성 분석)

  • 임연주;박상규
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.8B
    • /
    • pp.1333-1340
    • /
    • 2000
  • This paper shows that the Kronecker sequence, the rapid acquisition spreading code, can be used in packet wireless data communication systems. The general properties of the Kronecker sequence such as construction and correlation characteristics are described, and it is shown that the Kronecker sequence can use a partial-period correlation for a faster acquisition. Based on above Properties, it can be expected that the Kronecker sequence can be used in packet communication systems because the probability of false alarm for the Kronecker sequence is lower and flatter(that is, less sensitive to Ec/No variations) than that for the PN sequence under the assumption that both sequences have the same acquisition time.

  • PDF

Acceleration Method of Inter Prediction using Advanced SIMD (Advanced SIMD를 이용한 화면 간 예측 고속화방법)

  • Kim, Wan-Su;Lee, Jae-Heung
    • Journal of IKEEE
    • /
    • v.16 no.4
    • /
    • pp.382-388
    • /
    • 2012
  • An H.264/AVC fast motion estimation methodology is presented in this paper. Advanced SIMD based NEON which is one of the parallel processing methods is supported under the ARM Cortex-A9 dual-core platform. NEON is applied to a full search technique with one of the various motion estimation methods and SAD operation count of each macroblock is reduced to 1/4. Pixel values of the corresponding macroblock are assigned to eight 16-bit NEON registers and Intrinsic function in NEON architecture carried out 128 bits arithmetic operations at the same time. In this way, the exact motion vector with the minimum SAD value among the calculated SAD values can be designated. Experimental results show that performance gets improved 30% above average in accordance with the size of image and macroblock.

The Pathplanning of Navigation Algorithm using Dynamic Window Approach and Dijkstra (동적창과 Dijkstra 알고리즘을 이용한 항법 알고리즘에서 경로 설정)

  • Kim, Jae Joon;Jee, Gui-In
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2021.10a
    • /
    • pp.94-96
    • /
    • 2021
  • In this paper, we develop a new navigation algorithm for industrial mobile robots to arrive at the destination in unknown environment. To achieve this, we suggest a navigation algorithm that combines Dynamic Window Approach (DWA) and Dijkstra path planning algorithm. We compare Local Dynamic Window Approach (LDWA), Global Dynamic Window Approach(GDWA), Rapidly-exploring Random Tree (RRT) Algorithm. The navigation algorithm using Dijkstra algorithm combined with LDWA and GDWA makes mobile robots to reach the destination. and obstacles faced during the path planning process of LDWA and GDWA. Then, we compare on time taken to arrive at the destination, obstacle avoidance and computation complexity of each algorithm. To overcome the limitation, we seek ways to use the optimized navigation algorithm for industrial use.

  • PDF

Performance of an Efficient Association Control Scheme for Public Wireless LAN Systems (고속 공중 무선랜 시스템을 위한 효율적인 연결 요청 제어방법의 성능분석)

  • Lee Hyun woo;Kim Se han;Ryu Won;Yoon Chong ho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.3A
    • /
    • pp.209-216
    • /
    • 2005
  • This paper generally relates to the field of wireless local area networks(WLANs), and more particularly, to AP selection and association methods for the performance of a station. In these days, IEEE 802.11 Wireless LAN network is widely deployed and used as an emerging service to connect high-speed Internet in the public wireless environment. But, if there are many users in hot spot area, they suffer a severe decrease of performance. Thus it needs an association and access control mechanism especially when it is used in the public environment. In this paper, we suggest a selection and association method using Beacon or Probe Response frames based IEEE 802.11. Station selects AP using the information of the capacity area in a Beacon or a Probe Response frame. According to the present paper, an association method for a public WLAN service, which includes a WLAN user terminal and an AP for relaying WLAN communications to and from the user terminal, includes the steps of the user terminal asking the AP's states for access to a radio channel; and the station selects and associates with the AP According to the above-described selection in a high speed wireless Internet service based on public WLAN technologies that are currently in operations. Further, it is possible to improve the efficiency of network management.

Development of Reliability-Based Optimum Design of High-Speed Railway Bridges Considering Structure-Rail Longitudinal Interaction and Structure-Vehicle Interaction Using Heuristic Decision Method (Heuristic Decision Method를 이용하여 구조물-궤도 종방향 상호작용 및 구조물-차량 상호작용을 고려한 고속철도 교량의 신뢰성 최적설계 기법 개발)

  • Ihm, Yeong-Rok
    • Journal of the Korean Society of Hazard Mitigation
    • /
    • v.10 no.3
    • /
    • pp.31-38
    • /
    • 2010
  • In this study, it is suggested that it has to reliability-based design methodology with respect to bridge structure-rail longitudinal interaction and bridge structure-vehicle interaction. For the structural analysis, commercial package, ABAQUS, are used for a three-dimensional finite element analysis. The optimization process utilizes a well-known optimizer, ADS(Automated Design Synthesis). Optimization technique is utilized the ALM-BFGS method for global area search and Golden Section Method for 1-D search. In general, ALM-BFGS method don't need the 1-D search, and that algorithm converge a 0.1~0.2 of Push-Off factor. But in this study, value of Push-Off factor is used 90, therefore 1-D search should be needed for effective convergency. That algorithm contains the "heuristic decision method". As a result of optimum design of 2-main steel girder birdge with 5${\times}$(1@50m), design methodology suggested in this study was demonstrated more economic and efficient than existing design and LCC optimization not considering bridge-rail longitudinal interaction and bridge-vehicle interaction.

A Study of an Association Admission Method for Public Wireless LAN Systems (고속 공중 무선랜 시스템을 위한 효율적인 연결 수락 제어방법의 연구)

  • Lee, Hyun-Woo;Yoon, Hong;Yoon, Chong-Ho
    • Journal of Advanced Navigation Technology
    • /
    • v.7 no.2
    • /
    • pp.149-155
    • /
    • 2003
  • This paper generally relates to the field of wireless local area networks(WLANs), and more particularly, to AP selection and association methods for the performance of a station. In these days, IEEE 802.11 Wireless LAN network is widely deployed and used as an emerging service to connect high-speed Internet in the public wireless environment. But, if there are many users in hot spot area, they suffer a severe decrease of performance. Thus it needs an association and access control mechanism especially when it is used in the public environment. In this paper, we suggest a selection and association method using Beacon or Probe Response frames based IEEE 802.11. Station selects AP using the information of the capacity area in a Beacon or a Probe Response frame. According to the present paper, an association method for a public WLAN service, which includes a WLAN user terminal and an AP for relaying WLAN communications to and from the user terminal, includes the steps of the user terminal asking the AP's states for access to a radio channel; and the station selects and associates with the AP. According to the above-described selection in a high speed wireless Internet service based on public WLAN technologies that are currently in operations. Further, it is possible to improve the efficiency of network management.

  • PDF

Multiple Path Security-Aware Routing Protocol Mechanism for Ad Hoc Network (Ad Hoc 네트워크 라우팅 보안을 위한 다중경로 기반의 MP-SAR 프로토콜)

  • Han, In-Sung;Ryou, Hwang-Bin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.5B
    • /
    • pp.260-267
    • /
    • 2008
  • As pervious the SAR(Security Aware Routing)[10] protocol is an secure Ad Hoc network protocol that finds a secure path, it is the security routing protocol that uses the security level of nodes as the routing information. However, the SAR protocol sometimes transfers data through inefficient transmission paths because it always tries to find secure nodes for a safe transmission. Since it is a protocol based on AODV[6], it will cause transmission delay as researching of security routing path. when a node is out of the data transmission range as its battery dying or movement. Although it is possible to connection of nodes because a characteristic of the SAR protocol, the connection is not easy to reconnect when the security level of intermediate node is lower than the level requested by a source node. In this paper, we suggest the MP-SAR based on the SAR to solve the SAR protocol's problem. The MP-SAR seeks multiple secure path for maintenance of data confidentiality using the expanded secure path detection techniques based on the SAR. It can transfer data quickly and reliably by using the shortest efficient path among multiple paths. In the research result, we proved a outstanding performance of MP-SAR than the previous SAR through comparison and analysis.