• Journal of Biomedical Engineering Research
• /
• v.32 no.1
• /
• pp.15-24
• /
• 2011

While Compton imaging is recognized as a valuable 3-D technique in nuclear medicine, reconstructing an image from Compton scattered data has been of a difficult problem due to its computational complexity. The most complex and time-consuming computation in Compton camera reconstruction is to perform the conical projection and backprojection operations. To alleviate the computational burden imposed by these operations, we investigate a rebinning method which can convert conical projections into parallel projections. The use of parallel projections allows to directly apply the existing deterministic reconstruction methods, which have been useful for conventional emission tomography, to Compton camera reconstruction. To convert conical projections into parallel projections, a cone surface is sampled with a number of lines. Each line is projected onto an imaginary plane that is mostly perpendicular to the line. The projection data rebinned in each imaginary plane can then be treated as the standard parallel projection data. To validate the rebinning method, we tested with the representative deterministic algorithms, such as the filtered backprojection method and the algebraic reconstruction technique. Our experimental results indicate that the rebinning method can be useful when the direct application of existing deterministic methods is needed for Compton camera reconstruction.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.4
• /
• pp.1254-1259
• /
• 2010

In this paper, Low Computational Adaptive Expanded Block Search Motion Estimation Method is proposed. Proposed method classifies ME blocks as Average Motion Block(AMB) and Local Motion Block(LMB) according to correlation of reference frame. It could reduce the computational complexity with performing Modified Fast Search(MFS). And accuracy of MV is also increased by 4 sub-blocks on LMB and Block Expansion(BE). The experimental results show that the proposed method has better performance that increased 1.8dB than Diamond Search and 0.6dB than Full Search with 7.5 % computation of Full Search. The proposed method could be applied to video compression and Frame Rate Conversion(FRC).

• Journal of Satellite, Information and Communications
• /
• v.11 no.3
• /
• pp.119-122
• /
• 2016

Feature detection is recognized as an accurate spectrum sensing approach when the information of the desired signal is partly known at the receiver. This type of detection was proposed to overcome large noise environment. Cyclostationary detection is an example of feature detection in spectrum sensing technique in cognitive radio. However, the cyclostationary process calculation requires a lot of processing time and information about the designed signals. On the other hand, energy detection spectrum sensing is widely known as a simple and compact spectrum sensing technique. However, energy detection is highly affected by large noise and lead to high detection error probability. In this paper, the combination of energy detection and cyclostationary is proposed in order to increase the accuracy and decrease the calculation and processing time. The two-layer threshold is utilized in order to reduce the complexity of computation and processing time in cyclostationary which can lead to the improved throughput of the system. The simulation result shows that the implementation of energy-based cyclostationary detector can help to improve the performance of the system while it can considerably reduce the required time for signal detection.

• Journal of KIISE:Software and Applications
• /
• v.30 no.7_8
• /
• pp.599-609
• /
• 2003

Video abstraction is a process to pick up some important shots on a video, while the important shots might vary on the persons subjectivity. Previous works on video abstraction use only one low level feature to choose an important shot. This thesis proposes an abstraction scheme that selects a set of shots which simultaneously satisfies the desired features(or objective functions) of a good abstraction. Since the complexity of the computation to find a set of shots which maximizes the sum of object function values is $0({2^n})$, the proposed .scheme uses a simulated annealing based searching method to find the suboptimal value within a short period of time. Upon the experimental results on various videos, we could argue that the proposed abstraction scheme could produce a reasonable video abstraction. The proposed abstraction scheme used to build a digital video library.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.8
• /
• pp.966-974
• /
• 1999

완전 탐색 블록 정합 알고리즘(FBMA)은 다양한 움직임 추정 알고리즘 중 최상의 움직임 추정을 할 수 있으나, 방대한 계산량이 실시간 처리의 적용에 장애 요소이다. 본 논문에서는 완전 탐색 블록 정합 알고리즘에 비해 더 낮은 계산량과 유사한 화질을 가지는 새로운 고속 움직임 추정 알고리즘을 제안한다. 제안한 방법에서는 공간적인 상관성을 이용함으로써 적절한 탐색 영역의 크기를 예측할 수 있다. 현재 블록의 움직임 추정을 위하여 이웃 블록이 가지고 있는 움직임과 탐색 영역의 크기를 이용하여 현재 블록의 탐색 영역을 적응적으로 변화시키는 방법이다. 이 예측값으로 현재 블록의 탐색 영역 크기를 결정한 후, FBMA와 같이 이 영역 안의 모든 화소점들에 대하여 현재 블록을 정합하여 움직임 벡터를 추정한다. 컴퓨터 모의 실험 결과 계산량 측면에서 제안 방법이 완전 탐색 블록 정합 알고리즘보다 50%정도 감소하였으며, PSNR 측면에서는 0.08dB에서 1.29dB 정도 감소하는 좋은 결과를 얻었다.Abstract Full search block-matching algorithm (FBMA) was shown to be able to produce the best motion compensated images among various motion estimation algorithms. However, huge computational load inhibits its applicability in real applications. A new motion estimation algorithm with lower computational complexity and good image quality when compared to the FBMA will be presented in this paper. In the proposed method, The appropriate search area can be predicted by using the temporal correlation between neighbouring blocks. For motion estimation of the current block, it is the method changing adjustably search area of current block by using motion and search area size of the neighbouring block. After deciding search area size of the current block with this predicted value, we estimate motion vector that matching current block like the FBMA for every pixel in this area. By the computer simulation the computation amount of the proposed method can be greatly decreased about 50% than that of the FBMA and the good result of the PSNR can be attained.

