• 제목/요약/키워드: invariant

Search Result 2,151, Processing Time 0.027 seconds

Regression Testing of Software Evolution by AOP (AOP를 이용하여 진화된 프로그램의 회귀테스트 기법)

  • Lee, Mi-Jin;Choi, Eun-Man
    • The KIPS Transactions:PartD
    • /
    • v.15D no.4
    • /
    • pp.495-504
    • /
    • 2008
  • Aspect Oriented Programming(AOP) is a relatively new programming paradigm and has properties that other programming paradigms don't have. This new programming paradigm provides new modularization of software systems by cross-cutting concerns. In this paper, we propose a regression test method for program evolution by AOP. By using JoinPoint, we can catch a pointcut-name which makes it possible to test the incorrect pointcut strength fault and the incorrect aspect precedence fault. Through extending proof rules to aspect, we can recognize failures to establish expected postconditions faults. We can also trace variables using set() and get() pointcut and test failures to preserve state invariant fault. Using control flow graph, we can test incorrect changes in control dependencies faults. In order to show the correctness of our proposed method, channel management system is implemented and tested by using proposed methods.

An acoustic channel estimation using least mean fourth with an average gradient vector and a self-adjusted step size (기울기 평균 벡터를 사용한 가변 스텝 최소 평균 사승을 사용한 음향 채널 추정기)

  • Lim, Jun-Seok
    • The Journal of the Acoustical Society of Korea
    • /
    • v.37 no.3
    • /
    • pp.156-162
    • /
    • 2018
  • The LMF (Least Mean Fourth) algorithm is well known for its fast convergence and low steady-state error especially in non-Gaussian noise environments. Recently, there has been increasing interest in the LMS (Least Mean Square) algorithms with self-adjusted step size. It is because the self-adjusted step-size LMS algorithms have shown to outperform the conventional fixed step-size LMS in the various situations. In this paper, a self-adjusted step-size LMF algorithm is proposed, which adopts an averaged gradient based step size as a self-adjusted step size. It is expected that the proposed algorithm also outperforms the conventional fixed step-size LMF. The superiority of the proposed algorithm is confirmed by the simulations in the time invariant and time variant channels.

The ionization chamber response function from the measured and the corrected by Monte Carlo simulation. (측정된 원통형 전리함 반응함수의 몬테카를로 시뮬레이션 보정)

  • 이병용;김미화;조병철;나상균;김종훈;최은경;장혜숙
    • Progress in Medical Physics
    • /
    • v.7 no.1
    • /
    • pp.9-17
    • /
    • 1996
  • The response function of ionization chambers are measured in the narrow radiation field Nominal photon energies are 4MV, 6MV and 15MV. the Radii of the chambers are 0.5cm~3.05cm and the field size is 0.2$\times$20$\textrm{cm}^2$. The measurements are taken in the water phantom at 10cm depth. The beam kernel (radiation distribution profile) for narrow radiation field in the phantom are obtained from Monte Carlo simulation (EGS4, Electron Gamma Shower 4). The beam kernel components in the measured chamber response function are deconvolved in order to get the ideal chamber response function of the $\delta$-shaped function radiation field. The chamber response functions have energy dependent tendency before deconvolution, while they show energy invariant properties, after the components of beam kernels are removed by deconvolution method.

  • PDF

A Fingerprint Identification System using Large Database (대용량 DB를 사용한 지문인식 시스템)

  • Cha, Jeong-Hee;Seo, Jeong-Man
    • Journal of the Korea Society of Computer and Information
    • /
    • v.10 no.4 s.36
    • /
    • pp.203-211
    • /
    • 2005
  • In this paper, we propose a new automatic fingerprint identification system that identifies individuals in large databases. The algorithm consists of three steps; preprocessing, classification, and matching, in the classification. we present a new classification technique based on the statistical approach for directional image distribution. In matching, we also describe improved minutiae candidate pair extraction algorithm that is faster and more accurate than existing algorithm. In matching stage, we extract fingerprint minutiaes from its thinned image for accuracy, and introduce matching process using minutiae linking information. Introduction of linking information into the minutiae matching process is a simple but accurate way, which solves the problem of reference minutiae pair selection in comparison stage of two fingerprints quickly. This algorithm is invariant to translation and rotation of fingerprint. The proposed system was tested on 1000 fingerprint images from the semiconductor chip style scanner. Experimental results reveal false acceptance rate is decreased and genuine acceptance rate is increased than existing method.

  • PDF

CBIRS/TB Using Color Feature Information for A tablet Recognition (알약 인식을 위해 색 특징정보를 이용한 CBIRS/TB)

  • Koo, Gun-Seo
    • Journal of the Korea Society of Computer and Information
    • /
    • v.19 no.2
    • /
    • pp.49-56
    • /
    • 2014
  • This thesis proposes CBIRS/TB method that uses a tablet's color distribution information and form distinctive in content-based search. CBIRS/TB can avoid misuses and improper tablet uses by conducting content-based search in commonly prescribed tablets. The existing FE-CBIRS system is limited to recognizing only the image of color and shape of the tablet, that leads to applying insufficient form-specific information. While CBIRS/TB utilizes average, standard deviation, hue and saturation of each tablets in color, brightness, and contrast, FE-CBIRS has partial-sphere application problem; only applying the typical color of the tablet. Also, in case of the shape-specific-information, Invariant Moment is mainly used for the extracted partial-spheres. This causes delayed processing time and accuracy problems. Therefore, to improve this setback, this thesis indexed color-specific-information of the extracted images into categorized classification for improved search speed and accuracy.

