• Title/Summary/Keyword: Nonlinear transform

Search Result 289, Processing Time 0.023 seconds

Geocoding of the Free Stereo Mosaic Image Generated from Video Sequences (비디오 프레임 영상으로부터 제작된 자유 입체 모자이크 영상의 실좌표 등록)

  • Noh, Myoung-Jong;Cho, Woo-Sug;Park, Jun-Ku;Kim, Jung-Sub;Koh, Jin-Woo
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.29 no.3
    • /
    • pp.249-255
    • /
    • 2011
  • The free-stereo mosaics image without GPS/INS and ground control data can be generated by using relative orientation parameters on the 3D model coordinate system. Its origin is located in one reference frame image. A 3D coordinate calculated by conjugate points on the free-stereo mosaic images is represented on the 3D model coordinate system. For determining 3D coordinate on the 3D absolute coordinate system utilizing conjugate points on the free-stereo mosaic images, transformation methodology is required for transforming 3D model coordinate into 3D absolute coordinate. Generally, the 3D similarity transformation is used for transforming each other 3D coordinates. Error of 3D model coordinates used in the free-stereo mosaic images is non-linearly increased according to distance from 3D model coordinate and origin point. For this reason, 3D model coordinates used in the free-stereo mosaic images are difficult to transform into 3D absolute coordinates by using linear transformation. Therefore, methodology for transforming nonlinear 3D model coordinate into 3D absolute coordinate is needed. Also methodology for resampling the free-stereo mosaic image to the geo-stereo mosaic image is needed for overlapping digital map on absolute coordinate and stereo mosaic images. In this paper, we propose a 3D non-linear transformation for converting 3D model coordinate in the free-stereo mosaic image to 3D absolute coordinate, and a 2D non-linear transformation based on 3D non-linear transformation converting the free-stereo mosaic image to the geo-stereo mosaic image.

Performance Evaluation of SE-MMA Adaptive Equalization Algorithm with Varying Step Size based on Error Signal's Nonlinear Transform (오차 신호의 비선형 변환을 이용한 Varying Step Size 방식의 SE-MMA 적응 등화 알고리즘의 성능 평가)

  • Lim, Seung-Gag
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.17 no.1
    • /
    • pp.77-82
    • /
    • 2017
  • This paper related with the VSS_SE-MMA (Varying Step Size_Signed Error-MMA) which possible to improving the equalization performance that employing the varying adaptive step size based on the nonlinearities of error signal of SE-MMA (Signed Error-MMA), compensates the intersymbol interference by distortion occurs at the communication channel, in the transmitting the spectral efficient nonconstant modulus signal such as 16-QAM. The SE-MMA appeared to the reducing the computational arithematic operation using the polarity of error signal in the updating the tap coefficient of present MMA adaptive equalizer, but have a problem of equalization performance degradation. The VSS_SE-MMA improves the problem of such SE-MMA, using the varying step size consider the error signal in the update the adaptive equalizer tap coefficient, and its improved performance were confirmed by simulation. For this, the output signal constellation of equalizer, the residual isi and maximum distortion, MSE and SER were applied. As a result of computer simulation, it was confirmed that the VSS_SE-MMA algorithm has nearly same in convergence speed and has more good performance in every performance index at the steady state.

Chaotic Disaggregation of Daily Rainfall Time Series (카오스를 이용한 일 강우자료의 시간적 분해)

  • Kyoung, Min-Soo;Sivakumar, Bellie;Kim, Hung-Soo;Kim, Byung-Sik
    • Journal of Korea Water Resources Association
    • /
    • v.41 no.9
    • /
    • pp.959-967
    • /
    • 2008
  • Disaggregation techniques are widely used to transform observed daily rainfall values into hourly ones, which serve as important inputs for flood forecasting purposes. However, an important limitation with most of the existing disaggregation techniques is that they treat the rainfall process as a realization of a stochastic process, thus raising questions on the lack of connection between the structure of the models on one hand and the underlying physics of the rainfall process on the other. The present study introduces a nonlinear deterministic (and specifically chaotic) framework to study the dynamic characteristics of rainfall distributions across different temporal scales (i.e. weights between scales), and thus the possibility of rainfall disaggregation. Rainfall data from the Seoul station (recorded by the Korea Meteorological Administration) are considered for the present investigation, and weights between only successively doubled resolutions (i.e., 24-hr to 12-hr, 12-hr to 6-hr, 6-hr to 3-hr) are analyzed. The correlation dimension method is employed to investigate the presence of chaotic behavior in the time series of weights, and a local approximation technique is employed for rainfall disaggregation. The results indicate the presence of chaotic behavior in the dynamics of weights between the successively doubled scales studied. The modeled (disaggregated) rainfall values are found to be in good agreement with the observed ones in their overall matching (e.g. correlation coefficient and low mean square error). While the general trend (rainfall amount and time of occurrence) is clearly captured, an underestimation of the maximum values are found.

