• Journal of Korean Society for Geospatial Information Science
• /
• v.10 no.3 s.21
• /
• pp.79-87
• /
• 2002

This paper proposes an approach of automatically identifying the center of fiducial marks using radiometric and geometric characteristics of those marks existing on aerial photographs. Candidate region surrounding a mark, based on radiometric strategy, is determined by producing a bi-level image and by applying morphological operations. Based on geometric strategy, the central location of a mark is determined by applying ${\bigtriangledown}^G$ filtering and symmetry-enhancement filtering, and by finding peak location of symmetry. Evaluation with respect to 66 cases of sub-images containing a fiducial mark showed that the central location of the mark is determined up to around one pixel difference whit it is compared to a manual inspection.

• The Bulletin of The Korean Astronomical Society
• /
• v.46 no.2
• /
• pp.46.1-46.1
• /
• 2021

태양으로부터 3Rs보다 높은 코로나 밝기의 대부분은 먼지에 의해 산란된 F코로나로부터 나온다. F코로나와 자유전자의 톰슨산란에 의한 K코로나를 분리하는 효과적인 방법은 편광을 이용하는 것으로 알려져 있고 현재 NASA와 천문연간 협력개발 중인 K코로나 관측 기기 COronal Diagnostic EXperiment(CODEX)도 편광을 이용한 분류를 기본으로 자유전자의 온도와 속도를 측정한다. 문제는 F코로나도 약간의 편광도를 가져서 K코로나와 구별이 불가능해지는데다 F코로나의 편광량은 먼지입자의 구성물질, 모양, 산란 위치 등에 따라 달라서 거의 예측이 불가능하고 지금까지 제대로 알려진 바도, 연구된 바도 없다. 우리는 CODEX에서 F코로나 편광량을 산출하기 위해 한 개의 협대역 필터(Narrow Bandpass Filter)를 추가장착하는 것을 제안하였고 그 중심파장과 밴드폭을 결정하였다. 몬테카를로 계산 결과 10장의 393.55nm 중심의 1.4nm폭 협대역필터와 393.5nm 중심의 10nm 협대역 필터비를 이용해 1Rs 화소의 해상도로 F코로나 편광량을 결정할 수 있을 것으로 예상된다. 2023년 CODEX 발사 후 본 관측이 성공적으로 수행된다면 F코로나의 편광량의 시간, 공간적 변화를 확인할 수 있으며 추가적으로 K코로나를 보다 정밀하게 분리해낼 수 있을 것으로 기대된다.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.37 no.5
• /
• pp.54-63
• /
• 2000

We present a multi-resolution block matching algorithm (BMA) for fast motion estimation At the coarsest level, a motion vector (MV) having minimum matching error is chosen via a full search, and a MV with minimum matching error is concurrently found among the MVs of the spatially adjacent blocks Here, to examine the spatial MVs accurately, we propose an efficient method for searching full resolution MV s without MV quantization even at the coarsest level The chosen two MV s are used as the initial search centers at the middle level At the middle level, the local search is performed within much smaller search area around each search center If the method used at the coarsest level is adopted here, the local searches can be done at integer-pel accuracy A MV having minimum matching error is selected within the local search areas, and then the final level search is performed around this initial search center Since the local searches are performed at integer-pel accuracy at the middle level, the local search at the finest level does not take an effect on the overall performance So we can skip the final level search without performance degradation, thereby the search speed increases Simulation results show that in comparison with full search BMA, the proposed BMA without the final level search achieves a speed-up factor over 200 with minor PSNR degradation of 02dB at most, under a normal MPEG2 coding environment Furthermore, our scheme IS also suitable for hardware implementation due to regular data-flow.

• Proceedings of the Korean Society of Medical Physics Conference
• /
• 2004.11a
• /
• pp.64-66
• /
• 2004

When examing patients with DRs it is necessary to remove bad pixels and lines and to correct non-uniform offsets and x-ray field. For non-uniformity correction a flat field x-ray image is needed, and to obtain it the center of detector is usually aligned with the focal spot of the x-ray tube, which is conserved when examing patients to preserve the flat field. In some of radiographic techniques, however, it is necessary to move the x-ray tube off the center position of detector or tilt the detector. We investigated the effect of detector tilting on the non-uniformity correction, and propose a method to reduce the effect using a new algorithm. The flat field of X-ray in the DR detector could be guaranteed with this result.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.6
• /
• pp.1167-1173
• /
• 2017

As the society increasingly embraces the high - tech digital information age, the field of image processing becomes progressively more branched out and becoming an imperative field. However, image data is deteriorated due to various causes during transmission and salt and pepper noise is typical. Typical methods for removing salt and pepper noise include CWMF, SWMF, and A-TMF. However, existing methods are somewhat insufficient in their ability to remove noise in salt and pepper noise environments. Therefore, in this paper, after it is determined whether noise removal is needed, the following measures were taken. If the center pixel was non-noise, the original pixel was preserved, If it was noise, we proposed a two - dimensional spline interpolation method and a median filter depending on the noise density of the local mask. For the purpose of objective judgment, we compared the results with that of existing methods and used PSNR (peak signal to noise ratio) as a judgment criterion.

