• Title/Summary/Keyword: squares

Search Result 3,059, Processing Time 0.037 seconds

Performance Comparison of Two Ellipse Fitting-Based Cell Separation Algorithms

  • Cho, Migyung
    • Journal of information and communication convergence engineering
    • /
    • v.13 no.3
    • /
    • pp.215-219
    • /
    • 2015
  • Cells in a culture process transform with time and produce many overlapping cells in their vicinity. We are interested in a separation algorithm for images of overlapping cells taken using a fluorescence optical microscope system during a cell culture process. In this study, all cells are assumed to have an ellipse-like shape. For an ellipse fitting-based method, an improved least squares method is used by decomposing the design matrix into quadratic and linear parts for the separation of overlapping cells. Through various experiments, the improved least squares method (numerically stable direct least squares fitting [NSDLSF]) is compared with the conventional least squares method (direct least squares fitting [DLSF]). The results reveal that NSDLSF has a successful separation ratio with an average accuracy of 95% for two overlapping cells, an average accuracy of 91% for three overlapping cells, and about 82% accuracy for four overlapping cells.

AN ITERATIVE ALGORITHM FOR SOLVING THE LEAST-SQUARES PROBLEM OF MATRIX EQUATION AXB+CYD=E

  • Shen, Kai-Juan;You, Chuan-Hua;Du, Yu-Xia
    • Journal of applied mathematics & informatics
    • /
    • v.26 no.5_6
    • /
    • pp.1233-1245
    • /
    • 2008
  • In this paper, an iterative method is proposed to solve the least-squares problem of matrix equation AXB+CYD=E over unknown matrix pair [X, Y]. By this iterative method, for any initial matrix pair [$X_1,\;Y_1$], a solution pair or the least-norm least-squares solution pair of which can be obtained within finite iterative steps in the absence of roundoff errors. In addition, we also consider the optimal approximation problem for the given matrix pair [$X_0,\;Y_0$] in Frobenius norm. Given numerical examples show that the algorithm is efficient.

  • PDF

A transductive least squares support vector machine with the difference convex algorithm

  • Shim, Jooyong;Seok, Kyungha
    • Journal of the Korean Data and Information Science Society
    • /
    • v.25 no.2
    • /
    • pp.455-464
    • /
    • 2014
  • Unlabeled examples are easier and less expensive to obtain than labeled examples. Semisupervised approaches are used to utilize such examples in an eort to boost the predictive performance. This paper proposes a novel semisupervised classication method named transductive least squares support vector machine (TLS-SVM), which is based on the least squares support vector machine. The proposed method utilizes the dierence convex algorithm to derive nonconvex minimization solutions for the TLS-SVM. A generalized cross validation method is also developed to choose the hyperparameters that aect the performance of the TLS-SVM. The experimental results conrm the successful performance of the proposed TLS-SVM.

PSEUDO-SPECTRAL LEAST-SQUARES METHOD FOR ELLIPTIC INTERFACE PROBLEMS

  • Shin, Byeong-Chun
    • Journal of the Korean Mathematical Society
    • /
    • v.50 no.6
    • /
    • pp.1291-1310
    • /
    • 2013
  • This paper develops least-squares pseudo-spectral collocation methods for elliptic boundary value problems having interface conditions given by discontinuous coefficients and singular source term. From the discontinuities of coefficients and singular source term, we derive the interface conditions and then we impose such interface conditions to solution spaces. We define two types of discrete least-squares functionals summing discontinuous spectral norms of the residual equations over two sub-domains. In this paper, we show that the homogeneous least-squares functionals are equivalent to appropriate product norms and the proposed methods have the spectral convergence. Finally, we present some numerical results to provide evidences for analysis and spectral convergence of the proposed methods.

A Study on Process Optimization Using Partial Least Squares Response Surface Function (편최소제곱 반응표면함수를 이용한 공정 최적화에 관한 연구)

  • Park, Sung-Hyun;Choi, Um-Moon;Park, Chang-Soon
    • Journal of Korean Society for Quality Management
    • /
    • v.27 no.2
    • /
    • pp.237-250
    • /
    • 1999
  • Response surface analysis has been a popular tool conducted by engineers in many processes. In this paper, response surface function, named partial least squares response surface function is proposed. Partial least squares response surface function is a function of partial least squares components and the response surface modeling is used in either a first-order or a second-order model. Also, this approach will have the engineers be able to do the response surface modeling and the process optimization even when the number of experimental runs is less than the number of model parameters. This idea is applied to the nondesign data and an application of partial least squares response surface function to the process optimization is considered.

  • PDF

