• Title/Summary/Keyword: Image Geometry

Search Result 534, Processing Time 0.025 seconds

Determination of Epipolar Geometry for High Resolution Satellite Images

  • Noh Myoung-Jong;Cho Woosug
    • Proceedings of the KSRS Conference
    • /
    • 2004.10a
    • /
    • pp.652-655
    • /
    • 2004
  • The geometry of satellite image captured by linear pushbroom scanner is different from that of frame camera image. Since the exterior orientation parameters for satellite image will vary scan line by scan line, the epipolar geometry of satellite image differs from that of frame camera image. As we know, 2D affine orientation for the epipolar image of linear pushbroom scanners system are well-established by using the collinearity equation (Testsu Ono, 1999). Also, another epipolar geometry of linear pushbroom scanner system is recently established by Habib(2002). He reported that the epipolar geometry of linear push broom satellite image is realized by parallel projection based on 2D affine models. Here, in this paper, we compared the Ono's method with Habib's method. In addition, we proposed a method that generates epipolar resampled images. For the experiment, IKONOS stereo images were used in generating epipolar images.

  • PDF

Sparse-View CT Image Recovery Using Two-Step Iterative Shrinkage-Thresholding Algorithm

  • Chae, Byung Gyu;Lee, Sooyeul
    • ETRI Journal
    • /
    • v.37 no.6
    • /
    • pp.1251-1258
    • /
    • 2015
  • We investigate an image recovery method for sparse-view computed tomography (CT) using an iterative shrinkage algorithm based on a second-order approach. The two-step iterative shrinkage-thresholding (TwIST) algorithm including a total variation regularization technique is elucidated to be more robust than other first-order methods; it enables a perfect restoration of an original image even if given only a few projection views of a parallel-beam geometry. We find that the incoherency of a projection system matrix in CT geometry sufficiently satisfies the exact reconstruction principle even when the matrix itself has a large condition number. Image reconstruction from fan-beam CT can be well carried out, but the retrieval performance is very low when compared to a parallel-beam geometry. This is considered to be due to the matrix complexity of the projection geometry. We also evaluate the image retrieval performance of the TwIST algorithm -sing measured projection data.

Research on the Application of Fractal Geometry in Digital Arts

  • Xinyi Shan;Jeanhun Chung
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.15 no.2
    • /
    • pp.175-180
    • /
    • 2023
  • Fractal geometry, a relatively new branch of mathematics, was first introduced by Benoit Mandelbrot in 1975. Since then, its applications have expanded into various fields of natural science. In fact, it has been recognized as one of the three significant scientific discoveries of the mid-20th century, along with the Dissipative System and Chaos Theory. With the help of fractal geometry, designers can create intricate and expressive artistic patterns, using the concept of self-similarity found in nature. The impact of fractal geometry on the digital art world is significant and its exploration could lead to new avenues for creativity and expression. This paper aims to explore and analyze the development and applications of fractal geometry in digital art design. It also aims to showcase the benefits of applying fractal geometry in art creation and paves the way for future research on sacred geometry.

Epipolar Resampling for High Resolution Satellite Imagery Based on Parallel Projection (평행투영 기반의 고해상도 위성영상 에피폴라 재배열)

  • Noh, Myoung-Jong;Cho, Woo-Sug;Chang, Hwi-Jeong;Jeong, Ji-Yeon
    • Journal of Korean Society for Geospatial Information Science
    • /
    • v.15 no.4
    • /
    • pp.81-88
    • /
    • 2007
  • The geometry of satellite image captured by linear CCD sensor is different from that of frame camera image. The fact that the exterior orientation parameters for satellite image with linear CCD sensor varies from scan line by scan line, causes the difference of image geometry between frame and linear CCD sensor. Therefore, we need the epipolar geometry for linear CCD image which differs from that of frame camera image. In this paper, we proposed a method of resampling linear CCD satellite image in epipolar geometry under the assumption that image is not formed in perspective projection but in parallel projection, and the sensor model is a 2D affine sensor model based on parallel projection. For the experiment, IKONOS stereo images, which are high resolution linear CCD images, were used and tested. As results, the spatial accuracy of 2D affine sensor model is investigated and the accuracy of epipolar resampled image with RFM was presented.

  • PDF

