• 전자공학회논문지B
• /
• 제28B권5호
• /
• pp.318-326
• /
• 1991

A Quantizer reconstruction level control method for block artifact reduction in DCT image coding is described. In our scheme, quantizer reconstruction level control is obtained by adding quantization level step size to the optimum quantization level in the direction of reducing the block artifact by minimizing the mean square error(MSE) and error difference(EDF) distribution in boundary without the other additional bits. In simulation results, although the performance in terms of signal to noise ratio is degraded by a little amount, mean square of error difference at block boundary and mean square error having relation block artifact is greatly reduced. Subjective image qualities are improved compared with other block artifact reduction method such as postprocessing by filtering and trasform coding by block overlapping. But the addition calculations of 1-dimensional DCT become to be more necessary to coding process for determining the reconstruction level.

• 한국지능시스템학회논문지
• /
• 제20권1호
• /
• pp.101-108
• /
• 2010

본 논문에서는 퍼지 k-NN과 reconstruction error에 기반을 둔 feature selection을 이용한 lazy 분류기 설계를 제안하였다. Reconstruction error는 locally linear reconstruction의 평가 지수이다. 새로운 입력이 주어지면, 퍼지 k-NN은 local 분류기가 유효한 로컬 영역을 정의하고, 로컬 영역 안에 포함된 데이터 패턴에 하중 값을 할당한다. 로컬 영역과 하중 값을 정의한 우에, feature space의 차원을 감소시키기 위하여 feature selection이 수행된다. Reconstruction error 관점에서 우수한 성능을 가진 여러 개의 feature들이 선택 되어 지면, 다항식의 일종인 분류기가 하중 최소자승법에 의해 결정된다. 실험 결과는 기존의 분류기인 standard neural networks, support vector machine, linear discriminant analysis, and C4.5 trees와 비교 결과를 보인다.

• 한국방사선학회논문지
• /
• 제17권1호
• /
• pp.1-9
• /
• 2023

전산화단층촬영조영술(computer tomography angiography, CTA)의 최적 화질을 위한 서로 다른 요오드 농도와 스캔 매개변수를 적용하여 필터 보정 역투영 (filtered back projection, FBP), 혼합형 반복재구성 (hybrid-iterative reconstruction, hybrid-IR) 및 딥러닝 재구성 (deep learning reconstruction, DLR)의 화질적 특성을 정량적으로 평가하였다. 320행 검출기 CT 스캐너에서 지름 19 cm의 원통형 물 팬텀 가장자리에 있는 다양한 요오드 농도 (1.2, 2.9, 4.9, 6.9, 10.4, 14.3, 18.4 및 25.9 mg/mL)의 팬텀을 스캔하였다. 각각의 재구성 기술을 사용하여 획득한 데이터는 노이즈 (noise), 변동 계수 (coefficient of variation, COV) 및 평균 제곱근 오차 (root mean square error, RMSE)을 통해 영상을 분석하였다. 요오드의 농도가 증가할수록 CT number 값은 증가하였지만 노이즈 변화는 특별한 특성을 보이지 않았다. 다양한 관전류 및 관전압에서 FBP, adaptive iterative dose reduction (AIDR) 3D 및 advanced intelligent clear-IQ engine (AiCE)에 대해 요오드 농도를 증가할수록 COV는 감소하였고 요오드 농도가 낮을 때는 재구성 기술 간의 COV 차이가 다소 발생하였지만, 요오드 농도가 높아짐에 따라 그 차이는 미약한 결과를 보였다. 또한, AiCE에서는 요오드 농도가 높아질수록 RMSE는 감소하지만 특정한 농도 (4.9 mg/mL) 이후에는 RMSE가 오히려 증가 되는 특성을 보여주었다. 따라서 최적의 CTA 영상 획득을 위해 재구성 기술에 따른 요오드 농도의 변화 및 다양한 관전류 및 관전압의 스캔 매개변수의 특성을 고려하여 환자 스캔을 해야 할 것이다.

• Investigative Magnetic Resonance Imaging
• /
• 제19권1호
• /
• pp.19-30
• /
• 2015

Purpose: A new compressed sensing technique by iterative truncation of small transformed coefficients (ITSC) is proposed for fast cardiac CINE MRI. Materials and Methods: The proposed reconstruction is composed of two processes: truncation of the small transformed coefficients in the r-f domain, and restoration of the measured data in the k-t domain. The two processes are sequentially applied iteratively until the reconstructed images converge, with the assumption that the cardiac CINE images are inherently sparse in the r-f domain. A novel sampling strategy to reduce the normalized mean square error of the reconstructed images is proposed. Results: The technique shows the least normalized mean square error among the four methods under comparison (zero filling, view sharing, k-t FOCUSS, and ITSC). Application of ITSC for multi-slice cardiac CINE imaging was tested with the number of slices of 2 to 8 in a single breath-hold, to demonstrate the clinical usefulness of the technique. Conclusion: Reconstructed images with the compression factors of 3-4 appear very close to the images without compression. Furthermore the proposed algorithm is computationally efficient and is stable without using matrix inversion during the reconstruction.

• 전자공학회논문지B
• /
• 제32B권9호
• /
• pp.1207-1214
• /
• 1995