• Journal of Korea Multimedia Society
• /
• v.14 no.3
• /
• pp.356-367
• /
• 2011

In this paper, we proposed a new car engine sealing inspection system based on image processing and understanding. The car engine sealing inspection plays very important role for protecting leakage caused by inappropriate sealing, which is a crucial point for productivity of car engines. The proposed inspection system has been aimed to enhance the previously proposed sealing inspection systems based on image processing, which have high computation complexity and low performance for correctly inspecting some contamination by oil with similar color with that of sealing. Moreover, the previously proposed system has a difficulty in installing the camera system on the sealing machine. The proposed system considers a difference of images before and after sealing obtained from one static camera. By utilizing a difference of images, the proposed system shows very robust performance using a proposed simple depth checking algorithm for some contamination cases by oil with similar color with that of sealing and the total inspection system is simple and cheap to implement. According to the experiments conducted in a real car product line, the proposed inspection system shows better inspection performance and needs smaller implementation cost than three other previously proposed system working in current car sealing inspection systems.

• Journal of Korea Multimedia Society
• /
• v.16 no.10
• /
• pp.1180-1188
• /
• 2013

Interpolation or super-resolution is used in order to restore degradation of image quality that appears after various transform of image. The method on subjective or objective image resolution improvement having low computation complexity has been being researched in many different ways. In this paper, image enhancement method using improved self degradation restoration(ISDR) method is proposed. The proposed method uses ISDR to estimate pixel value of missed coordinate in the process of image scaling, and combines the estimated loss information and interpolated image to generate enhanced result image. The proposed method shows that PSNR increases by 1.8dB, and subjective image quality is superior to other compared methods. The proposed method can be applied as a basis technique in variety of applications which requires image scale transform.

• The KIPS Transactions:PartA
• /
• v.10A no.4
• /
• pp.357-368
• /
• 2003

Evaluation of shape similarity for 3D models is essential in many areas - medicine, mechanical engineering, molecular biology, etc. Moreover, as 3D models are commonly used on the Web, many researches have been made on the classification and retrieval of 3D models. In this paper, we describe methods for 3D shape representation and major concepts of similarity evaluation, and analyze the key features of recent researches for shape comparison after classifying them into four categories including multi-resolution, topology, 2D image, and statistics based methods. In addition, we evaluated the performance of the reviewed methods by the selected criteria such as uniqueness, robustness, invariance, multi-resolution, efficiency, and comparison scope. Multi-resolution based methods have resulted in decreased computation time for comparison and increased preprocessing time. The methods using geometric and topological information were able to compare more various types of models and were robust to partial shape comparison. 2D image based methods incurred overheads in time and space complexity. Statistics based methods allowed for shape comparison without pose-normalization and showed robustness against affine transformations and noise.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.9A
• /
• pp.1392-1400
• /
• 1999

In this paper, we propose a two-stage fast full search algorithm for block motion estimation that produces the same performance to that of full search algorithm (FSA) but with remarkable computation reduction. The proposed algorithm uses the search region subsampling and the difference of adjacent pixels in the current block. In the first stage, we subsample the search region by a factor of 9, and then calculate mean absolute error (MAE) at the subsampled search points. And in the second stage, we reduce the search points that need block matching process by using the lower bound of MAE value at each search Point. We Set the lower bound of MAE value for each search point from the MAE values which are calculated at the first stage and the difference of adjacent pixels in the current block. The experimental results show that we can reduce the computational complexity considerably without any degradation of picture quality.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37B no.9
• /
• pp.787-794
• /
• 2012

The visible light communication is considered as a next generation communication technology, when utilizes LED and PD for communication. Since it is easy to provide LOS communication environment along with cheap deployment cost, the positioning system based on VLC has been actively studied. However, the existing positioning system using VLC requires a complex computation and an additional deployment cost due to sensors for example. In this paper, we propose a new positioning system based on VLC which does not require additional complexity and the cost. In addition, the procedure for operating LED panels for positioning and the recognition schemes of pilot signal are proposed. The performance of recognition schemes of pilot signal is analyzed through the computer simulations.