• Title/Summary/Keyword: distance transform

Search Result 431, Processing Time 0.032 seconds

Quality Assessment of Images Projected Using Multiple Projectors

  • Kakli, Muhammad Umer;Qureshi, Hassaan Saadat;Khan, Muhammad Murtaza;Hafiz, Rehan;Cho, Yongju;Park, Unsang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.6
    • /
    • pp.2230-2250
    • /
    • 2015
  • Multiple projectors with partially overlapping regions can be used to project a seamless image on a large projection surface. With the advent of high-resolution photography, such systems are gaining popularity. Experts set up such projection systems by subjectively identifying the types of errors induced by the system in the projected images and rectifying them by optimizing (correcting) the parameters associated with the system. This requires substantial time and effort, thus making it difficult to set up such systems. Moreover, comparing the performance of different multi-projector display (MPD) systems becomes difficult because of the subjective nature of evaluation. In this work, we present a framework to quantitatively determine the quality of an MPD system and any image projected using such a system. We have divided the quality assessment into geometric and photometric qualities. For geometric quality assessment, we use Feature Similarity Index (FSIM) and distance-based Scale Invariant Feature Transform (SIFT). For photometric quality assessment, we propose to use a measure incorporating Spectral Angle Mapper (SAM), Intensity Magnitude Ratio (IMR) and Perceptual Color Difference (ΔE). We have tested the proposed framework and demonstrated that it provides an acceptable method for both quantitative evaluation of MPD systems and estimation of the perceptual quality of any image projected by them.

Scaling Technique of Earthquake Record and its Application to Pile Load Test for Model Driven into Pressure Chamber (지진 기록의 확대(Scaling) 기법과 압력토오 말뚝모형실험에의 적용)

  • 최용규
    • Geotechnical Engineering
    • /
    • v.12 no.2
    • /
    • pp.19-32
    • /
    • 1996
  • Based on Trifuilac's empirical model to transform earthquake acceleration time history in the time domain into Fourier amplitude spectrum in the frequency domail an earthquake scaling technique for simulating the earthquake record of certain magnitude as the required magnitude earthquake was suggested. Also, using the earthquake record of magni dude(M) 5.8, the simulated earthquake of magnitude(M) 8.0 was established and its application to dynamic testing system was proposed. The earthquake scaling technique could be considered by several terms : earthquake magnitude(M), earthquake intensity(MMI), epicentral distance, recording site conditions, component direction and confidence level required by the analysis. Albo, it had an application to the various earthquake records. The simulated earthquake in this study was established by two orthogonal horizontal components of earthquake acceleration-time history. The simulated earthquake shaking could be applied to the dynamic pile load test for the model tension pile and the model compressive open -ended piles driven into the pressure chamber. In the static pile load test, behavior of two piles was very different and after model tension pile experienced 2 or 3 successive slips of the pile relative to the soil, it was failed completely. During the simulated earthquake shaking, dynamic behavior and pile capacity degradation of two piles were very different.

  • PDF

Fault Severity Diagnosis of Ball Bearing by Support Vector Machine (서포트 벡터 머신을 이용한 볼 베어링의 결함 정도 진단)

  • Kim, Yang-Seok;Lee, Do-Hwan;Kim, Dae-Woong
    • Transactions of the Korean Society of Mechanical Engineers B
    • /
    • v.37 no.6
    • /
    • pp.551-558
    • /
    • 2013
  • A support vector machine (SVM) is a very powerful classification algorithm when a set of training data, each marked as belonging to one of several categories, is given. Therefore, SVM techniques have been used as one of the diagnostic tools in machine learning as well as in pattern recognition. In this paper, we present the results of classifying ball bearing fault types and severities using SVM with an optimized feature set based on the minimum distance rule. A feature set as an input for SVM includes twelve time-domain and nine frequency-domain features that are extracted from the measured vibration signals and their decomposed details and approximations with discrete wavelet transform. The vibration signals were obtained from a test rig to simulate various bearing fault conditions.