Implementation on the Urine Analysis System using Color Correction and Chromaticity Coordinates Transform Methods (색 보정 및 색 좌표 변환 기법을 이용한 요분석 시스템의 구현)

  • 김기련;예수영;손정만;김철한;정도운;이승진;장용훈;전계록
    • Journal of Biomedical Engineering Research
    • /
    • v.24 no.3
    • /
    • pp.183-192
    • /
    • 2003
  • A transformation methode of the chromaticity coordinates was proposed to calibrate the measured data obtained by a urine analysis system which implemented in our previous study. Generally. the reacted color of a reagent strip by urine analysis system often exhibit the color distortions due to nonlinear characteristics of the various devices that is the optic module mechanism. hardware, and surround circumstance. A color correction method for minimizing the color distortion play a few role in maintaining high accuracy and reproduction of the urine analysis system. In this work, we used the compensation method such as the shading correction, the characteristic curve extraction of RGB color by means of third order spline interpolation, and linear transformation using a reference color. In addition, 1931 CIE XYZ color space was used to compensate the color of the measured data by a standard reference system as colorimeter. A compensation matrix was obtained so that the output values of the urine analysis system is nearly equal to that of a standard reference system for identical color sample. Color correction obtained by a urine analysis system which implemented in our previous study exhibited a good color accuracy when it was compared with the reference data. Observed result from an experiments on ten items or a urinalysis strip that color difference or between two urine analysis system was 1.28.

Performance Evaluation of Mid-IR Spectrometers by Using a Mid-IR Tunable Optical Parametric Oscillator (중적외선 광 파라메트릭 발진기를 이용한 중적외선 분광기 성능 평가)

  • Nam, Hee Jin;Kim, Seung Kwan;Bae, In-Ho;Choi, Young-Jun;Ko, Jae-Hyeon
    • Korean Journal of Optics and Photonics
    • /
    • v.30 no.4
    • /
    • pp.154-158
    • /
    • 2019
  • We have used a mid-IR (mid-infrared) continuous-wave (cw) optical parametric oscillator (OPO), developed previously and described in Ref. 12, to build a performance-evaluation setup for a mid-IR spectrometer. The used CW OPO had a wavelength tuning range of $ 2.5-3.6{\mu}m$ using a pump laser with a wavelength of 1064 nm and a fan-out MgO-doped periodically poled lithium niobate (MgO:PPLN) nonlinear crystal in a concentric cavity design. The OPO was combined with a near-IR integrating sphere and a Fourier-transform IR optical spectrum analyzer to build a performance-evaluation setup for mid-IR spectrometers. We applied this performance-evaluation setup to evaluating a mid-IR spectrometer developed domestically, and demonstrated the capability of evaluating the performance, such as spectral resolution, signal-to-noise ratio, spectral stray light, and so on, based on this setup.

Design of a Bit-Serial Divider in GF(2$^{m}$ ) for Elliptic Curve Cryptosystem (타원곡선 암호시스템을 위한 GF(2$^{m}$ )상의 비트-시리얼 나눗셈기 설계)

  • 김창훈;홍춘표;김남식;권순학
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.12C
    • /
    • pp.1288-1298
    • /
    • 2002
  • To implement elliptic curve cryptosystem in GF(2$\^$m/) at high speed, a fast divider is required. Although bit-parallel architecture is well suited for high speed division operations, elliptic curve cryptosystem requires large m(at least 163) to support a sufficient security. In other words, since the bit-parallel architecture has an area complexity of 0(m$\^$m/), it is not suited for this application. In this paper, we propose a new serial-in serial-out systolic array for computing division operations in GF(2$\^$m/) using the standard basis representation. Based on a modified version of tile binary extended greatest common divisor algorithm, we obtain a new data dependence graph and design an efficient bit-serial systolic divider. The proposed divider has 0(m) time complexity and 0(m) area complexity. If input data come in continuously, the proposed divider can produce division results at a rate of one per m clock cycles, after an initial delay of 5m-2 cycles. Analysis shows that the proposed divider provides a significant reduction in both chip area and computational delay time compared to previously proposed systolic dividers with the same I/O format. Since the proposed divider can perform division operations at high speed with the reduced chip area, it is well suited for division circuit of elliptic curve cryptosystem. Furthermore, since the proposed architecture does not restrict the choice of irreducible polynomial, and has a unidirectional data flow and regularity, it provides a high flexibility and scalability with respect to the field size m.

