• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 2004년도 Proceedings of ISRS 2004
• /
• 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.

• ETRI Journal
• /
• 제37권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.

• International Journal of Internet, Broadcasting and Communication
• /
• 제15권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.

• 대한공간정보학회지
• /
• 제15권4호
• /
• pp.81-88
• /
• 2007

선형 CCD 센서에 의해 획득되는 위성영상의 기하는 프레임 카메라 영상의 기하와는 차이점을 가지고 있다. 이는 각 스캔 선마다 영상의 외부표정요소가 다르기 때문에 발생한다. 따라서 기존의 프레임 영상에 사용되었던 에피폴라 기하와는 다른 기하가 필요하게 된다. 이와 같은 관점에서, 본 연구에서는 대표적인 선형 CCD 센서를 사용하여 촬영된 IKONOS 위성영상을 이용하여 에피폴라 영상을 제작하기 위한 영상 재배열 방법에 대한 연구를 수행하였으며, 영상의 투영조건을 중심투영이 아닌 평행투영으로 간주하여 구성된 2D 부등각 센서모델을 적용하였다. 이센서 모델에 의해 구성된 에피폴라 선식으로부터 유도된 정규 매개변수와 부등각 변환을 적용하여 에피폴라 재배열영상을 제작하였다. 결과로써, 2D 부등각 센서모델의 정확도가 검증되었으며, 제작된 에피폴라 영상을 사용하여 추출된 3차원 위치정확도는 IKONOS의 RFM 위치정확도와 유사하게 도출되었다.

• 한국측량학회지
• /
• 제38권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.

• Journal of applied mathematics & informatics
• /
• 제41권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.

• 한국광학회:학술대회논문집
• /
• 한국광학회 1991년도 제6회 파동 및 레이저 학술발표회 Prodeedings of 6th Conference on Waves and Lasers
• /
• pp.156-161
• /
• 1991

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

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제15권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.

• Journal of Information Science Theory and Practice
• /
• 제7권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.

• 전자통신동향분석
• /
• 제4권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.