• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.11
• /
• pp.1637-1643
• /
• 2022

In recent years, the demand for image-processing technology in digital marketing has increased due to the expansion and diversification of the digital market, such as video, security, and machine intelligence. Noise-processing is essential for image-correction and reconstruction, especially in the case of sensitive noises, such as in CT, MRI, X-ray, and scanners. The two main salt and pepper noises have been actively studied, but the details and edges are still unsatisfactory and tend to blur when there is a lot of noise. Therefore, this paper proposes an algorithm that applies a weight-based Euclidean distance equation to the partial mask and uses only the non-noisy pixels that are the most similar to the original as effective pixels. The proposed algorithm determines the type of filter based on the state of the internal pixels of the designed partial mask and the degree of mask deterioration, which results in superior noise cancellation even in highly damaged environments.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.25 no.12
• /
• pp.1868-1873
• /
• 2021

This paper proposes the Hough transform(HT) using an extended lookup table(LUT) to reduce the computational burden of the HT that is a typical straight line detection algorithm, and analyzes its performance. The conventional HT also uses a LUT to the calculation of the parameter 𝜌 of all straight lines passing through an edge pixel of interest(ePel) in order to reduce the computational burden. However, the proposed HT adopts an extended LUT that can be applied to straight lines across the ePel as well as its peripheral edge pixels to induce more computational reduction. This paper proves the validity of the proposed algorithm mathematically and also verifies it through simulation. The simulation results show that the proposed HT reduces the multiplication computation from 49.6% up to 16.1%, depending on the image and the applied extended LUT, compared to the conventional HT.

• Journal of Biomedical Engineering Research
• /
• v.21 no.3 s.61
• /
• pp.247-254
• /
• 2000

We propose an efficient MR image compression technique using fractal coding in wavelet transform domain. In the Proposed method , we construct significant coefficient trees with the absolute values of discrete wavelet transform coefficients and then perform the fractal coding with the information of significant coefficients having high energy. For MR images, most Pixels including background have very low gray level values, the number of significant coefficients is small. so we can expect high compression rate. In addition. since this method uses the fractal coding in wavelet transform domain, blocking artifact is reduced prominently and edges sensitive to human visual system are well preserved. As a result of computer simulation, we obtained the reconstructed images with better quality than those by JPEG at the low bit rates below 0.33[bpp].

• Korean Journal of Remote Sensing
• /
• v.24 no.2
• /
• pp.213-222
• /
• 2008

Although hyperspectral sensing data have shown great potential to derive various surface information that is not usually available from conventional multispectral image, the acquisition of proper hyperspectral image data are often limited. To use ground-based hyperspectral camera image for remote sensing studies, radiometric calibration should be prerequisite. The objective of this study is to develop radiometric calibration procedure to convert image digital number (DN) value to surface reflectance for the 120 bands ground-based hyperspectral camera. Hyperspectral image and spectral measurements were simultaneously obtained from the experimental target that includes 22 different surface materials of diverse spectral characteristics at wavelength range between 400 to 900 nm. Calibration coefficients to convert image DN value to at-sensor radiance were initially derived from the regression equations between the sample image and spectral measurements using ASD spectroradiometer. Assuming that there is no atmospheric effects when the image acquisition and spectral measurements were made at very close distance in ground, we were also able to derive calibration coefficients that directly transform DN value to surface reflectance. However, these coefficients for deriving reflectance values should not be applied when the camera is used for aerial image that contains significant effect from atmosphere and further atmospheric correction procedure is required in such case.

• Proceedings of the Korean Association of Geographic Inforamtion Studies Conference
• /
• 2003.04a
• /
• pp.94-99
• /
• 2003

