• Title/Summary/Keyword: 최소 자승 알고리즘

Search Result 231, Processing Time 0.025 seconds

Real-Time Vehicle Mass Estimator for Active Rollover Prevention Systems (차량 전복 방지 장치를 위한 실시간 차량 질량 추정 시스템)

  • Han, Kwang-Jin;Kim, In-Keun;Kim, Seung-Ki;Huh, Kun-Soo
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.36 no.6
    • /
    • pp.673-679
    • /
    • 2012
  • Vehicle rollover is a serious kind of accident, particularly for sport utility vehicles, and its occurrence can be minimized by utilizing active rollover prevention systems. The performance of these protection systems is very sensitive to vehicle inertial parameters such as the vehicle's mass and center of mass. These parameters vary with the number of passengers and in different load situations. In this paper, a unified method for vehicle mass estimation is proposed that takes into account the available driving conditions. Three estimation algorithms are developed based on longitudinal, lateral, and vertical vehicle motion, respectively. Then, the three algorithms are combined to extract information on the vehicle's mass during arbitrary vehicle maneuvering. The performance of the proposed vehicle mass estimation method is demonstrated through real-time experiments.

A Study on the Generation for Negotiation Alternative Considering Negotiator's Strategy (협상자의 전략을 고려한 협상 대안 생성에 관한 연구)

  • Sim Joung-Hoon;Choi Hyung-Rim;Kim Hyun-Soo;Hong Soon-Goo;Cho Min-Je
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.10 no.3
    • /
    • pp.21-29
    • /
    • 2005
  • The most of automated negotiation systems are dependent upon negotiators' offers, as negotiation is going on. Particularly, the preference, evaluation function and negotiation strategy are variously changed at every negotiation round by the negotiator and have an effect on the counter offers. Therefore, this study proposed the automated negotiation methodology or negotiation model which makes the negotiator's participation minimize. To minimize negotiator's participation, the preference of negotiator was predicted by the ratio of seller and buyer's count offers and the evaluation function of negotiator was also predicted by least squares approximation method at every negotiation round. The predicted evaluation function was evaluated and selected by $R^2$ value, coefficient of determination. Finally the optimal counter offers were generated by the genetic algorithm using the predicted preference and value function.

  • PDF

Detecting Line Segment by Incremental Pixel Extension (점진적인 화소 확장에 의한 선분 추출)

  • Lee, Jae-Kwang;Park, Chang-Joon
    • Journal of Korea Multimedia Society
    • /
    • v.11 no.3
    • /
    • pp.292-300
    • /
    • 2008
  • An algorithm for detecting a line segment in an image is presented using incremental pixel extension. We use a different approach from conventional algorithms, such as the Hough transform approach and the line segment grouping approach. The Canny edge is calculated and an arbitrary point is selected among the edge elements. After the arbitrary point is selected, a base line approximating the line segment is calculated and edge pixels within an arbitrary radius are selected. A weighted value is assigned to each edge pixel, which is selected by using the error of the distance and the direction between the pixel and the base line. A line segment is extracted by Jilting a line using the weighted least square method after determining whether selected pixels are linked or delinked using the sum comparison of the weights. The proposed algorithm is compared with two other methods and results show that our algorithm is faster and can detect the real line segment.

  • PDF

Optimal Design of Fuzzy Relation-based Fuzzy Inference Systems with Information Granulation (정보 Granules에 의한 퍼지 관계 기반 퍼지 추론 시스템의 최적 설계)

  • Park Keon-Jun;Ahn Tae-Chon;Oh Sung-kwun;Kim Hyun-Ki
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.15 no.1
    • /
    • pp.81-86
    • /
    • 2005
  • In this study, we introduce a new category of fuzzy inference systems based on information granulation to carry out the model identification of complex and nonlinear systems. Informally speaking, information granules are viewed as linked collections of objects (data, in particular) drawn together by the criteria of proximity, similarity, or functionality Granulation of information with the aid of Hard C-Means (HCM) clustering help determine the initial parameters of fuzzy model such as the initial apexes of the membership functions and the initial values of polynomial functions being used in the premise and consequence part of the fuzzy rules. And the initial parameters are tuned effectively with the aid of the genetic algorithms(GAs) and the least square method (LSM). An aggregate objective function with a weighting factor is also used in order to achieve a balance between performance of the fuzzy model. The proposed model is evaluated with using a numerical example and is contrasted with the performance of conventional fuzzy models in the literature.

