• 제어로봇시스템학회논문지
• /
• 제10권10호
• /
• pp.855-868
• /
• 2004

There are several types of singularities in controlling robotic manipulators: kinematic singularity, algorithmic singularity, semi-kinematic singularity, semi-algorithmic singularity, and representation singularity. The kinematic and algorithmic singularities have been investigated intensively because they are not predictable or difficult to avoid. The problem with these singularities is an unnecessary performance reduction in non-singular region and the difficulty in performance tuning. Tn this paper, we propose a method of avoiding kinematic and algorithmic singularities by applying a task reconstruction approach while maximizing the task performance by calculating singularity measures. The proposed method is implemented by removing the component approaching the singularity calculated by using singularity measure in real time. The outstanding feature of the proposed task reconstruction method (TR-method) is that it is based on a local task reconstruction as opposed to the local joint reconstruction of many other approaches. And, this method has dynamic task priority assignment feature which ensures the system stability under singular regions owing to the change of task priority. The TR-method enables us to increase the task controller gain to improve the task performance whereas this increase can destabilize the system for the conventional algorithms in real experiments. In addition, the physical meaning of tuning parameters is very straightforward. Hence, we can maximize task performance even near the singular region while simultaneously obtaining the singularity-free motion. The advantage of the proposed method is experimentally tested by using the 7-dof spatial manipulator, and the result shows that the new method improves the performance several times over the existing algorithms.

• 한국통신학회논문지
• /
• 제27권6A호
• /
• pp.610-617
• /
• 2002

본 논문에서는 적응적 변이추정 기법을 이용한 새로운 중간시점영상합성 방법을 제시하였다. 즉, 스테레오 입력 영상으로부터 특징값을 추출하고, 설정된 임계값과 비교하여 특징값의 크기를 결정한 다음, 특징값의 크기에 따라 정합창의 크기를 적응적으로 선택하여 정합함으로써 중간시점의 영상을 합성하는 새로운 기법을 제안하였다. 제안된 기법에서는 배경과 같인 특징값이 작은 영역에서는 비교적 큰 정합창에 의한 블록정합이 이루어지고 물체의 윤곽선과 같이 특징값이 큰 영역에서는 상대적으로 작은 정합창에 의한 미세한 정합이 적응적으로 수행되기 때문에 전체적인 정합성능의 개선뿐만 아니라 기존의 기법에서 나타나는 오정합이나 블록화 현상등의 문제점 해결의 가능성을 제시하였다. 또한, 'Parts' 및 'Piano' 영상을 사용한 실험결과 본 논문에서 새로이 제안한 중간시점 영상합성 방법은 기존의 방식에 비해 평균적으로 PSNR은 약 2.32∼4.16dB가 향상되었고, 수행시간은 약 39.34∼65.58% 감소됨을 확인하였다.

• 반도체디스플레이기술학회지
• /
• 제12권3호
• /
• pp.59-64
• /
• 2013

Accurate and robust image registration is important task in many applications such as image retrieval and computer vision. To perform the image registration, essential required steps are needed in the process: feature detection, extraction, matching, and reconstruction of image. In the process of these function, feature extraction not only plays a key role, but also have a big effect on its performance. There are two representative algorithms for extracting image features, which are scale invariant feature transform (SIFT) and speeded up robust feature (SURF). In this paper, we present and evaluate two methods, focusing on comparative analysis of the performance. Experiments for accurate and robust feature detection are shown on various environments such like scale changes, rotation and affine transformation. Experimental trials revealed that SURF algorithm exhibited a significant result in both extracting feature points and matching time, compared to SIFT method.

• 대한약학회:학술대회논문집
• /
• 대한약학회 2003년도 Proceedings of the Convention of the Pharmaceutical Society of Korea Vol.2-1
• /
• pp.81-84
• /
• 2003

Aminoglycoside antibiotics are among the chlinically important antibiotics and a major structural feature is the existence of characteristic aminocyclitol aglycones [1]. Considering the structural features, aminoglycosides are classified in to two classes. The first are those containing fully substituted aminocyclitol such as streptomycin, hygromycin, fortimycin, etc. (omitted)

• ETRI Journal
• /
• 제40권6호
• /
• pp.788-793
• /
• 2018

3D reconstruction of urban architecture, land, and roads is an important part of building a "digital city." Unmanned aerial vehicles (UAVs) are gradually replacing other platforms, such as satellites and aircraft, in geographical image collection; the reason for this is not only lower cost and higher efficiency, but also higher data accuracy and a larger amount of obtained information. Recent 3D reconstruction algorithms have a high degree of automation, but their computation time is long and the reconstruction models may have many voids. This paper decomposes the object into multiple regional parallel reconstructions using the clustering principle, to reduce the computation time and improve the model quality. It is proposed to detect the planar area under low resolution, and then reduce the number of point clouds in the complex area.

