• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10b
• /
• pp.541-543
• /
• 2000

영역의 수와 윤곽선의 길이는 세그멘테이션 기반의 움직임 보상된 비디오 코딩에서 두 가지의 기본적인 제약사항이다. 이 논문에서 제안하는 코딩 스킴은 영역의 수를 축소하는 것에 초점을 맞추고, 윤곽성 코딩, 그리고 치환된 프레임 차이(DFD)의 압축에 초점을 맞춘다. 제안된 스킴의 가장 중요한 특징 중의 하나는 형태적인 필터를 기반으로 하는 spatio-temporal 단순성 알고리즘이고, 그것들과 함께 이미지는 작은 수의 영역으로 나누어질 수 있다. 이 스킴의 매우 중요한 특성은 세그멘테이션 맵 샘플링 기법으로, 그것은 윤곽선 길이를 매우 작은 복원 에러에 비례하여 약 50%까지 줄인다. 실험적인 결과는, 높은 압축 비율에 대하여 매우 작은 코딩 에러를 보여주었다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.8
• /
• pp.1707-1714
• /
• 1997

This paper proposes a novel algorithm for fractal coding of image sequence, based on the CPM (Circular Prediction Mapping) and the NCIM (Non Contractive Interframe Mapping). In the CPM and the NCIM, each range block is approximated by a domain block in the adjacent frame, which is of the same size as the range block. Also, in this paepr, we propose a coding scheme of color components and an algorithm for controlling the bit rate, resepectively, for practical implementation of the fractal coder. The computer simulation results on real image sequences demonstrate that the proposed algorithm provides very promising performance at low bit-rate, below 256 Kbps.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2003.11a
• /
• pp.43-46
• /
• 2003

본 논문에서는 영상의 특성을 이용하여 TM1300 미디어 프로세서에 적합한 효율적인 움직임 탐색방법을 제안한다. 주위 블록간의 공간 상관 관계를 이용해 예측 움직임 벡터를 구하고 이를 기준으로 탐색 영역을 축소하여 전체 연산량을 줄인다. TMI1300의 특성을 활용하여 메모리 사용 효율 증대 및 비교, 분기의 사용을 줄여 최적화에 유리한 움직임 예측 방법을 제안한다. 제안된 방법을 Philips 140 MHz IM1300 상의 MPEG-4 SP@L3 (Simple Profile Level 3) 부호화기에 적용한 결과 화질은 전역 탐색 방법에 근접하며 기존의 고속 움직임 예측 방법에 비해 메모리 접근 및 처리 속도 면에서 향상된 성능을 보였다.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2021.06a
• /
• pp.91-92
• /
• 2021

디지털 홀로그램(digital hologram, DH)은 2차원 데이터에 3차원의 정보를 포함하는 차세대 영상 콘텐츠이다. 따라서 이 콘텐츠의 유통을 위해서는 그 지적재산권이 반드시 보호되어야 한다. 본 논문에서는 이를 위한 딥러닝 기반 DH의 워터마킹 방법을 제안한다. 이 방법은 워터마크의 비가시성, 공격에 대한 강인성, 워터마크 추출 시 호스트 정보를 사용하지 않는 blind 워터마킹 방법이다. 이 네트워크는 고주파 성분이 강한 DH의 특성을 감안하여 호스트 데이터를 축소하지 않고 워터마크 데이터를 확장하여 워터마크를 삽입한다. 또한 홀로그램의 복원성능을 위한 학습을 제안한다. 제안한 방법을 다양한 종류와 강도의 공격에 대해 실험을 수행하여 그 성능을 보인다.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.47 no.6
• /
• pp.12-18
• /
• 2010

Automatic Target Detection (ATD) systems that use forward-looking infrared (FLIR) consists of three stages. preprocessing, detection, and clutter rejection. All potential targets are extracted in preprocessing and detection stages. But, this results in a high false alarm rates. To reduce false alarm rates of ATD system, true targets are extracted in the clutter rejection stage. This paper focuses on clutter rejection stage. This paper presents a new clutter rejection technique using PCA features and stochastic features of clutters and targets. PCA features are obtained from Euclidian distances using which potential targets are projected to reduced eigenspace selected from target eigenvectors. CV is used for calculating stochastic features of edges in targets and clutters images. To distinguish between target and clutter, LDA (Linear Discriminant Analysis) is applied. The experimental results show that the proposed algorithm accurately classify clutters with a low false rate compared to PCA method or CV method

• Journal of Korean Society for Geospatial Information Science
• /
• v.4 no.1 s.6
• /
• pp.93-102
• /
• 1996

