• 제목/요약/키워드: Reconstruction Algorithm

검색결과 981건 처리시간 0.022초

A migration based reconstruction algorithm for the imaging of defects in a plate using a compact array

  • Muralidharan, Ajith;Balasubramaniam, Krishnan;Krishnamurthy, C.V.
    • Smart Structures and Systems
    • /
    • 제4권4호
    • /
    • pp.449-464
    • /
    • 2008
  • An array based, outward monitoring, ultrasonic guided wave based SHM technique using a single transmitter and multiple receivers (STMR), with a small footprint is discussed here. The previous implementation of such SHM arrays used a phase-reconstruction algorithm (that is similar to the beam-steering algorithm) for the imaging of reflectors. These algorithms were found to have a limitation during the imaging of defects/reflectors that are present in the "near-field" of the array. Here, the "near-field" is defined to be approximately 3-4 times the diameter of the compact array. This limitation is caused by approximations in the beam-steering reconstruction algorithm. In this paper, a migration-based reconstruction algorithm, with dispersion correction in the frequency domain, is discussed. Simulation and experimental studies are used to demonstrate that this algorithm improves the reconstruction in the "near-field" without decreasing the ability to reconstruct defects in the "far-field" in both isotropic and anisotropic plates.

인터넷상의 실시간 음성 전송을 위한 에러 복원 알고리즘의 연구 (Study of Error Reconstruction Algorithm for Real-time Voice for Transmissions over the Internet)

  • 신현숙;최연성
    • 한국정보통신학회:학술대회논문집
    • /
    • 한국해양정보통신학회 2001년도 춘계종합학술대회
    • /
    • pp.388-394
    • /
    • 2001
  • 인터넷상의 실시간 음성 전송 시에 발생하는 손실을 은닉하기 위한 다수의 알고리즘들이 제안되고 있다. 이 알고리즘들의 주 목적은 적은 대역폭을 사용하여 손실을 복원하고 복원 후 좋은 음질을 보장하는 것이다. 손실 은닉 알고리즘들은 receiver based와 sender- / receiver-based로 나뉘어진다. 본 논문에서 sender- 와 receiver-based 복원 알고리즘을 CELP를 사용하는 저 비트율 코덱에 적용하고자 한다.

  • PDF

반복 학습법에 의한 비선형 계의 입력신호 재현 (Input signal reconstruction for nonlinear systems using iterative learning procedures)

  • Seo, Jong-Soo;S. J. Elliott
    • 한국소음진동공학회:학술대회논문집
    • /
    • 한국소음진동공학회 2002년도 춘계학술대회논문집
    • /
    • pp.855-861
    • /
    • 2002
  • This paper demonstrates the reconstruction of input signals from only the measured signal for the simulation and endurance test of automobiles. The aim of this research is concerned with input signal reconstruction using various iterative teaming algorithm under the condition of system characteristics. From a linear to nonlinear systems which provides the output signals are estimated in this algorithm which is based on the frequency domain. Our concerns are that the algorithm can assure an acceptable stability and convergence compared to the ordinary iterative learning algorithm. As a practical application, a f car model with nonlinear damper system is used to verify the restoration of input signal especially with a modified iterative loaming algorithm.

  • PDF

Stagewise Weak Orthogonal Matching Pursuit Algorithm Based on Adaptive Weak Threshold and Arithmetic Mean

  • Zhao, Liquan;Ma, Ke
    • Journal of Information Processing Systems
    • /
    • 제16권6호
    • /
    • pp.1343-1358
    • /
    • 2020
  • In the stagewise arithmetic orthogonal matching pursuit algorithm, the weak threshold used in sparsity estimation is determined via maximum iterations. Different maximum iterations correspond to different thresholds and affect the performance of the algorithm. To solve this problem, we propose an improved variable weak threshold based on the stagewise arithmetic orthogonal matching pursuit algorithm. Our proposed algorithm uses the residual error value to control the weak threshold. When the residual value decreases, the threshold value continuously increases, so that the atoms contained in the atomic set are closer to the real sparsity value, making it possible to improve the reconstruction accuracy. In addition, we improved the generalized Jaccard coefficient in order to replace the inner product method that is used in the stagewise arithmetic orthogonal matching pursuit algorithm. Our proposed algorithm uses the covariance to replace the joint expectation for two variables based on the generalized Jaccard coefficient. The improved generalized Jaccard coefficient can be used to generate a more accurate calculation of the correlation between the measurement matrixes. In addition, the residual is more accurate, which can reduce the possibility of selecting the wrong atoms. We demonstrate using simulations that the proposed algorithm produces a better reconstruction result in the reconstruction of a one-dimensional signal and two-dimensional image signal.

