• Title/Summary/Keyword: weighted algorithm

Search Result 1,102, Processing Time 0.032 seconds

An Adaptive Weighted Regression and Guided Filter Hybrid Method for Hyperspectral Pansharpening

  • Dong, Wenqian;Xiao, Song
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.1
    • /
    • pp.327-346
    • /
    • 2019
  • The goal of hyperspectral pansharpening is to combine a hyperspectral image (HSI) with a panchromatic image (PANI) derived from the same scene to obtain a single fused image. In this paper, a new hyperspectral pansharpening approach using adaptive weighted regression and guided filter is proposed. First, the intensity information (INT) of the HSI is obtained by the adaptive weighted regression algorithm. Especially, the optimization formula is solved to obtain the closed solution to reduce the calculation amount. Then, the proposed method proposes a new way to obtain the sufficient spatial information from the PANI and INT by guided filtering. Finally, the fused HSI is obtained by adding the extracted spatial information to the interpolated HSI. Experimental results demonstrate that the proposed approach achieves better property in preserving the spectral information as well as enhancing the spatial detail compared with other excellent approaches in visual interpretation and objective fusion metrics.

A Homing and Obstacle Avoidance Algorithm for Nonholonomic Mobile Robots (Nonholonomic 이동로봇의 호밍과 장애물 회피 알고리즘)

  • Kong, Sung-Hak;Suh, Il-Hong
    • The Transactions of the Korean Institute of Electrical Engineers D
    • /
    • v.51 no.12
    • /
    • pp.583-595
    • /
    • 2002
  • Homing operation can be defined as a series of actions which are necessary for a mobile robot to move from the current position with any arbitrary orientation to a desired position with a specified orientation, while avoiding possible obstacles. In this paper, a homing and obstacle avoidance algorithm for nonholonomic mobile robots is proposed. The proposed algorithm consists of a local goal generator, a discrete state controller, and local path tracking controller based on Aicardi's path following algorithm. In the discrete state controller, 4 states are defined according to the environmental conditions and 4 desired high-level command for the states are given as follows: avoid, wander, home and homing zones. The proposed local goal generator is designed to generate the desired local path by using weighted distance transforms which are newly made to satisfy the nonholonomic constraints of mobile robots. Here, subgoals are also found as vertices of the desired local path. To demonstrate result effectiveness and applicability of the proposed algorithm, computer simulations are illustrated and experimental results for a real mobile robot system are also provided.

K-Means-Based Polynomial-Radial Basis Function Neural Network Using Space Search Algorithm: Design and Comparative Studies (공간 탐색 최적화 알고리즘을 이용한 K-Means 클러스터링 기반 다항식 방사형 기저 함수 신경회로망: 설계 및 비교 해석)

  • Kim, Wook-Dong;Oh, Sung-Kwun
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.17 no.8
    • /
    • pp.731-738
    • /
    • 2011
  • In this paper, we introduce an advanced architecture of K-Means clustering-based polynomial Radial Basis Function Neural Networks (p-RBFNNs) designed with the aid of SSOA (Space Search Optimization Algorithm) and develop a comprehensive design methodology supporting their construction. In order to design the optimized p-RBFNNs, a center value of each receptive field is determined by running the K-Means clustering algorithm and then the center value and the width of the corresponding receptive field are optimized through SSOA. The connections (weights) of the proposed p-RBFNNs are of functional character and are realized by considering three types of polynomials. In addition, a WLSE (Weighted Least Square Estimation) is used to estimate the coefficients of polynomials (serving as functional connections of the network) of each node from output node. Therefore, a local learning capability and an interpretability of the proposed model are improved. The proposed model is illustrated with the use of nonlinear function, NOx called Machine Learning dataset. A comparative analysis reveals that the proposed model exhibits higher accuracy and superb predictive capability in comparison to some previous models available in the literature.

Organ Recognition in Ultrasound images Using Log Power Spectrum (로그 전력 스펙트럼을 이용한 초음파 영상에서의 장기인식)

  • 박수진;손재곤;김남철
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.9C
    • /
    • pp.876-883
    • /
    • 2003
  • In this paper, we propose an algorithm for organ recognition in ultrasound images using log power spectrum. The main procedure of the algorithm consists of feature extraction and feature classification. In the feature extraction, as a translation invariant feature, log power spectrum is used for extracting the information on echo of the organs tissue from a preprocessed input image. In the feature classification, Mahalanobis distance is used as a measure of the similarity between the feature of an input image and the representative feature of each class. Experimental results for real ultrasound images show that the proposed algorithm yields the improvement of maximum 30% recognition rate than the recognition algorithm using power spectrum and Euclidean distance, and results in better recognition rate of 10-40% than the recognition algorithm using weighted quefrency complex cepstrum.

A Study on Cascade Filter Algorithm for Random Valued Impulse Noise Elimination (랜덤 임펄스 잡음제거를 위한 캐스케이드 필터 알고리즘에 관한 연구)

  • Yinyu, Gao;Kim, Nam-Ho
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.16 no.3
    • /
    • pp.598-604
    • /
    • 2012
  • Image signal is corrupted by various noises in image processing, many studies are being accomplished to restore those images. In this paper, we proposed a cascade filter algorithm for removing random valued impulse noise. The algorithm consists two steps that noise detection and noise elimination. Variance of filtering mask and center pixel variance are calculated for noise detection, and the noise pixel is replaced by estimated value which first apply switching self adaptive weighted median filter and finally processed by modified weight filter. Considering the proposed algorithm only remove noise and preserve the uncorrupted information that the algorithm can not only remove noise well but also preserve edge.

