• Title/Summary/Keyword: Multi-Thresholding

Search Result 68, Processing Time 0.024 seconds

Automatic Estimation of Threshold Values for Change Detection of Multi-temporal Remote Sensing Images (다중시기 원격탐사 화상의 변화탐지를 위한 임계치 자동 추정)

  • 박노욱;지광훈;이광재;권병두
    • Korean Journal of Remote Sensing
    • /
    • v.19 no.6
    • /
    • pp.465-478
    • /
    • 2003
  • This paper presents two methods for automatic estimation of threshold values in unsupervised change detection of multi-temporal remote sensing images. The proposed methods consist of two analytical steps. The first step is to compute the parameters of a 3-component Gaussian mixture model from difference or ratio images. The second step is to determine a threshold value using Bayesian rule for minimum error. The first method which is an extended version of Bruzzone and Prieto' method (2000) is to apply an Expectation-Maximization algorithm for estimation of the parameters of the Gaussian mixture model. The second method is based on an iterative thresholding algorithm that successively employs thresholding and estimation of the model parameters. The effectiveness and applicability of the methods proposed here were illustrated by two experiments and one case study including the synthetic data sets and KOMPSAT-1 EOC images. The experiments demonstrate that the proposed methods can effectively estimate the model parameters and the threshold value determined shows the minimum overall error.

IMPROVEMENT OF FLOW SIMULATIONS METHOD WITH MULTI-RESOLUTION ANALYSIS BY BOUNDARY TREATMENT (경계면 처리 개선을 통한 다중해상도 유동해석 기법 개선 연구)

  • Kang, H.M.
    • Journal of computational fluids engineering
    • /
    • v.20 no.4
    • /
    • pp.44-50
    • /
    • 2015
  • The computational efficiency of flow simulations with Multi-resolution analysis (MRA) was enhanced via the boundary treatment of the computational domain. In MRA, an adaptive dataset to a solution is constructed through data decomposition with interpolating polynomial and thresholding. During the decomposition process, the basis points of interpolation should exceed the boundary of the computational domain. In order to resolve this problem, the weight coefficients of interpolating polynomial were adjusted near the boundaries. By this boundary treatment, the computational efficiency of MRA was enhanced while the numerical accuracy of a solution was unchanged. This modified MRA was applied to two-dimensional steady Euler equations and the enhancement of computational efficiency and the maintenance of numerical accuracy were assessed.

Development of Two Dimensional Position Measuring Device for Floating Structure Using an Image Processing Method (이미지 프로세싱을 이용한 부유구조물의 2차원 위치 계측장치 개발)

  • 지명석;김성근;김상봉
    • Journal of Ocean Engineering and Technology
    • /
    • v.8 no.2
    • /
    • pp.166-172
    • /
    • 1994
  • This paper presents an image processing method for two dimensional position measurement of a floating structure. This method is based on image processing technique using concept of window and threshold processing to track the target object. The experimental results for position measurement of the target object in two dimensional water tank demonstrate the validity of this method.

  • PDF

Compression and Enhancement of Medical Images Using Opposition Based Harmony Search Algorithm

  • Haridoss, Rekha;Punniyakodi, Samundiswary
    • Journal of Information Processing Systems
    • /
    • v.15 no.2
    • /
    • pp.288-304
    • /
    • 2019
  • The growth of telemedicine-based wireless communication for images-magnetic resonance imaging (MRI) and computed tomography (CT)-leads to the necessity of learning the concept of image compression. Over the years, the transform based and spatial based compression techniques have attracted many types of researches and achieve better results at the cost of high computational complexity. In order to overcome this, the optimization techniques are considered with the existing image compression techniques. However, it fails to preserve the original content of the diagnostic information and cause artifacts at high compression ratio. In this paper, the concept of histogram based multilevel thresholding (HMT) using entropy is appended with the optimization algorithm to compress the medical images effectively. However, the method becomes time consuming during the measurement of the randomness from the image pixel group and not suitable for medical applications. Hence, an attempt has been made in this paper to develop an HMT based image compression by utilizing the opposition based improved harmony search algorithm (OIHSA) as an optimization technique along with the entropy. Further, the enhancement of the significant information present in the medical images are improved by the proper selection of entropy and the number of thresholds chosen to reconstruct the compressed image.

Information extraction of the moving objects based on edge detection and optical flow (Edge 검출과 Optical flow 기반 이동물체의 정보 추출)

  • Chang, Min-Hyuk;Park, Jong-An
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.8A
    • /
    • pp.822-828
    • /
    • 2002
  • Optical flow estimation based on multi constraint approaches is frequently used for recognition of moving objects. However, the use have been confined because of OF estimation time as well as error problem. This paper shows a new method form effectively extracting movement information using the multi-constraint base approaches with sobel edge detection. The moving objects anr extraced in the input image sequence using edge detection and segmentation. Edge detection and difference of the two input image sequence gives us the moving objects in the images. The process of thresholding removes the moving objects detected due to noise. After thresholding the real moving objects, we applied the Combinatorial Hough Transform (CHT) and voting accumulation to find the optimal constraint lines for optical flow estimation. The moving objects found in the two consecutive images by using edge detection and segmentation greatly reduces the time for comutation of CHT. The voting based CHT avoids the errors associated with least squares methods. Calculation of a large number of points along the constraint line is also avoided by using the transformed slope-intercept parameter domain. The simulation results show that the proposed method is very effective for extracting optical flow vectors and hence recognizing moving objects in the images.

