http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
송병철,조유경,최은광,좌혜영,김흥업,송현주,나수영,부선진,정승욱 대한간학회 2014 Clinical and Molecular Hepatology(대한간학회지) Vol.20 No.4
Background/Aims: Spontaneous HBeAg seroconversion occurs frequently in the immune reactive phase in HBeAg-positive chronic hepatitis B (CHB). Therefore, observation for 3–6 months before commencing antiviral therapy is recommended in patients with alanine aminotransferase (ALT) levels that exceed twice the upper limit of normal (ULN). However, HBeAg seroconversion occurs infrequently in patients infected with hepatitis B virus (HBV) genotype C. The aim of the present study was to determine whether the waiting policy is necessary in endemic areas of HBV genotype C infection. Methods: Ninety patients with HBeAg-positive CHB were followed prospectively without administering antiviral therapy for 6 months. Antiviral therapy was initiated promptly at any time if there was any evidence of biochemical (i.e., acute exacerbation of HBV infection or aggravation of jaundice) or symptomatic deterioration. After 6 months of observation, antiviral therapy was initiated according to the patient’s ALT and HBV DNA levels. Results: Only one patient (1.1%) achieved spontaneous HBeAg seroconversion. Biochemical and symptomatic deterioration occurred before 6 months in 17 patients (18.9%) and 5 patients, respectively. High ALT and HBV DNA levels were both independent risk factors for biochemical deterioration. Of 15 patients with HBV DNA ≥5.1×107 IU/mL and ALT ≥5×ULN, biochemical deterioration occurred in 7 (46.7%), including 1 patient receiving liver transplantation due to liver failure. Conclusions: Spontaneous HBeAg seroconversion in patients with HBeAg-positive CHB is rare within 6 months. Biochemical deterioration was common and may lead to liver failure. Immediate antiviral therapy should be considered, especially in patients with high ALT and HBV DNA levels in endemic areas of genotype C infection.
효율적인 영상 검색을 위한 클러스터링 기반 고속 다 해상도 전역 탐색 기법
송병철,김명준,라종범,Song, Byeong-Cheol,Kim, Myeong-Jun,Ra, Jong-Beom 대한전자공학회 2001 電子工學會論文誌-SP (Signal processing) Vol.43 No.2
유사도 측정자 (similarity measure)에 따라 문의자 (query)의 최적 정합자 (the best match)를 찾는 최적 검색 (optimal retrieval)을 위해서는 데이터베이스의 모든 영상들에 대해 전역 탐색 (exhaustive search)을 수행해야 한다. 그러나, 일반적인 전역 탐색은 방대한 계산량을 요구한다. 그 계산량을 줄이기 위해, 본 논문은 영상 데이터베이스의 클러스터링 (clustering)에 기반한 고속 다 해상도 전역 탐색 기법을 제안한다. 먼저 데이터베이스 내의 모든 영상들을 일정 수의 클러스터 (cluster)들로 나눈다. 각 클러스터는 유사한 특징 (feature)을 갖는 영상들로 구성된다. 그리고, 각 클러스터와 문의자 간 거리 (distance)의 하계(lower bound)를 구하고, 가능성이 전혀 없다고 판단될 경우 그 클러스터를 제거한다. 가능성이 있다고 판단된 클러스터들에 속한 후보 영상들 중에서 최적 정합자를 찾는다. 또한, 불필요한 특징 정합 연산을 줄이기 위해 다 해상도 데이터 구조에 기반한 거리 부등식 성질 (distance inequality property)을 유도하여, 탐색 과정에 적용한다. 제안한 기법은 고속 다 해상도 전역 탐색 기법으로서 단일 최적 정합자뿐만 아니라 다수의 상위 최적 정합자들도 정확하게 찾을 수 있다. 가장 보편적인 밝기 히스토그램 (luminance histogram)특징을 사용하여, 제안한 기법이 고속의 탐색 속도와 함께 최적 검색을 보장함을 증명해 보인다. In order to achieve optimal retrieval, i.e., to find the best match to a query according to a certain similarity measure, the exhaustive search should be performed literally for all the images in a database. However, the straightforward exhaustive search algorithm is computationally expensive in large image databases. To reduce its heavy computational cost, this paper presents a fast exhaustive multi-resolution search algorithm based on image database clustering. Firstly, the proposed algorithm partitions the whole image data set into a pre-defined number of clusters having similar feature contents. Next, for a given query, it checks the lower bound of distances in each cluster, eliminating disqualified clusters. Then, it only examines the candidates in the remaining clusters. To alleviate unnecessary feature matching operations in the search procedure, the distance inequality property is employed based on a multi-resolution data structure. The proposed algorithm realizes a fast exhaustive multi-resolution search for either the best match or multiple best matches to the query. Using luminance histograms as a feature, we prove that the proposed algorithm guarantees optimal retrieval with high searching speed.