• Title/Summary/Keyword: projection matrix

Search Result 181, Processing Time 0.028 seconds

Correction for SPECT image distortion by non-circular detection orbits (비원형 궤도에서의 검출에 의한 SPECT 영상 왜곡 보정)

  • Lee, Nam-Yong
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.8 no.3
    • /
    • pp.156-162
    • /
    • 2007
  • The parallel beam SPECT system acquires projection data by using collimators in conjunction with photon detectors. The projection data of the parallel beam SPECT system is, however, blurred by the point response function of the collimator that is used to define the range of directions where photons can be detected. By increasing the number of parallel holes per unit area in collimator, one can reduce such blurring effect. This approach also, however, has the blurring problem if the distance between the object and the collimator becomes large. In this paper we consider correction methods for artifacts caused by non-circular orbit of parallel beam SPECT with many parallel holes per detector cell. To do so, we model the relationship between the object and its projection data as a linear system, and propose an iterative reconstruction method including artifacts correction. We compute the projector and the backprojector, which are required in iterative method, as a sum of convolutions with distance-dependent point response functions instead of matrix form, where those functions are analytically computed from a single function. By doing so, we dramatically reduce the computation time and memory required for the generation of the projector and the backprojector. We conducted several simulation studies to compare the performance of the proposed method with that of conventional Fourier method. The result shows that the proposed method outperforms Fourier methods objectively and subjectively.

  • PDF

Guaranteed Sparse Recovery Using Oblique Iterative Hard Thresholding Algorithm in Compressive Sensing (Oblique Iterative Hard Thresholding 알고리즘을 이용한 압축 센싱의 보장된 Sparse 복원)

  • Nguyen, Thu L.N.;Jung, Honggyu;Shin, Yoan
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39A no.12
    • /
    • pp.739-745
    • /
    • 2014
  • It has been shown in compressive sensing that every s-sparse $x{\in}R^N$ can be recovered from the measurement vector y=Ax or the noisy vector y=Ax+e via ${\ell}_1$-minimization as soon as the 3s-restricted isometry constant of the sensing matrix A is smaller than 1/2 or smaller than $1/\sqrt{3}$ by applying the Iterative Hard Thresholding (IHT) algorithm. However, recovery can be guaranteed by practical algorithms for some certain assumptions of acquisition schemes. One of the key assumption is that the sensing matrix must satisfy the Restricted Isometry Property (RIP), which is often violated in the setting of many practical applications. In this paper, we studied a generalization of RIP, called Restricted Biorthogonality Property (RBOP) for anisotropic cases, and the new recovery algorithms called oblique pursuits. Then, we provide an analysis on the success of sparse recovery in terms of restricted biorthogonality constant for the IHT algorithms.

Multiple Target Angle Tracking Algorithm with Efficient Equation for Angular Innovation (효율적으로 방위각 이노베이션을 구하는 다중표적 방위각 추적 알고리즘)

  • Ryu, Chang-Soo;Lee, Jang-Sik;Lee, Kyun-Kyung
    • Journal of the Institute of Electronics Engineers of Korea SC
    • /
    • v.38 no.6
    • /
    • pp.1-8
    • /
    • 2001
  • Recently, Ryu et al. proposed a multiple target angle tracking algorithm using the angular innovation extracted from the estimated signal subspace. This algorithm obtains the angles of targets and associates data simultaneously. Therefore, it has a simple structure without data association problem. However it requires the calculation of the inverse of a real matrix with dimension (2N+1)${\times}$(2N+1) to obtain the angular innovations of N targets. In this paper, a new linear equation for angular innovation is proposed using the fact that the projection error is zero when the target steering vector is projected onto the signal subspace. As a result, the proposed algorithm dose not require the matrix inversion and is computationally efficient.

  • PDF

Cryptotia recurrence lowering technique with additional acellular dermal matrix graft

  • Lee, Dongeun;Kim, Young Seok;Roh, Tai Suk;Yun, In Sik
    • Archives of Craniofacial Surgery
    • /
    • v.20 no.3
    • /
    • pp.170-175
    • /
    • 2019
  • Background: Cryptotia is a congenital anomaly in which the upper part of the retroauricular sulcus is absent and buried underneath the temporal skin. Various surgical techniques have been reported for the correction of cryptotia following Kubo's V-Y plasty in 1933. Conventional methods using a local skin flap, skin grafting, tissue expansion, Z-plasty, and any of these combined approaches can result in skin deficiency of the upper auricle. The aim of this study was to develop a new method that improves cosmetic results and has fewer complications. Methods: This study involved four patients in whom five cryptotia deformities were corrected using V-Y plasty and Z-plasty. After elevation of the flap, acellular dermal matrix (ADM; MegaDerm) that was over 5 mm in thickness was applied to the cephalo-auricular angle and positioned to enhance the projection of the ear. Lastly, the flap was transposed to complete the repair. Results: Between January 2014 and February 2018, cryptotia correction with ADM graft was performed in four patients. None of the patients developed a recurrence of cryptotia, and there were no postoperative complications such as wound infection, seroma formation, and dehiscence. In addition, the procedures resulted in a favorable cosmetic appearance. Conclusion: Based on these findings, i.e., no recurrence and a favorable cosmetic result, when using an ADM graft, it is suggested that this technique could be an alternative method of cryptotia correction. It could also lessen donor-site morbidity when compared to autologous cartilage grafting and be more cost-effective than using cartilage from a cadaver.

