• Title/Summary/Keyword: invariance

Search Result 356, Processing Time 0.022 seconds

THE NIELSEN ROOT NUMBET FOR THE COMPLEMENT

  • Yang, Ki-Yeol
    • The Pure and Applied Mathematics
    • /
    • v.8 no.1
    • /
    • pp.61-69
    • /
    • 2001
  • The purpose of this paper is to introduce the Nielsen root number for the complement N(f:X-A,c) which shares such properties with the Nielsen root number N(f;c) as lower bound and homotopy invariance.

  • PDF

H-Closed Spaces and W-Lindelöf Spaces

  • Park, Jong-Suh
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.1 no.1
    • /
    • pp.55-64
    • /
    • 1988
  • We introduce the concept of a w-Lindel$\ddot{o}$f space which is a more general concept than that of a Lindel$\ddot{o}$f spaces. We obtain some characterization about H-closed sapces and w-Lindel$\ddot{o}$f spaces. Also, we investigate their invariance properties.

  • PDF

Scale Invariant Auto-context for Object Segmentation and Labeling

  • Ji, Hongwei;He, Jiangping;Yang, Xin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.8
    • /
    • pp.2881-2894
    • /
    • 2014
  • In complicated environment, context information plays an important role in image segmentation/labeling. The recently proposed auto-context algorithm is one of the effective context-based methods. However, the standard auto-context approach samples the context locations utilizing a fixed radius sequence, which is sensitive to large scale-change of objects. In this paper, we present a scale invariant auto-context (SIAC) algorithm which is an improved version of the auto-context algorithm. In order to achieve scale-invariance, we try to approximate the optimal scale for the image in an iterative way and adopt the corresponding optimal radius sequence for context location sampling, both in training and testing. In each iteration of the proposed SIAC algorithm, we use the current classification map to estimate the image scale, and the corresponding radius sequence is then used for choosing context locations. The algorithm iteratively updates the classification maps, as well as the image scales, until convergence. We demonstrate the SIAC algorithm on several image segmentation/labeling tasks. The results demonstrate improvement over the standard auto-context algorithm when large scale-change of objects exists.

Smoke Detection Method Using Local Binary Pattern Variance in RGB Contrast Imag (RGB Contrast 영상에서의 Local Binary Pattern Variance를 이용한 연기검출 방법)

  • Kim, Jung Han;Bae, Sung-Ho
    • Journal of Korea Multimedia Society
    • /
    • v.18 no.10
    • /
    • pp.1197-1204
    • /
    • 2015
  • Smoke detection plays an important role for the early detection of fire. In this paper, we suggest a newly developed method that generated LBPV(Local Binary Pattern Variance)s as special feature vectors from RGB contrast images can be applied to detect smoke using SVM(Support Vector Machine). The proposed method rearranges mean value of the block from each R, G, B channel and its intensity of the mean value. Additionally, it generates RGB contrast image which indicates each RGB channel’s contrast via smoke’s achromatic color. Uniform LBPV, Rotation-Invariance LBPV, Rotation-Invariance Uniform LBPV are applied to RGB Contrast images so that it could generate feature vector from the form of LBP. It helps to distinguish between smoke and non smoke area through SVM. Experimental results show that true positive detection rate is similar but false positive detection rate has been improved, although the proposed method reduced numbers of feature vector in half comparing with the existing method with LBP and LBPV.

Construction of Intensity-Duration-Frequency Curve Using a Spatial-Temporal Downscaling Approach of GCM (GCM의 시간적, 공간적 축소화기법 이용한 미래의 IDF곡선 생성)

  • Oh, Jin-Ho;Chung, Eun Sung;Lee, Kil Seong
    • 한국방재학회:학술대회논문집
    • /
    • 2011.02a
    • /
    • pp.175-175
    • /
    • 2011
  • IDF 곡선은 수리구조물의 설계에 이용되며 본 연구에서는 기후변화를 고려한 GCM의 시간적 공간적 축소화기법을 통하여 미래의 IDF 곡선을 생성하였다. GCM자료로는 HadCM3과 CGCM3의 지역주의와 경제발전을 지향하는 A2시나리오를 이용하였다. GCM자료에 대한 공간적인 축소화기법으로 다중회귀 모형인 SDSM(Statistical DownScaling Model)을 이용하여 2030년, 2050년, 2080년의 미래의 일강우 자료를 생성하였다. 이를 다시 시간적 축소화기법인 GEV분포를 이용한 Scaling-Invariance기법을 적용하여 시단위의 강우자료를 생성하였다. 이를 통해 최종적으로 HadCM3과 CGCM3에 대한 각각 미래의 IDF곡선을 생성하였다. CGCM3의 경우 지속적인 강우강도의 증가를 보였지만 HadCM3의 경우 2050년대 감소하다 2080년대 다시 증가하는 양상을 보였다. 또한 CGCM3의 경우 HadCM3의 경우보다 좀 더 높은 강우 강도를 보였다. 본 연구의 대상지역은 서울지역이며 생성된 자료의 신뢰성을 확보하기위하여 서울기상관측소의 1961년부터~2000년까지의 일단위 강우자료를 이용하여 검 보정을 수행하였다.

  • PDF

