• Title/Summary/Keyword: Measure Algorithm

Search Result 2,036, Processing Time 0.032 seconds

3D Surface Reconstruction by Combining Focus Measures through Genetic Algorithm (유전 알고리즘 기반의 초점 측도 조합을 이용한 3차원 표면 재구성 기법)

  • Mahmood, Muhammad Tariq;Choi, Young Kyu
    • Journal of the Semiconductor & Display Technology
    • /
    • v.13 no.2
    • /
    • pp.23-28
    • /
    • 2014
  • For the reconstruction of three-dimensional (3D) shape of microscopic objects through shape from focus (SFF) methods, usually a single focus measure operator is employed. However, it is difficult to compute accurate depth map using a single focus measure due to different textures, light conditions and arbitrary object surfaces. Moreover, real images with diverse types of illuminations and contrasts lead to the erroneous depth map estimation through a single focus measure. In order to get better focus measurements and depth map, we have combined focus measure operators by using genetic algorithm. The resultant focus measure is obtained by weighted sum of the output of various focus measure operators. Optimal weights are obtained using genetic algorithm. Finally, depth map is obtained from the refined focus volume. The performance of the developed method is then evaluated by using both the synthetic and real world image sequences. The experimental results show that the proposed method is more effective in computing accurate depth maps as compared to the existing SFF methods.

A Measure of Reliability Importance in the Network and its Computational Algorithm (네트워크 신뢰성 중요도의 척도와 계산알고리즘)

  • Lee, Chang-Hun;Jeong, Seong-Jin;Hong, Jeong-Sik
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.13 no.2
    • /
    • pp.79-85
    • /
    • 1987
  • A unified reliability importance of the component in the network is considered. A measure is presented by considering the traffic between vertex pairs. An algrithm for this measure is also presented by using the factoring algorithm.

  • PDF

Building Detection Using Segment Measure Function and Line Relation

  • Ye, Chul-Soo;Kim, Gyeong-Hwan;Lee, Kwae-Hi
    • Proceedings of the KSRS Conference
    • /
    • 1999.11a
    • /
    • pp.177-181
    • /
    • 1999
  • This paper presents an algorithm for building detection from aerial image using segment measure function and line relation. In the detection algorithm proposed, edge detection, linear approximation and line linking are used and then line measure function is applied to each line segment in order to improve the accuracy of linear approximation. Parallelisms, orthogonalities are applied to the extracted liner segments to extract building. The algorithm was applied to aerial image and the buildings were accurately detected.

  • PDF

A Study on Complexity Measure Algorithm of Time Series Data (시계열 데이타의 흔돈도 분석 알고리즘에 관한 연구)

  • Lee, Byung-Chae;Jeong, Kee-Sam;Lee, Myoung-Ho
    • Proceedings of the KOSOMBE Conference
    • /
    • v.1995 no.05
    • /
    • pp.281-284
    • /
    • 1995
  • This paper describes a complexity measure algorithm based on nonlinear dynamics(chaos theory). In order to quantify complexity or regularity of biomedical signal, this paper proposed fractal dimension-1 and fractal dimension-2 algorithm with digital filter. Approximate entropy algorithm which measure a system regularity are also compared. In this paper investigate what we quantify of biomedical signal. These quantified complexity measure may be a useful information about human physiology.

  • PDF

A Study on the Subtask Performance Using Measure Constraint Locus for a Redundant Robot (여유자유도 로봇에 있어서 성능지수 제한궤적을 이용한 부작업의 성능에 관한 연구)

  • 최병욱;원종화;정명진
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.28B no.10
    • /
    • pp.761-770
    • /
    • 1991
  • This paper suggests a measure constraint locus for characterization of the performance of a subtask for a redundant robot. The measure constraint locus are the loci of points satisfying the necessary constraint for optimality of measure in the joint configuration space. To uniquely obtain an inverse kinematic solution, one must consider both measure constraint locus and self-motion manifolds which are set of homogeneous solutions. Using measure constraint locus for maniqulability measure, the invertible workspace without singularities and the topological property of the configuration space for linding equilibrium configurations are analyzed. We discuss some limitations based on the topological arguments of measure constraint locus, of the inverse kinematic algorithm for a cyclic task. And the inverse kinematic algorithm using global maxima on self-motion manifolds is proposed and its property is studied.

  • PDF

