• Title/Summary/Keyword: linear search

Search Result 456, Processing Time 0.029 seconds

Incorporation of Scene Geometry in Least Squares Correlation Matching for DEM Generation from Linear Pushbroom Images

  • Kim, Tae-Jung;Yoon, Tae-Hun;Lee, Heung-Kyu
    • Proceedings of the KSRS Conference
    • /
    • 1999.11a
    • /
    • pp.182-187
    • /
    • 1999
  • Stereo matching is one of the most crucial parts in DEM generation. Naive stereo matching algorithms often create many holes and blunders in a DEM and therefore a carefully designed strategy must be employed to guide stereo matching algorithms to produce “good” 3D information. In this paper, we describe one such a strategy designed by the use of scene geometry, in particular, the epipolarity for generation of a DEM from linear pushbroom images. The epipolarity for perspective images is a well-known property, i.e., in a stereo image pair, a point in the reference image will map to a line in the search image uniquely defined by sensor models of the image pair. This concept has been utilized in stereo matching by applying epipolar resampling prior to matching. However, the epipolar matching for linear pushbroom images is rather complicated. It was found that the epipolarity can only be described by a Hyperbola- shaped curve and that epipolar resampling cannot be applied to linear pushbroom images. Instead, we have developed an algorithm of incorporating such epipolarity directly in least squares correlation matching. Experiments showed that this approach could improve the quality of a DEM.

  • PDF

Design Optimization of Linear Synchronous Motors for Overall Improvement of Thrust, Efficiency, Power Factor and Material Consumption

  • Vaez-Zadeh, Sadegh;Hosseini, Monir Sadat
    • Journal of Power Electronics
    • /
    • v.11 no.1
    • /
    • pp.105-111
    • /
    • 2011
  • By having accurate knowledge of the magnetic field distribution and the thrust calculation in linear synchronous motors, assessing the performance and optimization of the motor design are possible. In this paper, after carrying out a performance analysis of a single-sided wound secondary linear synchronous motor by varying the motor design parameters in a layer model and a d-q model, machine single- and multi-objective design optimizations are carried out to improve the thrust density of the motor based on the motor weight and the motor efficiency multiplied by its power factor by defining various objective functions including a flexible objective function. A genetic algorithm is employed to search for the optimal design. The results confirm that an overall improvement in the thrust mean, efficiency multiplied by the power factor, and thrust to the motor weight ratio are obtained. Several design conclusions are drawn from the motor analysis and the design optimization. Finally, a finite element analysis is employed to evaluate the effectiveness of the employed machine models and the proposed optimization method.

Binary Search on Levels Using Bloom filter for IPv6 Address Lookup (IPv6 주소 검색을 위한 블룸 필터를 사용한 레벨에 따른 이진 검색 구조)

  • Park, Kyong-Hye;Lim, Hye-Sook
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.4B
    • /
    • pp.403-418
    • /
    • 2009
  • IP version 6 (IPv6) is a new If addressing scheme that has 128-bit address space. IPv6 is proposed to solve the address space problem of IP version 4 (IPv4) which has 32-bit address space. For a given IPv6 routing set, if a forwarding table is built using a trio structure, the trio has a lot more levels than that for IPv4. Hence, for IPv6 address lookup, the binary search on trio levels would be more appropriate and give better search performance than linear search on trio levels. This paper proposes a new IPv6 address lookup algorithm performing binary search on trio levels. The proposed algorithm uses a Bloom filter in pre-filtering levels which do not have matching nodes, and hence it reduces the number of off-chip memory accesses. Simulation has been performed using actual IPv6 routing sets, and the result shows that an IPv6 address lookup can be performed with 1-3 memory accesses in average for a routing data set with 1096 prefixes.

Fast Adaptation Techniques of Compensation Coefficient of Active Noise Canceller using Binary Search Algorithm (이진 탐색 알고리즘을 이용한 능동 노이즈 제거용 보정 계수 고속 적용 기법)

  • An, Joonghyun;Park, Daejin
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.25 no.11
    • /
    • pp.1635-1641
    • /
    • 2021
  • Portable systems with built-in active noise control is required low power operation. Excessive anti noise search operation can lead to rapid battery consumption. A method that can adaptively cancel noise according to the operating conditions of the system is required and the methods of reducing power are becoming very important key feature in today's portable systems. In this paper, we propose the method of active noise control(ANC) using binary search algorithm in noisy systems. The implemented architecture detects a frequency component considered as noise from the input signal and by using the binary search algorithm, the system find out an appropriate amplitude value for anti-noise in a much faster time than the general linear search algorithm. Through the experimental results, it was confirmed that the proposed algorithm performs a successful functional operation.

Enhancing Retrieval Performance for Hierarchical Compact Binary Tree (계층형 집약 이진 트리의 검색 성능 개선)

  • Kim, Sung Wan
    • Journal of Creative Information Culture
    • /
    • v.5 no.3
    • /
    • pp.345-353
    • /
    • 2019
  • Several studies have been proposed to improve storage space efficiency by expressing binary trie data structure as a linear binary bit string. Compact binary tree approach generated using one binary trie increases the key search time significantly as the binary bit string becomes very long as the size of the input key set increases. In order to reduce the key search range, a hierarchical compact binary tree technique that hierarchically expresses several small binary compact trees has been proposed. The search time increases proportionally with the number and length of binary bit streams. In this paper, we generate several binary compact trees represented by full binary tries hierarchically. The search performance is improved by allowing a path for the binary bit string corresponding to the search range to be determined through simple numeric conversion. Through the performance evaluation using the worst time and space complexity calculation, the proposed method showed the highest performance for retrieval and key insertion or deletion. In terms of space usage, the proposed method requires about 67% ~ 68% of space compared to the existing methods, showing the best space efficiency.

