Pixel values of contrast enhanced computed tomography (CE-CT) images are randomly changed. Also, the middle liver part has a problem to segregate the liver structure because of similar gray-level values of a pancreas in the abdomen. In this paper, an automatic liver segmentation method using a partial histogram threshold (PHT) algorithm is proposed for overcoming randomness of CE-CT images and removing the pancreas. After histogram transformation, adaptive multi-modal threshold is used to find the range of gray-level values of the liver structure. Also, the PHT algorithm is performed for removing the pancreas. Then, morphological filtering is processed for removing of unnecessary objects and smoothing of the boundary. Four CE-CT slices of eight patients were selected to evaluate the proposed method. As the average of normalized average area of the automatic segmented method II (ASM II) using the PHT and manual segmented method (MSM) are 0.1671 and 0.1711, these two method shows very small differences. Also, the average area error rate between the ASM II and MSM is 6.8339 %. From the results of experiments, the proposed method has similar performance as the MSM by medical Doctor.
Journal of the Korean Association of Geographic Information Studies
/
v.17
no.3
/
pp.20-38
/
2014
Vegetation phenology is the most important indicator of ecosystem response to climate change. Therefore it is necessary to continuously monitor forest phenology. This paper analyzes the phenological characteristics of forests in South Korea using the MODIS vegetation index with error from clouds or other sources removed using the HANTS algorithm. After using the HANTS algorithm to reduce the noise of the satellite-based vegetation index data, we were able to confirm that phenological transition dates varied strongly with altitudinal gradients. The dates of the start of the growing season, end of the growing season and the length of the growing season were estimated to vary by +0.71day/100m, -1.33day/100m and -2.04day/100m in needleleaf forests, +1.50day/100m, -1.54day/100m and -3.04day/100m in broadleaf forests, +1.39day/100m, -2.04day/100m and -3.43day/100m in mixed forests. We found a linear pattern of variation in response to altitudinal gradients that was related to air temperature. We also found that broadleaf forests are more sensitive to temperature changes compared to needleleaf forests.
The Transactions of the Korea Information Processing Society
/
v.4
no.1
/
pp.149-160
/
1997
This paper is concerned with the problem of speaker-adaptive speech synthes is method using a mapped codebook designed by fuzzy mapping on FLVQ (Fuzzy Learning Vector Quantization). The FLVQ is used to design both input and reference speaker's codebook. This algorithm is incorporated fuzzy membership function into the LVQ(learning vector quantization) networks. Unlike the LVQ algorithm, this algorithm minimizes the network output errors which are the differences of clas s membership target and actual membership values, and results to minimize the distances between training patterns and competing neurons. Speaker Adaptation in speech synthesis is performed as follow;input speaker's codebook is mapped a reference speaker's codebook in fuzzy concepts. The Fuzzy VQ mapping replaces a codevector preserving its fuzzy membership function. The codevector correspondence histogram is obtained by accumulating the vector correspondence along the DTW optimal path. We use the Fuzzy VQ mapping to design a mapped codebook. The mapped codebook is defined as a linear combination of reference speaker's vectors using each fuzzy histogram as a weighting function with membership values. In adaptive-speech synthesis stage, input speech is fuzzy vector-quantized by the mapped codcbook, and then FCM arithmetic is used to synthesize speech adapted to input speaker. The speaker adaption experiments are carried out using speech of males in their thirties as input speaker's speech, and a female in her twenties as reference speaker's speech. Speeches used in experiments are sentences /anyoung hasim nika/ and /good morning/. As a results of experiments, we obtained a synthesized speech adapted to input speaker.
Journal of the Korea Academia-Industrial cooperation Society
/
v.18
no.5
/
pp.99-110
/
2017
Improving tracking performance by estimating the status of multiple targets using radar is important. In a clutter environment, a joint event occurs between the track and measurement in multiple target tracking using a tracking filter. As the number increases, the joint event increases exponentially. The problem to be considered when multiple target tracking filter design in such environments is that first, the tracking filter minimizes the rate of false track alarmsby eliminating the false track and quickly confirming the target track. The purpose is to increase the FTD performance. The second consideration is to improve the track maintenance performance by allocating each measurement to a track efficiently when an event occurs. Through two considerations, a single target tracking data association technique is extended to a multiple target tracking filter, and representative algorithms are JIPDAF and LM-IPDAF. In this study, a probabilistic evaluation of many hypotheses in the assignment of measurements was not performed, so that the computation amount does not increase nonlinearly according to the number of measurements and tracks, and the track existence probability based on the track density The LM-IPDAF algorithm was introduced. This paper also proposes a method to reduce the computational complexity by improving the clutter density estimation method for calculating the track existence probability of LM-IPDAF. The performance was verified by a comparison with the existing algorithm through simulation. As a result, it was possible to reduce the simulation processing time by approximately 20% while achieving equivalent performance on the position RMSE and Confirmed True Track.
The advent of towed geo-electrical array surveying on water and land has resulted in datasets of magnitude approaching that of airborne electromagnetic surveying and most suited to 1D inversion. Robustness and complete automation is essential if processing and reliable interpretation of such data is to be viable. Sharp boundaries such as river beds and the top of saline aquifers must be resolved so use of smoothness constraints must be minimised. Suitable inversion algorithms must intelligently handle low signal-to-noise ratio data if conductive basement, that attenuates signal, is not to be misrepresented. A noise-level aware inversion algorithm that operates with one elastic thickness layer per electrode configuration has been coded. The noise-level aware inversion identifies if conductive basement has attenuated signal levels so that they are below noise level, and models conductive basement where appropriate. Layers in the initial models are distributed to span the effective depths of each of the geo-electric array quadrupoles. The algorithm works optimally on data collected using geo-electric arrays with an approximately exponential distribution of quadrupole effective depths. Inversion of data from arrays with linear electrodes, used to reduce contact resistance, and capacitive-line antennae is plausible. This paper demonstrates the effectiveness of the algorithm using theoretical examples and an example from a salt interception scheme on the Murray River, Australia.
Journal of the Korean Data and Information Science Society
/
v.27
no.3
/
pp.587-598
/
2016
In predicting an outcome of election using a variety of methods ahead of the election, non-response is one of the major issues. Therefore, to address the non-response issue, a variety of methods of non-response imputation may be employed, but the result of forecasting tend to vary according to methods. In this study, in order to improve electoral forecasts, we studied a model based method of non-response imputation attempting to apply the Monte Carlo Expectation Maximization (MCEM) algorithm, introduced by Wei and Tanner (1990). The MCEM algorithm using maximum likelihood estimates (MLEs) is applied to solve the boundary solution problem under the non-ignorable non-response mechanism. We performed the simulation studies to compare estimation performance among MCEM, maximum likelihood estimation, and Bayesian estimation method. The results of simulation studies showed that MCEM method can be a reasonable candidate for non-response model estimation. We also applied MCEM method to the Korean presidential election exit poll data of 2012 and investigated prediction performance using modified within precinct error (MWPE) criterion (Bautista et al., 2007).
Proceedings of the Korean Society of Medical Physics Conference
/
2002.09a
/
pp.119-120
/
2002
The aim is to urge the need of elaborate commissioning of 3D RTP system from the firsthand experience. A 3D RTP system requires so much data such as beam data and patient data. Most data of radiation beam are directly transferred from a 3D dose scanning system, and some other data are input by editing. In the process inputting parameters and/or data, no error should occur. For RTP system using algorithm-bas ed-on beam-modeling, careless beam-data processing could also cause the treatment error. Beam data of 3 different qualities of photon from two linear accelerators, patient data and calculated results were commissioned. For PDD, the doses by Clarkson, convolution, superposition and fast superposition methods at 10 cm for 10${\times}$10 cm field, 100 cm SSD were compared with the measured. An error in the SCD for one quality was input by the service engineer. Whole SCD defined by a physicist is SAD plus d$\sub$max/, the value was just SAD. That resulted in increase of MU by 100${\times}$((1_d$\sub$max//SAD)$^2$-1)%. For 10${\times}$10 cm open field, 1 m SSD and at 10 cm depth in uniform medium of relative electron density (RED) 1, PDDs for 4 algorithms of dose calculation, Clarkson, convolution, superposition and fast-superposition, were compared with the measured. The calculated PDD were similar to the measured. For 10${\times}$10 cm open field, 1 m SSD and at 10 cm depth with 5 cm thick inhomogeneity of RED 0.2 under 2 cm thick RED 1 medium, PDDs for 4 algorithms were compared. PDDs ranged from 72.2% to 77.0% for 4 MV X-ray and from 90.9% to 95.6% for 6 MV X-ray. PDDs were of maximum for convolution and of minimum for superposition. For 15${\times}$15 cm symmetric wedged field, wedge factor was not constant for calculation mode, even though same geometry. The reason is that their wedge factor is considering beam hardness and ray path. Their definition requires their users to change the concept of wedge factor. RTP user should elaborately review beam data and calculation algorithm in commissioning.
Journal of the Korean Data and Information Science Society
/
v.28
no.6
/
pp.1229-1244
/
2017
In recent years, as demand for data-based analytical methodologies increases in various fields, optimization methods have been developed to handle them. In particular, various constraints required for problems in statistics and machine learning can be solved by convex optimization. Alternating direction method of multipliers (ADMM) can effectively deal with linear constraints, and it can be effectively used as a parallel optimization algorithm. ADMM is an approximation algorithm that solves complex original problems by dividing and combining the partial problems that are easier to optimize than original problems. It is useful for optimizing non-smooth or composite objective functions. It is widely used in statistical and machine learning because it can systematically construct algorithms based on dual theory and proximal operator. In this paper, we will examine applications of ADMM algorithm in various fields related to statistics, and focus on two major points: (1) splitting strategy of objective function, and (2) role of the proximal operator in explaining the Lagrangian method and its dual problem. In this case, we introduce methodologies that utilize regularization. Simulation results are presented to demonstrate effectiveness of the lasso.
Proceedings of the Korea Water Resources Association Conference
/
2011.05a
/
pp.185-185
/
2011
Mapping of artificial levee lines, one of major tasks in river zone mapping, is critical to prevention of river flood, protection of environments and eco systems in river zones. Thus, mapping of artificial levee lines is essential for management and development of river zones. Coastal mapping including river zone mapping has been historically carried out using surveying technologies. Photogrammetry, one of the surveying technologies, is recently used technology for national river zone mapping in Korea. Airborne laser scanning has been used in most advanced countries for coastal mapping due to its ability to penetrate shallow water and its high vertical accuracy. Due to these advantages, use of LiDAR data in coastal mapping is efficient for monitoring and predicting significant topographic change in river zones. This paper introduces a method for construction of a 3D artificial levee line using a set of LiDAR points that uses normal vectors. Multiple steps are involved in this method. First, a 2.5-dimensional Delaunay triangle mesh is generated based on three nearest-neighbor points in the LiDAR data. Second, a median filtering is applied to minimize noise. Third, edge selection algorithms are applied to extract break edges from a Delaunay triangle mesh using two normal vectors. In this research, two methods for edge selection algorithms using hypothesis testing are used to extract break edges. Fourth, intersection edges which are extracted using both methods at the same range are selected as the intersection edge group. Fifth, among intersection edge group, some linear feature edges which are not suitable to compose a levee line are removed as much as possible considering vertical distance, slope and connectivity of an edge. Sixth, with all line segments which are suitable to constitute a levee line, one river levee line segment is connected to another river levee line segment with the end points of both river levee line segments located nearest horizontally and vertically to each other. After linkage of all the river levee line segments, the initial river levee line is generated. Since the initial river levee line consists of the LiDAR points, the pattern of the initial river levee line is being zigzag along the river levee. Thus, for the last step, a algorithm for smoothing the initial river levee line is applied to fit the initial river levee line into the reference line, and the final 3D river levee line is constructed. After the algorithm is completed, the proposed algorithm is applied to construct the 3D river levee line in Zng-San levee nearby Ham-Ahn Bo in Nak-Dong river. Statistical results show that the constructed river levee line generated using a proposed method has high accuracy in comparison to the ground truth. This paper shows that use of LiDAR data for construction of the 3D river levee line for river zone mapping is useful and efficient; and, as a result, it can be replaced with ground surveying method for construction of the 3D river levee line.
Journal of Korean Society for Geospatial Information Science
/
v.24
no.1
/
pp.35-41
/
2016
GNSS/Geoid positioning technology allows orthometric height determination using both the geoidal height calculated from geoid model and the ellipsoidal height achieved by GNSS survey. In this study, Network-RTK surveying was performed through the Benchmarks in the study area to analyze the possibility of height positioning of the Network-RTK. And the orthometric heights were calculated by applying the Korean national geoid model KNGeoid13 according to the condition of with site calibration and without site calibration and the results were compared. Simplex algorithm was adopted for liner programming in this study and the heights of all Benchmarks were calculated in both case of applying site calibration and does not applying site calibration. The results were compared to Benchmark official height of the National Geographic Information Institute. The results showed that the average value of the height difference was 0.060m, and the standard deviation was 0.072m in Network-RTK without site calibration and the average value of the height difference was 0.040m, and the standard deviation was 0.047m in Network-RTK with the application of the site calibration. With linearization method to obtain the optimal solution for observations it showed that the height determination within 0.033m was available in GNSS Network-RTK positioning.
본 웹사이트에 게시된 이메일 주소가 전자우편 수집 프로그램이나
그 밖의 기술적 장치를 이용하여 무단으로 수집되는 것을 거부하며,
이를 위반시 정보통신망법에 의해 형사 처벌됨을 유념하시기 바랍니다.
[게시일 2004년 10월 1일]
이용약관
제 1 장 총칙
제 1 조 (목적)
이 이용약관은 KoreaScience 홈페이지(이하 “당 사이트”)에서 제공하는 인터넷 서비스(이하 '서비스')의 가입조건 및 이용에 관한 제반 사항과 기타 필요한 사항을 구체적으로 규정함을 목적으로 합니다.
제 2 조 (용어의 정의)
① "이용자"라 함은 당 사이트에 접속하여 이 약관에 따라 당 사이트가 제공하는 서비스를 받는 회원 및 비회원을
말합니다.
② "회원"이라 함은 서비스를 이용하기 위하여 당 사이트에 개인정보를 제공하여 아이디(ID)와 비밀번호를 부여
받은 자를 말합니다.
③ "회원 아이디(ID)"라 함은 회원의 식별 및 서비스 이용을 위하여 자신이 선정한 문자 및 숫자의 조합을
말합니다.
④ "비밀번호(패스워드)"라 함은 회원이 자신의 비밀보호를 위하여 선정한 문자 및 숫자의 조합을 말합니다.
제 3 조 (이용약관의 효력 및 변경)
① 이 약관은 당 사이트에 게시하거나 기타의 방법으로 회원에게 공지함으로써 효력이 발생합니다.
② 당 사이트는 이 약관을 개정할 경우에 적용일자 및 개정사유를 명시하여 현행 약관과 함께 당 사이트의
초기화면에 그 적용일자 7일 이전부터 적용일자 전일까지 공지합니다. 다만, 회원에게 불리하게 약관내용을
변경하는 경우에는 최소한 30일 이상의 사전 유예기간을 두고 공지합니다. 이 경우 당 사이트는 개정 전
내용과 개정 후 내용을 명확하게 비교하여 이용자가 알기 쉽도록 표시합니다.
제 4 조(약관 외 준칙)
① 이 약관은 당 사이트가 제공하는 서비스에 관한 이용안내와 함께 적용됩니다.
② 이 약관에 명시되지 아니한 사항은 관계법령의 규정이 적용됩니다.
제 2 장 이용계약의 체결
제 5 조 (이용계약의 성립 등)
① 이용계약은 이용고객이 당 사이트가 정한 약관에 「동의합니다」를 선택하고, 당 사이트가 정한
온라인신청양식을 작성하여 서비스 이용을 신청한 후, 당 사이트가 이를 승낙함으로써 성립합니다.
② 제1항의 승낙은 당 사이트가 제공하는 과학기술정보검색, 맞춤정보, 서지정보 등 다른 서비스의 이용승낙을
포함합니다.
제 6 조 (회원가입)
서비스를 이용하고자 하는 고객은 당 사이트에서 정한 회원가입양식에 개인정보를 기재하여 가입을 하여야 합니다.
제 7 조 (개인정보의 보호 및 사용)
당 사이트는 관계법령이 정하는 바에 따라 회원 등록정보를 포함한 회원의 개인정보를 보호하기 위해 노력합니다. 회원 개인정보의 보호 및 사용에 대해서는 관련법령 및 당 사이트의 개인정보 보호정책이 적용됩니다.
제 8 조 (이용 신청의 승낙과 제한)
① 당 사이트는 제6조의 규정에 의한 이용신청고객에 대하여 서비스 이용을 승낙합니다.
② 당 사이트는 아래사항에 해당하는 경우에 대해서 승낙하지 아니 합니다.
- 이용계약 신청서의 내용을 허위로 기재한 경우
- 기타 규정한 제반사항을 위반하며 신청하는 경우
제 9 조 (회원 ID 부여 및 변경 등)
① 당 사이트는 이용고객에 대하여 약관에 정하는 바에 따라 자신이 선정한 회원 ID를 부여합니다.
② 회원 ID는 원칙적으로 변경이 불가하며 부득이한 사유로 인하여 변경 하고자 하는 경우에는 해당 ID를
해지하고 재가입해야 합니다.
③ 기타 회원 개인정보 관리 및 변경 등에 관한 사항은 서비스별 안내에 정하는 바에 의합니다.
제 3 장 계약 당사자의 의무
제 10 조 (KISTI의 의무)
① 당 사이트는 이용고객이 희망한 서비스 제공 개시일에 특별한 사정이 없는 한 서비스를 이용할 수 있도록
하여야 합니다.
② 당 사이트는 개인정보 보호를 위해 보안시스템을 구축하며 개인정보 보호정책을 공시하고 준수합니다.
③ 당 사이트는 회원으로부터 제기되는 의견이나 불만이 정당하다고 객관적으로 인정될 경우에는 적절한 절차를
거쳐 즉시 처리하여야 합니다. 다만, 즉시 처리가 곤란한 경우는 회원에게 그 사유와 처리일정을 통보하여야
합니다.
제 11 조 (회원의 의무)
① 이용자는 회원가입 신청 또는 회원정보 변경 시 실명으로 모든 사항을 사실에 근거하여 작성하여야 하며,
허위 또는 타인의 정보를 등록할 경우 일체의 권리를 주장할 수 없습니다.
② 당 사이트가 관계법령 및 개인정보 보호정책에 의거하여 그 책임을 지는 경우를 제외하고 회원에게 부여된
ID의 비밀번호 관리소홀, 부정사용에 의하여 발생하는 모든 결과에 대한 책임은 회원에게 있습니다.
③ 회원은 당 사이트 및 제 3자의 지적 재산권을 침해해서는 안 됩니다.
제 4 장 서비스의 이용
제 12 조 (서비스 이용 시간)
① 서비스 이용은 당 사이트의 업무상 또는 기술상 특별한 지장이 없는 한 연중무휴, 1일 24시간 운영을
원칙으로 합니다. 단, 당 사이트는 시스템 정기점검, 증설 및 교체를 위해 당 사이트가 정한 날이나 시간에
서비스를 일시 중단할 수 있으며, 예정되어 있는 작업으로 인한 서비스 일시중단은 당 사이트 홈페이지를
통해 사전에 공지합니다.
② 당 사이트는 서비스를 특정범위로 분할하여 각 범위별로 이용가능시간을 별도로 지정할 수 있습니다. 다만
이 경우 그 내용을 공지합니다.
제 13 조 (홈페이지 저작권)
① NDSL에서 제공하는 모든 저작물의 저작권은 원저작자에게 있으며, KISTI는 복제/배포/전송권을 확보하고
있습니다.
② NDSL에서 제공하는 콘텐츠를 상업적 및 기타 영리목적으로 복제/배포/전송할 경우 사전에 KISTI의 허락을
받아야 합니다.
③ NDSL에서 제공하는 콘텐츠를 보도, 비평, 교육, 연구 등을 위하여 정당한 범위 안에서 공정한 관행에
합치되게 인용할 수 있습니다.
④ NDSL에서 제공하는 콘텐츠를 무단 복제, 전송, 배포 기타 저작권법에 위반되는 방법으로 이용할 경우
저작권법 제136조에 따라 5년 이하의 징역 또는 5천만 원 이하의 벌금에 처해질 수 있습니다.
제 14 조 (유료서비스)
① 당 사이트 및 협력기관이 정한 유료서비스(원문복사 등)는 별도로 정해진 바에 따르며, 변경사항은 시행 전에
당 사이트 홈페이지를 통하여 회원에게 공지합니다.
② 유료서비스를 이용하려는 회원은 정해진 요금체계에 따라 요금을 납부해야 합니다.
제 5 장 계약 해지 및 이용 제한
제 15 조 (계약 해지)
회원이 이용계약을 해지하고자 하는 때에는 [가입해지] 메뉴를 이용해 직접 해지해야 합니다.
제 16 조 (서비스 이용제한)
① 당 사이트는 회원이 서비스 이용내용에 있어서 본 약관 제 11조 내용을 위반하거나, 다음 각 호에 해당하는
경우 서비스 이용을 제한할 수 있습니다.
- 2년 이상 서비스를 이용한 적이 없는 경우
- 기타 정상적인 서비스 운영에 방해가 될 경우
② 상기 이용제한 규정에 따라 서비스를 이용하는 회원에게 서비스 이용에 대하여 별도 공지 없이 서비스 이용의
일시정지, 이용계약 해지 할 수 있습니다.
제 17 조 (전자우편주소 수집 금지)
회원은 전자우편주소 추출기 등을 이용하여 전자우편주소를 수집 또는 제3자에게 제공할 수 없습니다.
제 6 장 손해배상 및 기타사항
제 18 조 (손해배상)
당 사이트는 무료로 제공되는 서비스와 관련하여 회원에게 어떠한 손해가 발생하더라도 당 사이트가 고의 또는 과실로 인한 손해발생을 제외하고는 이에 대하여 책임을 부담하지 아니합니다.
제 19 조 (관할 법원)
서비스 이용으로 발생한 분쟁에 대해 소송이 제기되는 경우 민사 소송법상의 관할 법원에 제기합니다.
[부 칙]
1. (시행일) 이 약관은 2016년 9월 5일부터 적용되며, 종전 약관은 본 약관으로 대체되며, 개정된 약관의 적용일 이전 가입자도 개정된 약관의 적용을 받습니다.