Indoor 3D Dynamic Reconstruction Fingerprint Matching Algorithm in 5G Ultra-Dense Network

  • Zhang, Yuexia;Jin, Jiacheng;Liu, Chong;Jia, Pengfei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제15권1호
    • /
    • pp.343-364
    • /
    • 2021
  • In the 5G era, the communication networks tend to be ultra-densified, which will improve the accuracy of indoor positioning and further improve the quality of positioning service. In this study, we propose an indoor three-dimensional (3D) dynamic reconstruction fingerprint matching algorithm (DSR-FP) in a 5G ultra-dense network. The first step of the algorithm is to construct a local fingerprint matrix having low-rank characteristics using partial fingerprint data, and then reconstruct the local matrix as a complete fingerprint library using the FPCA reconstruction algorithm. In the second step of the algorithm, a dynamic base station matching strategy is used to screen out the best quality service base stations and multiple sub-optimal service base stations. Then, the fingerprints of the other base station numbers are eliminated from the fingerprint database to simplify the fingerprint database. Finally, the 3D estimated coordinates of the point to be located are obtained through the K-nearest neighbor matching algorithm. The analysis of the simulation results demonstrates that the average relative error between the reconstructed fingerprint database by the DSR-FP algorithm and the original fingerprint database is 1.21%, indicating that the accuracy of the reconstruction fingerprint database is high, and the influence of the location error can be ignored. The positioning error of the DSR-FP algorithm is less than 0.31 m. Furthermore, at the same signal-to-noise ratio, the positioning error of the DSR-FP algorithm is lesser than that of the traditional fingerprint matching algorithm, while its positioning accuracy is higher.

Comparison of a Deep Learning-Based Reconstruction Algorithm with Filtered Back Projection and Iterative Reconstruction Algorithms for Pediatric Abdominopelvic CT

  • Wookon Son;MinWoo Kim;Jae-Yeon Hwang;Young-Woo Kim;Chankue Park;Ki Seok Choo;Tae Un Kim;Joo Yeon Jang
    • Korean Journal of Radiology
    • /
    • 제23권7호
    • /
    • pp.752-762
    • /
    • 2022
  • Objective: To compare a deep learning-based reconstruction (DLR) algorithm for pediatric abdominopelvic computed tomography (CT) with filtered back projection (FBP) and iterative reconstruction (IR) algorithms. Materials and Methods: Post-contrast abdominopelvic CT scans obtained from 120 pediatric patients (mean age ± standard deviation, 8.7 ± 5.2 years; 60 males) between May 2020 and October 2020 were evaluated in this retrospective study. Images were reconstructed using FBP, a hybrid IR algorithm (ASiR-V) with blending factors of 50% and 100% (AV50 and AV100, respectively), and a DLR algorithm (TrueFidelity) with three strength levels (low, medium, and high). Noise power spectrum (NPS) and edge rise distance (ERD) were used to evaluate noise characteristics and spatial resolution, respectively. Image noise, edge definition, overall image quality, lesion detectability and conspicuity, and artifacts were qualitatively scored by two pediatric radiologists, and the scores of the two reviewers were averaged. A repeated-measures analysis of variance followed by the Bonferroni post-hoc test was used to compare NPS and ERD among the six reconstruction methods. The Friedman rank sum test followed by the Nemenyi-Wilcoxon-Wilcox all-pairs test was used to compare the results of the qualitative visual analysis among the six reconstruction methods. Results: The NPS noise magnitude of AV100 was significantly lower than that of the DLR, whereas the NPS peak of AV100 was significantly higher than that of the high- and medium-strength DLR (p < 0.001). The NPS average spatial frequencies were higher for DLR than for ASiR-V (p < 0.001). ERD was shorter with DLR than with ASiR-V and FBP (p < 0.001). Qualitative visual analysis revealed better overall image quality with high-strength DLR than with ASiR-V (p < 0.001). Conclusion: For pediatric abdominopelvic CT, the DLR algorithm may provide improved noise characteristics and better spatial resolution than the hybrid IR algorithm.

