http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Hyperspectral Fluorescence Imaging for Mouse Skin Tumor Detection
공성곤,Matthew E. Martin,Tuan Vo-Dinh 한국전자통신연구원 2006 ETRI Journal Vol.28 No.6
This paper presents a hyperspectral imaging technique based on laser-induced fluorescence for non-invasive detection of tumorous tissue on mouse skin. Hyperspectral imaging sensors collect image data in a number of narrow, adjacent spectral bands. Such high-resolution measurement of spectral information reveals contiguous emission spectra at each image pixel useful for the characterization of constituent materials. The hyperspectral image data used in this study are fluorescence images of mouse skin consisting of 21 spectral bands in the visible spectrum of the wavelengths ranging from 440 nm to 640 nm. Fluorescence signal is measured with the use of laser excitation at 337 nm. An acousto-optic tunable filter (AOTF) is used to capture images at 10 nm intervals. All spectral band images are spatially registered with the reference band image at 490 nm to obtain exact pixel correspondences by compensating the spatial offsets caused by the refraction differences in AOTF at different wavelengths during the image capture procedure. The unique fluorescence spectral signatures demonstrate a good separation to differentiate malignant tumors from normal tissues for rapid detection of skin cancers without biopsy.
시뮬레이티드 어닐링기법을 이용한 다단 상호접속망의 최적 경로배정
김성수,공성곤 崇實大學校 生産技術硏究所 1995 論文集 Vol.25 No.2
This paper presents an optimal routing method for a multistage interconnection network(MIN) using the simulated annealing technique. Optimal routing using the simulated annealing technique can find global minimum better than that of the greedy search in the Benes network and the Clos network. Exhaustive search always finds the optimal path, but with heavy computation. Although greedy search sets up a path quickly, the path found need not be optimal. The simulated annealing search can find a sub optimal path in time comparable with the greedy search. Simulated annealing technique can be employed as a routing method for a Random MIN that doesn't have a simple routing method.