Color Image Restoration in Detected Aliasing Region (에일리어싱 영역 검출을 통한 컬러 영상 복원)

  • Kwon, Ji Yong;Kang, Moon Gi
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.53 no.12
    • /
    • pp.105-110
    • /
    • 2016
  • To reduce the cost and volume of a digital camera, a subsampled color filter array(CFA) image is used and demosaicking is applied to estimate the missing color values. However, aliasing, the overlaps of signals in the frequency domain, occurs when signals are subsampled. This causes aliasing artifacts such as false colors and zipper effects in demosaicking processes. In this paper, the algorithm estimating high-quality color images by removing aliasing artifacts in them is proposed. The aliasing region map is estimated using the sub-sampled signals of the CFA image. By using the aliasing region map and the estimated luminance image, the least squares problem of the observation models is designed and aliasing artifacts are eliminated. The experiments demonstrate that the proposed algorithm restores color images without aliasing artifacts.

Voice personality transformation using an orthogonal vector space conversion (직교 벡터 공간 변환을 이용한 음성 개성 변환)

  • Lee, Ki-Seung;Park, Kun-Jong;Youn, Dae-Hee
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.33B no.1
    • /
    • pp.96-107
    • /
    • 1996
  • A voice personality transformation algorithm using orthogonal vector space conversion is proposed in this paper. Voice personality transformation is the process of changing one person's acoustic features (source) to those of another person (target). In this paper, personality transformation is achieved by changing the LPC cepstrum coefficients, excitation spectrum and pitch contour. An orthogonal vector space conversion technique is proposed to transform the LPC cepstrum coefficients. The LPC cepstrum transformation is implemented by principle component decomposition by applying the Karhunen-Loeve transformation and minimum mean-square error coordinate transformation(MSECT). Additionally, we propose a pitch contour modification method to transform the prosodic characteristics of any speaker. To do this, reference pitch patterns for source and target speaker are firstly built up, and speaker's one. The experimental results show the effectiveness of the proposed algorithm in both subjective and objective evaluations.

  • PDF

Development of Autonomous Algorithm Using an Online Feedback-Error Learning Based Neural Network for Nonholonomic Mobile Robots (온라인 피드백 에러 학습을 이용한 이동 로봇의 자율주행 알고리즘 개발)

  • Lee, Hyun-Dong;Myung, Byung-Soo
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.21 no.5
    • /
    • pp.602-608
    • /
    • 2011
  • In this study, a method of designing a neurointerface using neural network (NN) is proposed for controlling nonholonomic mobile robots. According to the concept of virtual master-slave robots, in particular, a partially stable inverse dynamic model of the master robot is acquired online through the NN by applying a feedback-error learning method, in which the feedback controller is assumed to be based on a PD compensator for such a nonholonomic robot. The NN for the online feedback-error learning can composed that the input layer consists of six units for the inputs $x_i$, i=1~6, the hidden layer consists of two hidden units for hidden outputs $o_j$, j=1~2, and the output layer consists of two units for the outputs ${\tau}_k$, k=1~2. A tracking control problem is demonstrated by some simulations for a nonholonomic mobile robot with two-independent driving wheels. The initial q value was set to [0, 5, ${\pi}$].