Experimental study of noise level optimization in brain single-photon emission computed tomography images using non-local means approach with various reconstruction methods

  • Seong-Hyeon Kang;Seungwan Lee;Youngjin Lee
    • Nuclear Engineering and Technology
    • /
    • 제55권5호
    • /
    • pp.1527-1532
    • /
    • 2023
  • The noise reduction algorithm using the non-local means (NLM) approach is very efficient in nuclear medicine imaging. In this study, the applicability of the NLM noise reduction algorithm in single-photon emission computed tomography (SPECT) images with a brain phantom and the optimization of the NLM algorithm by changing the smoothing factors according to various reconstruction methods are investigated. Brain phantom images were reconstructed using filtered back projection (FBP) and ordered subset expectation maximization (OSEM). The smoothing factor of the NLM noise reduction algorithm determined the optimal coefficient of variation (COV) and contrast-to-noise ratio (CNR) results at a value of 0.020 in the FBP and OSEM reconstruction methods. We confirmed that the FBP- and OSEM-based SPECT images using the algorithm applied with the optimal smoothing factor improved the COV and CNR by 66.94% and 8.00% on average, respectively, compared to those of the original image. In conclusion, an optimized smoothing factor was derived from the NLM approach-based algorithm in brain SPECT images and may be applicable to various nuclear medicine imaging techniques in the future.

Spotlight-mode SAR(Synthetic Aperture Radar)에서의 Inversion 기법 성능 분석 (Performance Analysis of the Inversion Schemes in the Spotlight-mode SAR(Synthetic Aperture Radar))

  • 최정희
    • 대한전자공학회논문지SP
    • /
    • 제40권1호
    • /
    • pp.130-138
    • /
    • 2003
  • Stripmap-mode 합성개구레이더의 고전적인 영상 복원기술은 Range-Doppler 알고리즘이다. 하지만 고해상도 Spotlight-mode 합성개구레이더 시스템에서는 Range-Doppler 알고리즘을 적용했을 때 성능이 상당히 나빠지므로 Spotlight-mode에 맞는 별도의 Inversion 알고리즘이 연구되어왔다. 본 논문에서는 Spotlight-mode 합성개구레이더에서 Raw-data를 처리하기 위한 알고리즘 연구를 통해 기존의 평면파 근사 방법을 이용하고 있는 Polar format 알고리즘과 근사 방법을 사용하지 않는 Wavefront Reconstruction 기법에 대한 성능분석을 시도하였다. 이 때 Source 신호의 Carrier 주파수, 합성 개구면 Size, 그리고 표적물의 위치에 따라 두 Inversion기법의 결과 영상을 비교함으로써 Wavefront Reconstruction 기법의 우수성을 입증하였다. Spotlight-mode 합성 개구 레이더 시스템을 시뮬레이션하여 Raw-data를 생성시키고 각 알고리즘에 적용하여 역변환을 통해 영상화된 표적물의 형태로 성능을 비교 분석하였다.

CT 영상재구성을 위한 빠른 선적분 알고리즘 (Fast Calculation Algorithm for Line Integral on CT Reconstruction)

  • 천권수;길준민
    • 정보처리학회논문지:컴퓨터 및 통신 시스템
    • /
    • 제12권1호
    • /
    • pp.41-46
    • /
    • 2023
  • CT의 반복재구성법은 투영과 역투영을 번갈아 가며 최적의 단면 영상을 얻을 때까지 반복 수행하기 때문에 계산 시간이 오래 걸리는 단점이 있다. 영상재구성 시간을 단축하기 위하여 계산 시간이 많이 소요되는 투영을 빠르게 수행할 수 있는 알고리즘이 필요하다. 본 논문은 Siddon 알고리즘을 개선한 Jacobs 버전보다 대략 10% 빠른 알고리즘을 제안하였다. 제안한 알고리즘은 기존의 Jacobs 버전의 루프 횟수를 줄임으로써 계산 시간을 줄이도록 하였다. 제안한 방법은 계산속도뿐만 아니라 영상 품질 측면에서도 우수한 성능을 보였다. 평행빔의 경우에 대해 조사되었지만 향후 부채살빔 및 콘빔의 경우로 확장이 가능하다.

Complete 3D Surface Reconstruction from Unstructured Point Cloud

  • Kim, Seok-Il;Li, Rixie
    • Journal of Mechanical Science and Technology
    • /
    • 제20권12호
    • /
    • pp.2034-2042
    • /
    • 2006
  • In this study, a complete 3D surface reconstruction method is proposed based on the concept that the vertices, of surface model can be completely matched to the unstructured point cloud. In order to generate the initial mesh model from the point cloud, the mesh subdivision of bounding box and shrink-wrapping algorithm are introduced. The control mesh model for well representing the topology of point cloud is derived from the initial mesh model by using the mesh simplification technique based on the original QEM algorithm, and the parametric surface model for approximately representing the geometry of point cloud is derived by applying the local subdivision surface fitting scheme on the control mesh model. And, to reconstruct the complete matching surface model, the insertion of isolated points on the parametric surface model and the mesh optimization are carried out. Especially, the fast 3D surface reconstruction is realized by introducing the voxel-based nearest-point search algorithm, and the simulation results reveal the availability of the proposed surface reconstruction method.