• Journal of Internet Computing and Services
• /
• v.3 no.5
• /
• pp.51-62
• /
• 2002

The development of computer technology and the advancement of the technology of information and communications spread the technology of multimedia and increased the use of multimedia data with large capacity, Users can grasp the overall video data and they are able to play wanted video back. To grasp the overall video data it is necessary to offer the list of summarized video data information, In order to search video efficiently on index process of video data is essential and it is also indispensable skill, Therefore, this thesis suggested the effective method about the cut detection of frames which will become a basis of an index based on contents of video image data. This suggested method was detected as the unchanging pixel color intelligence value, classified into diagonal direction. Pixel value of color detected in each frame of video data is stored as A(i, j) matrix-i is the number of frames. j is an image height of frame. By using the stored pixel value as the method of sum of squared difference of color two frames I calculated a specified value difference between frames and detected cut quickly and exactly in case it is bigger than threshold value set in advance, To carry out on experiment on the cut detection of frames comprehensively, I experimented on many kinds of video. analyzing and comparing efficiency of the cut detection system.

• The KIPS Transactions:PartB
• /
• v.17B no.2
• /
• pp.115-124
• /
• 2010

Stereo matching techniques are categorized in two major schemes, local and global matching techniques. In global matching schemes, several investigations are introduced, where cost accumulation is performed in multiple matching lines. In this paper, we introduce a new multi-line stereo matching techniques which expands a conventional single-line matching scheme to multiple one. Matching cost is based on simple normalized cross correlation. We expand the scan-line optimization technique to a multi-line scan-line optimization technique. The proposed technique first generates a reliability image, which is iteratively updated based on the previous reliability measure. After some number of iterations, the reliability image is completed by a hole-filling algorithm. The hole-filling algorithm introduces a disparity score table which records the disparity score of the current pixel. The disparity of an empty pixel is determined by comparing the scores of the neighboring pixels. The proposed technique is tested using the Middlebury and CMU stereo images. The error analysis shows that the proposed matching technique yields better performance than using conventional global matching algorithm.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.5
• /
• pp.596-600
• /
• 2010

This paper proposes hough transform-based semi-automatic vertex detection algorithm for object modeling on a mobile phone supporting touch-screens. The proposed algorithm shows fast processing time by searching the limited range of parameters for computing hough transform with a small range of ROI image. Moreover, the proposed algorithm removes bad candidates among the detected lines by selecting the two closest candidate lines from the position of user's input. After that, it accurately detects an interesting vertex without additionally required interactions by detecting an intersection point of the two lines. As a result, we believe that the proposed algorithm shows a 1.4 pixel distance error on average as a vertex detection accuracy under such conditions as a 5.7 pixel distance error on average as an inaccurate input.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39C no.5
• /
• pp.447-455
• /
• 2014

In this paper, we consider a representative integral imaging method in glasses-free 3D image processing and propose a prioritized transmission scheme for guaranteeing a received video quality in error-prone environments. According to the correlation of pixels consisting of each voxel of integral image, we set the priority differently and apply the modulation level according to this priority value. That is to say, the corresponding pixels with small variance are set to a high priority and transmitted by using a low level modulation that is robust under transmission errors, but the corresponding pixels with greater variance are set to a lower priority and transmitted by using a high level modulation that has a high bit error rate but fast transmission rate. Result shows that the proposed scheme that applies the error-robust modulation level to the important image bit stream with the high priority improves the peak to sidelobe ratio (PSR) of the received 3D image, compared with a typical method that use the same modulation level without distinction of priorities.

• The KIPS Transactions:PartB
• /
• v.16B no.3
• /
• pp.195-202
• /
• 2009

In this paper, we propose the regions segmentation method of the white matter and the gray matter for brain MR image by using the ant colony optimization algorithm. Ant Colony Optimization (ACO) is a new meta heuristics algorithm to solve hard combinatorial optimization problem. This algorithm finds the expected pixel for image as the real ant finds the food from nest to food source. Then ants deposit pheromone on the pixels, and the pheromone will affect the motion of next ants. At each iteration step, ants will change their positions in the image according to the transition rule. Finally, we can obtain the segmentation results through analyzing the pheromone distribution in the image. We compared the proposed method with other threshold methods, viz. the Otsu' method, the genetic algorithm, the fuzzy method, and the original ant colony optimization algorithm. From comparison results, the proposed method is more exact than other threshold methods for the segmentation of specific region structures in MR brain image.

• Journal of Biomedical Engineering Research
• /
• v.19 no.3
• /
• pp.225-232
• /
• 1998

Results of Monte Carlo simulations on amorphous silicon based x-ray imaging arrays are described. In order to investigate the characteristics of amorphous silicon x-ray imaging devices and to provide the optimum design parameter, Monte Carlo simulations were performed. Monte Carlo simulation codes for our purpose were developed and various combinations of x-ray peak voltages, aluminum filter thicknesses, CsI(TI) thicknesses, and amorphous silicon photodiode pixel sizes were tested in connection with detection efficiency and spatial resolution of the amorphous silicon based x-ray imager. With usual Csl(TI) thickness of 300${\mu}{\textrm}{m}$-500${\mu}{\textrm}{m}$, detection efficiency was in the range of 70%-95% and energy absorption efficiency was in the range of 40%-70% for 60kVp-120kVp x-ray. From the simulations it was found that amorphous silicon pixel size and Csl(TI) thickness were the most important parameters which determine the resolution of the imager. By use of our simulation results we could provide proper combinations of Csl(TI) thicknesses and pixels sizes for optimum sensitivity and resolution.

