• Title/Summary/Keyword: Measure Algorithm

Search Result 2,036, Processing Time 0.037 seconds

An Adaptive Image Quality Assessment Algorithm

  • Sankar, Ravi;Ivkovic, Goran
    • International journal of advanced smart convergence
    • /
    • v.1 no.1
    • /
    • pp.6-13
    • /
    • 2012
  • An improved algorithm for image quality assessment is presented. First a simple model of human visual system, consisting of a nonlinear function and a 2-D filter, processes the input images. This filter has one user-defined parameter, whose value depends on the reference image. This way the algorithm can adapt to different scenarios. In the next step the average value of locally computed correlation coefficients between the two processed images is found. This criterion is closely related to the way in which human observer assesses image quality. Finally, image quality measure is computed as the average value of locally computed correlation coefficients, adjusted by the average correlation coefficient between the reference and error images. By this approach the proposed measure differentiates between the random and signal dependant distortions, which have different effects on human observer. Performance of the proposed quality measure is illustrated by examples involving images with different types of degradation.

DEVELOPMENT OF AN ORTHOGONAL DOUBLE-IMAGE PROCESSING ALGORITHM TO MEASURE BUBBLE VOLUME IN A TWO-PHASE FLOW

  • Kim, Seong-Jin;Park, Goon-Cherl
    • Nuclear Engineering and Technology
    • /
    • v.39 no.4
    • /
    • pp.313-326
    • /
    • 2007
  • In this paper, an algorithm to reconstruct two orthogonal images into a three-dimensional image is developed in order to measure the bubble size and volume in a two-phase boiling flow. The central-active contour model originally proposed by P. $Szczypi\'{n}ski$ and P. Strumillo is modified to reduce the dependence on the initial reference point and to increase the contour stability. The modified model is then applied to the algorithm to extract the object boundary. This improved central contour model could be applied to obscure objects using a variable threshold value. The extracted boundaries from each image are merged into a three-dimensional image through the developed algorithm. It is shown that the object reconstructed using the developed algorithm is very similar or identical to the real object. Various values such as volume and surface area are calculated for the reconstructed images and the developed algorithm is qualitatively verified using real images from rubber clay experiments and quantitatively verified by simulation using imaginary images. Finally, the developed algorithm is applied to measure the size and volume of vapor bubbles condensing in a subcooled boiling flow.

Two-Stage Fast Block Matching Algorithm Using Integral Projections (가산 투영을 이용한 2단계 고속 블록정합 알고리즘)

  • 김준식;박래홍;이병욱
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.30B no.1
    • /
    • pp.45-55
    • /
    • 1993
  • In this paper, a two-stage block matching algorithm (BMA), which can reduce greatly the computational complexity of the conventional BMAs, is proposed, in which the onedimensional distortion measure based on the integral projection is introduced to determine the candidate motion vectors and then among them a final motion vector is detected based on the conventional two-dimensional distortion measure. Due to the one-dimensional calculation of a distortion measure, the proposed algorithm can reduce the computational complexity of the conventional BMA (full search method with a 16$\times$16 block) by a factor of 4, with its performance comparable to those of the conventional ones. Simulation results based on the original and noisy image sequences are shown. Also the simulation of the proposed method combined with the MPEG (Moving Picture Experts Group) SM3 (Simulation Model Three) is presented. Computer simulation shows that the proposed algorithm is fast with its performance comparable to those of the conventional ones.

  • PDF

A Study on the Unsupervised Change Detection for Hyperspectral Data Using Similarity Measure Techniques (화소간 유사도 측정 기법을 이용한 하이퍼스펙트럴 데이터의 무감독 변화탐지에 관한 연구)

  • Kim Dae-Sung;Kim Yong-Il
    • Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
    • /
    • 2006.04a
    • /
    • pp.243-248
    • /
    • 2006
  • In this paper, we propose the unsupervised change detection algorithm that apply the similarity measure techniques to the hyperspectral image. The general similarity measures including euclidean distance and spectral angle were compared. The spectral similarity scale algorithm for reducing the problems of those techniques was studied and tested with Hyperion data. The thresholds for detecting the change area were estimated through EM(Expectation-Maximization) algorithm. The experimental result shows that the similarity measure techniques and EM algorithm can be applied effectively for the unsupervised change detection of the hyperspectral data.

  • PDF

The Evaluation Measure of Text Clustering for the Variable Number of Clusters (가변적 클러스터 개수에 대한 문서군집화 평가방법)

  • Jo, Tae-Ho
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2006.10b
    • /
    • pp.233-237
    • /
    • 2006
  • This study proposes an innovative measure for evaluating the performance of text clustering. In using K-means algorithm and Kohonen Networks for text clustering, the number clusters is fixed initially by configuring it as their parameter, while in using single pass algorithm for text clustering, the number of clusters is not predictable. Using labeled documents, the result of text clustering using K-means algorithm or Kohonen Network is able to be evaluated by setting the number of clusters as the number of the given target categories, mapping each cluster to a target category, and using the evaluation measures of text. But in using single pass algorithm, if the number of clusters is different from the number of target categories, such measures are useless for evaluating the result of text clustering. This study proposes an evaluation measure of text clustering based on intra-cluster similarity and inter-cluster similarity, what is called CI (Clustering Index) in this article.

  • PDF