On Estimating the Incident Angles of Wide Band Signals in Low SNR Environment (신호 대 잡음비가 낮은 경우 광대역 신호의 입사각 추정)

  • Jo, Jeong-Gwon;Hwang, Yeong-Su;Cha, Il-Hwan;Yun, Dae-Hui
    • The Journal of the Acoustical Society of Korea
    • /
    • v.8 no.4
    • /
    • pp.44-52
    • /
    • 1989
  • The UCERSS (Unit Circle Eigendecomposition Rational Signal Subspace) algorithm has extended MUSIC (MUltiple Signal Classification ) by using eigendecomposition on the unit circle in order to estimate incident angles of multiple wide band signals. The purpose of this thesis is to further extend the UCERSS to be able to estimate the direction of arrivals of multiple wide band signals in very low SNR . The wide band ESPRIT (Estimation of Signal Parameter via Rotational Invariance Technique) uses covariance difference matrices to reduce noise components. In this paper the wide band ESPRIT which combines the ideas of UCERSS and ESPRIT Is proposed. Computer simulation results Indicate that the performances of the proposed approaches are superior to those of the UCERSS in very low SNR.

  • PDF

Robust-to-rotation Iris Recognition Using Local Gradient Orientation Histogram (국부적 그래디언트 방향 히스토그램을 이용한 회전에 강인한 홍채 인식)

  • Choi, Chang-Soo;Jun, Byoung-Min
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.3C
    • /
    • pp.268-273
    • /
    • 2009
  • Iris recognition is a biometric technology which can identify a person using the iris pattern. It is important for the iris recognition system to extract the feature which is invariant to changes in iris patterns. Those changes can be occurred by the influence of lights, changes in the size of the pupil, and head tilting. In this paper, we propose a novel method based on local gradient orientation histogram which is robust to variations in illumination and rotations of iris patterns. The proposed method enables high-speed feature extraction and feature comparison because it requires no additional processing to obtain the rotation invariance, and shows comparable performance to the well-known previous methods.

The Three Directional Separable Processing Method for Double-Density Wavelet Transformation Improvement (이중 밀도 웨이브렛 변환의 성능 향상을 위한 3방향 분리 처리 기법)

  • Shin, Jong Hong
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.8 no.2
    • /
    • pp.131-143
    • /
    • 2012
  • This paper introduces the double-density discrete wavelet transform using 3 direction separable processing method, which is a discrete wavelet transform that combines the double-density discrete wavelet transform and quincunx sampling method, each of which has its own characteristics and advantages. The double-density discrete wavelet transform is nearly shift-invariant. But there is room for improvement because not all of the wavelets are directional. That is, although the double-density DWT utilizes more wavelets, some lack a dominant spatial orientation, which prevents them from being able to isolate those directions. The dual-tree discrete wavelet transform has a more computationally efficient approach to shift invariance. Also, the dual-tree discrete wavelet transform gives much better directional selectivity when filtering multidimensional signals. But this transformation has more cost complexity Because it needs eight digital filters. Therefor, we need to hybrid transform which has the more directional selection and the lower cost complexity. A solution to this problem is a the double-density discrete wavelet transform using 3 direction separable processing method. The proposed wavelet transformation services good performance in image and video processing fields.

Dual-tree Wavelet Discrete Transformation Using Quincunx Sampling For Image Processing (디지털 영상 처리를 위한 Quincunx 표본화가 사용된 이중 트리 이산 웨이브렛 변환)

  • Shin, Jong Hong
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.7 no.4
    • /
    • pp.119-131
    • /
    • 2011
  • In this paper, we explore the application of 2-D dual-tree discrete wavelet transform (DDWT), which is a directional and redundant transform, for image coding. DDWT main property is a more computationally efficient approach to shift invariance. Also, the DDWT gives much better directional selectivity when filtering multidimensional signals. The dual-tree DWT of a signal is implemented using two critically-sampled DWTs in parallel on the same data. The transform is 2-times expansive because for an N-point signal it gives 2N DWT coefficients. If the filters are designed is a specific way, then the sub-band signals of the upper DWT can be interpreted as the real part of a complex wavelet transform, and sub-band signals of the lower DWT can be interpreted as the imaginary part. The quincunx lattice is a sampling method in image processing. It treats the different directions more homogeneously than the separable two dimensional schemes. Quincunx lattice yields a non separable 2D-wavelet transform, which is also symmetric in both horizontal and vertical direction. And non-separable wavelet transformation can generate sub-images of multiple degrees rotated versions. Therefore, non-separable image processing using DDWT services good performance.