• 대한원격탐사학회지
• /
• 제22권5호
• /
• pp.439-443
• /
• 2006

Image co-registration is the process of overlaying two images of the same scene. One of which is a reference image, while the other (sensed image) is geometrically transformed to the one. Numerous methods were developed for the automated image co-registration and it is known as a timeconsuming and/or computation-intensive procedure. In order to improve efficiency and effectiveness of the co-registration of satellite imagery, this paper proposes a pre-qualified area matching, which is composed of feature extraction with Laplacian filter and area matching algorithm using correlation coefficient. Moreover, to improve the accuracy of co-registration, the outliers in the initial matching point should be removed. For this, two outlier detection techniques of studentized residual and modified RANSAC algorithm are used in this study. Three pairs of Landsat images were used for performance test, and the results were compared and evaluated in terms of robustness and efficiency.

• 한국멀티미디어학회논문지
• /
• 제22권1호
• /
• pp.18-26
• /
• 2019

In this paper we propose how to detect circular objects in the gray scale image and segment them using the discrete Morse theory, which makes it possible to analyze the topology of a digital image, when it is transformed into the data structure of some combinatorial complex. It is possible to get meaningful information about how many connected components and topologically circular shapes are in the image by computing the persistent homology of the filtration using the Morse complex. We obtain a Morse complex by modeling an image as a cubical cellular complex. Each cell in the Morse complex is the critical point at which the topological structure changes in the filtration consisting of the level sets of the image. In this paper, we implement the proposed algorithm of segmenting the circularly shaped objects with a long persistence of homology as well as computing persistent homology along the filtration of the input image and displaying in the form of a persistence diagram.

• 한국통신학회논문지
• /
• 제29권6C호
• /
• pp.834-841
• /
• 2004

화자의 입술영상에는 카메라와 화자의 위치나 자세로 인하여 정상적인 입술이 기하학적으로 변환될 수 있다. 이러한 변환은 본래 입술위상의 기하학적 정보를 변경시킨다. 따라서 기하학적으로 변환된 입술모양을 보정하는데 부분적인 입술위상정보를 사용함으로써 전체 입술정보를 개선하고자, 본 논문에서는 입술모양의 기하학적 보정 기법을 제안한다. 제안한 기법은 특징결정 단계와 보정 단계로 구성된다. 특징결정 단계에서는 원영상과 목표영상의 입술모델에 따라 원영상의 특징점과 특징을 추출하고 목표영상의 특징점과 특징을 결정한다. 보정단계에서는 이전 단계에서 추출한 정보를 기반으로 영상을 부분영상으로 분할하고 사상 후 보정된 영상을 통합한다. 실험영상은 6개의 한국어 단모음 발음에 대한 동영상 프레임이고 알고리즘 평가를 위하여 입술의 좌우 대칭성을 활용한다. 실험 결과, 윗입술보다는 아랫입술의 보정률, 입술의 움직임이 작은 발음보다는 움직임이 큰 발음의 보정률이 높게 개선되었다.

• 제어로봇시스템학회논문지
• /
• 제14권8호
• /
• pp.848-855
• /
• 2008

In this paper, we describe correspondence among multiple images taken by multiple cameras. The correspondence among multiple views is an interesting problem which often appears in the application like visual surveillance or gesture recognition system. We use the principal axis and the ground plane homography to estimate foot of human. The principal axis belongs to the subtracted silhouette-based region of human using subtraction of the predetermined multiple background models with current image which includes moving person. For the calculation of the ground plane homography, we use landmarks on the ground plane in 3D space. Thus the ground plane homography means the relation of two common points in different views. In the normal human being, the foot of human has an exactly same position in the 3D space and we represent it to the intersection in this paper. The intersection occurs when the principal axis in an image crosses to the transformed ground plane from other image. However the positions of the intersection are different depend on camera views. Therefore we construct the correspondence that means the relationship between the intersection in current image and the transformed intersection from other image by homography. Those correspondences should confirm within a short distance measuring in the top viewed plane. Thus, we track a person by these corresponding points on the ground plane. Experimental result shows the accuracy of the proposed algorithm has almost 90% of detecting person for tracking based on correspondence of intersections.

• 대한전자공학회논문지SD
• /
• 제46권3호
• /
• pp.10-19
• /
• 2009

