• Title/Summary/Keyword: Model matching

Search Result 1,371, Processing Time 0.024 seconds

Measurement Accuracy for 3D Structure Shape Change using UAV Images Matching (UAV 영상정합을 통한 구조물 형상변화 측정 정확도 연구)

  • Kim, Min Chul;Yoon, Hyuk Jin;Chang, Hwi Jeong;Yoo, Jong Soo
    • Journal of Korean Society for Geospatial Information Science
    • /
    • v.25 no.1
    • /
    • pp.47-54
    • /
    • 2017
  • Recently, there are many studies related aerial mapping project and 3 dimensional shape and model reconstruction using UAV(unmanned aerial vehicle) system and images. In this study, we create 3D reconstruction point data using image matching technology of the UAV overlap images, detect shape change of structure and perform accuracy assessment of area($m^2$) and volume($m^3$) value. First, we build the test structure model data and capturing its images of shape change Before and After. Second, for post-processing the Before dataset is convert the form of raster format image to ensure the compare with all 3D point clouds of the After dataset. The result shows high accuracy in the shape change of more than 30 centimeters, but less is still it becomes difficult to apply because of image matching technology has its own limits. But proposed methodology seems very useful to detect illegal any structures and the quantitative analysis of the structure's a certain amount of damage and management.

Determination of Spatial Resolution to Improve GCP Chip Matching Performance for CAS-4 (농림위성용 GCP 칩 매칭 성능 향상을 위한 위성영상 공간해상도 결정)

  • Lee, YooJin;Kim, Taejung
    • Korean Journal of Remote Sensing
    • /
    • v.37 no.6_1
    • /
    • pp.1517-1526
    • /
    • 2021
  • With the recent global and domestic development of Earth observation satellites, the applications of satellite images have been widened. Research for improving the geometric accuracy of satellite images is being actively carried out. This paper studies the possibility of automated ground control point (GCP) generation for CAS-4 satellite, to be launched in 2025 with the capability of image acquisition at 5 m ground sampling distance (GSD). In particular, this paper focuses to check whether GCP chips with 25 cm GSD established for CAS-1 satellite images can be used for CAS-4 and to check whether optimalspatial resolution for matching between CAS-4 images and GCP chips can be determined to improve matching performance. Experiments were carried out using RapidEye images, which have similar GSD to CAS-4. Original satellite images were upsampled to make satellite images with smaller GSDs. At each GSD level, up-sampled satellite images were matched against GCP chips and precision sensor models were estimated. Results shows that the accuracy of sensor models were improved with images atsmaller GSD compared to the sensor model accuracy established with original images. At 1.25~1.67 m GSD, the accuracy of about 2.4 m was achieved. This finding lead that the possibility of automated GCP extraction and precision ortho-image generation for CAS-4 with improved accuracy.

Flexible Integration of Models and Solvers for Intuitive and User-Friendly Model-Solution in Decision Support Systems (의사결정지원시스템에서 직관적이고 사용자 친숙한 모델 해결을 위한 모델과 솔버의 유연한 통합에 대한 연구)

  • Lee Keun-Woo;Huh Soon-Young
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.30 no.1
    • /
    • pp.75-94
    • /
    • 2005
  • Research in the decision sciences has continued to develop a variety of mathematical models as well as software tools supporting corporate decision-making. Yet. in spite of their potential usefulness, the models are little used in real-world decision making since the model solution processes are too complex for ordinary users to get accustomed. This paper proposes an intelligent and flexible model-solver integration framework that enables the user to solve decision problems using multiple models and solvers without having precise knowledge of the model-solution processes. Specifically, for intuitive model-solution, the framework enables a decision support system to suggest the compatible solvers of a model autonomously without direct user intervention and to solve the model by matching the model and solver parameters intelligently without any serious conflicts. Thus, the framework would improve the productivity of institutional model solving tasks by relieving the user from the burden of leaning model and solver semantics requiring considerable time and efforts.

A Fast Sub-pel Motion Estimation Scheme using a Parabolic SAD Model

  • Ahn, Sang-Soo;Lee, Bum-Shik;Kim, Mun-Churl;Park, Chang-Seob;Hahm, Sang-Jin;Cho, In-Jun
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2009.01a
    • /
    • pp.321-325
    • /
    • 2009
  • Sub-pel level motion estimation contributes to significant increase in R-D performance for H.264|MPEG 4 Part 10 AVC. However, several supplements, such as interpolation, block matching, and Hadamard transform which entails large computational complexity of encoding process, are essential to find best matching block in sub-pel level motion estimation and compensation. In this paper, a fast motion estimation scheme in sub-pel accuracy is proposed based on a parabolic model of SAD to avoid such computational complexity. In the proposed scheme, motion estimation (ME) is only performed in integer-pel levels and the following sub-pel level motion vectors are found from the parametric SAD model for which the model parameters are estimated from the SAD values obtained in the integer-pel levels. Fall-back check is performed to ensure the validity of the parabolic SAD model with the estimated parameters. The experiment result shows that the proposed scheme can reduce the motion estimation time up to about 30% of the total ME times in average with negligible amount of PSNR drops (0.14dB in maximum) and bit increments (2.54%in maximum).

  • PDF

