• Title/Summary/Keyword: affine set

Search Result 39, Processing Time 0.021 seconds

A Study on Application of Coordinates Transformation Methods on Parcel and Forestry Map Connection (지적도와 임야도접합을 위한 좌표변환방법 적용에 관한 연구)

  • 강준묵;조성호;김성진
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.20 no.4
    • /
    • pp.405-413
    • /
    • 2002
  • It is crucial that we should set proper standards capable of efficiently handling new corrections of maps, connections of edges on the maps, administrative districts, and inter-scale connections in order to make serial cadastral maps. This study drew a two dimensional Parameter using an indent point, as a Review Control Point, on forest screening line or boundary line of administrative district. The study also introduced a few different transformations such as Affine Transformation, N-Degree Polynomial Transformation, and Projective Transformation, the two dimensional transformation methods to apply them to the connection of cadastal·forestry maps and the connection of parcels between the administrative districts, on the forestry map designed by discretionary edges on the maps per district unit with parcel numbers and tried to apply the coordinates transformation method to connections of maps to make serial cadastral maps.

An algorithm for the image improvement in the multi-view images coding (Multi-view 영상 코딩에서 영상 개선 알고리듬)

  • 김도현;최동준;양영일
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.35S no.7
    • /
    • pp.53-61
    • /
    • 1998
  • In this paper, we propose an efficient multi-view images coding algorithm to find the optimal depth and texture from the set of multi-view images. The proposed algorithm consists of two consecutive steps, i) the depth estraction step, and ii) the texture extraction step, comparedwith the traditional algorithem which finds the depth and texture concurrently. The X-Y plane of the normalized object space is divided into traingular paatches and the Z value of the node is determined in the first step and then the texture of the each patch is extracted in the second step. In the depth extraction step, the depth of the node is determined by applying the block based disparity compensation method to the windowed area centered at the node. In the second step, the texture of the traingular patches is extracted from the multi-view images by applying the affine transformation based disparity compensation method to the traingular pateches with the depth extracted from the first step. Experimental results show that the SNR(Singnal-to- Noise Ratio) of images enconded by our algorithm is better than that of images encoded by the traditional algorithm by the amount about 4dB for for the test sets of multi-view images called dragon, kid, city and santa.

  • PDF

Image Registration for PET/CT and CT Images with Particle Swarm Optimization (Particle Swarm Optimization을 이용한 PET/CT와 CT영상의 정합)

  • Lee, Hak-Jae;Kim, Yong-Kwon;Lee, Ki-Sung;Moon, Guk-Hyun;Joo, Sung-Kwan;Kim, Kyeong-Min;Cheon, Gi-Jeong;Choi, Jong-Hak;Kim, Chang-Kyun
    • Journal of radiological science and technology
    • /
    • v.32 no.2
    • /
    • pp.195-203
    • /
    • 2009
  • Image registration is a fundamental task in image processing used to match two or more images. It gives new information to the radiologists by matching images from different modalities. The objective of this study is to develop 2D image registration algorithm for PET/CT and CT images acquired by different systems at different times. We matched two CT images first (one from standalone CT and the other from PET/CT) that contain affluent anatomical information. Then, we geometrically transformed PET image according to the results of transformation parameters calculated by the previous step. We have used Affine transform to match the target and reference images. For the similarity measure, mutual information was explored. Use of particle swarm algorithm optimized the performance by finding the best matched parameter set within a reasonable amount of time. The results show good agreements of the images between PET/CT and CT. We expect the proposed algorithm can be used not only for PET/CT and CT image registration but also for different multi-modality imaging systems such as SPECT/CT, MRI/PET and so on.

  • PDF

An Image Coding Algorithm for the Representation of the Set of the Zoom Images (Zoom 영상 표현을 위한 영상 코딩 알고리듬)

  • Jang, Bo-Hyeon;Kim, Do-Hyeon;Yang, Yeong-Il
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.38 no.5
    • /
    • pp.498-508
    • /
    • 2001
  • In this paper, we propose an efficient coding algorithm for the zoom images to find the optimal depth and texture information. The proposed algorithm is the area-based method consisting of two consecutive steps, i) the depth extraction step and ii) the texture extraction step. The X-Y plane of the object space is divided into triangular patches and the depth value of the node is determined in the first step and then the texture of the each patch is extracted in the second step. In the depth extraction step, the depth of the node is determined by applying the block-based disparity compensation method to the windowed area centered at the node. In the second step, the texture of the triangular patches is extracted from the zoom images by applying the affine transformation based disparity compensation method to the triangular patches with the depth value extracted from the first step. To improve the quality of image, the interpolation is peformed on the object space instead of the interpolation on the image plane.

  • PDF

Model based Facial Expression Recognition using New Feature Space (새로운 얼굴 특징공간을 이용한 모델 기반 얼굴 표정 인식)

  • Kim, Jin-Ok
    • The KIPS Transactions:PartB
    • /
    • v.17B no.4
    • /
    • pp.309-316
    • /
    • 2010
  • This paper introduces a new model based method for facial expression recognition that uses facial grid angles as feature space. In order to be able to recognize the six main facial expression, proposed method uses a grid approach and therefore it establishes a new feature space based on the angles that each gird's edge and vertex form. The way taken in the paper is robust against several affine transformations such as translation, rotation, and scaling which in other approaches are considered very harmful in the overall accuracy of a facial expression recognition algorithm. Also, this paper demonstrates the process that the feature space is created using angles and how a selection process of feature subset within this space is applied with Wrapper approach. Selected features are classified by SVM, 3-NN classifier and classification results are validated with two-tier cross validation. Proposed method shows 94% classification result and feature selection algorithm improves results by up to 10% over the full set of feature.

