• Title/Summary/Keyword: Image pixel

Search Result 2,503, Processing Time 0.03 seconds

Estimation of spatial evapotranspiration using Terra MODIS satellite image and SEBAL model in mixed forest and rice paddy area (SEBAL 모형과 Terra MODIS 영상을 이용한 혼효림, 논 지역에서의 공간증발산량 산정 연구)

  • Lee, Yong Gwan;Jung, Chung Gil;Ahn, So Ra;Kim, Seong Joon
    • Journal of Korea Water Resources Association
    • /
    • v.49 no.3
    • /
    • pp.227-239
    • /
    • 2016
  • This study is to estimate Surface Energy Balance Algorithm for Land (SEBAL) daily spatial evapotranspiration (ET) comparing with eddy covariance flux tower ET in Seolmacheon mixed forest (SMK) and Cheongmicheon rice paddy (CFK). The SEBAL input data of Albedo, Land Surface Temperature (LST), Normalized Difference Vegetation Index (NDVI) from Terra MODIS products and the meteorological data of wind speed, and solar radiation were prepared for 2 years (2012-2013). For the annual average flux tower ET of 302.8 mm in SMK and 482.0 mm in CFK, the SEBAL ETs were 183.3 mm and 371.5 mm respectively. The determination coefficients ($R^2$) of SEBAL ET versus flux tower ET for total periods were 0.54 in SMK and 0.79 in CFK respectively. The main reason of SEBAL ET underestimation for both sites was from the determination of hot pixel and cold pixel of the day and affected to the overestimation of sensible heat flux.

Motion Estimation Skipping Technique for Fast Motion Estimation (고속 움직임 추정을 위한 움직임 추정 생략 기법)

  • 강현수;박성모
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.7C
    • /
    • pp.726-732
    • /
    • 2003
  • The paper proposes a motion estimation (ME) technique to reduce computational complexity. It is achieved by skipping ME process for macro-blocks decided to be in no need of the operation. Thus, it is called ME skipping technique(MEST). In general, the ME is composed of integer pixel precision ME (IME) followed by half pixel precision ME (HME). The MEST is performed just before an IME process and makes a decision on skipping the IME process according to a criterion based on ME errors of adjacent macro-blocks (MBs) already encoded. When the IME process for a MB is decided to be skipped, which is called ME skip mode, the IME process is skipped and the integer pixel precision motion vector of the MB is just replaced by a predicted vector and used as the input of HME. On the other hands, the IME processes for MBs in ME non-skip mode are not skipped but normally performed. Accordingly, the MEST is very effective to reduce computational complexity when MBs in ME skip mode is abundant. In addition, when the MEST is applied to video encoder, it contributes to more accurate rate control and more robusaess for channel errors. It is experimentally shown that the MEST has the above advantages while maintaining good reconstructed image quality.

Design of Gamma Camera with Diverging Collimator for Spatial Resolution Improvement (공간분해능 향상을 위한 확산형 콜리메이터 기반의 감마카메라 설계)

  • Lee, Seung-Jae;Jang, Yeongill;Baek, Cheol-Ha
    • Journal of the Korean Society of Radiology
    • /
    • v.13 no.4
    • /
    • pp.661-666
    • /
    • 2019
  • Diverging collimators is used to obtain reduced images of an object, or to detect a wide filed-of-view (FOV) using a small gamma camera. In the gamma camera using the diverging collimators, the block scintillator, and the pixel scintillator array, gamma rays are obliquely incident on the scintillator surface when the source is located the periphery of the FOV. Therefore, the spatial resolution is reduced because it is obliquely detected in depth direction. In this study, we designed a novel system to improve the spatial resolution in the periphery of the FOV. Using a tapered crystal array to configure the scintillation pixels to coincide with the angle of the collimator's hole allows imaging to one scintillation pixel location, even if events occur to different depths. That is, even if is detected at various points in the diagonal direction, the gamma rays interact with one crystal pixel, so resolution does not degrade. The resolution of the block scintillator and the tapered crystal array was compared and evaluated through Geant4 Application for Tomographic Emission (GATE) simulation. The spatial resolution of the obtained image was 4.05 mm in the block scintillator and 2.97 mm in the tapered crystal array. There was a 26.67% spatial resolution improvement in the tapered crystal array compared to the block scintillation.