Modeling of Sensorineural Hearing Loss for the Evaluation of Digital Hearing Aid Algorithms (디지털 보청기 알고리즘 평가를 위한 감음신경성 난청의 모델링)

  • 김동욱;박영철
    • Journal of Biomedical Engineering Research
    • /
    • v.19 no.1
    • /
    • pp.59-68
    • /
    • 1998
  • Digital hearing aids offer many advantages over conventional analog hearing aids. With the advent of high speed digital signal processing chips, new digital techniques have been introduced to digital hearing aids. In addition, the evaluation of new ideas in hearing aids is necessarily accompanied by intensive subject-based clinical tests which requires much time and cost. In this paper, we present an objective method to evaluate and predict the performance of hearing aid systems without the help of such subject-based tests. In the hearing impairment simulation(HIS) algorithm, a sensorineural hearing impairment medel is established from auditory test data of the impaired subject being simulated. Also, the nonlinear behavior of the loudness recruitment is defined using hearing loss functions generated from the measurements. To transform the natural input sound into the impaired one, a frequency sampling filter is designed. The filter is continuously refreshed with the level-dependent frequency response function provided by the impairment model. To assess the performance, the HIS algorithm was implemented in real-time using a floating-point DSP. Signals processed with the real-time system were presented to normal subjects and their auditory data modified by the system was measured. The sensorineural hearing impairment was simulated and tested. The threshold of hearing and the speech discrimination tests exhibited the efficiency of the system in its use for the hearing impairment simulation. Using the HIS system we evaluated three typical hearing aid algorithms.

  • PDF

A digital Audio Watermarking Algorithm using 2D Barcode (2차원 바코드를 이용한 오디오 워터마킹 알고리즘)

  • Bae, Kyoung-Yul
    • Journal of Intelligence and Information Systems
    • /
    • v.17 no.2
    • /
    • pp.97-107
    • /
    • 2011
  • Nowadays there are a lot of issues about copyright infringement in the Internet world because the digital content on the network can be copied and delivered easily. Indeed the copied version has same quality with the original one. So, copyright owners and content provider want a powerful solution to protect their content. The popular one of the solutions was DRM (digital rights management) that is based on encryption technology and rights control. However, DRM-free service was launched after Steve Jobs who is CEO of Apple proposed a new music service paradigm without DRM, and the DRM is disappeared at the online music market. Even though the online music service decided to not equip the DRM solution, copyright owners and content providers are still searching a solution to protect their content. A solution to replace the DRM technology is digital audio watermarking technology which can embed copyright information into the music. In this paper, the author proposed a new audio watermarking algorithm with two approaches. First, the watermark information is generated by two dimensional barcode which has error correction code. So, the information can be recovered by itself if the errors fall into the range of the error tolerance. The other one is to use chirp sequence of CDMA (code division multiple access). These make the algorithm robust to the several malicious attacks. There are many 2D barcodes. Especially, QR code which is one of the matrix barcodes can express the information and the expression is freer than that of the other matrix barcodes. QR code has the square patterns with double at the three corners and these indicate the boundary of the symbol. This feature of the QR code is proper to express the watermark information. That is, because the QR code is 2D barcodes, nonlinear code and matrix code, it can be modulated to the spread spectrum and can be used for the watermarking algorithm. The proposed algorithm assigns the different spread spectrum sequences to the individual users respectively. In the case that the assigned code sequences are orthogonal, we can identify the watermark information of the individual user from an audio content. The algorithm used the Walsh code as an orthogonal code. The watermark information is rearranged to the 1D sequence from 2D barcode and modulated by the Walsh code. The modulated watermark information is embedded into the DCT (discrete cosine transform) domain of the original audio content. For the performance evaluation, I used 3 audio samples, "Amazing Grace", "Oh! Carol" and "Take me home country roads", The attacks for the robustness test were MP3 compression, echo attack, and sub woofer boost. The MP3 compression was performed by a tool of Cool Edit Pro 2.0. The specification of MP3 was CBR(Constant Bit Rate) 128kbps, 44,100Hz, and stereo. The echo attack had the echo with initial volume 70%, decay 75%, and delay 100msec. The sub woofer boost attack was a modification attack of low frequency part in the Fourier coefficients. The test results showed the proposed algorithm is robust to the attacks. In the MP3 attack, the strength of the watermark information is not affected, and then the watermark can be detected from all of the sample audios. In the sub woofer boost attack, the watermark was detected when the strength is 0.3. Also, in the case of echo attack, the watermark can be identified if the strength is greater and equal than 0.5.

