• Title/Summary/Keyword: invariant Laplacian

Search Result 15, Processing Time 0.025 seconds

F-TRACELESS COMPONENT OF THE CONFORMAL CURVATURE TENSOR ON KÄHLER MANIFOLD

  • Funabashi, Shoichi;Kim, Hang-Sook;Kim, Young-Mi;Pak, Jin-Suk
    • Bulletin of the Korean Mathematical Society
    • /
    • v.44 no.4
    • /
    • pp.795-806
    • /
    • 2007
  • We investigate F-traceless component of the conformal curvature tensor defined by (3.6) in $K\ddot{a}hler$ manifolds of dimension ${\geq}4$, and show that the F-traceless component is invariant under concircular change. In particular, we determine $K\ddot{a}hler$ manifolds with parallel F-traceless component and improve some theorems, provided in the previous paper([2]), which are concerned with the traceless component of the conformal curvature tensor and the spectrum of the Laplacian acting on $p(0{\leq}p{\leq}2)$-forms on the manifold by using the F-traceless component.

Scale-invariant man-made structure extraction algorithm (크기에 강인한 인공물 축출 방법)

  • Son, Kil-Ho;Kim, Sang-Hee;Lee, Yong-Woong
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2008.06c
    • /
    • pp.539-544
    • /
    • 2008
  • 이 논문에서 크기의 변화에 강인한 인공물 축출 알고리듬을 제안한다. 인공물은 크기 및 카메라 센서의 특성에 따라 영상에 다양한 크기로 나타난다. 이 논문은 이러한 크기 변화에 강인한 인공물 축출 방법을 제안한다. 우선 LoG(Laplacian of Gaussian)를 이용하여 최적의 크기를 찾아낸다. 이를 이용하여 우리는 이웃한 정보를 포함할 수 있는 MAP-MRF(Maximum A Posterior-Markov Random Field) 레이블링(Labeling) 방법을 기반으로 인공물 축출을 위한 비용함수를 제안하였다. 인공물은 서로 근처에 존재하기 때문이다. 여기서 정보 비용함수(Data cost function)는 방향 히스토그램(Orientation histogram)을 이용하여 정의하였고, 스무딩 비용함수(Smoothing cost function)는 ICM(Iterated Conditional Modes)을 이용하여 정의한다. 최종적으로 이 알고리듬을 위성영상에 적용하여 알고리듬의 성능을 증명한다.

  • PDF

Vision based place recognition using Bayesian inference with feedback of image retrieval

  • Yi, Hu;Lee, Chang-Woo
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2006.11a
    • /
    • pp.19-22
    • /
    • 2006
  • In this paper we present a vision based place recognition method which uses Bayesian method with feed back of image retrieval. Both Bayesian method and image retrieval method are based on interest features that are invariant to many image transformations. The interest features are detected using Harris-Laplacian detector and then descriptors are generated from the image patches centered at the features' position in the same manner of SIFT. The Bayesian method contains two stages: learning and recognition. The image retrieval result is fed back to the Bayesian recognition to achieve robust and confidence. The experimental results show the effectiveness of our method.

  • PDF

A Novel Automatic Block-based Multi-focus Image Fusion via Genetic Algorithm

  • Yang, Yong;Zheng, Wenjuan;Huang, Shuying
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.7
    • /
    • pp.1671-1689
    • /
    • 2013
  • The key issue of block-based multi-focus image fusion is to determine the size of the sub-block because different sizes of the sub-block will lead to different fusion effects. To solve this problem, this paper presents a novel genetic algorithm (GA) based multi-focus image fusion method, in which the block size can be automatically found. In our method, the Sum-modified-Laplacian (SML) is selected as an evaluation criterion to measure the clarity of the image sub-block, and the edge information retention is employed to calculate the fitness of each individual. Then, through the selection, crossover and mutation procedures of the GA, we can obtain the optimal solution for the sub-block, which is finally used to fuse the images. Experimental results show that the proposed method outperforms the traditional methods, including the average, gradient pyramid, discrete wavelet transform (DWT), shift invariant DWT (SIDWT) and two existing GA-based methods in terms of both the visual subjective evaluation and the objective evaluation.

A Study on the Improvement of the Facial Image Recognition by Extraction of Tilted Angle (기울기 검출에 의한 얼굴영상의 인식의 개선에 관한 연구)

  • 이지범;이호준;고형화
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.18 no.7
    • /
    • pp.935-943
    • /
    • 1993
  • In this paper, robust recognition system for tilted facial image was developed. At first, standard facial image and lilted facial image are captured by CCTV camera and then transformed into binary image. The binary image is processed in order to obtain contour image by Laplacian edge operator. We trace and delete outermost edge line and use inner contour lines. We label four inner contour lines in order among the inner lines, and then we extract left and right eye with known distance relationship and with two eyes coordinates, and calculate slope information. At last, we rotate the tilted image in accordance with slope information and then calculate the ten distance features between element and element. In order to make the system invariant to image scale, we normalize these features with distance between left and righ eye. Experimental results show 88% recognition rate for twenty five face images when tilted degree is considered and 60% recognition rate when tilted degree is not considered.

  • PDF