Optimal Identification of Nonlinear Process Data Using GAs-based Fuzzy Polynomial Neural Networks (유전자 알고리즘 기반 퍼지 다항식 뉴럴네트워크를 이용한 비선형 공정데이터의 최적 동정)

  • Lee, In-Tae;Kim, Wan-Su;Kim, Hyun-Ki;Oh, Sung-Kwun
    • Proceedings of the KIEE Conference
    • /
    • 2005.05a
    • /
    • pp.6-8
    • /
    • 2005
  • In this paper, we discuss model identification of nonlinear data using GAs-based Fuzzy Polynomial Neural Networks(GAs-FPNN). Fuzzy Polynomial Neural Networks(FPNN) is proposed model based Group Method Data Handling(GMDH) and Neural Networks(NNs). Each node of FPNN is expressed Fuzzy Polynomial Neuron(FPN). Network structure of nonlinear data is created using Genetic Algorithms(GAs) of optimal search method. Accordingly, GAs-FPNN have more inflexible than the existing models (in)from structure selecting. The proposed model select and identify its for optimal search of Genetic Algorithms that are no. of input variables, input variable numbers and consequence structures. The GAs-FPNN model is select tuning to input variable number, number of input variable and the last part structure through optimal search of Genetic Algorithms. It is shown that nonlinear data model design using Genetic Algorithms based FPNN is more usefulness and effectiveness than the existing models.

  • PDF

Implementation and Design of Control Circuit for Touch Screen with Faster Response Time (고속 응답 터치스크린 제어회로 설계 및 구현)

  • Park, Sang-Bong;Heo, Jeong-Hwa
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.14 no.1
    • /
    • pp.155-159
    • /
    • 2014
  • In this paper, we describe algorithm and digital circuit implementation of touch screen controller that has the faster response time. We enhance the response time by adaptive search method instead of linear search method of step level in the pulse width decision. The faster response time might bring effects of feeling better in the touch keyboard. The performance of the proposed algorithm and function is verified by using logic simulation and FPGA test board. It is expected to use in the mobile touch screen.

A Design of Dynamically Simultaneous Search GA-based Fuzzy Neural Networks: Comparative Analysis and Interpretation

  • Park, Byoung-Jun;Kim, Wook-Dong;Oh, Sung-Kwun
    • Journal of Electrical Engineering and Technology
    • /
    • v.8 no.3
    • /
    • pp.621-632
    • /
    • 2013
  • In this paper, we introduce advanced architectures of genetically-oriented Fuzzy Neural Networks (FNNs) based on fuzzy set and fuzzy relation and discuss a comprehensive design methodology. The proposed FNNs are based on 'if-then' rule-based networks with the extended structure of the premise and the consequence parts of the fuzzy rules. We consider two types of the FNNs topologies, called here FSNN and FRNN, depending upon the usage of inputs in the premise of fuzzy rules. Three different type of polynomials function (namely, constant, linear, and quadratic) are used to construct the consequence of the rules. In order to improve the accuracy of FNNs, the structure and the parameters are optimized by making use of genetic algorithms (GAs). We enhance the search capabilities of the GAs by introducing the dynamic variants of genetic optimization. It fully exploits the processing capabilities of the FNNs by supporting their structural and parametric optimization. To evaluate the performance of the proposed FNNs, we exploit a suite of several representative numerical examples and its experimental results are compared with those reported in the previous studies.

A New Fast Pitch Search Algorithm using Line Spectrum Frequency in the CELP Vocoder (CELP보코더에서 Line Spectrum Frequency를 이용한 고속 피치검색)

  • Bae, Myung-Jin;Sohn, Sang-Mok;Yoo, Hah-Young;Byun, Kyung-Jin
    • The Journal of the Acoustical Society of Korea
    • /
    • v.15 no.2
    • /
    • pp.90-94
    • /
    • 1996
  • Code Excited Linear Prediction(CELP) vocoder exhibits good performance at data rates below 8 kbps. The major drawback of CELP type coders is a large amount of computation. In this paper, we propose a new pitch searching method that preserves the quality of the CELP vocoder reducing computational complexity. The basic idea is that grasps preliminary pitches using the first formant of speech signal and performs pitch search only about the preliminary pitches. As applying the proposed method to the CELP vocoder, we can reduce complexity by 64% in the pitch search.

  • PDF

A Study on Prediction of Attendance in Korean Baseball League Using Artificial Neural Network (인경신경망을 이용한 한국프로야구 관중 수요 예측에 관한 연구)

  • Park, Jinuk;Park, Sanghyun
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.6 no.12
    • /
    • pp.565-572
    • /
    • 2017
  • Traditional method for time series analysis, autoregressive integrated moving average (ARIMA) allows to mine significant patterns from the past observations using autocorrelation and to forecast future sequences. However, Korean baseball games do not have regular intervals to analyze relationship among the past attendance observations. To address this issue, we propose artificial neural network (ANN) based attendance prediction model using various measures including performance, team characteristics and social influences. We optimized ANNs using grid search to construct optimal model for regression problem. The evaluation shows that the optimal and ensemble model outperform the baseline model, linear regression model.