Parameterized Modeling of Spatially Varying PSF for Lens Aberration and Defocus

  • Wang, Chao;Chen, Juan;Jia, Hongguang;Shi, Baosong;Zhu, Ruifei;Wei, Qun;Yu, Linyao;Ge, Mingda
    • Journal of the Optical Society of Korea
    • /
    • v.19 no.2
    • /
    • pp.136-143
    • /
    • 2015
  • Image deblurring by a deconvolution method requires accurate knowledge of the blur kernel. Existing point spread function (PSF) models in the literature corresponding to lens aberrations and defocus are either parameterized and spatially invariant or spatially varying but discretely defined. In this paper, a parameterized model is developed and presented for a PSF which is spatially varying due to lens aberrations and defocus in an imaging system. The model is established from the Seidel third-order aberration coefficient and the Hu moment. A skew normal Gauss model is selected for parameterized PSF geometry structure. The accuracy of the model is demonstrated with simulations and measurements for a defocused infrared camera and a single spherical lens digital camera. Compared with optical software Code V, the visual results of two optical systems validate our analysis and proposed method in size, shape and direction. Quantitative evaluation results reveal the excellent accuracy of the blur kernel model.

Face Recognition under Varying Pose using Local Area obtained by Side-view Pose Normalization (측면 포즈정규화를 통한 부분 영역을 이용한 포즈 변화에 강인한 얼굴 인식)

  • Ahn, Byeong-Doo;Ko, Han-Seok
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.42 no.4 s.304
    • /
    • pp.59-68
    • /
    • 2005
  • This paper proposes a face recognition under varying poses using local area obtained by side-view pose normalization. General normalization methods for face recognition under varying pose have a problem with the information about invisible area of face. Generally this problem is solved by compensation, but there are many cases where the image is distorted or features lost due to compensation .To solve this problem we normalize the face pose in side-view to reduce distortion that happens mainly in areas that have large depth variation. We only use undistorted area, removing the area that has been distorted by normalization. We consider two cases of yaw pose variation and pitch pose variation, and by experiments, we confirm the improvement of recognition performance.

Recognition of Printed Hangul Text Using Circular Pattern Vectors (원형 패턴 벡터를 이용한 인쇄체 한글 인식)

  • Jeong, Ji-Ho;Choe, Tae-Yeong
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.38 no.3
    • /
    • pp.269-281
    • /
    • 2001
  • This thesis deals with a novel font-dependent Hangul recognition algorithm invariant to position translation, scaling, and rotation using circular pattern vectors. The proposed algorithm removes noise from input letters using binary morphology and generates the circular pattern vectors. The generated circular pattern vectors represent spatial distributions on several concentric circles from the center of gravity in a given letter. Then the algorithm selects the letter minimizing the distance between the reference vectors and the generated circular pattern vectors. In order to estimate performances of the proposed algorithm, the completed Batang Hangul 2,350 letters were used as test images with scaling and rotational transformations. Experimental results show that the proposed algorithm are better than conventional algorithm using the ring projection in the recognition rates of Hangul letters with scaling and rotational transformation.

  • PDF

Ringing Artifact Removal in Image Restoration Using Wavelet Transform (웨이블릿 변환을 이용한 영상복원의 물결현상 제거 방법)

  • Youn, Jin-Young;Yoo, Yoon-Jong;Jun, Sin-Young;Shin, Jeong-Ho;Paik, Joon-Ki
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.45 no.6
    • /
    • pp.78-87
    • /
    • 2008
  • Digital image find own level core media in multimedia as image restoration technology fields, which remove degradation factor for image enhancement, have been growing. Linear space-invariant image restoration algorithm often introduce ringing artifacts near sharp intensity transition areas. This paper presents a new adaptive post-filtering algorithm for reducing ringing artifact. The proposed method extracts an edge map of the image using wavelet transform Based on the edge information, ringing artifacts are detected, and removed by an adaptive bilateral filter. Experimental results show that the proposed algorithm can efficiently remove ringing artifacts with edge preservation.

GAN-based Image-to-image Translation using Multi-scale Images (다중 스케일 영상을 이용한 GAN 기반 영상 간 변환 기법)

  • Chung, Soyoung;Chung, Min Gyo
    • The Journal of the Convergence on Culture Technology
    • /
    • v.6 no.4
    • /
    • pp.767-776
    • /
    • 2020
  • GcGAN is a deep learning model to translate styles between images under geometric consistency constraint. However, GcGAN has a disadvantage that it does not properly maintain detailed content of an image, since it preserves the content of the image through limited geometric transformation such as rotation or flip. Therefore, in this study, we propose a new image-to-image translation method, MSGcGAN(Multi-Scale GcGAN), which improves this disadvantage. MSGcGAN, an extended model of GcGAN, performs style translation between images in a direction to reduce semantic distortion of images and maintain detailed content by learning multi-scale images simultaneously and extracting scale-invariant features. The experimental results showed that MSGcGAN was better than GcGAN in both quantitative and qualitative aspects, and it translated the style more naturally while maintaining the overall content of the image.