Improved Image Matching Method Based on Affine Transformation Using Nadir and Oblique-Looking Drone Imagery

  • Jang, Hyo Seon;Kim, Sang Kyun;Lee, Ji Sang;Yoo, Su Hong;Hong, Seung Hwan;Kim, Mi Kyeong;Sohn, Hong Gyoo
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.38 no.5
    • /
    • pp.477-486
    • /
    • 2020
  • Drone has been widely used for many applications ranging from amateur and leisure to professionals to get fast and accurate 3-D information of the surface of the interest. Most of commercial softwares developed for this purpose are performing automatic matching based on SIFT (Scale Invariant Feature Transform) or SURF (Speeded-Up Robust Features) using nadir-looking stereo image sets. Since, there are some situations where not only nadir and nadir-looking matching, but also nadir and oblique-looking matching is needed, the existing software for the latter case could not get good results. In this study, a matching experiment was performed to utilize images with differences in geometry. Nadir and oblique-looking images were acquired through drone for a total of 2 times. SIFT, SURF, which are feature point-based, and IMAS (Image Matching by Affine Simulation) matching techniques based on affine transformation were applied. The experiment was classified according to the identity of the geometry, and the presence or absence of a building was considered. Images with the same geometry could be matched through three matching techniques. However, for image sets with different geometry, only the IMAS method was successful with and without building areas. It was found that when performing matching for use of images with different geometry, the affine transformation-based matching technique should be applied.

MEDICAL IMAGE ANALYSIS USING HIGH ANGULAR RESOLUTION DIFFUSION IMAGING OF SIXTH ORDER TENSOR

  • K.S. DEEPAK;S.T. AVEESH
    • Journal of applied mathematics & informatics
    • /
    • v.41 no.3
    • /
    • pp.603-613
    • /
    • 2023
  • In this paper, the concept of geodesic centered tractography is explored for diffusion tensor imaging (DTI). In DTI, where geodesics has been tracked and the inverse of the fourth-order diffusion tensor is inured to determine the diversity. Specifically, we investigated geodesic tractography technique for High Angular Resolution Diffusion Imaging (HARDI). Riemannian geometry can be extended to a direction-dependent metric using Finsler geometry. Euler Lagrange geodesic calculations have been derived by Finsler geometry, which is expressed as HARDI in sixth order tensor.

Study of real image reconstruction by hologram (홀로그램의 실상 재생 geometry 연구)

  • 백성훈
    • Proceedings of the Optical Society of Korea Conference
    • /
    • 1991.06a
    • /
    • pp.156-161
    • /
    • 1991
  • 결상 홀로그램(image hologram)을 제작할 때 물체의 실상을 얻는 방법으로는 렌즈 등의 광학계를 이용하거나 다른 홀로그램에서 재생된 실상을 이용하는 방법 등이 있다. 본 연구에서는 결상 홀로그램을 제작하기 위하여 홀로그램에서 실상을 재생할 때, 재생빔으로 diverging spherical wave를 사용하는 geometry를 제안하고 문제점-재생된 실상의 상배를 변화와 홀로그램 수차들을 논의하였다.

  • PDF

Adaptive Algorithm in Image Reconstruction Based on Information Geometry

  • Wang, Meng;Ning, Zhen Hu;Yu, Jing;Xiao, Chuang Bai
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.2
    • /
    • pp.461-484
    • /
    • 2021
  • Compressed sensing in image reconstruction has attracted attention and many studies are proposed. As we know, adding prior knowledge about the distribution of the support on the original signal to CS can improve the quality of reconstruction. However, it is still difficult for a recovery framework adjusts its strategy for exploiting the prior knowledge efficiently according to the current estimated signals in serial iterations. With the theory of information geometry, we propose an adaptive strategy based on the current estimated signal in each iteration of the recovery. We also improve the performance of existing algorithms through the adaptive strategy for exploiting the prior knowledge according to the current estimated signal. Simulations are presented to validate the results. In the end, we also show the application of the model in the image.

Facial Data Visualization for Improved Deep Learning Based Emotion Recognition

  • Lee, Seung Ho
    • Journal of Information Science Theory and Practice
    • /
    • v.7 no.2
    • /
    • pp.32-39
    • /
    • 2019
  • A convolutional neural network (CNN) has been widely used in facial expression recognition (FER) because it can automatically learn discriminative appearance features from an expression image. To make full use of its discriminating capability, this paper suggests a simple but effective method for CNN based FER. Specifically, instead of an original expression image that contains facial appearance only, the expression image with facial geometry visualization is used as input to CNN. In this way, geometric and appearance features could be simultaneously learned, making CNN more discriminative for FER. A simple CNN extension is also presented in this paper, aiming to utilize geometric expression change derived from an expression image sequence. Experimental results on two public datasets (CK+ and MMI) show that CNN using facial geometry visualization clearly outperforms the conventional CNN using facial appearance only.

Parallel Computing For Computational Geometry (컴퓨터 기하학을 위한 병렬계산)

  • O, Seung-Jun
    • Electronics and Telecommunications Trends
    • /
    • v.4 no.1
    • /
    • pp.93-117
    • /
    • 1989
  • Computational Geometry is concerned with the design and analysis of computational algorithms which solve geometry problems. Geometry problems have a large number of applications areas such as pattern recognition, image processing, computer graphics, VLSI design and statistics since they involve inherently geometric problems for which efficient algorithms have to be developed. Several parallel algorithms, based on various parallel computation models, have been proposed for solving geometric problems. We review the current status of the parallel algorithms in computational geometry.