본 논문에서는 다중위상래핑과 실수값 함수를 이용하는 효율적인 광 워터마킹을 제안하였다. 원 영상 삽입 과정에서 숨겨야 될 두 원 영상을 제로 패딩 시켜서 입력 평면의 두 개의 사분면에 하나씩 위치시킨 후 푸리에 변환을 수행하고 다중위상래핑을 적용하여 무작위 정 실수 값을 가지는 패턴을 생성시킨 후 하나의 실수부를 취하여 복호화 키를, 두 패턴 모두의 허수부의 합을 취하여 은닉영상을 생성시킨다. 위에서 생성된 은닉영상을 인간 시각으로는 감지 할 수 없도록 감쇄화 시킨 후 커버 영상과 일차 선형 변환 시켜서 배포영상을 제작한다. 복호화 과정에서는 배포영상과 복호화 키가 곱해져서 광학적인 역 푸리에 변환을 수행하고 출력 평면에서 원점에 대하여 대칭인 원영상이 간단히 복원된다. 컴퓨터 모의 실험과 광실험을 통하여 제안된 워터마킹이 광학적인 시스템에 적용 가능함을 확인하였다.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2006년도 춘계종합학술대회
• /
• pp.163-166
• /
• 2006

컴퓨터의 발달과 의료기기의 디지털화로 인해 의료영상 분야도 디지털화되었다. 그 결과 디지털 의료영상의 불법복제, 소유권 및 데이터 인증 문제 또한 발생하고 있다. 이러한 환경 하에서 환자의 사생활 보호와 의료영상 자체의 소유권, 재산권의 여부 및 데이터 변형 여부의 판별을 위하여 디지털 워터마킹이 사용되고 있다. 기존에 제안된 여러 가지 워터마킹 기법들은 Non-Blind 방식에서는 원 영상이 필요하다는 점과 Blind 방식을 사용할 경우에는 육안으로는 식별이 힘든 양극 워터마크를 사용한다는 단점이 있다. 본 논문은 Blind 워터마킹에서 양극 워터마크를 삽입하는 방식을 따르지 않고, 시각적으로 인지하기 쉽도록 하기 위하여 이진 워터마크 영상을 다중 웨이블릿 변환하고, 원 영상을 이산 푸리에 변환하여 영상의 중간 주파수대에 Circular Input 방식을 이용하여 워터마크를 삽입하는 알고리즘을 제안하였고 그 방법은 상관도 0.97이라는 우수한 결과를 얻었다.

• Journal of Multimedia Information System
• /
• 제4권4호
• /
• pp.205-210
• /
• 2017

This paper presents a verification watermarking applied to healthcare information management. The proposed method uses the whole region based on the public-key cryptograph, which is transformed by the DWT transform to integrity verification. Furthermore, the public-key cryptograph algorithm is used for the embedded watermark image. We adaptively select the upper bit-plane including the LSB parts of each block when the watermark is inserted.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1987년도 전기.전자공학 학술대회 논문집(II)
• /
• pp.1379-1382
• /
• 1987

IN ADAPTIVE LINEAR PREDICTION, AN ADAPTIVE CAPABILITY IS BUILT INTO THE PROCESSOR SUCH THAT AS THE IMAGE STATISTICS CHANGE, THE PREDICTION FILTER COEFFICIENTS THEMSELVES CHANGE, PRODUCING A NEW FILTER MORE CLOSELY OPTIMIZED TO THE NEW SET OF IMAGES STATISTICS. THE LMS ALGORITHM MAY BE USED TO ADAPT THE COEFFICIENT OF AN ADAPTIVE PREDICTION FILTER FOR IMAGE SOURCE ENCODING. IN THIS PAPER, TWO CODING SYSTEMS USING DPCM AND LMS ALGORITHMS RESPECTIVELY FOR OBTAINING THE FIRST TRANSFORMED COEFFICIENT IN HYBRID CODING ARE COMPARED.

• 대한전자공학회논문지
• /
• 제25권9호
• /
• pp.1102-1107
• /
• 1988

We describe a volume holographic associative memory using photorefractive material and conventional planar mirror. Multiple hologram is generated with two angular multiplexed writing beams and Fourier transformed object beam in Ba Ti O3 crystal at 0.6328 um. Complete image can be recalled successfully by partial input of the original stored image without any additional thresholding and optical feedback process. It is proved that our system is useful for optical implementation of real-time associative memory and location addressable memory.

• 제어로봇시스템학회논문지
• /
• 제8권4호
• /
• pp.333-337
• /
• 2002

A content-based image retrieval method using color, texture, and shape features is proposed in this paper. A region segmentation technique using PIM(Picture Information Measure) entropy is used for similarity indexing. For segmentation, a color image is first transformed to a gray image and it is divided into n$\times$n non-overlapping blocks. Entropy using PIM is obtained from each block. Adequate variance to perform good segmentation of images in the database is obtained heuristically. As variance increases up to some bound, objects within the image can be easily segmented from the background. Therefore, variance is a good indication for adequate image segmentation. For high variance image, the image is segmented into two regions-high and low entropy regions. In high entropy region, hue-saturation-intensity and canny edge histograms are used for image similarity calculation. For image having lower variance is well represented by global texture information. Experiments show that the proposed method displayed similar images at the average of 4th rank for top-10 retrieval case.