Park, Hyeongjun;Son, Jong-Hwan;Shin, Jung-Il;Kweon, Ki-Eok;Kim, Taejung
Korean Journal of Remote Sensing
/
v.35
no.6_1
/
pp.907-917
/
2019
Recently, the demand for high-resolution satellite images increases in many fields such as land monitoring and terrain analysis. Therefore, the need for geometric correction is increasing. As an automatic precision geometric correction method, there is a method of automatically extracting the GCP by matching between the GCP Chip and the satellite image. For automatic precision geometric correction, the success rate of matching GCP Chip and satellite image is important. Therefore, it is important to evaluate the matching performance of the manufactured GCP Chip. In order to evaluate the matching performance of GCP Chips, a total of 3,812 GCP Chips in South Korea were used as experimental data. The GCP Chip matching results of KOMPSAT-3A and Google Map showed similar matching results. Therefore, we determined that Google Map satellite imagery could replace high-resolution satellite imagery. Also, presented a method using center point and error radius of Google Map to reduce the time required to verify matching performance. As a result, it is best to set the optimum error radius to 8.5m. Evaluated the matching performance of GCP Chips in South Korea using Google Maps. And verified matching result using presented method. As a result, the GCP Chip s in South Korea had a matching success rate of about 94%. Also, the main matching failure factors were analyzed by matching failure GCP Chips. As a result, Except for GCP Chips that need to be remanufactured, the remaining GCP Chips can be used for the automatic geometric correction of satellite images.
In this study, the target detection using both high-resolution satellite SAR and Elecro-Optical (EO) images such as TerraSAR-X and WorldView-2 is performed, considering the characteristics of targets. The targets of our interest are featured by being stationary and appearing as cluster targets. After the target detection of SAR image by using Constant False Alarm Rate (CFAR) algorithm, a series of processes is performed in order to reduce false alarms, including pixel clustering, network clustering and coherence analysis. We extend further our algorithm by adopting the fast and effective ellipse detection in EO image using randomized hough transform, which is significantly reducing the number of false alarms. The performance of proposed algorithm has been tested and analyzed on TerraSAR-X SAR and WordView-2 EO images. As a result, the average false alarm for group of targets is 1.8 groups/$64km^2$ and the false alarms of single target range from 0.03 to 0.3 targets/$km^2$. The results show that groups of targets are successfully identified with very low false alarms.
We analyzed the feasibility of detecting wave gliders moving on the sea surface using SAR images. For the experiment, a model was constructed and placed on the sea using a towing ship before and after the satellite observation time. In the acquisition of KOMPSAT-5 image, high resolution SAR data of spotlight mode was collected considering the small size of wave glider. As a result of the backscattering intensity analysis around the towing ship along with wave glider, several scattering points away from the ship were observed, which are not strong but clearly distinguished from the surrounding clutter values. Considering the distance from the center of the ship, it seems to be a signal by the wave glider. On the other hand, it is confirmed that the wave glider can be detected even at the very low false alarm rate ($10^{-6}$) of the target detection using CFAR. Although the scatter signal by the wave glider could be distinguished from the surrounding ocean clutter in the high resolution SAR image, further research is needed to determine if actual wave gliders are detected in various marine environments.
Purpose: Damage to pulse crops by wild birds is a serious problem. The damage is to such an extent that the rate of damage during the period between seeding and cotyledon stages reaches 54.6% on an average. In this study, a crop-position detection method was developed wherein infrared (IR) sensors were used to determine the cotyledon position under a vinyl mulch. Methods: IR sensors that helped measure the temperature were used to locate the cotyledons below the vinyl mulch. A single IR sensor module was installed at three locations of the crops (peanut, red lettuce, and crown daisy) in the cotyledon stage. The representative thermal response of a $16{\times}4$ pixel area was detected using this sensor in the case where the distance from the target was 25 cm. A spatial image was applied to the two-dimensional temperature distribution using a non-integral moving-average method. The collected data were first processed by taking the moving average via interpolation to determine the frame where the variance was the lowest for a resolution unit of 1.02 cm. Results: The temperature distribution was plotted corresponding to a distance of 10 cm between the crops. A clear leaf pattern of the crop was visually confirmed. However, the temperature distribution after the normalization was unclear. The image conversion and frequency-conversion graphs were obtained based on the moving average by averaging the points corresponding to a frequency of 40 Hz for 8 pixels. The most optimized resolutions at locations 1, 2, and 3 were found on 3.4, 4.1, and 5.6 Pixels, respectively. Conclusions: In this study, to solve the problem of damage caused by birds to crops in the cotyledon stage after seeding, the vinyl mulch is punched after seeding. The crops in the cotyledon stage could be accurately located using the proposed method. By conducting the experiments using the single IR sensor and a sliding mechanical device with the help of a non-integral interpolation method, the crops in the cotyledon stage could be precisely located.
Park, Ji-Hun;Jang, Yung-Dae;Lee, Dong-Hun;Lee, Jong-Kwan;Ham, Mi-Ok
The KIPS Transactions:PartB
/
v.14B
no.3
s.113
/
pp.171-182
/
2007
We propose a simple method for tracking a nonparameterized subject contour in a single video stream with a moving camera and changing background. Then we present a method to eliminate the tracked contour object by replacing with the background scene we get from other frame. First we track the object using LOD (Level-of-Detail) canny edge maps, then we generate background of each image frame and replace the tracked object in a scene by a background image from other frame that is not occluded by the tracked object. Our tracking method is based on level-of-detail (LOD) modified Canny edge maps and graph-based routing operations on the LOD maps. We get more edge pixels along LOD hierarchy. Our accurate tracking is based on reducing effects from irrelevant edges by selecting the stronger edge pixels, thereby relying on the current frame edge pixel as much as possible. The first frame background scene is determined by camera motion, camera movement between two image frames, and other background scenes are computed from the previous background scenes. The computed background scenes are used to eliminate the tracked object from the scene. In order to remove the tracked object, we generate approximated background for the first frame. Background images for subsequent frames are based on the first frame background or previous frame images. This approach is based on computing camera motion. Our experimental results show that our method works nice for moderate camera movement with small object shape changes.
In this paper, we propose a novel noiseless method of BRDF rendering on a GPU in real-time. Illumination at a surface point is formulated as an integral of BRDF producted with incident radiance over the hemi-sphere domain. The most popular method to compute the integral is the Monte Carlo method, which needs a large number of samples to achieve good image quality. But, it leads to increase of rendering time. Otherwise, a small number of sample points cause serious image noise. The main contribution of our work is a new importance sampling scheme producing a set of incoming ray samples varying continuously with respect to the eye ray. An incoming ray is importance-based sampled at different latitude angles of the eye ray, and then the ray samples are linearly connected to form a curve, called a thread. These threads give continuously moving incident rays for eye ray change, so they do not make image noise. Since even a small number of threads can achieve a plausible quality and also can be precomputed before rendering, they enable real-time BRDF rendering on the GPU.
Journal of the Korean Institute of Intelligent Systems
/
v.12
no.3
/
pp.210-218
/
2002
This paper proposes an efficient separation method of the composite images by using independent component analysis(ICA) based on neural networks of the approximate learning algorithm. The Proposed learning algorithm is the fixed point(FP) algorithm based on Secant method which can be approximately computed by only the values of function for estimating the root of objective function for optimizing entropy. The secant method is an alternative of the Newton method which is essential to differentiate the function for estimating the root. It can achieve a superior property of the FP algorithm for ICA due to simplify the composite computation of differential process. The proposed algorithm has been applied to the composite signals and image generated by random mixing matrix in the 4 signal of 500-sample and the 10 images of $512{\times}512-pixel$, respectively The simulation results show that the proposed algorithm has better performance of the learning speed and the separation than those using the conventional algorithm based method. It also solved the training performances depending on initial points setting and the nonrealistic learning time for separating the large size image by using the conventional algorithm.
In remote sensing, images are acquired over the same area by sensors of different spectral ranges (from the visible to the microwave) and/or with different number, position, and width of spectral bands. These images are generally partially redundant, as they represent the same scene, and partially complementary. For many applications of image classification, the information provided by a single sensor is often incomplete or imprecise resulting in misclassification. Fusion with redundant data can draw more consistent inferences for the interpretation of the scene, and can then improve classification accuracy. The common approach to the classification of multisensor data as a data fusion scheme at pixel level is to concatenate the data into one vector as if they were measurements from a single sensor. The multiband data acquired by a single multispectral sensor or by two or more different sensors are not completely independent, and a certain degree of informative overlap may exist between the observation spaces of the different bands. This dependence may make the data less informative and should be properly modeled in the analysis so that its effect can be eliminated. For modeling and eliminating the effect of such dependence, this study employs a strategy using self and conditional information variation measures. The self information variation reflects the self certainty of the individual bands, while the conditional information variation reflects the degree of dependence of the different bands. One data set might be very less reliable than others in the analysis and even exacerbate the classification results. The unreliable data set should be excluded in the analysis. To account for this, the self information variation is utilized to measure the degrees of reliability. The team of positively dependent bands can gather more information jointly than the team of independent ones. But, when bands are negatively dependent, the combined analysis of these bands may give worse information. Using the conditional information variation measure, the multiband data are split into two or more subsets according the dependence between the bands. Each subsets are classified separately, and a data fusion scheme at decision level is applied to integrate the individual classification results. In this study. a two-level algorithm using hierarchical clustering procedure is used for unsupervised image classification. Hierarchical clustering algorithm is based on similarity measures between all pairs of candidates being considered for merging. In the first level, the image is partitioned as any number of regions which are sets of spatially contiguous pixels so that no union of adjacent regions is statistically uniform. The regions resulted from the low level are clustered into a parsimonious number of groups according to their statistical characteristics. The algorithm has been applied to satellite multispectral data and airbone SAR data.
Kim, Hyun-ho;Seo, Doochun;Jung, JaeHeon;Kim, Yongwoo
Korean Journal of Remote Sensing
/
v.37
no.5_1
/
pp.1013-1027
/
2021
Images taken with KOMPSAT-3 have additional NIR and PAN bands, as well as RGB regions of the visible ray band, compared to imagestaken with a standard camera. Furthermore, electrical and optical properties must be considered because a wide radius area of approximately 17 km or more is photographed at an altitude of 685 km above the ground. In other words, the camera sensor of KOMPSAT-3 is distorted by each CCD pixel, characteristics of each band,sensitivity and time-dependent change, CCD geometry. In order to solve the distortion, correction of the sensors is essential. In this paper, we propose a method for detecting uniform regions in side-slider-based KOMPSAT-3 images using segment-based noise analysis. After detecting a uniform area with the corresponding algorithm, a correction table was created for each sensor to apply the non-uniformity correction algorithm, and satellite image correction was performed using the created correction table. As a result, the proposed method reduced the distortion of the satellite image,such as vertical noise, compared to the conventional method. The relative radiation accuracy index, which is an index based on mean square error (RA) and an index based on absolute error (RE), wasfound to have a comparative advantage of 0.3 percent and 0.15 percent, respectively, over the conventional method.
Kim, Jin Kyem;Yoon, Haesung;Lee, Mi-Jung;Kim, Myung-Joon;Han, Kyunghwa;Koh, Hong;Kim, Seung;Han, Seok Joo;Shin, Hyun Joo
Investigative Magnetic Resonance Imaging
/
v.23
no.3
/
pp.251-258
/
2019
Purpose: To assess the feasibility of the use of spin-echo echo-planar imaging (SE-EPI) magnetic resonance elastography (MRE) in livers of children and young adults. Materials and Methods: Patients (${\leq}20$ years old) who underwent 3T SE-EPI MRE were included retrospectively. Subjects were divided into three groups according to the purpose of the liver MRI: suspicion of fatty liver or focal fat deposition in the liver (FAT group), liver fibrosis after receiving a Kasai operation from biliary atresia (BA group), and hepatic iron deposition after receiving chemotherapy or transfusions (IRON group). Technical failure of MRE was defined when a stiffness map showed no pixel value with a confidence index higher than 95%, and the patients were divided as success and failure groups accordingly. Clinical findings including age, gender, weight, height, and body mass index and magnetic resonance imaging results including proton density fat fraction (PDFF), $T2^*$, and MRE values were assessed. Factors affecting failure of MRE were evaluated and the image quality in wave propagation image and stiffness map was evaluated using the appropriate scores. Results: Among total 240 patients (median 15 years, 211 patients in the FAT, 21 patients in the BA, and 8 patients in the IRON groups), technical failure was noted in six patients in the IRON group (6/8 patients, 75%), while there were no failures noted in the FAT and BA groups. These six patients had $T2^*$ values ranging from 0.9 to 3.8 ms. The image quality scores were not significantly different between the FAT and BA groups (P > 0.999), while the scores were significantly lower in the IRON group (P < 0.001). Conclusion: The 3T SE-EPI MRE in children and young adults had a high technical success rate. The technical failure was occurred in children with decreased $T2^*$ value (${\leq}3.8ms$) from iron deposition.
본 웹사이트에 게시된 이메일 주소가 전자우편 수집 프로그램이나
그 밖의 기술적 장치를 이용하여 무단으로 수집되는 것을 거부하며,
이를 위반시 정보통신망법에 의해 형사 처벌됨을 유념하시기 바랍니다.
[게시일 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일부터 적용되며, 종전 약관은 본 약관으로 대체되며, 개정된 약관의 적용일 이전 가입자도 개정된 약관의 적용을 받습니다.