• Current Optics and Photonics
• /
• 제8권3호
• /
• pp.215-224
• /
• 2024

In medium- and long-range optical imaging systems, atmospheric turbulence causes blurring and distortion of images, resulting in loss of image information. An image-restoration method based on an adaptive feature-fusion multi-input-multi-output (MIMO) dense U-shaped network (Unet) is proposed, to restore a single image degraded by atmospheric turbulence. The network's model is based on the MIMO-Unet framework and incorporates patch-embedding shallow-convolution modules. These modules help in extracting shallow features of images and facilitate the processing of the multi-input dense encoding modules that follow. The combination of these modules improves the model's ability to analyze and extract features effectively. An asymmetric feature-fusion module is utilized to combine encoded features at varying scales, facilitating the feature reconstruction of the subsequent multi-output decoding modules for restoration of turbulence-degraded images. Based on experimental results, the adaptive feature-fusion MIMO dense U-shaped network outperforms traditional restoration methods, CMFNet network models, and standard MIMO-Unet network models, in terms of image-quality restoration. It effectively minimizes geometric deformation and blurring of images.

• 한국멀티미디어학회논문지
• /
• 제15권6호
• /
• pp.770-783
• /
• 2012

본 논문에서는 다중 영상에서 추출된 특징점을 사용해서 투영 공간에서의 카메라 행렬과 3차원 정점좌표를 계산하는 방법을 제안한다. 수치적인 안정성을 위해서 특징점을 정규화한 후 복원하며 얻어지는 카메라 행렬과 3차원 정점에 대해서 비정규화한다. 카메라 행렬과 3차원 정점의 초기값을 얻기 위해서 특이값 분해기법을 사용해서 투영 깊이가 적용된 측정 행렬을 분해한다. 행렬 분해 제약을 사용하여 카메라 행렬과 3차원 정점을 투영 복원한다. 투영 복원 과정에서는 비선형 반복적 최적화 방법이 사용된다. 실험 결과 제안방법은 대체로 적절한 정확성을 얻었고 오차의 편차가 크지 않았다.

• ETRI Journal
• /
• 제44권6호
• /
• pp.1034-1046
• /
• 2022

The learning-based multiview stereo (MVS) methods for three-dimensional (3D) reconstruction generally use 3D volumes for depth inference. The quality of the reconstructed depth maps and the corresponding point clouds is directly influenced by the spatial resolution of the 3D volume. Consequently, these methods produce point clouds with sparse local regions because of the lack of the memory required to encode a high volume of information. Here, we apply the atrous spatial pyramid pooling (ASPP) module in MVS methods to obtain dense feature maps with multiscale, long-range, contextual information using high receptive fields. For a given 3D volume with the same spatial resolution as that in the MVS methods, the dense feature maps from the ASPP module encoded with superior information can produce dense point clouds without a high memory footprint. Furthermore, we propose a 3D loss for training the MVS networks, which improves the predicted depth values by 24.44%. The ASPP module provides state-of-the-art qualitative results by constructing relatively dense point clouds, which improves the DTU MVS dataset benchmarks by 2.25% compared with those achieved in the previous MVS methods.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권4호
• /
• pp.2109-2123
• /
• 2017

This paper presents a super-resolution reconstruction method based on sparse representation for two-dimensional bar code images. Considering the features of two-dimensional bar code images, Kirsch and LBP (local binary pattern) operators are used to extract the edge gradient and texture features. Feature extraction is constituted based on these two features and additional two second-order derivatives. By joint dictionary learning of the low-resolution and high-resolution image patch pairs, the sparse representation of corresponding patches is the same. In addition, the global constraint is exerted on the initial estimation of high-resolution image which makes the reconstructed result closer to the real one. The experimental results demonstrate the effectiveness of the proposed algorithm for two-dimensional bar code images by comparing with other reconstruction algorithms.

• Journal of Information Display
• /
• 제5권4호
• /
• pp.31-37
• /
• 2004

In this paper, an effective method for reconstruction of stereoscopic image pair through the regularized adaptive disparity estimation is proposed. Although the conventional adaptive disparity window matching can sharply improve the PSNR of a reconstructed stereo image, but there still exist some problems of overlapping between the matching windows and disallocation of the matching windows, because the size of the matching window tend to changes adaptively in accordance with the magnitude of the feature values. In the proposed method, the problems relating to the conventional adaptive disparity estimation scheme can be solved and the predicted stereo image can be more effectively reconstructed by regularizing the extimated disparity vector with the neighboring disparity vectors. From the experimental results, it is found that the proposed algorithm show improvements the PSNR of the reconstructed right image by about 2.36${\sim}$2.76 dB, on average, compared with that of conventional algorithms.