Generalized Moving Least Squares Method and its use in Meshless Analysis of Thin Beam (일반화된 이동최소자승법과 이를 이용한 얇은 보의 무요소 해석)

  • 조진연
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 2002.04a
    • /
    • pp.497-504
    • /
    • 2002
  • In meshless methods, the moving least squares approximation technique is widely used to approximate a solution space because of its useful numerical characters such as non-element approximation, easily controllable smoothness, and others. In this work, a generalized version of the moving least squares method Is introduced to enhance the approximation performance through the Information converning to the derivative of the field variable. The results of numerical tests for approximation verify the improved accuracy of the generalized meshless approximation procedure compared to the conventional moving least squares method. By using this generalized moving least squares method, meshless analysis of thin beam is carried out, and its performance is investigated.

  • PDF

Effects of Edge Detection on Least-squares Model-image Fitting Algorithm

  • Wang, Sendo;Tseng, Yi-Hsing;Liou, Yan-Shiou
    • Proceedings of the KSRS Conference
    • /
    • 2003.11a
    • /
    • pp.159-161
    • /
    • 2003
  • Fitting the projected wire-frame model to the detected edge pixels on images by using least-squares approach, called Least-squares Model-image Fitting (LSMIF), is the key of the Model-based Building Extraction (MBBE). It is implemented by iteratively adjusting the model parameters to minimize the squares sum of distances from the extracted edge pixels to the projected wire-frame. This paper describes a series of experiments and studies on various factors affect the fitting results, including the edge detectors, the weighting rules, the initial value of parameters, and the number of overlapped images. The experimental result is not only helpful to clarify the influences of each factor, but is also able to enhance the robustness of the LSMIF algorithm.

  • PDF

A Study of Broad-band Conformal Beam Forming using Moving Least Squares Method (Moving Least Squares 기법을 이용한 광대역 컨포멀 빔 형성 연구)

  • Jung, Sang-Hoon;Lee, Kang-In;Jung, Hyun-Kyo;Chung, Young-Seek
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.68 no.1
    • /
    • pp.83-89
    • /
    • 2019
  • In this paper, beam forming using moving least squares method (MLSM) is studied. In the previous research, the least squares method (LSM), one of the data interpolation methods, was used to determine the desired beam pattern and obtain a beam pattern that minimizes the square of the error with the desired beam pattern. However, LSM has a disadvantage in that the beam pattern can not be formed to satisfy the exact steering angle of the desired beam pattern and the peak sidelobe level (PSLL) condition. To overcome this drawback, MLSM is used for beam forming. In order to verify, the proposed method is applied in beam forming of Bezier platform array antenna which is one of conformal array antenna platform.

Prediction of Flash Point of Binary Systems by Using Multivariate Statistical Analysis (다변량 통계 분석법을 이용한 2성분계 혼합물의 인화점 예측)

  • Lee, Bom-Sock;Kim, S.Y.;Chung, C.B.;Choi, S.H.
    • Journal of the Korean Institute of Gas
    • /
    • v.10 no.4 s.33
    • /
    • pp.29-33
    • /
    • 2006
  • Estimation of process safety is important in the chemical process design. Prediction for flash points of flammable substances used in chemical processes is the one of the methods for estimating process safety. Flash point is the property used to examine the potential for the fire and explosion hazards of flammable substances. In this paper, multivariate statistical analysis methods(partial least squares(PLS) quadratic partial least squares(QPLS)) using experimental data is suggested for predicting flash points of flammable substances of binary systems. The prediction results are compared with the values calculated by laws of Raoult and Van Laar equation.

  • PDF

Comparative Analysis of Learning Methods of Fuzzy Clustering-based Neural Network Pattern Classifier (퍼지 클러스터링기반 신경회로망 패턴 분류기의 학습 방법 비교 분석)

  • Kim, Eun-Hu;Oh, Sung-Kwun;Kim, Hyun-Ki
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.65 no.9
    • /
    • pp.1541-1550
    • /
    • 2016
  • In this paper, we introduce a novel learning methodology of fuzzy clustering-based neural network pattern classifier. Fuzzy clustering-based neural network pattern classifier depicts the patterns of given classes using fuzzy rules and categorizes the patterns on unseen data through fuzzy rules. Least squares estimator(LSE) or weighted least squares estimator(WLSE) is typically used in order to estimate the coefficients of polynomial function, but this study proposes a novel coefficient estimate method which includes advantages of the existing methods. The premise part of fuzzy rule depicts input space as "If" clause of fuzzy rule through fuzzy c-means(FCM) clustering, while the consequent part of fuzzy rule denotes output space through polynomial function such as linear, quadratic and their coefficients are estimated by the proposed local least squares estimator(LLSE)-based learning. In order to evaluate the performance of the proposed pattern classifier, the variety of machine learning data sets are exploited in experiments and through the comparative analysis of performance, it provides that the proposed LLSE-based learning method is preferable when compared with the other learning methods conventionally used in previous literature.