Facial Texture Generation using an Image Registration Algorithm based on Ellipsoidal Prototype Model (타원체형 모델 기반의 영상정렬 알고리즘을 이용한 얼굴 텍스쳐 생성)

  • Lee Joong Jae;Noh Myung Woo;Choi Hyung Il
    • Journal of KIISE:Software and Applications
    • /
    • v.32 no.1
    • /
    • pp.22-33
    • /
    • 2005
  • In this paper. we propose an image registration algorithm based on variable-sized blocks of ellipsoidal prototype model which is similar in shape to human face. While matching blocks, the existing cylindrical prototype model which only takes into account left and right curvature can accomplish a correct alignment on left and right images. But, registration errors are produced from up and down images because the cylindrical prototype model not reflects characteristics of head shape and jaw structure of human. The proposed method is a block matching algorithm which uses variable-sized blocks with considering left-right and up-down curvature of ellipsoidal face model and can correctly align images by using the correlation between them. We then adapt image mosaic technique to generate a face texture from aligned images. For this purpose, we stitch them with assigning linear weights according to the overlapped region and remove ghost effects to make more realistic facial texture.

Group-Sparse Channel Estimation using Bayesian Matching Pursuit for OFDM Systems

  • Liu, Yi;Mei, Wenbo;Du, Huiqian
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.2
    • /
    • pp.583-599
    • /
    • 2015
  • We apply the Bayesian matching pursuit (BMP) algorithm to the estimation of time-frequency selective channels in orthogonal frequency division multiplexing (OFDM) systems. By exploiting prior statistics and sparse characteristics of propagation channels, the Bayesian method provides a more accurate and efficient detection of the channel status information (CSI) than do conventional sparse channel estimation methods that are based on compressive sensing (CS) technologies. Using a reasonable approximation of the system model and a skillfully designed pilot arrangement, the proposed estimation scheme is able to address the Doppler-induced inter-carrier interference (ICI) with a relatively low complexity. Moreover, to further reduce the computational cost of the channel estimation, we make some modifications to the BMP algorithm. The modified algorithm can make good use of the group-sparse structure of doubly selective channels and thus reconstruct the CSI more efficiently than does the original BMP algorithm, which treats the sparse signals in the conventional manner and ignores the specific structure of their sparsity patterns. Numerical results demonstrate that the proposed Bayesian estimation has a good performance over rapidly time-varying channels.

A Flexible Feature Matching for Automatic Facial Feature Points Detection (얼굴 특징점 자동 검출을 위한 탄력적 특징 정합)

  • Hwang, Suen-Ki;Bae, Cheol-Soo
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.3 no.2
    • /
    • pp.12-17
    • /
    • 2010
  • An automatic facial feature points(FFPs) detection system is proposed. A face is represented as a graph where the nodes are placed at facial feature points(FFPs) labeled by their Gabor features and the edges are describes their spatial relations. An innovative flexible feature matching is proposed to perform features correspondence between models and the input image. This matching model works likes random diffusion process in the image space by employing the locally competitive and globally corporative mechanism. The system works nicely on the face images under complicated background, pose variations and distorted by facial accessories. We demonstrate the benefits of our approach by its implementation on the system.

  • PDF

A flexible Feature Matching for Automatic Face and Facial Feature Points Detection (얼굴과 얼굴 특징점 자동 검출을 위한 탄력적 특징 정합)

  • 박호식;배철수
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.7 no.4
    • /
    • pp.705-711
    • /
    • 2003
  • An automatic face and facial feature points(FFPs) detection system is proposed. A face is represented as a graph where the nodes are placed at facial feature points(FFPs) labeled by their Gabor features and the edges are describes their spatial relations. An innovative flexible feature matching is proposed to perform features correspondence between models and the input image. This matching model works likes random diffusion process in !be image space by employing the locally competitive and globally corporative mechanism. The system works nicely on the face images under complicated background, pose variations and distorted by facial accessories. We demonstrate the benefits of our approach by its implementation on the face identification system.

A Study on the Hair Line detection Using Feature Points Matching in Hair Beauty Fashion Design (헤어 뷰티 패션 디자인 선별을 위한 특징 점 정합을 이용한 헤어 라인 검출)

  • 송선희;나상동;배용근
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.7 no.5
    • /
    • pp.934-940
    • /
    • 2003
  • In this paper, hair beauty fashion design feature points detection system is proposed. A hair models and hair face is represented as a graph where the nodes are placed at facial feature points labeled by their Gabor features and the edges are describes their spatial relations. An innovative flexible feature matching is proposed to perform features correspondence between hair models and the input image. This matching hair model works like random diffusion process in the image space by employing the locally competitive and globally corporative mechanism. The system works nicely on the face images under complicated background. pose variations and distorted by accessories. We demonstrate the benefits of our approach by its implementation on the face identification system.

A methodology for the standardization of structural design document structure using XML schema matching technique (XML 스키마 매칭 기법을 이용한 구조설계 문서구조 표준화 방법론)

  • Kim Bong-Geun;Jeong Yeon-Suk;Kim Dong-Hyun;Lee Sang-Ho
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 2006.04a
    • /
    • pp.200-207
    • /
    • 2006
  • A new formal standardization methodology of the structural design document information is proposed in this paper. The standardization process is divided into three steps: pre-process of the collected sample document (CSD), construction of the document structure, and definition of the occurrence of each element in the document. During the pre-process, the detail document contents in the CSD are indexed with templates defined in this study, and the indexed CSD is translated into XML Schema (XSD) formal Afterwards the degree of confidences of all elements between the temporary standard document (TSD) and the translated CSD are calculated by using the XML schema matching algorithm; the TSD is then updated. This second step is repeated until all of the CSD are compared. In the final step, the common elements and unbounded elements are extracted by determining the occurrence of the temporary document elements, and the standardized document schema is exported in the XSD format. The case study dealing with the structural calculation documents show that the ,proposed methodology can be effectively used to build a XML -based information model of structural design documents.

  • PDF