• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2000년도 제15차 학술회의논문집
• /
• pp.241-241
• /
• 2000

In this Paper, we present a new efficient algorithm that can segment an object in the image. There are many algorithms for segmentation and many studies for criteria or threshold value. But, if the environment or brightness is changed, their would not be suitable. Accordingly, we apply a clustering algorithm for adopting and compensating environmental factors. And applying labeling method, we try arranging segment by the similarity that calculated with the fuzzy algorithm. we also present simulations for searching an object and show that the algorithm is somewhat more efficient than the other algorithm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권11호
• /
• pp.5605-5623
• /
• 2016

We propose a face recognition method that utilizes the LCP face descriptor. The proposed method applies a LoG mask to extract a face contour response, and employs the LCP algorithm to produce a binary pattern representation that ensures high recognition performance even under the changes in illumination, noise, and aging. The proposed LCP algorithm produces excellent noise reduction and efficiency in removing unnecessary information from the face by extracting a face contour response using the LoG mask, whose behavior is similar to the human eye. Majority of reported algorithms search for face contour response information. On the other hand, our proposed LCP algorithm produces results expressing major facial information by applying the threshold to the search area with only 8 bits. However, the LCP algorithm produces results that express major facial information with only 8-bits by applying a threshold value to the search area. Therefore, compared to previous approaches, the LCP algorithm maintains a consistent accuracy under varying circumstances, and produces a high face recognition rate with a relatively small feature vector. The test results indicate that the LCP algorithm produces a higher facial recognition rate than the rate of human visual's recognition capability, and outperforms the existing methods.

• Journal of Information Processing Systems
• /
• 제14권4호
• /
• pp.941-947
• /
• 2018

Since the amplitudes of spin echo train in nuclear magnetic resonance logging (NMRL) are small and the signal to noise ratio (SNR) is also very low, this paper puts forward an improved de-noising algorithm based on wavelet transformation. The steps of this improved algorithm are designed and realized based on the characteristics of spin echo train in NMRL. To test this improved de-noising algorithm, a 32 points forward model of big porosity is build, the signal of spin echo sequence with adjustable SNR are generated by this forward model in an experiment, then the median filtering, wavelet hard threshold de-noising, wavelet soft threshold de-noising and the improved de-noising algorithm are compared to de-noising these signals, the filtering effects of these four algorithms are analyzed while the SNR and the root mean square error (RMSE) are also calculated out. The results of this experiment show that the improved de-noising algorithm can improve SNR from 10 to 27.57, which is very useful to enhance signal and de-nosing noise for spin echo train in NMRL.

• 한국산학기술학회논문지
• /
• 제18권2호
• /
• pp.590-599
• /
• 2017

국내에서 하수관로 탐사장치는 200만 화소 이상의 고해상도 디지털 카메라를 이용한 제품이 개발되어 있으나 30만 화소 이하의 장치가 대부분 사용되고 있다. 특히, 10만화소 이하의 장치가 아직도 많이 사용되고 있어, 영상처리를 위한 환경이 매우 열악하다. 본 연구에서 다루는 하수관 영상은 매우 저해상도($240{\times}320$ = 76,800화소)로 균열탐지가 매우 어렵다. 국내에서 이러한 저해상도 하수관거 영상이 대부분이기 때문에, 이를 연구대상으로 선택하였다. 이러한 저해상도 영상으로 하수 관거의 균열을 자동으로 탐지하는 기법을 디지털 영상처리 기술을 이용하여 연구하였다. 총8단계를 거쳐 균열을 자동으로 탐지하는 프로그램을 개발하였으며, 기본적으로 Matlab 프로그램의 함수를 이용하였다. 2단계에서 최적의 임계값을 찾는 알고리즘과 5단계에서 균열을 판단하는 알고리즘을 개발하였다. 2단계는 자막이 흰색이기 때문에 자막이 없는 원래 영상보다 Otsu's 임계값(threshold)이 높게 계산이 되는 점에 착안하여 Otsu 임계값을 시작으로 0.01씩 감소시키면서 최적의 임계값을 찾는 방법 알고리즘이며, 5단계는 길이가 10mm(40픽셀) 이상이고 폭이 1mm(4픽셀) 이상으로 판단하여, 균열을 탐지하는 알고리즘이다. 해석 결과 매우 저해상도 영상임에도 불구하고 균열 탐지 결과가 우수한 것으로 판단된다.

• 대한원격탐사학회지
• /
• 제37권1호
• /
• pp.69-84
• /
• 2021