Test Algorithm and Measurement of Housekeeping A/D Converter (하우스킵핑 A/D 변환기의 테스트 알고리즘과 측정)

  • 박용수;유흥균
    • Journal of the Semiconductor & Display Technology
    • /
    • v.3 no.4
    • /
    • pp.19-27
    • /
    • 2004
  • The characteristic evaluation of A/D converter is to measure the linearity of the converter. The evaluation of the linearity is to measure the DNL, INL, gain error and offset error in the various test parameters of A/D converter. Generally, DNL and INL are to be measured by the Histogram Test Algorithm in the DSP-based ATE environment. And gain error and offset error are to be measured by the calculation equation of the measuring algorithm. It is to propose the new Concurrent Histogram Test Algorithm for the test of the housekeeping A/D converter used in the CDMA cellular phone. Using the proposed method, it is to measure the DNL, INL, gain error and offset error concurrently and to show the measured results.

  • PDF

Development of Algorithm for Measuring Oscillating Angles and Periods of Ships in a Seaway (파랑중 실선의 동요각 및 동요 주기 추정 알고리듬 개발)

  • Choi, Kwang-Sik;Won, Moon-Cheol;Ryu, Sang-Hyun;Lew, Jae-Moon;Ji, Yong-Jin
    • Journal of the Society of Naval Architects of Korea
    • /
    • v.47 no.2
    • /
    • pp.141-149
    • /
    • 2010
  • It is essential to find oscillating angles and periods in a seaway when designing and manufacturing stabilizers. It is difficult to find oscillating angles and periods in high speed turning and they vary with ship speed and wave heading angles, therefore, proper algorithm to measure oscillating periods in a seaway. In the present study, three kinds of algorithms are developed to measure oscillating angles periods in a seaway. Dual axis tilt sensor of low price is used to measure oscillating angles, and the effect of lateral accelerations on tilt sensor have been reduced by the fusion algorithm using the gyro sensor signals. Analog and digital filters are applied to minimize the noise of the signals. Three kinds of algorithms, zero crossing, peak to peak and moving zero crossing algorithm, are developed to measure oscillating periods in a seaway. It is found that the moving zero algorithm showed the best results in the sea trials.

Algorithms to measure carbonation depth in concrete structures sprayed with a phenolphthalein solution

  • Ruiz, Christian C.;Caballero, Jose L.;Martinez, Juan H.;Aperador, Willian A.
    • Advances in concrete construction
    • /
    • v.9 no.3
    • /
    • pp.257-265
    • /
    • 2020
  • Many failures of concrete structures are related to steel corrosion. For this reason, it is important to recognize how the carbonation can affect the durability of reinforced concrete structures. The repeatability of the carbonation depth measure in a specimen of concrete sprayed with a phenolphthalein solution is consistently low whereby it is necessary to have an impartial method to measure the carbonation depth. This study presents two automatic algorithms to detect the non-carbonated zone in concrete specimens. The first algorithm is based solely on digital processing image (DPI), mainly morphological and threshold techniques. The second algorithm is based on artificial intelligence, more specifically on an array of Kohonen networks, but also using some DPI techniques to refine the results. Moreover, another algorithm was developed with the purpose of measure the carbonation depth from the image obtained previously.

Color image quantization using color activity weighted distortion measure of human vision (인간 시각의 칼라 활성 가중 왜곡 척도를 이용한 칼라 영상 양자화)

  • 김경만;이응주;박양우;이채수;하영호
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.33B no.4
    • /
    • pp.101-110
    • /
    • 1996
  • Color image quantization is a process of selecting a set of colors to display an image with some representative colors without noticeable perceived difference. It is very important in many applications to display a true color image in a low cost color monitor or printer. the basic problem is how to display 224 colors with 256 or less colors, called color palette. In this paper, we propose an algorithm to design the 256 or less size color palette by using spatial maskin geffect of HVS and subjective distortion measure weighted by color palette by using spatial masking effect of HVS and subjective distortion measure weighted by color activity in 4*4 local region in any color image. The proposed algorithm consists of octal prequantization and subdivision quantization processing step using the distortion measure and modified Otsu's between class variance maximization method. The experimental results show that the proposed algorithm has higher visual quality and needs less consuming time than conventional algorithms.

  • PDF

Robust Oriented Hausdorff Measure for 2-D Object Matching (이차원 물체 정합을 위한 Robust Oriented Hausdorff Measure)

  • Sim, Dong-Gyu;Park, Rae-Hong
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.36S no.11
    • /
    • pp.60-67
    • /
    • 1999
  • This paper proposes a robust oriented Hausdorff measure (ROHM) for 20D object matching. The ROHM is introduced by replacing the distance concept of the conventional Hausdorff distance (HD) algorithm by the accumulation scheme of the Hough transform (HT). The proposed algorithm can be considered as the modified directed HT using the distance transform (DT). The orientation information at each pixel is also used for removing incorrect correspondences. Experiments with various test images show that the performance of the proposed algorithm is better than that of conventional HD algorithms considered.

  • PDF