The Prediction of DEA based Efficiency Rating for Venture Business Using Multi-class SVM (다분류 SVM을 이용한 DEA기반 벤처기업 효율성등급 예측모형)

  • Park, Ji-Young;Hong, Tae-Ho
    • Asia pacific journal of information systems
    • /
    • v.19 no.2
    • /
    • pp.139-155
    • /
    • 2009
  • For the last few decades, many studies have tried to explore and unveil venture companies' success factors and unique features in order to identify the sources of such companies' competitive advantages over their rivals. Such venture companies have shown tendency to give high returns for investors generally making the best use of information technology. For this reason, many venture companies are keen on attracting avid investors' attention. Investors generally make their investment decisions by carefully examining the evaluation criteria of the alternatives. To them, credit rating information provided by international rating agencies, such as Standard and Poor's, Moody's and Fitch is crucial source as to such pivotal concerns as companies stability, growth, and risk status. But these types of information are generated only for the companies issuing corporate bonds, not venture companies. Therefore, this study proposes a method for evaluating venture businesses by presenting our recent empirical results using financial data of Korean venture companies listed on KOSDAQ in Korea exchange. In addition, this paper used multi-class SVM for the prediction of DEA-based efficiency rating for venture businesses, which was derived from our proposed method. Our approach sheds light on ways to locate efficient companies generating high level of profits. Above all, in determining effective ways to evaluate a venture firm's efficiency, it is important to understand the major contributing factors of such efficiency. Therefore, this paper is constructed on the basis of following two ideas to classify which companies are more efficient venture companies: i) making DEA based multi-class rating for sample companies and ii) developing multi-class SVM-based efficiency prediction model for classifying all companies. First, the Data Envelopment Analysis(DEA) is a non-parametric multiple input-output efficiency technique that measures the relative efficiency of decision making units(DMUs) using a linear programming based model. It is non-parametric because it requires no assumption on the shape or parameters of the underlying production function. DEA has been already widely applied for evaluating the relative efficiency of DMUs. Recently, a number of DEA based studies have evaluated the efficiency of various types of companies, such as internet companies and venture companies. It has been also applied to corporate credit ratings. In this study we utilized DEA for sorting venture companies by efficiency based ratings. The Support Vector Machine(SVM), on the other hand, is a popular technique for solving data classification problems. In this paper, we employed SVM to classify the efficiency ratings in IT venture companies according to the results of DEA. The SVM method was first developed by Vapnik (1995). As one of many machine learning techniques, SVM is based on a statistical theory. Thus far, the method has shown good performances especially in generalizing capacity in classification tasks, resulting in numerous applications in many areas of business, SVM is basically the algorithm that finds the maximum margin hyperplane, which is the maximum separation between classes. According to this method, support vectors are the closest to the maximum margin hyperplane. If it is impossible to classify, we can use the kernel function. In the case of nonlinear class boundaries, we can transform the inputs into a high-dimensional feature space, This is the original input space and is mapped into a high-dimensional dot-product space. Many studies applied SVM to the prediction of bankruptcy, the forecast a financial time series, and the problem of estimating credit rating, In this study we employed SVM for developing data mining-based efficiency prediction model. We used the Gaussian radial function as a kernel function of SVM. In multi-class SVM, we adopted one-against-one approach between binary classification method and two all-together methods, proposed by Weston and Watkins(1999) and Crammer and Singer(2000), respectively. In this research, we used corporate information of 154 companies listed on KOSDAQ market in Korea exchange. We obtained companies' financial information of 2005 from the KIS(Korea Information Service, Inc.). Using this data, we made multi-class rating with DEA efficiency and built multi-class prediction model based data mining. Among three manners of multi-classification, the hit ratio of the Weston and Watkins method is the best in the test data set. In multi classification problems as efficiency ratings of venture business, it is very useful for investors to know the class with errors, one class difference, when it is difficult to find out the accurate class in the actual market. So we presented accuracy results within 1-class errors, and the Weston and Watkins method showed 85.7% accuracy in our test samples. We conclude that the DEA based multi-class approach in venture business generates more information than the binary classification problem, notwithstanding its efficiency level. We believe this model can help investors in decision making as it provides a reliably tool to evaluate venture companies in the financial domain. For the future research, we perceive the need to enhance such areas as the variable selection process, the parameter selection of kernel function, the generalization, and the sample size of multi-class.