Character Segmentation and Recognition Algorithm for Steel Manufacturing Process Automation (슬라브 제품 정보 인식을 위한 문자 분리 및 문자 인식 알고리즘 개발)

  • Choi, Sung-Hoo;Yun, Jong-Pil;Park, Young-Su;Park, Jee-Hoon;Koo, Keun-Hwi;Kim, Sang-Woo
    • Proceedings of the KIEE Conference
    • /
    • 2007.04a
    • /
    • pp.389-391
    • /
    • 2007
  • This paper describes about the printed character segmentation and recognition system for slabs in steel manufacturing process. To increase the recognition rate, it is important to improve success rate of character segmentation. Since Slabs front area surface are not uniform and surface temperature is very high, marked characters not only undergo damages but also have much noise. On the other hand, since almost marked characters are very thick and the space between characters is only about 10 $^{\sim}$ 15 mm, there are many touching characters. Therefore appropriate character image preprocessing and segmentation algorithm is needed. In this paper we propose a multi-local thresholding method for damaged character restoration, a modified touching character segmentation, algorithm for marked characters. Finally a effective Multi-Class SVM is used to recognize segmented characters.

  • PDF

Estimation of high-dimensional sparse cross correlation matrix

  • Yin, Cao;Kwangok, Seo;Soohyun, Ahn;Johan, Lim
    • Communications for Statistical Applications and Methods
    • /
    • v.29 no.6
    • /
    • pp.655-664
    • /
    • 2022
  • On the motivation by an integrative study of multi-omics data, we are interested in estimating the structure of the sparse cross correlation matrix of two high-dimensional random vectors. We rewrite the problem as a multiple testing problem and propose a new method to estimate the sparse structure of the cross correlation matrix. To do so, we test the correlation coefficients simultaneously and threshold the correlation coefficients by controlling FRD at a predetermined level α. Further, we apply the proposed method and an alternative adaptive thresholding procedure by Cai and Liu (2016) to the integrative analysis of the protein expression data (X) and the mRNA expression data (Y) in TCGA breast cancer cohort. By varying the FDR level α, we show that the new procedure is consistently more efficient in estimating the sparse structure of cross correlation matrix than the alternative one.

Study of Target Tracking Algorithm using iterative Joint Integrated Probabilistic Data Association in Low SNR Multi-Target Environments (낮은 SNR 다중 표적 환경에서의 iterative Joint Integrated Probabilistic Data Association을 이용한 표적추적 알고리즘 연구)

  • Kim, Hyung-June;Song, Taek-Lyul
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.23 no.3
    • /
    • pp.204-212
    • /
    • 2020
  • For general target tracking works by receiving a set of measurements from sensor. However, if the SNR(Signal to Noise Ratio) is low due to small RCS(Radar Cross Section), caused by remote small targets, the target's information can be lost during signal processing. TBD(Track Before Detect) is an algorithm that performs target tracking without threshold for detection. That is, all sensor data is sent to the tracking system, which prevents the loss of the target's information by thresholding the signal intensity. On the other hand, using all sensor data inevitably leads to computational problems that can severely limit the application. In this paper, we propose an iterative Joint Integrated Probabilistic Data Association as a practical target tracking technique suitable for a low SNR multi-target environment with real time operation capability, and verify its performance through simulation studies.

Adaptive Multi-class Segmentation Model of Aggregate Image Based on Improved Sparrow Search Algorithm

  • Mengfei Wang;Weixing Wang;Sheng Feng;Limin Li
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.17 no.2
    • /
    • pp.391-411
    • /
    • 2023
  • Aggregates play the skeleton and supporting role in the construction field, high-precision measurement and high-efficiency analysis of aggregates are frequently employed to evaluate the project quality. Aiming at the unbalanced operation time and segmentation accuracy for multi-class segmentation algorithms of aggregate images, a Chaotic Sparrow Search Algorithm (CSSA) is put forward to optimize it. In this algorithm, the chaotic map is combined with the sinusoidal dynamic weight and the elite mutation strategies; and it is firstly proposed to promote the SSA's optimization accuracy and stability without reducing the SSA's speed. The CSSA is utilized to optimize the popular multi-class segmentation algorithm-Multiple Entropy Thresholding (MET). By taking three METs as objective functions, i.e., Kapur Entropy, Minimum-cross Entropy and Renyi Entropy, the CSSA is implemented to quickly and automatically calculate the extreme value of the function and get the corresponding correct thresholds. The image adaptive multi-class segmentation model is called CSSA-MET. In order to comprehensively evaluate it, a new parameter I based on the segmentation accuracy and processing speed is constructed. The results reveal that the CSSA outperforms the other seven methods of optimization performance, as well as the quality evaluation of aggregate images segmented by the CSSA-MET, and the speed and accuracy are balanced. In particular, the highest I value can be obtained when the CSSA is applied to optimize the Renyi Entropy, which indicates that this combination is more suitable for segmenting the aggregate images.

An Efficient Adaptive Wavelet-Collocation Method Using Lifted Interpolating Wavelets (수정된 보간 웨이블렛응 이용한 적응 웨이블렛-콜로케이션 기법)

  • Kim, Yun-Yeong;Kim, Jae-Eun
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.24 no.8 s.179
    • /
    • pp.2100-2107
    • /
    • 2000
  • The wavelet theory is relatively a new development and now acquires popularity and much interest in many areas including mathematics and engineering. This work presents an adaptive wavelet method for a numerical solution of partial differential equations in a collocation sense. Due to the multi-resolution nature of wavelets, an adaptive strategy can be easily realized it is easy to add or delete the wavelet coefficients as resolution levels progress. Typical wavelet-collocation methods use interpolating wavelets having no vanishing moment, but we propose a new wavelet-collocation method on modified interpolating wavelets having 2 vanishing moments. The use of the modified interpolating wavelets obtained by the lifting scheme requires a smaller number of wavelet coefficients as well as a smaller condition number of system matrices. The latter property makes a preconditioned conjugate gradient solver more useful for efficient analysis.