An improved extended Kalman filter for parameters and loads identification without collocated measurements

  • Jia He;Mengchen Qi;Zhuohui Tong;Xugang Hua;Zhengqing Chen
    • Smart Structures and Systems
    • /
    • v.31 no.2
    • /
    • pp.131-140
    • /
    • 2023
  • As well-known, the extended Kalman filter (EKF) is a powerful tool for parameter identification with limited measurements. However, traditional EKF is not applicable when the external excitation is unknown. By using least-squares estimation (LSE) for force identification, an EKF with unknown input (EKF-UI) approach was recently proposed by the authors. In this approach, to ensure the influence matrix be of full column rank, the sensors have to be deployed at all the degrees-of-freedom (DOFs) corresponding to the unknown excitation, saying collocated measurements are required. However, it is not easy to guarantee that the sensors can be installed at all these locations. To circumvent this limitation, based on the idea of first-order-holder discretization (FOHD), an improved EKF with unknown input (IEKF-UI) approach is proposed in this study for the simultaneous identification of structural parameters and unknown excitation. By using projection matrix, an improved observation equation is obtained. Few displacement measurements are fused into the observation equation to avoid the so-called low-frequency drift. To avoid the ill-conditioning problem for force identification without collocated measurements, the idea of FOHD is employed. The recursive solution of the structural states and unknown loads is then analytically derived. The effectiveness of the proposed approach is validated via several numerical examples. Results show that the proposed approach is capable of satisfactorily identifying the parameters of linear and nonlinear structures and the unknown excitation applied to them.

Variation on Estimated Values of Radioactivity Concentration According to the Change of the Acquisition Time of SPECT/CT (SPECT/CT의 획득시간 증감에 따른 방사능농도 추정치의 변화)

  • Kim, Ji-Hyeon;Lee, Jooyoung;Son, Hyeon-Soo;Park, Hoon-Hee
    • The Korean Journal of Nuclear Medicine Technology
    • /
    • v.25 no.2
    • /
    • pp.15-24
    • /
    • 2021
  • Purpose SPECT/CT was noted for its excellent correction method and qualitative functions based on fusion images in the early stages of dissemination, and interest in and utilization of quantitative functions has been increasing with the recent introduction of companion diagnostic therapy(Theranostics). Unlike PET/CT, various conditions like the type of collimator and detector rotation are a challenging factor for image acquisition and reconstruction methods at absolute quantification of SPECT/CT. Therefore, in this study, We want to find out the effect on the radioactivity concentration estimate by the increase or decrease of the total acquisition time according to the number of projections and the acquisition time per projection among SPECT/CT imaging conditions. Materials and Methods After filling the 9,293 ml cylindrical phantom with sterile water and diluting 99mTc 91.76 MBq, the standard image was taken with a total acquisition time of 600 sec (10 sec/frame × 120 frames, matrix size 128 × 128) and also volume sensitivity and the calibration factor was verified. Based on the standard image, the comparative images were obtained by increasing or decreasing the total acquisition time. namely 60 (-90%), 150 (-75%), 300 (-50%), 450 (-25%), 900 (+50%), and 1200 (+100%) sec. For each image detail, the acquisition time(sec/frame) per projection was set to 1.0, 2.5, 5.0, 7.5, 15.0 and 20.0 sec (fixed number of projections: 120 frame) and the number of projection images was set to 12, 30, 60, 90, 180 and 240 frames(fixed time per projection:10 sec). Based on the coefficients measured through the volume of interest in each acquired image, the percentage of variation about the contrast to noise ratio (CNR) was determined as a qualitative assessment, and the quantitative assessment was conducted through the percentage of variation of the radioactivity concentration estimate. At this time, the relationship between the radioactivity concentration estimate (cps/ml) and the actual radioactivity concentration (Bq/ml) was compared and analyzed using the recovery coefficient (RC_Recovery Coefficients) as an indicator. Results The results [CNR, radioactivity Concentration, RC] by the change in the number of projections for each increase or decrease rate (-90%, -75%, -50%, -25%, +50%, +100%) of total acquisition time are as follows. [-89.5%, +3.90%, 1.04] at -90%, [-77.9%, +2.71%, 1.03] at -75%, [-55.6%, +1.85%, 1.02] at -50%, [-33.6%, +1.37%, 1.01] at -25%, [-33.7%, +0.71%, 1.01] at +50%, [+93.2%, +0.32%, 1.00] at +100%. and also The results [CNR, radioactivity Concentration, RC] by the acquisition time change for each increase or decrease rate (-90%, -75%, -50%, -25%, +50%, +100%) of total acquisition time are as follows. [-89.3%, -3.55%, 0.96] at - 90%, [-73.4%, -0.17%, 1.00] at -75%, [-49.6%, -0.34%, 1.00] at -50%, [-24.9%, 0.03%, 1.00] at -25%, [+49.3%, -0.04%, 1.00] at +50%, [+99.0%, +0.11%, 1.00] at +100%. Conclusion In SPECT/CT, the total coefficient obtained according to the increase or decrease of the total acquisition time and the resulting image quality (CNR) showed a pattern that changed proportionally. On the other hand, quantitative evaluations through absolute quantification showed a change of less than 5% (-3.55 to +3.90%) under all experimental conditions, maintaining quantitative accuracy (RC 0.96 to 1.04). Considering the reduction of the total acquisition time rather than the increasing of the image acquiring time, The reduction in total acquisition time is applicable to quantitative analysis without significant loss and is judged to be clinically effective. This study shows that when increasing or decreasing of total acquisition time, changes in acquisition time per projection have fewer fluctuations that occur in qualitative and quantitative condition changes than the change in the number of projections under the same scanning time conditions.