Time- and Frequency-Domain Block LMS Adaptive Digital Filters: Part Ⅱ - Performance Analysis (시간영역 및 주파수영역 블럭적응 여파기에 관한 연구 : 제 2 부- 성능분석)

  • Lee, Jae-Chon;Un, Chong-Kwan
    • The Journal of the Acoustical Society of Korea
    • /
    • v.7 no.4
    • /
    • pp.54-76
    • /
    • 1988
  • In Part Ⅰ of the paper, we have developed various block least mean-square (BLMS) adaptive digital filters (ADF's) based on a unified matrix treatment. In Part Ⅱ we analyze the convergence behaviors of the self-orthogonalizing frequency-domain BLMS (FBLMS) ADF and the unconstrained FBLMS (UFBLMS) ADF both for the overlap-save and overlap-add sectioning methods. We first show that, unlike the FBLMS ADF with a constant convergence factor, the convergence behavior of the self-orthogonalizing FBLMS ADF is governed by the same autocorrelation matrix as that of the UFBLMS ADF. We then show that the optimum solution of the UFBLMS ADF is the same as that of the constrained FBLMS ADF when the filter length is sufficiently long. The mean of the weight vector of the UFBLMS ADF is also shown to converge to the optimum Wiener weight vector under a proper condition. However, the steady-state mean-squared error(MSE) of the UFBLMS ADF turns out to be slightly worse than that of the constrained algorithm if the same convergence constant is used in both cases. On the other hand, when the filter length is not sufficiently long, while the constrained FBLMS ADF yields poor performance, the performance of the UFBLMS ADF can be improved to some extent by utilizing its extended filter-length capability. As for the self-orthogonalizing FBLMS ADF, we study how we can approximate the autocorrelation matrix by a diagonal matrix in the frequency domain. We also analyze the steady-state MSE's of the self-orthogonalizing FBLMS ADF's with and without the constant. Finally, we present various simulation results to verify our analytical results.

  • PDF

Development of an Automatic 3D Coregistration Technique of Brain PET and MR Images (뇌 PET과 MR 영상의 자동화된 3차원적 합성기법 개발)

  • Lee, Jae-Sung;Kwark, Cheol-Eun;Lee, Dong-Soo;Chung, June-Key;Lee, Myung-Chul;Park, Kwang-Suk
    • The Korean Journal of Nuclear Medicine
    • /
    • v.32 no.5
    • /
    • pp.414-424
    • /
    • 1998
  • Purpose: Cross-modality coregistration of positron emission tomography (PET) and magnetic resonance imaging (MR) could enhance the clinical information. In this study we propose a refined technique to improve the robustness of registration, and to implement more realistic visualization of the coregistered images. Materials and Methods: Using the sinogram of PET emission scan, we extracted the robust head boundary and used boundary-enhanced PET to coregister PET with MR. The pixels having 10% of maximum pixel value were considered as the boundary of sinogram. Boundary pixel values were exchanged with maximum value of sinogram. One hundred eighty boundary points were extracted at intervals of about 2 degree using simple threshold method from each slice of MR images. Best affined transformation between the two point sets was performed using least square fitting which should minimize the sum of Euclidean distance between the point sets. We reduced calculation time using pre-defined distance map. Finally we developed an automatic coregistration program using this boundary detection and surface matching technique. We designed a new weighted normalization technique to display the coregistered PET and MR images simultaneously. Results: Using our newly developed method, robust extraction of head boundary was possible and spatial registration was successfully performed. Mean displacement error was less than 2.0 mm. In visualization of coregistered images using weighted normalization method, structures shown in MR image could be realistically represented. Conclusion: Our refined technique could practically enhance the performance of automated three dimensional coregistration.

  • PDF

Robust frame synchronization algorithm in time-varying underwater acoustic communication channel (수중 음향통신에서 채널 시변동성에 강인한 프레임 동기 알고리즘)

  • Ko, Seokjun;Kim, Wan-Jin
    • The Journal of the Acoustical Society of Korea
    • /
    • v.39 no.1
    • /
    • pp.8-15
    • /
    • 2020
  • In this paper, we propose a frame synchronization algorithm for robust to the combined effects of large Doppler fluctuations and extended, time-varying multipath in the underwater acoustic communication. From the algorithm, we can recover a high timing error which is occurred from an acoustic propagation delay and uncertainty of oscillator between transmitter and receiver. In order to verify the performance of the synchronization algorithm, the lake trial results are used. The lake experiments are performed in a Gyeongcheonho located in Mungyeong-si, Gyeongsangbuk-do. We can see that the start position of frame is adjusted after the frame synchronization while the receiver moving.