• Journal of Korea Multimedia Society
• /
• v.5 no.3
• /
• pp.255-262
• /
• 2002

A boundary sequence can be a good representation of arbitrary shapes, because it can represent them simply and precisely. However, boundary sequences have not been used as a representation of arbitrary shapes, because the pixel-based shape-features such as area, centroid, orientation, projection and so forth, could not be computed directly from them. In this paper, we show that the shape-features can be easily computed from the boundary sequences by introducing the cross-sections that are defined as vertical (or horizontal) line segments in a shape. A cross-section generation method is proposed, which generates cross-sections of the shape efficiently by tracing the boundary sequence of the shape once. Furthermore, a boundary sequence extraction method is also proposed, which generates a boundary sequence for each shape in a binary image automatically The proposed methods work well even if a shape has holes. Eventually, we show that a boundary sequence can be used effectively for representing arbitrary shapes.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.37 no.4
• /
• pp.20-28
• /
• 2000

The error diffusion algorithm is good for reproducing continuous image to binary image. However the reproduction of edge characteristic is weak in power spectrum analysts of display error. In this paper, an error diffusion method which include pre-filter algorithm for edge characteristic enhancement is proposed Pre-filter algorithm is organized horizontal and vertical directional differential value and weighting function of pre-filter First, it is obtained the horizontal and vertical differential value from the peripheral pixels in original image using $3{\times}3$ Sobel operator Secondly weighting function of pre-filter is composed by function including absolute value and sign of differential value The improved Error diffusion algorithm using pre-filter, present a good result visually which edge characteristic is enhanced. The difference between orignal image and halftoning image is compared with edge-enhanced error diffusion algorithm by measuring the radially averaged power spectrum density.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.3
• /
• pp.29-35
• /
• 2012

In this paper, it is presented the method of image recovering which existing is only pixel processing, but suggesting method is concluding image clustering overlap degree after classfying around unit fixel to crowd pixel. Concluding overlap degree threshold value is after identifying pattern pixel and grasping geometry structure of sample pattern and deduction of deciding function. distinguishing feature space is above four dimension is reason of not visual observation of pattern structure. consideration of distribution structure is distance of center of crowd pixel, the number of each crowd pattern pixel and standard deviation. The over threshold value elimate the overlap image and the downward is recovered and established dynamic image. memory storage deduction of 20% and elevation of 15% performance is estimated in recovery of image.

• Journal of the Korean Geographical Society
• /
• v.47 no.2
• /
• pp.282-296
• /
• 2012

This study compared effects of spatial resolution ratio in image fusion by Korea Multi-Purpose SATellite 2 (KOMPSAT II), also known as Arirang-2. Image fusion techniques, also called pansharpening, are required to obtain color imagery with high spatial resolution imagery using panchromatic and multi-spectral images. The higher quality satellite images generated by an image fusion technique enable interpreters to produce better application results. Thus, image fusions categorized in 3 domains were applied to find out significantly improved fused images using KOMPSAT 2. In addition, all fused images were evaluated to satisfy both spectral and spatial quality to investigate an optimum fused image. Additionally, this research compared Pixel-Based Image Analysis (PBIA) with the GEOgraphic Object-Based Image Analysis (GEOBIA) to make better classification results. Specifically, a roof top of building was extracted by both image analysis approaches and was finally evaluated to obtain the best accurate result. This research, therefore, provides the effective use for very high resolution satellite imagery with image interpreter to be used for many applications such as coastal area, urban and regional planning.

• Journal of Korean Society for Geospatial Information Science
• /
• v.17 no.1
• /
• pp.131-139
• /
• 2009

The existing vessel monitoring system using the ground surveillance radar has a difficulty in monitoring ships continuously due to the limited range of detecting ships. For resolving this problem, we carry out a research on ship detection which is to be the core technology of vessel monitoring system for ocean monitoring using SAR imagery. There are two different methods of detecting ships in SAR imagery: detection of the ship target itself and detection of the ship wake. In this paper, we mainly focus on algorithms which detect the ship itself, and also present the accuracy test after extracting positional and directional figures of the ships. After rectifying input SAR imagery using polynomial transformation, we use Wiener filter to remove speckle noises. A labeling technique and morphological filtering in conjunction with Otsu's method are used to automatically detect the ships based on the image processing domain. For ground truth data, information from a radar system is used, which allows assessing the accuracy of the proposed method. The results show that the proposed method has the high potential in automatically detecting the ships and its positional/directional figures in a fast way.