• Journal of Cadastre & Land InformatiX
• /
• v.45 no.2
• /
• pp.117-130
• /
• 2015

A least squares method for adjusting the horizontal network satisfies the conditions which is minimizing the sum of the squares of errors based on probability theory. This research compared accuracy of 3rd cadastral control points adjusted by traditional and least square method with respect to the result of Network-RTK. Test results showed the least square method more evenly distribute closure error than traditional method. Mean errors of least square and traditional adjusting method are 2.7cm, 2.2cm respectively. In addition, blunder in angle observations can be detected by comparing position errors which calculated by forward and backward initial coordinates. However, distance blunder cannot offer specific observation line occurred mistake because distance error propagates several observation lines which have similar directions.

• The Korean Journal of Applied Statistics
• /
• v.25 no.3
• /
• pp.531-541
• /
• 2012

In this study, we consider various methods to estimate the weights of a pairwise comparison matrix in the Analytic Hierarchy Process widely applied in various decision-making fields. This paper uses a data dependent simulation to evaluate the statistical accuracy, minimum violation and minimum norm of the obtaining weight methods from a reciprocal symmetric matrix. No method dominates others in all criteria. Least squares methods perform best in point of mean squared errors; however, the eigenvectors method has an advantage in the minimum norm.

• Journal of the Korean earth science society
• /
• v.38 no.5
• /
• pp.333-344
• /
• 2017

We present the environmental dependence of the luminosity-size relation of galaxies in the local universe (z < 0.01) along with their dependence on galaxy morphology represented by five broad types (E, dEs, S0, Sp, and Irr). The environmental parameters we consider are the local background density and the group/cluster membership together with the clustercenteric distance for the Virgo cluster galaxies. We derive the regression coefficient (${\beta}$), i.e., the slope of the line representing the least-squares fitting to the data and the Pearson correlation coefficient (c.c.) representing the goodness of the least-squares fit along with the confidence interval from bootstrap resampling. We find no significant dependence of the luminosity-size relation on galaxy morphology. However, there is a weak dependence of the luminosity-size relations on the environment of galaxies, in the sense that galaxies in the low density environment have shallower slopes than galaxies in the high density regions except for elliptical galaxies that show an opposite trend.

• Proceedings of the Korean Information Science Society Conference
• /
• 2011.06c
• /
• pp.393-396
• /
• 2011

In this paper, we propose a constrained alternating least squares nonnegative matrix factorization algorithm (cALSNMF) to detect active brain regions from single subject's task-related fMRI data. In cALSNMF, we define a new cost function which considers the uncorrelation and noisy problems of fMRI data by adding decorrelation and smoothing constraints in original Euclidean distance cost function. We also generate a novel training procedure by modifying the update rules and combining with optimal brain surgeon (OBS) algorithm. The experimental results on visuomotor task fMRI data show that our cALSNMF fits fMRI data better than original ALSNMF in detecting task-related brain activation from single subject's fMRI data.

• Journal of the Korean Data and Information Science Society
• /
• v.25 no.2
• /
• pp.439-446
• /
• 2014

Quantile regression models with errors in variables have received a great deal of attention in the social and natural sciences. Some eorts have been devoted to develop eective estimation methods for such quantile regression models. In this paper we propose an orthogonal distance quantile regression model that eectively considers the errors on both input and response variables. The performance of the proposed method is evaluated through simulation studies.

• Journal of the Korean Statistical Society
• /
• v.24 no.2
• /
• pp.349-360
• /
• 1995

This paper deals with the robustness properties of the minimum disparity estimation in linear regression models. The estimators defined as statistical quantities whcih minimize the blended weight Hellinger distance between a weighted kernel density estimator of the residuals and a smoothed model density of the residuals. It is shown that if the weights of the density estimator are appropriately chosen, the estimates of the regression parameters are robust.

• Journal of applied mathematics & informatics
• /
• v.6 no.2
• /
• pp.669-684
• /
• 1999

We are interested in the problem of fitting a curve to a set of points in the plane in such a way that the sum of the squares of the orthogonal distances to given data points ins minimized. In[1] the prob-lem of fitting circles and ellipses was considered and numerically solved with general purpose methods. Especially in [2] H. Spath proposed a special purpose algorithm (Spath's ODF) for parabolas y-b=$c($\chi$-a)^2$ and for rotated ones. In this paper we present another parabola fitting algorithm which is slightly different from Spath's ODF. Our algorithm is mainly based on the steepest descent provedure with the view of en-suring the convergence of the corresponding quadratic function Q(u) to a local minimum. Numerical examples are given.

• Communications of the Korean Mathematical Society
• /
• v.17 no.1
• /
• pp.121-142
• /
• 2002

We are interested in the curve fitting problems in such a way that the sum of the squares of the orthogonal distances to the given data points is minimized. Especially, the fitting an ellipse to the given data points is a problem that arises in many application areas, e.g. computer graphics, coordinate metrology, etc. In [1] the problem of fitting ellipses was considered and numerically solved with general purpose methods. In this paper we present another new ellipse fitting algorithm. Our algorithm if mainly based on the steepest descent procedure with the view of ensuring the convergence of the corresponding quadratic function Q(u) to a local minimum. Numerical examples are given.

• Korea Real Estate Review
• /
• v.24 no.1
• /
• pp.63-76
• /
• 2014

This study utilizes FGLS (Feasible Generalized Least Squares) to determine the impact of Jeju Olle trekking courses on nearby land prices. Official 2010 land price data for 7 areas surrounding different Jeju Olle Trails was examined with a GIS program to determine the exact distance of land parcels from nearby trekking courses. Distance and various other pricing factors were used as explanatory variables for increases in land prices. The dependent variable was the rate of change in land prices from 2002 to 2010. Unlike existing studies which have examined the effect of highways, subways and other transportation facilities on land prices, this paper examines the effect of Korea's first-ever trekking courses on nearby land prices. This study concludes that 7 different Olle Trails exert a significant influence on nearby land prices and that land prices decrease by 0.03% per meter as plots get further and further from Olle Trails. This result shows that not only transport infrastructure (highways, subways, etc.) but also non-traffic infrastructure such as Jeju Olle Trails and trekking courses can have positive effects on local real estate markets.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2016.05a
• /
• pp.840-843
• /
• 2016

The circular arc is a very useful feature for object detection and recognition in industrial environments. In this paper, a new method to detect circular arcs is proposed. The detection of the circular arc includes the estimation of the center, the radius and the two ending points of the arc. This new method is based on determining the best part of the circular arc (part which does not contains outliers points) using 3 points designated along the arc. A least square method is applied to the best part of the arc and the center and the radius of the arc are obtained. The distance between the remaining edge's points (points which are not lying on the best part of the arc) and the radius is used to the two ending points of the arc.