For an atomatic generation of DEM(Digital Elevation Model) by computer, it is a time-consumed work to determine adquate matches from stereo images. Correlation and evenly distributed area-based method is generally used for matching operation. In this paper, we propose a new approach that computes matches efficiantly by changing the size of mask window and search area according to the given terrain information. For image segmentation, at first edge-preserving smoothing filter is used for preprocessing, and then region growing algorithm is applied for the filterd images. The segmented regions are classifed into mountain, plain and water area by using MRF(Markov Random Filed) model. Maching is composed of predicting parallex and fine matching. Predicted parallex determines the location of search area in fine matching stage. The size of search area and mask window is determined by terrain information for each pixel. The execution time of matching is reduced by lessening the size of search area in the case of plain and water. For the experiments, four images which are covered $10km{\times}10km(1024{\times}1024\;pixel)$ of Taejeon-Kumsan in each are studied. The result of this study shows that the computing time of the proposed method using terrain information for matching operation can be reduced from 25% to 35%.

• The KIPS Transactions:PartB
• /
• v.14B no.2
• /
• pp.65-70
• /
• 2007

Red tide is becoming hot issue of environmental problem worldwide since the 1990. Advanced nations, are progressing study that detect red tide area on early time using satellite for sea. But, our country most seashores bends serious. Also because there are a lot of turbid method streams on coast, hard to detect small red tide area by satellite for sea that is low resolution. Also, method by sea color that use one feature of satellite image for sea of existent red tide area detection was most. In this way, have a few feature in image with sea color and it can cause false negative mistake that detect red tide area. Therefore, in this paper, acquired texture information to use GLCM(Gray Level Co occurrence Matrix)'s texture 6 information about high definition land satellite south Coast image. Removed needless component reducing dimension through principal component analysis from this information. And changed into 2 principal component accumulation images, Experiment result 2 principal component conversion accumulation image's eigenvalues were 94.6%. When component with red tide area that uses only sea color image and all principal component image. displayed more correct result. And divided as quantitative,, it compares with turbid stream and the sea that red tide does not exist using statistical feature analysis about texture.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.3
• /
• pp.541-550
• /
• 2014

This paper describes a multi-scale user interaction based tiled display visualization system using multiple input devices for monitoring and analyzing Geostationary Ocean Color Imager (GOCI) observation satellite imagery. This system provides multi-touch screen, Kinect motion sensing, and moblie interface for multiple users to control the satellite imagery either in front of the tiled display screen or far away from a distance to view marine environmental or climate changes around Korean peninsular more effectively. Due to a large amount of memory required for loading high-resolution GOCI satellite images, we employed the multi-level image load technique where the image was divided into small tiled images in order to reduce the load on the system and to be operated smoothly by user manipulation. This system performs the abstraction of common input information from multi-user Kinect motion and gestures, multi-touch points and mobile interaction information to enable a variety of user interactions for any tiled display application. In addition, the unit of time corresponding to the selected date of the satellite images are sequentially displayed on the screen and multiple users can zoom-in/out, move the imagery and select buttons to trigger functions.

• Journal of Internet Computing and Services
• /
• v.10 no.6
• /
• pp.99-111
• /
• 2009

The result of Image segmentation, an indispensable process in image processing, significantly affects the analysis of an image. Despite the significance of image segmentation, it produces some problems when the variation of pixel values is large, or the boundary between background and an object is not clear. Also, these problems occur frequently when many objects in an image are placed very close by. In this paper, when the shape of objects in an image is circular, we proposed an algorithm which segment an each object in an image using the geometric characteristic of circular shape. The proposed algorithm is composed of 4 steps. First is the boundary edge extraction of whole object. Second step is to find the candidate points for further segmentation using the boundary edge in the first step. Calculating the representative circles using the candidate points is the third step. Final step is to draw the line connecting the overlapped points produced by the several erosions and dilations of the representative circles. To verify the efficiency of the proposed algorithm, the algorithm is compared with the three well-known cell segmentation algorithms. Comparison is conducted by the number of segmented region and the correctness of the inner segment line. As the result, the proposed algorithm is better than the well-known algorithms in both the number of segmented region and the correctness of the inner segment line by 16.7% and 21.8%, respectively.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.49 no.4
• /
• pp.85-94
• /
• 2012

Lane marking detection is essential to both ITS and DAS systems. The objective of this paper is to provide more robust technique for lane marking detection than traditional techniques by using scale-space technique. Variable thresholding that is based on the local statistics may be very effective for detecting such objects as lane markings that have prominent intensities. However, such techniques that only rely on local statistics have limitations containing irrelevant areas as well. We reduce the candidate areas by combining the variable thresholding result with cost-efficient horizontal 1D LoG filtered scale space. Through experiments using practical images, we could achieve significant improvement over the techniques based not only on the variable thresholding but also on the Hough transform that is another very popular technique for this purpose.