A Scene Change Detection Technique using the Weighted $\chi^2$-test and the Automated Threshold-Decision Algorithm (변형된 $\chi^2$- 테스트와 자동 임계치-결정 알고리즘을 이용한 장면전환 검출 기법)

  • Ko, Kyong-Cheol;Rhee, Yang-Won
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.42 no.4 s.304
    • /
    • pp.51-58
    • /
    • 2005
  • This paper proposes a robust scene change detection technique that uses the weighted chi-square test and the automated threshold-decision algorithms. The weighted chi-square test can subdivide the difference values of individual color channels by calculating the color intensities according to NTSC standard, and it can detect the scene change by joining the weighted color intensities to the predefined chi-square test which emphasize the comparative color difference values. The automated threshold-decision at algorithm uses the difference values of frame-to-frame that was obtained by the weighted chi-square test. At first, The Average of total difference values is calculated and then, another average value is calculated using the previous average value from the difference values, finally the most appropriate mid-average value is searched and considered the threshold value. Experimental results show that the proposed algorithms are effective and outperform the previous approaches.

High Dynamic Range Image Display Combining Weighted Least Squares Filtering with Color Appearance Model (가중 최소자승 필터링과 색 표현 모델을 결합한 넓은 동적 영역 이미지 표현)

  • Piao, Mei-Xian;Lee, Kyung-Jun;Wee, Seung-Woo;Jeong, Jechang
    • Journal of Broadcast Engineering
    • /
    • v.21 no.6
    • /
    • pp.920-928
    • /
    • 2016
  • Recently high dynamic range imaging technique is hot issue in computer graphic area. We present a progressive tone mapping algorithm, which is based on weighted least squares optimization framework. Our approach combines weighted least squares filtering with iCAM06 model. To show more perceptual high dynamic range images in conventional display, we decompose high dynamic range image into base layers and detail layers. The base layers are obtained by using weighted least squares filter. Then, we adopt chromatic adaption function and non-linear compression function to deal with base layers. Only the base layers reduce contrast, and preserving detail. The image quality assessment shows that our tone mapped image is more similar to original high dynamic range image. Moreover, the subjective result shows our algorithm produces more reliable and pleasing image.

The Design and Implementation of Location Information System using Wireless Fidelity in Indoors (실내에서 Wi-Fi를 이용한 위치 정보 시스템의 설계 및 구현)

  • Kwon, O-Byung;Kim, Kyeong-Su
    • Journal of Digital Convergence
    • /
    • v.11 no.4
    • /
    • pp.243-249
    • /
    • 2013
  • In this paper, GPS(Global Positioning System) that can be used outdoors and GPS(Global Positioning System) is not available for indoor Wi-Fi(Wireless Fidelity) using the Android-based location information system has been designed and implemented. Pedestrians in a room in order to estimate the location of the pedestrian's position, regardless of need to obtain the absolute position and relative position, depending on the movement of pedestrians in a row it is necessary to estimate. In order to estimate the initial position of the pedestrian Wi-Fi Fingerprinting was used. Most existing Wi-Fi Fingerprinting position error small WKNN(Weighted K Nearest Neighbor) algorithm shortcoming EWKNN (Enhanced Weighted K Nearest Neighbor) using the algorithm raised the accuracy of the position. And in order to estimate the relative position of the pedestrian, the smart phone is mounted on the IMUInertial Measurement Unit) because the use did not require additional equipment.

Multi-level thresholding using Entropy-based Weighted FCM Algorithm in Color Image (Entropy 기반의 Weighted FCM 알고리즘을 이용한 컬러 영상 Multi-level thresholding)

  • Oh, Jun-Taek;Kwak, Hyun-Wook;Kim, Wook-Hyun
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.42 no.6
    • /
    • pp.73-82
    • /
    • 2005
  • This paper proposes a multi-level thresholding method using weighted FCM(Fuzzy C-Means) algorithm in color image. FCM algerian determines a more optimal thresholding value than the existing methods and can extend to multi-level thresholding. But FCM algerian is sensitive to noise because it doesn't include spatial information. To solve the problem, we can remove noise by applying a weight based on entropy that is obtained from neighboring pixels to FCM algerian. And we determine the optimal cluster number by using within-class distance in code image based on the clustered pixels of each color component. In the experiments, we show that the proposed method is more tolerant to noise and is more superior than the existing methods.

Equivalence study of canonical correspondence analysis by weighted principal component analysis and canonical correspondence analysis by Gaussian response model (가중주성분분석을 활용한 정준대응분석과 가우시안 반응 모형에 의한 정준대응분석의 동일성 연구)

  • Jeong, Hyeong Chul
    • The Korean Journal of Applied Statistics
    • /
    • v.34 no.6
    • /
    • pp.945-956
    • /
    • 2021
  • In this study, we considered the algorithm of Legendre and Legendre (2012), which derives canonical correspondence analysis from weighted principal component analysis. And, it was proved that the canonical correspondence analysis based on the weighted principal component analysis is exactly the same as Ter Braak's (1986) canonical correspondence analysis based on the Gaussian response model. Ter Braak (1986)'s canonical correspondence analysis derived from a Gaussian response curve that can explain the abundance of species in ecology well uses the basic assumption of the species packing model and then conducts generalized linear model and canonical correlation analysis. It is derived by way of binding. However, the algorithm of Legendre and Legendre (2012) is calculated in a method quite similar to Benzecri's correspondence analysis without such assumptions. Therefore, if canonical correspondence analysis based on weighted principal component analysis is used, it is possible to have some flexibility in using the results. In conclusion, this study shows that the two methods starting from different models have the same site scores, species scores, and species-environment correlations.