Analysis of Geolocation Accuracy of Precision Image Processing System developed for CAS-500 (국토관측위성용 정밀영상생성시스템의 위치정확도 분석)

  • Lee, Yoojin;Park, Hyeongjun;Kim, Hye-Sung;Kim, Taejung
    • Korean Journal of Remote Sensing
    • /
    • v.36 no.5_2
    • /
    • pp.893-906
    • /
    • 2020
  • This paper reports on the analysis of the location accuracy of a precision image generation system manufactured for CAS 500. The planned launch date of the CAS 500 is 2021, and since it has not yet been launched, the analysis was performed using KOMPSAT-3A satellite images having similar specifications to the CAS 500. In this paper, we have checked the geolocation accuracy of initial sensor model, the model point geolocation accuracy of the precise sensor model, the geolocation accuracy of the precise sensor model using the check point, and the geolocation accuracy of the precise orthoimage using 30 images of the Korean Peninsula. In this study, the target geolocation accuracy is to have an RMSE within 2 pixels when an accurate ground control point is secured. As a result, it was confirmed that the geolocation accuracy of the precision sensor model using the checkpoint was about 1.85 pixels in South Korea and about 2.04 pixels in North Korea, and the geolocation accuracy of the precise orthoimage was about 1.15 m in South Korea and about 3.23 m in North Korea. Overall, it was confirmed that the accuracy of North Korea was low compared to that of South Korea, and this was confirmed to have affected the measured accuracy because the GCP (Ground Control Point) quality of the North Korea images was poor compared to that of South Korea. In addition, it was confirmed that the accuracy of the precision orthoimage was slightly lower than that of precision sensor medel, especially in North Korea. It was judged that this occurred from the error of the DTM (Digital Terrain Model) used for orthogonal correction. In addition to the causes suggested by this paper, additional studies should be conducted on factors that may affect the position accuracy.

Opticla Angle Sensor Using Pseudorandom-code And Geometry-code (슈도 랜덤 코드와 기하학 코드를 이용한 광학적 Angle Sensor)

  • 김희성;도규봉
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.41 no.2
    • /
    • pp.27-32
    • /
    • 2004
  • Absolute optical angle sensor is described that is an essentially digital opto-electronic device. Its purpose is to resolve the relative and absolute angle position of coded disk using Pseudorandom-code and Geometry-code. In this technique, the angular position of disk is determined in coarse sense first by Pseudorandom-code. A further fine angular position data based on Pixel count is obtained by Geometry-code which result 0.006$^{\circ}$ resolution of the system provided that 7 ${\mu}{\textrm}{m}$ line image sensor are used. The proposed technique is novel in a number of aspects, such that it has the non-contact reflective nature, high resolution of the system, relatively simple code pattern, and inherent digital nature of the sensor. And what is more the system can be easily modified to torque sensor by applying two coded disks in a manner that observe the difference in absolute angular displacement. The digital opto-electronic nature of the proposed sensor, along with its reporting of both torque and angle, makes the system ideal for use in intelligent vehicle systems. In this communication, we propose a technique that utilizes Pseudorandom-code and Geometry-code to determine accurate angular position of coded disk. We present the experimental results to demonstrate the validity of the idea.

Parallel Processing of k-Means Clustering Algorithm for Unsupervised Classification of Large Satellite Images: A Hybrid Method Using Multicores and a PC-Cluster (대용량 위성영상의 무감독 분류를 위한 k-Means Clustering 알고리즘의 병렬처리: 다중코어와 PC-Cluster를 이용한 Hybrid 방식)

  • Han, Soohee;Song, Jeong Heon
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.37 no.6
    • /
    • pp.445-452
    • /
    • 2019
  • In this study, parallel processing codes of k-means clustering algorithm were developed and implemented in a PC-cluster for unsupervised classification of large satellite images. We implemented intra-node code using multicores of CPU (Central Processing Unit) based on OpenMP (Open Multi-Processing), inter-nodes code using a PC-cluster based on message passing interface, and hybrid code using both. The PC-cluster consists of one master node and eight slave nodes, and each node is equipped with eight multicores. Two operating systems, Microsoft Windows and Canonical Ubuntu, were installed in the PC-cluster in turn and tested to compare parallel processing performance. Two multispectral satellite images were tested, which are a medium-capacity LANDSAT 8 OLI (Operational Land Imager) image and a high-capacity Sentinel 2A image. To evaluate the performance of parallel processing, speedup and efficiency were measured. Overall, the speedup was over N / 2 and the efficiency was over 0.5. From the comparison of the two operating systems, the Ubuntu system showed two to three times faster performance. To confirm that the results of the sequential and parallel processing coincide with the other, the center value of each band and the number of classified pixels were compared, and result images were examined by pixel to pixel comparison. It was found that care should be taken to avoid false sharing of OpenMP in intra-node implementation. To process large satellite images in a PC-cluster, code and hardware should be designed to reduce performance degradation caused by file I / O. Also, it was found that performance can differ depending on the operating system installed in a PC-cluster.