Characteristics of Electric and Mgnetic Field Profiles from Transformer and GIS Perimeters (변압기와 GIS 주변에서 전장과 자장 분포의 특성)

  • 이복희;이승칠;안창환;길형준;장석훈;박동화;곽희로
    • Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
    • /
    • v.12 no.3
    • /
    • pp.51-58
    • /
    • 1998
  • This paper deals with the power frequency electric and magnetic profiles from transformer and gas-insulated swichgear(GIS) perimeters in the indoor power substation. Measurements of electric and magnetic field magnitudes were carried out by using single axis and three axes field meters at a height of 1[m]. The resultant electric and magnetic field profiles measured in the vicinity of the transformer were displayed as a 2-dimensional plot. The electric fields intensity are relatively low value of about 2.3~9[V/m], and the magnetic fields intensity range from 0.3 to [$20.3\mu$T]. Also, in the GIS perimeter the electric fields intensity are in the range of 2.2~2.5[V/m], and the high magnetic fields are largely localized to the intermediate section of the GIS and their amplitudes are [$1.2~39.5\mu$T]. Metal enclosures of transform and GIS play a role in reducing the electric field, and the magnetic fields are characterized by a rapid decrease with distance from the transformer and GIS enclosures.

  • PDF

A Study on the Applications of a Geographic Information Systems To A Transportation Planning Model (교통모형에서의 지리정보시스템 활용방안에 관한 연구)

  • Kim, Dae-Ho;Park, Jin-Woo
    • Journal of Korean Society for Geospatial Information Science
    • /
    • v.1 no.2 s.2
    • /
    • pp.167-175
    • /
    • 1993
  • This article contains three objectives. First it is to revise unnecessary procedures of a transportation models and transform results of a model into an image. Second objectives is to develop an operational structures which automatically input all data needed from arc-node topology to link-node topology of transportation network. By solving the network discrepancy, time and money for constructing to transportation can be saved. In addition, the rate of errors that my caused during data input process can be reduced. Conclusively, it is found that the integration package may provide user friendliness and reduce the rate of errors. The package can extract informations such as distance between zones and nodes, lane numbers, and hierarchy from arc-node topology for executing SDI. Another advantage of integration is the ability of spatial analysis. The integrated package may provide adequate arrangements of traffic facilities and checking systems of the shortest path. Finally, the database function of GIS package provides various information about study area for transportation analysis.

  • PDF

Identification of Track Irregularity using Wavelet Transfer Function (웨이브렛 전달함수를 이용한 궤도틀림 식별)

  • Shin, Soo-Bong;Lee, Hyeung-Jin;Kim, Man-Cheol;Yoon, Seok-Jun
    • Journal of the Korean Society for Railway
    • /
    • v.13 no.3
    • /
    • pp.304-308
    • /
    • 2010
  • This paper presents a methodology for identifying track irregularity using a wavelet transfer function. An equivalent wavelet SISO (single-input single-output) transfer function is defined by the measured track geometry and the acceleration data measured at a bogie of a train. All the measured data with various sampling frequencies were rearranged according to the constant 25cm reference recording distance of the track recording vehicle used in the field. Before applying the wavelet transform, measured data were regressed by eliminating those out of the range. The inverse wavelet transfer function is also formulated to estimate track geometry. The closeness of the estimated track geometry to the actual one is evaluated by the coherence function and also by FRF (frequency response function). A track irregularity index is defined by comparing the variance of the estimation error from the intact condition and that from the current condition. A simulation study has been carried out to examine the proposed algorithm.

The Implementation of Face Authentication System Using Real-Time Image Processing (실시간 영상처리를 이용한 얼굴 인증 시스템 구현)

  • Baek, Young-Hyun;Shin, Seong;Moon, Sung-Ryong
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.18 no.2
    • /
    • pp.193-199
    • /
    • 2008
  • In this paper, it is proposed the implementation of face authentication system based on real-time image processing. We described the process implementing the two steps for real-time face authentication system. At first face detection steps, we describe the face detection by using feature of wavelet transform, LoG operator and hausdorff distance matching. In the second step we describe the new dual-line principal component analysis(PCA) for real-time face recognition. It is combines horizontal line to vertical line so as to accept local changes of PCA. The proposed system is affected a little by the video size and resolution. And then simulation results confirm the effectiveness of out system and demonstrate its superiority to other conventional algorithm. Finally, the possibility of performance evaluation and real-time processing was confirmed through the implementation of face authentication system.