• The Bulletin of The Korean Astronomical Society
• /
• v.37 no.2
• /
• pp.212.2-212.2
• /
• 2012

지구 자기권에 존재하는 플라즈마 입자의 다중관측을 목적으로 개발된 초소형 탑재체 STEIN (SupraThermal Electron, Ion, Neutral) 은 경희대학교와 UC Berkeley가 공동으로 개발 중인 3대의 초소형 과학위성 TRIO-CINEMA (TRiplet Ionosphere Observatory - Cubesat for Ion, Neutral, Electron and MAgnetic fields) 에 탑재될 입자 검출기이다. 32개의 픽셀로 이루어진 STEIN 검출기는 2~300 keV의 전자, 4~300 keV의 이온과 중성입자(Energetic Neutral Atom: ENA) 를 분리 계측할 목적으로 설계되었으며, 하전입자가 정전장 편향기를 통과하여 서로 다른 검출기 픽셀에 도달함으로써 전자와 이온, 중성입자를 분리하여 계측할 수 있도록 하였다. 한편, STEIN 구조물에서 발생한 2차 입자의 검출을 방지하기 위해 정전 편향기 사이에 차단날(blade)을 설계하였다. 본 연구에서는 STEIN 모의실험 예비 결과로써 전기장에 크기 및 차단날에 의한 하전입자의 궤적과 이에 따른 분리 계측 성능을 알아보고자 Geant4 (GEometry ANd Tracking)를 사용하여 검출기 픽셀에 입사하는 전자의 초기 위치를 분석하였다. 전자의 입사 위치는 검출기로부터 5 cm 전방에서 6 mm * 20 mm 범위 내에서 무작위로 생성하여 검출기의 방향으로 수직 입사하였다. 분석 결과 전자들은 전기장의 방향에 따라 편향되는 결과를 보였으며, 저에너지 전자는 강한 전기장의 영향으로 차단날에 의해 차폐되어 검출되지 않았다. 따라서 전기장의 크기와 차단날에 따른 입자 분리 검출이 가능함을 본 모의실험을 통해 확인하였으며, STEIN 운용 시 입자 분리 검출 및 결과 분석 기반으로 본 연구 결과를 사용될 수 있을 것으로 기대된다.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2000.04a
• /
• pp.425-428
• /
• 2000

2차원 슬라이스 영상으로부터 volume rendered 이미지를 생성하기 위해서는 2차원 영상의 pixel 데이터를 voxel 기반으로 재구성해야 한다. 영상을 재구성하면서 생성되는 voxel value 는 3차원 영상을 2차원 화면으로 원근 투영할 때 최종 픽셀값을 결정하는 기본 요소가 된다. 따라서 본 논문에서는 조합되는 voxel value를 결정하는 Transfer Function를 이용한 intensity 와 gradient magnitude 의조작을 통하여 최종 3차원 이미지에서 오브젝트의 surface 뿐만 아니라 내부의 서로 다른 조직끼리의 경계 영역을 가시화하여 보았다.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2003.11b
• /
• pp.569-572
• /
• 2003

본 연구에서는 뉴우턴법에 기초한 고정점 알고리즘의 신경망 기반 독립성분분석에 kurtosis를 추가한 독립성분의 군집화를 제안하였다. 여기서 뉴우턴법의 고정점 알고리즘은 엔트로피에 기초한 목적 함수의 근을 구하는 근사화 방법으로 빠른 성분분석을 위함이고, kurtosis는 독립성분의 추출순서를 고려하지 않는 속성을 개선하기 위함이다. 제안된 기법을 256$\times$256 픽셀의 8개 혼합영상의 분리에 적용한 결과, 제안된 방법은 기존의 독립성분분석에서 분석순서를 고려치 않는 제약을 효과적으로 해결 할 수 있음을 확인하였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10a
• /
• pp.127-129
• /
• 2000

일반적인 색 정보추출방법으로 색 히스토그램(Color Histogram)은 색의 분포나 응집성, 질감에 대한 구분능력이 없다는 단점을 가지고 있어 정환한 이미지 유사성 비교를 위해 추가적인 정보를 요구한다. Androutsos등은 Haar Wavelet 변환을 통해 이미지의 방향성 질감정보를 구하였다[1]. 하지만 이 방법은 Haar Wavelet 변환의 특성으로 인해 정확한 방향성 정보를 얻을 수 없었다. 본 논문에서는 인접 픽셀(pixel)값의 편차(deviaiton)를 이용하여 방향성 정보를 추출 성능을 향상시키는 방법을 제안하였고, Brodatz 112 질감 이미지와 실재 자연사진을 통해 방향성 질감의 성능을 평가하였다.