We present an optimized integer cosine transform(OICT) as an alternative approach to the conventional discrete cosine transform(DCT), and its fast computational algorithm. In the actual implementation of the OICT, we have used the techniques similar to those of the orthogonal integer transform(OIT). The normalization factors are approximated to single one while keeping the reconstruction error at the best tolerable level. By obtaining a single normalization factor, both forward and inverse transform are performed using only the integers. However, there are so many sets of integers that are selected in the above manner, the best OICT matrix obtained through value minimizing the Hibert-Schmidt norm and achieving fast computational algorithm. Using matrix decomposing, a fast algorithm for efficient computation of the order-8 OICT is developed, which is minimized to 20 integer multiplications. This enables us to implement a high performance 2-D DCT processor by replacing the floating point operations by the integer number operations. We have also run the simulation to test the performance of the order-8 OICT with the transform efficiency, maximum reducible bits, and mean square error for the Wiener filter. When the results are compared to those of the DCT and OIT, the OICT has out-performed them all. Furthermore, when the conventional DCT coefficients are reduced to 7-bit as those of the OICT, the resulting reconstructed images were critically impaired losing the orthogonal property of the original DCT. However, the 7-bit OICT maintains a zero mean square reconstruction error.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2004년도 봄 학술발표논문집 Vol.31 No.1 (B)
• /
• pp.715-717
• /
• 2004

This paper proposes a new reconstruction method of high-resolution facial image from a low-resolution facial image based on a recursive error back-projection of top-down machine learning. A face is represented by a linear combination of prototypes of shape and texture. With the shape and texture information about the pixels in a given low-resolution facial image, we can estimate optimal coefficients for a linear combination of prototypes of shape and those of texture by solving least square minimization. Then high-resolution facial image can be obtained by using the optimal coefficients for linear combination of the high-resolution prototypes, In addition to, a recursive error back-projection is applied to improve the accuracy of synthesized high-resolution facial image. The encouraging results of the proposed method show that our method can be used to improve the performance of the face recognition by applying our method to reconstruct high-resolution facial images from low-resolution one captured at a distance.

• 한국멀티미디어학회논문지
• /
• 제8권12호
• /
• pp.1565-1571
• /
• 2005

Images reconstructed with Maximum-Likelihood Expectation-Maximization (MLEM) algorithm have been observed to have checkerboard effects and have noise artifacts near edges as iterations proceed. To compensate this ill-posed nature, numerous penalized maximum-likelihood methods have been proposed. We suggest a simple algorithm of applying edge detecting process to the MLEM and Bayesian Expectation-Maximization (BEM) to reduce the noise artifacts near edges and remove checkerboard effects. We have shown by simulation that this algorithm removes checkerboard effects and improves the clarity of the reconstructed image and has good properties based on root mean square error (RMS).

• Journal of the Optical Society of Korea
• /
• 제20권4호
• /
• pp.515-523
• /
• 2016

Spectral reflectance is sparse in space, and while the traditional spectral-reconstruction algorithm does not make full use of this characteristic sparseness, the compressive sensing algorithm can make full use of it. In this paper, on the basis of analyzing compressive sensing based on the orthogonal matching pursuit algorithm, a new algorithm based on the Dice matching criterion is proposed. The Dice similarity coefficient is introduced, to calculate the correlation coefficient of the atoms and the residual error, and is used to select the atoms from a library. The accuracy of Spectral reconstruction based on the pseudo-inverse method, Wiener estimation method, OMP algorithm, and DOMP algorithm is compared by simulation on the MATLAB platform and experimental testing. The result is that spectral-reconstruction accuracy based on the DOMP algorithm is higher than for the other three methods. The root-mean-square error and color difference decreases with an increasing number of principal components. The reconstruction error decreases as the number of iterations increases. Spectral reconstruction based on the DOMP algorithm can improve the accuracy of color-information replication effectively, and high-accuracy color-information reproduction can be realized.

• The Journal of the Acoustical Society of Korea
• /
• 제15권2E호
• /
• pp.24-32
• /
• 1996

A rigorous theory for modeling, analysis, optimum nonseparable filter bank in multidimensional M-band quantized subband codec are developed in this paper. Each pdf-optimized quantizer is modeled by a nonlinear gain-plus-additive uncorrelated noise and embedded into the subband structure. We then decompose the analysis/synthesis filter banks into their polyphase components and shift the down-and up-samplers to the right and left of the analysis/synthesis polyphase matrices respectively. Focusing on the slow clock rate signal between the samplers, we derive the exact expression for the output mean square quantization error by using spatial-invariant analysis. We show that this error can be represented by two uncorrelated components : a distortion component due to the quantizer gain, and a random noise component due to fictitious uncorrelated noise at the uantizer. This mean square error is then minimized subject to perfect reconstruction (PR) constraints and the total bit allocation for the entire filter bank. The algorithm gives filter coefficients and subband bit allocations. Numerical design example for the optimum nonseparable orthonormal filter bank is given with a quincunx subsampling lattice.

• 한국융합학회논문지
• /
• 제7권5호
• /
• pp.175-180
• /
• 2016

광기전공학 기술이 융합된 광학계의 발달은 광학계를 구성하는 부품의 표면이 비구면 또는 자유곡면으로 진화하고 있다. 본 논문에서는 광학식 자유곡면의 국부영역으로부터 직교하는 2방향의 곡률을 정의하여 전체 형상을 복원하는 알고리즘을 제안하였다. 8.4 m 자유곡면 형상을 가진 반사거울에 구현된 알고리즘을 적용한 결과 형상 복원 최대오차 0.065 nm, 평균제곱근 오차 0.013 nm로 복원됨을 확인하였다. 프루브의 위치오차 발생에 대한 노이즈 민감도를 해석한 결과, 2 mm 오차에 대해서도 형상복원 최대오차 30 nm, 제곱평균제곱근 오차 8.7 nm로 위치 오차에 매우 둔감한 알고리즘임을 확인하였다.