Probabilistic localization of the service robot by mapmatching algorithm

  • Lee, Dong-Heui;Woojin Chung;Kim, Munsang
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2002.10a
    • /
    • pp.92.3-92
    • /
    • 2002
  • A lot of localization algorithms have been developed in order to achieve autonomous navigation. However, most of localization algorithms are restricted to certain conditions. In this paper, Monte Carlo localization scheme with a map-matching algorithm is suggested as a robust localization method for the Public Service Robot to accomplish its tasks autonomously. Monte Carlo localization can be applied to local, global and kidnapping localization problems. A range image based measure function and a geometric pattern matching measure function are applied for map matching algorithm. This map matching method can be applied to both polygonal environments and un-polygonal environments and achieves...

  • PDF

Development of Algorithm to Measure Line constants of Electric Railway System (전기철도 시스템을 위한 선로정수 실측 알고리즘 개발)

  • Lee, H.M.;Kim, G.D.;Oh, S.C.;Park, S.H.;Kim, J.D.
    • Proceedings of the KIEE Conference
    • /
    • 2005.07b
    • /
    • pp.1649-1652
    • /
    • 2005
  • Line constants are composed by impedances and susceptances. We don't need all line constants on electric railway system. Depending on where they are applied, The algorithm to get line constants Is different. We suggest two algorithm to measure them.

  • PDF

Measure of Effectiveness Analysis for Tracking in SONAR System (소나시스템에서의 추적효과도 분석)

  • Cho, Jung-Hong;Kim, Hyoung Rok;Kim, Seongil;Kim, Jea Soo
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.16 no.1
    • /
    • pp.5-26
    • /
    • 2013
  • Since the optimized use of sonar systems for target tracking is a practical problem for naval operations, the measure of mission achievability is needed for preparing efficient sonar-maneuver tactic. In order to quantify the mission achievability or Measure Of Effectiveness(MOE) for given sonar-maneuver tactics, we developed and tested a simulation algorithm. The proposed algorithm for tracking is based on Measure Of Performance(MOP) for localization and tracking system of sonar against target. Probability of Detection(PD) using steering beam patterns referenced to the aspect angle of sonar is presented to consider the tracking-performance of sonar. Also, the integrated software package, named as Optimal Acoustic Search Path Planning(OASPP) is used for generating sonar-maneuver patterns and vulnerability analysis for a given scenario. Through simulation of a simple case for which the intuitive solution is known, the proposed algorithm is verified.

Output feedback left eigenstructure assignment considering controllability and disturbance suppressibility measures (가제어성 및 외란 가억제성 척도를 고려하는 출력되먹임 고유구조 지정)

  • Choi, Jae-Weon;Lee, Jang-Gyu;Kim, You-Dan;Gang, Tae-Sam
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.1 no.2
    • /
    • pp.71-77
    • /
    • 1995
  • The control effectiveness and disturbance suppressibility are mainly governed by a left eigenstructure of a system. In this paper, a control algorithm which uses an output feedback eigenstructure assignment scheme is proposed in order that a desired closed-loop system has the specified degree of controllability and/or degree of disturbance suppressibility. To do this, a modal and a gross disturbance suppressibility measures are proposed. A modified version of Hamdan and Nayfeh's modal controllability measure is also presented. The validity and usefulness of the proposed measures and the controller design algorithm are illustrated by designing a controller for a third-order system as an example.

  • PDF

On the Evaluation Algrithm of Hierarchical Process using $\lambda$-Fuzzy Integral (퍼지 적분을 도입한 계증구조 평가 알고리즘)

  • 여기태;노홍승;이철영
    • Journal of the Korean Society of Marine Environment & Safety
    • /
    • v.2 no.1
    • /
    • pp.97-106
    • /
    • 1996
  • One of the main problems in evaluating complex objects, such as an ill-defined system, is how to treat ambiguous aspect of the evaluation. Due to the Complexity and ambiguity of the objects, many types of evaluation attributes should be identified based on the rational dsision. One of these attributes is an analytical hierarchy process (AHP). the weight of evaluation attribtes in AHP however comes from the probability measure based on the additivity. Therefore, it is notapplicable to the objects which have the property of non-additivity. In the previous studies by other researchers they intriduced the Hierarchical Fuzzy Integral method or mergd AHP and fuzzy measure for the analysis of the overlaps among the evaluation objects. But, they need more anlyses in terms of transformation of the probability measure into fuzzy measure which fits for the additivity and overlapping coefficient which affects to the fuzzy measure. Considering these matters, this paper deals that, ⅰ) clarifying the relation between the fuzzy and probability measure adopted in AHP, ii) calculating directly the family of fuzzy measure from the overlapping coefficient and probability measure. A simple algorithm for the calculation of fuzzy measures and set family of those from the above results is also proposed. Finally, the effectiveness of the algorithm developed by applying this to the problems for estimation of safety in ship berthing and for evaluation of ports in competition is verified. This implied that the new algoritnm gives better description of the system evaluation.

  • PDF