A Robust Test for Location Parameters in Multivariate Data (다변량 자료에서 위치모수에 대한 로버스트 검정)

  • So, Sun-Ha;Lee, Dong-Hee;Jung, Byoung-Cheo
    • The Korean Journal of Applied Statistics
    • /
    • v.22 no.6
    • /
    • pp.1355-1364
    • /
    • 2009
  • This work propose a robust test for location parameters in multivariate data based on MVE and MCD with the affine equivariance and the high-breakdown properties. We consider the hypothesis testing satisfying high efficiency and high test power simultaneously to bring in the one-step reweighting procedure upon high-breakdown estimators, which generally suffer from the low efficiency and, as a result, usually used only in the exploratory analysis. Monte Carlo study shows that the suggested method retains nominal significance levels and higher testing power without regard to various population distributions than a Hotelling's $T^2$ test. In an example, a data set containing known outliers does not make an influence toward our proposal, while it renders a Hotelling's $T^2$ useless.

Robust and Non-fragile $H^{\infty}$ Controller Design for Tracking Servo of Blu-ray disc Drive System (Blu-ray 디스크 드라이브 시스템 트래킹 서보시스템에 대한 견실비약성 $H^{\infty}$ 상태궤환 제어기 설계)

  • Lee, Hyung-Ho;Kim, Joon-Ki;Kim, Woon-Ki;Jo, Sang-Woo;Park, Hong-Bae
    • Journal of the Institute of Electronics Engineers of Korea SC
    • /
    • v.45 no.3
    • /
    • pp.32-41
    • /
    • 2008
  • In this paper, we describe the synthesis of robust and non-fragile $H^{\infty}$ state feedback controllers for linear systems with affine parameter uncertain tracking servo system of blu-ray disc drive, as well as static state feedback controller with polytopic uncertainty Similarity any other control system, the objective of the track-following system design for optical disc drives is to construct the system with better performance and robustness against modeling uncertainties and various disturbances. Also, the obtained condition can be rewritten as parameterized linear matrix inequalities(PLMIs), that is, LMIs whose coefficients are functions of a parameter confined to a compact set. We show that the resulting controller guarantees the asymptotic stability and disturbance attenuation of the closed loop system in spite of controller gain variations within a resulted polytopic region.

Generating a Stereoscopic Image from a Monoscopic Camera (단안 카메라를 이용한 입체영상 생성)

  • Lee, Dong-Woo;Lee, Kwan-Wook;Kim, Man-Bae
    • Journal of Broadcast Engineering
    • /
    • v.17 no.1
    • /
    • pp.17-25
    • /
    • 2012
  • In this paper, we propose a method of producing a stereoscopic image from multiple images captured from a monoscopic camera. By translating a camera in the horizontal direction, left and right images are chosen among N captured images. For this, image edges are extracted and a rotational angle is estimated from edge orientation. Also, a translational vector is also estimated from the correlation of projected image data. Then, two optimal images are chosen and subsequently compensated using the rotational angle as well as the translational vector in order to make a satisfactory stereoscopic image. The proposed method was performed on thirty-two test image set. The subjective visual fatigue test was carried out to validate the 3D quality of stereoscopic images. In terms of visual fatigue, the 3D satisfaction ratio reached approximately 84%.

Improved Method of License Plate Detection and Recognition using Synthetic Number Plate (인조 번호판을 이용한 자동차 번호인식 성능 향상 기법)

  • Chang, Il-Sik;Park, Gooman
    • Journal of Broadcast Engineering
    • /
    • v.26 no.4
    • /
    • pp.453-462
    • /
    • 2021
  • A lot of license plate data is required for car number recognition. License plate data needs to be balanced from past license plates to the latest license plates. However, it is difficult to obtain data from the actual past license plate to the latest ones. In order to solve this problem, a license plate recognition study through deep learning is being conducted by creating a synthetic license plates. Since the synthetic data have differences from real data, and various data augmentation techniques are used to solve these problems. Existing data augmentation simply used methods such as brightness, rotation, affine transformation, blur, and noise. In this paper, we apply a style transformation method that transforms synthetic data into real-world data styles with data augmentation methods. In addition, real license plate data are noisy when it is captured from a distance and under the dark environment. If we simply recognize characters with input data, chances of misrecognition are high. To improve character recognition, in this paper, we applied the DeblurGANv2 method as a quality improvement method for character recognition, increasing the accuracy of license plate recognition. The method of deep learning for license plate detection and license plate number recognition used YOLO-V5. To determine the performance of the synthetic license plate data, we construct a test set by collecting our own secured license plates. License plate detection without style conversion recorded 0.614 mAP. As a result of applying the style transformation, we confirm that the license plate detection performance was improved by recording 0.679mAP. In addition, the successul detection rate without image enhancement was 0.872, and the detection rate was 0.915 after image enhancement, confirming that the performance improved.