Awareness of boats is a main issue in areas of fishery management, illegal fishing, and maritime traffic, etc. For the awareness, Automatic Identification System (AIS) and Vessel-Pass System (V-PASS) have been widely used to collect the boat-related information. However, only using these systems makes it difficult to collect the accurate information. Recently, satellite-based data has been increasingly used as a cooperative system. In 2015, U.S. National Oceanic and Atmospheric Administration (NOAA) developed a boat detection algorithm using Visible Infrared Imaging Radiometer Suite (VIIRS) Day & Night Band (DNB) data. Although the detections have been widely utilized in many publications, it is difficult to estimate the night-time fishing boats immediately. Particularly, it is difficult to estimate the threshold due to the lunar irradiation effect. This effect must be corrected to apply a single specific threshold. In this study, the moon phase was considered as the main frequency of this effect. Considering the moon phase, relational expressions are derived and then used as offsets for relative correction. After the correction, it shows a significant reduction in the standard deviation of the threshold compared to the threshold of NOAA. Through the correction, this study can set a constant threshold every day without determination of different thresholds. In conclusion, this study can achieve the detection applying the single specific threshold regardless of the moon phase.

• Journal of information and communication convergence engineering
• /
• 제9권5호
• /
• pp.487-490
• /
• 2011

This paper presents splitting and merging algorithm based on adaptive thresholding. The algorithm first divides the image into blocks, and then compares each block using the calculated thresholding value. The blocks which are same are merged using the certain threshold value and different blocks are split unless it satisfies the threshold value. When the block has been merged, maximum and minimum block sizes are determined then the average block size is determined. After the average block size is determined the average intensity and standard deviation of average block is calculated. The process of thresholding is applied to binarize the image. Finally, the experimental results show that the proposed method distinguishes clearly the background with text in the document image.

• 대한전기학회논문지:시스템및제어부문D
• /
• 제53권4호
• /
• pp.258-264
• /
• 2004

This paper propose a method that GOP structure based on the picture complexity change realtime adaptive without pre-analysis or time delay. Proposed algorithm calculates the complexity of pictures at first, and the ratio of the complexity( X$\sub$p/ /X$\sub$i/) between P picture and I picture is calculated. The suitable M value for the three picture select by comparing with predetermined threshold. Used bit and vbv_delay the value of GOP is calculated according to selected M. Experimental results show that the prediction error is reduce than the fixed GOP structure. Since the complexity distribution of the sequence is different, applied limits of threshold value is changed, also.

• 전자공학회논문지B
• /
• 제31B권2호
• /
• pp.80-87
• /
• 1994

Fetal monitoring is a routine procedure to obtain a record of physiologic functions during pregnancy and labor. It is required to determine fetal heart frequency accurately. There are various types of fetal heart rate(FHR) determination and the most frequently applied method is transabdominal Doppler ultrasound. However, in the case of weak or noise corrupted Doppler ultrasound signals, conventional peak detections and the autocorrelation function method have many difficulties to determine FHR precisely. Also the autocorrelation function is effected by threshold level and window size. To solve these problems, the high resolution pitch determination algorinthm is introduced to detect FHR from Doppler ultrasound signals. This scheme digitally processes Doppler ultrasound signal for digital rectification, envelope detection, decimation and correlation calculation of two interconnected segments and then FHR is determined by its maximal value. Even in the case of a greatly smeared noise signal, this algorithm is able to search FHR more accurately than autocorrelation function by means of compensating FHR with a constant correlation threshold. This algorithm is simulated by 386-MATLAB on PC 486/DX and verified that it is superior to the autocorrelation function method.

• IEIE Transactions on Smart Processing and Computing
• /
• 제3권6호
• /
• pp.388-392
• /
• 2014

This paper proposes an early termination method of a block vector search for fast encoding of high efficiency video coding (HEVC) screen content coding (SCC). In the proposed algorithm, two blocks indicated by two block vector predictors (BVPs) were first employed as an intra block copy (IBC) search. If the sum of absolute difference (SAD) value of the block is less than a threshold defined empirically, an IBC BV search is terminated early. The initial threshold for early termination is derived by statistical analysis and it can be modified adaptively based on a quantization parameter (QP). The proposed algorithm is evaluated on SCM-2.0 under all intra (AI) coding configurations. Experimental results show that the proposed algorithm reduces IBC BV search time by 29.23% on average while the average BD-rate loss is 0.41% under the HEVC SCC common test conditions (CTC).

• 한국통신학회논문지
• /
• 제21권10호
• /
• pp.2552-2562
• /
• 1996

In this paper, we propose a segmentation algorithm that can reliably separate moving objects from noisy background in the image sequance received from a camera at the fixed position. The proposed algorithm consists of three processes:generation of the difference image between the input image and the reference image, multilevel quantization of the difference image, and multistagemerging in the quantized image. The quantization process requantizes the difference image based on the multiple threshold values determined bythe histogram analysis. The merging starts from the seed region which created by using the highest threshold value and ends when termination conditions are met. the proposed method has been tested with various real imge sequances containing intruders. The test results show that the proposed algorithm can detect moving objects like intruders very effectively in the noisy environment.