다중분광 영상의 정확한 지형지물 분류를 수행하기 위하여 분류 클래스의 훈련지역 선정과 선정된 클래스의 분리도 분포가 중요하다. 최근에 이용되고 있는 위성탑재 초다중분광 영상은 많은 밴드를 포함하고 있기 때문에 데이터 처리가 어렵고, 노이즈로 인하여 다중분광 영상보다 분류 결과가 나쁜 경우도 나타난다. 특히 대상지역의 클래스에 따른 훈련지역의 선정시 밴드수에 비해 상대적으로 제한된 훈련화소 크기로 인하여 공분산 행렬의 계산에 어려움이 따른다. 따라서 본 연구에서는 Hyperion 데이터를 이용한 분류를 수행하기 위하여 필요한 유효 밴드 추출 방식을 알아보고, 분류영상의 정확도 평가를 통하여 추출된 밴드와 분류 클래스의 적합성 관계를 확인하고자 한다 이 과정에서 클래스 분리도를 이용하여 정확도 평가 이전에 밴드와 클래스 선정의 타당성을 확인할 수 있다.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.13 no.2
• /
• pp.199-208
• /
• 1995

Significant developments in the use of digital imagery for close-range photogrammetric metrology have occured in the last few years because of technological advances in digital image processing. Present day needs for applications of digital image processing technique to measurements of photographs obtained with non-metric camera at reduced cost, automation and convenience. In order for this application to be useful, a detailed procedure must be developed. Investigation of this study is given to the detailed procedure for the digital measurements of the object space data from the scanned non-metric photographs.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.1
• /
• pp.655-658
• /
• 2005

This paper proposes a modified block matching algorithm which reduces an amount of matching computation by using only pixels contributing greatly to block matching. In consideration of algorithm implementation and additional information, the proposed algorithm divides a matching block into sub-blocks, selects some sub-blocks using their complexities, and execute the block mating with them. Simulation results show that the proposed algorithm performs a valid block matching with some sub-blocks.

• Journal of rehabilitation welfare engineering & assistive technology
• /
• v.8 no.2
• /
• pp.133-138
• /
• 2014

In this paper, a simple but efficient gait recognition method using spatial-temporal silhouette analysis is proposed. For each image sequence, a background subtraction algorithm and a PBAS(pixel based adaptive segmenter) procedure are first used to segment the moving silhouettes of a walking figure. Then, to identify people, the step count and stride length of walking figure is obtained in silhouette images. Experimental results on a CASIA dataset including 124 subjects demonstrate the validity of the proposed method. Also, the proposed system are believed to have a sufficient feasibility for the application to gait recognition.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2022.05a
• /
• pp.421-424
• /
• 2022

Hough transform is a representative algorithm for detecting straight lines in an edge image. It corresponds the parameters of straight lines that may occur in the edge pixel into a parameter space, and detects valid parameters satisfying a given condition as straight lines. In general Hough transform, the parameters of the line are calculated with the image origin as the reference point. However, in this paper, the Hough transform based on the image center as a reference point is performed and its performance is compared and analyzed with the conventional Hough transform.

• Journal of Broadcast Engineering
• /
• v.1 no.2
• /
• pp.165-175
• /
• 1996

In this paper, the image segmentation method based on the hierarchical pyramid image structure of reduced resolution versions of the image for solving the problems in the conventional methods is presented. This method is described the object detection and delineation by statistical approach. In the object detection method, IFSVR( Inverse-father-son variance ratio) method and FSVR(father-son variance ratio ) method are proposed for solving clustering validity problem occurred In the hierarchical pyramid image structure. An optimal object pixel Is detected at some level by this method. In the object delineation method, the iterative algorithm by top-down traversing method is proposed for moving the optimal object pixel to levels of higher resolution. Using the computer simulation, the results by the proposed statistical methods and object traversing method are investigated for the binary Image and the real image. At the results of computer simulation, the proposed methods of image segmentation based on the hierarchical pyramid Image structure seem to have useful properties and deserve consideration as a possible alternative to existing methods of image segmentation. The computation for the proposed method is required 0(log n) for n${\times}$n input image.