Development of the Computer Vision based Continuous 3-D Feature Extraction System via Laser Structured Lighting (레이저 구조광을 이용한 3차원 컴퓨터 시각 형상정보 연속 측정 시스템 개발)

  • Im, D. H.;Hwang, H.
    • Journal of Biosystems Engineering
    • /
    • v.24 no.2
    • /
    • pp.159-166
    • /
    • 1999
  • A system to extract continuously the real 3-D geometric fearture information from 2-D image of an object, which is fed randomly via conveyor has been developed. Two sets of structured laser lightings were utilized. And the laser structured light projection image was acquired using the camera from the signal of the photo-sensor mounted on the conveyor. Camera coordinate calibration matrix was obtained, which transforms 2-D image coordinate information into 3-D world space coordinate using known 6 points. The maximum error after calibration showed 1.5 mm within the height range of 103mm. The correlation equation between the shift amount of the laser light and the height was generated. Height information estimated after correlation showed the maximum error of 0.4mm within the height range of 103mm. An interactive 3-D geometric feature extracting software was developed using Microsoft Visual C++ 4.0 under Windows system environment. Extracted 3-D geometric feature information was reconstructed into 3-D surface using MATLAB.

  • PDF

Network Parameters of 6-Pole Dual-Mode Singly Terminated Elliptic Function Filter (6차 단일종단 이중모드 타원응답 필터의 회로망 파라미터 추출에 관한 연구)

  • Lee, Juseop;Uhm, Man-Seok;Yom, In-Bok;Lee, Seong-Pal
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.7A
    • /
    • pp.557-562
    • /
    • 2003
  • An output multiplexer of manifold type is widely used in a recent satellite transponder for its mass and volume reduction. For correct operation, the filters of such a multiplexer must be singly terminated. In this paper, a simple synthesis method of a 6-pole dual-mode singly-terminated filter is described. From the transfer function of the filter, network parameters such as in/output terminations and coupling coefficients are obtained easily without complicated matrix algebra such as orthogonal projection and similarity transformation. Two different-structure filters are taken into consideration and the network parameters of each filter have been extracted from the same transfer function. It is shown that the responses of two filters are same to each other since their network parameters are obtained from the same transfer function. The method described in this paper can be applied to the other degree singly terminated filter.

Type II analysis by projections (사영을 이용한 제2종 분석)

  • Choi, Jaesung
    • Journal of the Korean Data and Information Science Society
    • /
    • v.23 no.6
    • /
    • pp.1155-1163
    • /
    • 2012
  • This paper suggests a method for getting sums of squares due to sources of variation under the assumption of two-way fixed effects model. The method used for calculating the quantities due to fixed-effects is based on the projections of an observation vector y on the column space generated by the model matrix X under the assumed model. The suggested method shows that the calculation of Type II sums of squares by projections is much easier than the classical Type II analysis.

Generic Training Set based Multimanifold Discriminant Learning for Single Sample Face Recognition

  • Dong, Xiwei;Wu, Fei;Jing, Xiao-Yuan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.1
    • /
    • pp.368-391
    • /
    • 2018
  • Face recognition (FR) with a single sample per person (SSPP) is common in real-world face recognition applications. In this scenario, it is hard to predict intra-class variations of query samples by gallery samples due to the lack of sufficient training samples. Inspired by the fact that similar faces have similar intra-class variations, we propose a virtual sample generating algorithm called k nearest neighbors based virtual sample generating (kNNVSG) to enrich intra-class variation information for training samples. Furthermore, in order to use the intra-class variation information of the virtual samples generated by kNNVSG algorithm, we propose image set based multimanifold discriminant learning (ISMMDL) algorithm. For ISMMDL algorithm, it learns a projection matrix for each manifold modeled by the local patches of the images of each class, which aims to minimize the margins of intra-manifold and maximize the margins of inter-manifold simultaneously in low-dimensional feature space. Finally, by comprehensively using kNNVSG and ISMMDL algorithms, we propose k nearest neighbor virtual image set based multimanifold discriminant learning (kNNMMDL) approach for single sample face recognition (SSFR) tasks. Experimental results on AR, Multi-PIE and LFW face datasets demonstrate that our approach has promising abilities for SSFR with expression, illumination and disguise variations.