• Title/Summary/Keyword: 부분 곱 축소

Search Result 4, Processing Time 0.017 seconds

Scaled Sub-image Retrieval Approach using Alignment of Sub-Sequence (부분 서열 정렬을 이용한 확대축소 부분 영상 검색 기법)

  • Kim, JunHo;Jang, WonAng;Yang, IkSuk;Lee, DoHoon
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2012.11a
    • /
    • pp.512-515
    • /
    • 2012
  • 부분 영상 검색은 질의 영상을 입력으로 사용해서 질의 영상을 부분 영상으로 포함하는 대상 영상을 찾아낸다. 본 논문에서는 부분 영상 검색에 생물정보학에서 사용하는 정렬(Alignment)을 이용한다. 생물정보학에서는 두 DNA 서열 간에 유사도를 비교하고 시각화하는 방법으로 점 행렬을 널리 사용한다. 두 영상을 정렬하기 위해서 먼저 질의 영상과 대상 영상을 일차원 명암도 영상 서열로 변환하고 정렬하여 부분 영상 후보 영역을 찾는다. 이전 연구[1]에서 정렬하는 방법은 두 서열의 길이의 곱만큼의 메모리 공간이 필요하므로 두 서열의 길이가 길어지면 필요한 메모리 공간이 선형적으로 증가했다. 본 논문에서는 영상 데이터의 특성을 이용해서 부분 서열 정렬로 필요한 메모리 공간을 줄였고 부가적인 효과로 처리시간이 감소하고 정확도가 상향되었다.

Approximate Multiplier With Efficient 4-2 Compressor and Compensation Characteristic (효율적인 4-2 Compressor와 보상 특성을 갖는 근사 곱셈기)

  • Kim, Seok;Seo, Ho-Sung;Kim, Su;Kim, Dae-Ik
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.17 no.1
    • /
    • pp.173-180
    • /
    • 2022
  • Approximate Computing is a promising method for designing hardware-efficient computing systems. Approximate multiplication is one of key operations used in approximate computing methods for high performance and low power computing. An approximate 4-2 compressor can implement hardware-efficient circuits for approximate multiplication. In this paper, we propose an approximate multiplier with low area and low power characteristics. The proposed approximate multiplier architecture is segmented into three portions; an exact region, an approximate region, and a constant correction region. Partial product reduction in the approximation region are simplified using a new 4:2 approximate compressor, and the error due to approximation is compensated using a simple error correction scheme. Constant correction region uses a constant calculated with probabilistic analysis for reducing error. Experimental results of 8×8 multiplier show that the proposed design requires less area, and consumes less power than conventional 4-2 compressor-based approximate multiplier.

An Efficient Dempster-Shafer Evidence Combination Scheme for Uncertainty Handling (불확실성 처리를 위한 효율적 뎀스터 쉐이퍼 증거병합 방법)

  • Lee, Gye-Seong
    • The Transactions of the Korea Information Processing Society
    • /
    • v.3 no.4
    • /
    • pp.908-914
    • /
    • 1996
  • A number of techniques have been studied for handling uncertainty in the development of expert systems. One of techniques adopted in many expert systems is the Dumpster-Shafer Evidence combination scheme. This has been the main focus among others due to is favorable features and computational complexity. In this paper, we develop and algorithm to deal with the exponential complexity inherent in Dempster-Shafer evidence combination. In the evidence combination process, we divide the frame of discernment into two groups, one for those common in both belief functions and the other for the rest. A property is found that in computing new belief function for the latter group, the result of evidence combination show linear change. The irrelevancy factor is derived and used to compute the change. The main idea of the method is to reduce the size of the frame of discernment and thus exponential complexity.

  • PDF

Inversion of Acoustical Properties of Sedimentary Layers from Chirp Sonar Signals (Chirp 신호를 이용한 해저퇴적층의 음향학적 특성 역산)

  • 박철수;성우제
    • The Journal of the Acoustical Society of Korea
    • /
    • v.18 no.8
    • /
    • pp.32-41
    • /
    • 1999
  • In this paper, an inversion method using chirp signals and two near field receivers is proposed. Inversion problems can be formulated into the probabilistic models composed of signals, a forward model and noise. Forward model to simulate chirp signals is chosen to be the source-wavelet-convolution planewave modeling method. The solution of the inversion problem is defined by a posteriori pdf. The wavelet matching technique, using weighted least-squares fitting, estimates the sediment sound-speed and thickness on which determination of the ranges for a priori uniform distribution is based. The genetic algorithm can be applied to a global optimization problem to find a maximum a posteriori solution for determined a priori search space. Here the object function is defined by an L₂norm of the difference between measured and modeled signals. The observed signals can be separated into a set of two signals reflected from the upper and lower boundaries of a sediment. The separation of signals and successive applications of the genetic algorithm optimization process reduce the search space, therefore improving the inversion results. Not only the marginal pdf but also the statistics are calculated by numerical evaluation of integrals using the samples selected during importance sampling process of the genetic algorithm. The examples applied here show that, for synthetic data with noise, it is possible to carry out an inversion for sedimentary layers using the proposed inversion method.

  • PDF