Fixed Homography-Based Real-Time SW/HW Image Stitching Engine for Motor Vehicles

  • Suk, Jung-Hee;Lyuh, Chun-Gi;Yoon, Sanghoon;Roh, Tae Moon
    • ETRI Journal
    • /
    • v.37 no.6
    • /
    • pp.1143-1153
    • /
    • 2015
  • In this paper, we propose an efficient architecture for a real-time image stitching engine for vision SoCs found in motor vehicles. To enlarge the obstacle-detection distance and area for safety, we adopt panoramic images from multiple telegraphic cameras. We propose a stitching method based on a fixed homography that is educed from the initial frame of a video sequence and is used to warp all input images without regeneration. Because the fixed homography is generated only once at the initial state, we can calculate it using SW to reduce HW costs. The proposed warping HW engine is based on a linear transform of the pixel positions of warped images and can reduce the computational complexity by 90% or more as compared to a conventional method. A dual-core SW/HW image stitching engine is applied to stitching input frames in parallel to improve the performance by 70% or more as compared to a single-core engine operation. In addition, a dual-core structure is used to detect a failure in state machines using rock-step logic to satisfy the ISO26262 standard. The dual-core SW/HW image stitching engine is fabricated in SoC with 254,968 gate counts using Global Foundry's 65 nm CMOS process. The single-core engine can make panoramic images from three YCbCr 4:2:0 formatted VGA images at 44 frames per second and frequency of 200 MHz without an LCD display.

OFDM System for Wireless-PAN related short distance Maritime Data Communication (Wireless PAN기반의 근거리 해상통신용 OFDM 송수신회로에 관한 연구)

  • Cho, Seung-Il;Cha, Jae-Sang;Park, Gye-Kack;Yang, Chung-Mo;Kim, Seong-Kweon
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.19 no.1
    • /
    • pp.145-151
    • /
    • 2009
  • Orthogonal Frequency Division Multiplexing (OFDM) has been focused on as 4th generation communication method for realization of Ubiquitous Network in land mobile communications services, and has been a standard technology of Wireless Local Area Network (WLAN) for a High Date Rate communication. And in maritime data communication using high frequency (HF) band, 32-point FFT OFDM system is recommended by International Telecommunication Union (ITU). Maritime communication should be kept on connecting when maritime accident or the maritime disaster happen. Therefore, main device FFT should be operated with low power consumption. In this paper we propose a low power 32-point FFT algorithm using radix-2 and radix-4 for low power operation. The proposed algorithm was designed using VHSIC hardware description language (VHDL), and it was confirmed that the output value of Spartan-3 field-programmable gate array (FPGA) board corresponded to the output value calculated using Matlab. The proposed 32-point FFT algorithm will be useful as a leading technology in a HF maritime data communication.

A Fast Encoding Algorithm for Image Vector Quantization Based on Prior Test of Multiple Features (복수 특징의 사전 검사에 의한 영상 벡터양자화의 고속 부호화 기법)

  • Ryu Chul-hyung;Ra Sung-woong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.12C
    • /
    • pp.1231-1238
    • /
    • 2005
  • This paper presents a new fast encoding algorithm for image vector quantization that incorporates the partial distances of multiple features with a multidimensional look-up table (LUT). Although the methods which were proposed earlier use the multiple features, they handles the multiple features step by step in terms of searching order and calculating process. On the other hand, the proposed algorithm utilizes these features simultaneously with the LUT. This paper completely describes how to build the LUT with considering the boundary effect for feasible memory cost and how to terminate the current search by utilizing partial distances of the LUT Simulation results confirm the effectiveness of the proposed algorithm. When the codebook size is 256, the computational complexity of the proposed algorithm can be reduced by up to the $70\%$ of the operations required by the recently proposed alternatives such as the ordered Hadamard transform partial distance search (OHTPDS), the modified $L_2-norm$ pyramid ($M-L_2NP$), etc. With feasible preprocessing time and memory cost, the proposed algorithm reduces the computational complexity to below the $2.2\%$ of those required for the exhaustive full search (EFS) algorithm while preserving the same encoding quality as that of the EFS algorithm.