The Comparison of Motion Correction Methods in Myocardial Perfusion SPECT (심근관류 SPECT에서 움직임 보정 방법들의 비교)

  • Park, Jang-Won;Nam, Ki-Pyo;Lee, Hoon-Dong;Kim, Sung-Hwan
    • The Korean Journal of Nuclear Medicine Technology
    • /
    • v.18 no.2
    • /
    • pp.28-32
    • /
    • 2014
  • Purpose Patient motion during myocardial perfusion SPECT can produce images that show visual artifacts and perfusion defects. This artifacts and defects remain a significant source of unsatisfactory myocardial perfusion SPECT. Motion correction has been developed as a way to correct and detect the patient motion for reducing artifacts and defects, and each motion correction uses different algorithm. We corrected simulated motion patterns with several motion correction methods and compared those images. Materials and Methods Phantom study was performed. The anthropomorphic torso phantom was made with equal counts from patient's body and simulated defect was added in myocardium phantom for to observe the change in defect. Vertical motion was intentionally generated by moving phantom downward in a returning pattern and in a non-returning pattern throughout the acquisition. In addition, Lateral motion was generated by moving phantom upward in a returning pattern and in a non-returning pattern. The simulated motion patterns were detected and corrected similarly to no-motion pattern image and QPS score, after Motion Detection and Correction Method (MDC), stasis, Hopkins method were applied. Results In phantom study, Changes of perfusion defect were shown in the anterior wall by the simulated phantom motions, and inferior wall's defect was found in some situations. The changes derived from motion were corrected by motion correction methods, but Hopkins and Stasis method showed visual artifact, and this visual artifact did not affect to perfusion score. Conclusion It was confirmed that motion correction method is possible to reduce the motion artifact and artifactual perfusion defect, through the apply on the phantom tests. Motion Detection and Correction Method (MDC) performed better than other method with polar map image and perfusion score result.

  • PDF

Improved Simple Boundary Following Algorithm (개선된 간단한 경계선 추적자 알고리즘)

  • Cheong, Cheol-Ho;Han, Tack-Don
    • Journal of KIISE:Software and Applications
    • /
    • v.33 no.4
    • /
    • pp.427-439
    • /
    • 2006
  • The SBF (Simple Boundary Follower) is a boundary-following algorithm, and is used mainly for image recognition and presentation. The SBF is very popular because of its simplicity and efficiency in tracing the boundary of an object from an acquired binary image; however, it does have two drawbacks. First, the SBF cannot consistently process inner or inner-outer corners according to the follower's position and direction. Second, the SBF requires movement operations for the non-boundary pixels that are connected to boundary pixels. The MSBF (Modified Simple Boundary Follower) has a diagonal detour step for preventing inner-outer corner inconsistency, but is still inconsistent with inner-corners and still requires extra movement operations on non-boundary pixels. In this paper, we propose the ISBF (Improved Simple Boundary Follower), which solves the inconsistencies and reduces the extra operations. In addition, we have classified the tour maps by paths from a current boundary pixel to the next boundary pixel and have analyzed SBF, MSBF, and ISBF. We have determined that the ISBF has no inconsistency issues and reduces the overall number of operations.

A study on the subset averaged median methods for gaussian noise reduction (가우시안 잡음 제거를 위한 부분 집합 평균 메디안 방법에 관한 연구)

  • 이용환;박장춘
    • Journal of the Korea Society of Computer and Information
    • /
    • v.4 no.2
    • /
    • pp.120-134
    • /
    • 1999
  • Image processing steps consist of image acquisition, pre-processing, region segmentation and recognition, and the images are easily corrupted by noise during the data transmission, data capture, and data processing. Impulse noise and gaussian noise are major noises, which can occur during the process. Many filters such as mean filter, median filter, weighted median filter, Cheikh filter, and Kyu-cheol Lee filter were proposed as spatial noise reduction filters so far. Many researches have been focused on the reduction of impulse noise, but comparatively the research in the reduction of gaussian noise has been neglected. For the reduction of gaussian noise, subset averaged median filter, using median information and subset average information of pixels in a window. was proposed. At this time, consider of the window size as 3$^{*}$3 pixel. The window is divided to 4 subsets consisted of 4 pixels. First of all, we calculate the average value of each subset, and then find the median value by sorting the average values and center pixel's value. In this paper, a better reduction of gaussian noise was proved. The proposed algorithms were implemented by ANSI C language on a Sun Ultra 2 for testing purposes and the effects and results of the filter in the various levels of noise and images were proposed by comparing the values of PSNR, MSE, and RMSE with the value of the other existing filtering methods.thods.

  • PDF

The Obstacle Avoidance Algorithm of Mobile Robot using Line Histogram Intensity (Line Histogram Intensity를 이용한 이동로봇의 장애물 회피 알고리즘)

  • 류한성;최중경;구본민;박무열;방만식
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.6 no.8
    • /
    • pp.1365-1373
    • /
    • 2002
  • In this paper, we present two types of vision algorithm that mobile robot has CCD camera. for obstacle avoidance. This is simple algorithm that compare with grey level from input images. Also, The mobile robot depend on image processing and move command from PC host. we has been studied self controlled mobile robot system with CCD camera. This system consists of digital signal processor, step motor, RF module and CCD camera. we used wireless RF module for movable command transmitting between robot and host PC. This robot go straight until recognize obstacle from input image that preprocessed by edge detection, converting, thresholding. And it could avoid the obstacle when recognize obstacle by line histogram intensity. Host PC measurement wave from various line histogram each 20 pixel. This histogram is (x, y) value of pixel. For example, first line histogram intensity wave from (0, 0) to (0, 197) and last wave from (280, 0) to (2n, 197. So we find uniform wave region and nonuniform wave region. The period of uniform wave is obstacle region. we guess that algorithm is very useful about moving robot for obstacle avoidance.