• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.3
• /
• pp.163-174
• /
• 2004

The 3D tooth model in which each tooth can be manipulated individualy is essential component for the orthodontic simulation and implant simulation in dental field. For the reconstruction of such a tooth model, we need an image segmentation algorithm capable of separating individual tooth from neighboring teeth and alveolar bone. In this paper we propose a CT image normalization method and adaptive optimal thresholding algorithm for the segmenation of tooth region in CT image slices. The proposed segmentation algorithm is based on the fact that the shape and intensity of tooth change gradually among CT image slices. It generates temporary boundary of a tooth by using the threshold value estimated in the previous imge slice, and compute histograms for the inner region and the outer region seperated by the temporary boundary. The optimal threshold value generating the finnal tooth region is computed based on these two histogram.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.4
• /
• pp.73-81
• /
• 2011

In this paper, an improved block-based background modeling technique using adaptive parameter estimation that judiciously adjusts the number of model histograms at each frame sequence is proposed. The conventional block-based background modeling method has a fixed number of background model histograms, resulting to false negatives when the image sequence has either rapid illumination changes or swiftly moving objects, and to false positives with motionless objects. In addition, the number of optimal model histogram that changes each type of input image must have found manually. We demonstrate the proposed method is promising through representative performance evaluations including the background modeling in an elevator environment that may have situations with rapid illumination changes, moving objects, and motionless objects.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.4C
• /
• pp.350-357
• /
• 2010

In this paper, we present an auto-range fast bilateral filter (FBF) for high-dynamic-range (HDR) images, which increases computation speed by using adaptive standard deviations for range filter (RF) of FBF in iCAM06. Many images that cover the entire dynamic range of the scene with different exposure times are fused into one High Dynamic Range (HDR) image. The representative algorithm for HDR image rendering is iCAM06, which is based on the iCAM framework, such as the local white point adaptation, chromatic adaptation, and the image processing transform (IPT) uniform color space. FBF in iCAM06 uses constant standard deviation in RF. So, it causes unnecessary FBF computation in high stimulus range with broad and low distribution. To solve this problem, the low stimulus image and high stimulus image of CIE tri-stimulus values (XYZ) divided by the threshold are respectively processed by adaptive standard deviation based on its histogram distribution. Experiment results show that the proposed method reduces computation time than the previous FBF.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.16 no.4
• /
• pp.299-307
• /
• 2016

While segmenting "complex" images (with multiple objects, many details, etc.) we experienced a need to explore new ways for time-efficient and meaningful image segmentation. In this paper we propose a new technique for image segmentation which has only one variable for controlling the expected number of segments. The algorithm focuses on the treatment of pixels in transition zones between various label distributions. Results of the proposed algorithm (e.g. on the Berkeley image segmentation dataset) are comparable to those of GMM or HMM-EM segmentation, but are achieved with significantly reduced computation time.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.16 no.2
• /
• pp.104-110
• /
• 2016

Dense local image descriptors like SIFT are fruitful for capturing salient information about image, shown to be successful in various image-related tasks when formed in bag-of-words representation (i.e., histograms). In this paper we consider to utilize these dense local descriptors in the object tracking problem. A notable aspect of our tracker is that instead of adopting a point estimate for the target model, we account for uncertainty in data noise and model incompleteness by maintaining a distribution over plausible candidate models within the Bayesian framework. The target model is also updated adaptively by the principled Bayesian posterior inference, which admits a closed form within our Dirichlet prior modeling. With empirical evaluations on some video datasets, the proposed method is shown to yield more accurate tracking than baseline histogram-based trackers with the same types of features, often being superior to the appearance-based (visual) trackers.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2016.06a
• /
• pp.361-363
• /
• 2016

현재 차량 내 운전자에게 편의성과 안전성을 제공하는 시스템이 활발히 개발 중이고 향후 ADAS(Advanced Driver Assistance System)와 스마트 자동차에서 영상 정보를 이용한 물체 추적과 분석은 매우 중요한 부분을 차지하고 있다. 영상에서 얻을 수 있는 정보 중 현재 도로의 이정표 정보는 중요한 분석 정보로 사용된다. 하지만 국내 도로표지판 검출 연구의 경우 유럽과 북미와 비교하여 연구 개발이 활발히 진행되고 있지 않다. 국내의 경우 도로 이정표에서 영문자뿐만 아니라 한글 문자 정보까지 포함하고 있어 검출이 쉽지 않다. 또한 비교적 밝고 잡음이 적은 검출하기 좋은 환경에서는 검출이 잘 되지만 명암이 뚜렷하지 않고 잡음이 많은 환경에서는 도로 이정표 문자 검출이 어렵다. 이에 본 논문에서는 CLAHE(Contrast-Limited Adaptive Histogram Equalization) 방법을 적용하여 영상이 어둡고 잡음이 많은 환경에서 국내 도로 이정표의 문자 정보를 얻는다. 실험 결과, 기존 방법에 비해 문자 영역 검출 성능이 향상되었다.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2009.01a
• /
• pp.207-210
• /
• 2009

Edge detection is an important process in low level image processing. But many proposed methods for edge detection are not very robust to the image noise and are not flexible for different images. To solve the both problems, an algorithm is proposed which eliminate the noise by mean shift algorithm in advance, and then adaptively determine the double thresholds based on gradient histogram and minimum interclass variance, With this algorithm, it can fade out almost all the sensitive noise and calculate the both thresholds for different images without necessity to setup any parameter artificially, and choose edge pixels by fuzzy algorithm.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2011.07a
• /
• pp.303-304
• /
• 2011

영역기반 스테레오 매칭의 분야에서 최근 인간의 시각체계(Human Visual System)에 기반하여 영역내의 밝기값과 거리값에 따라 적응적으로 가중치를 부여하는 적응적 영역 가중치(Adaptive Support-Weight) 방법이 좋은 매칭 결과를 보이고 있다. 하지만 이 방법은 영역 윈도우의 크기가 커짐에 따라 기하급수적으로 계산량이 많아지는 단점을 보이고 있다. 이에 Bilateral filter 수식으로 근사화 후 Integral Histogram 기법을 적용하여 영역 윈도우의 크기에 상관없이 상수 시간 O(1) 내에 매칭을 수행하는 연구가 진행되었다. 하지만 이 방법은 근사화 과정에서의 원 ASW 수식을 왜곡하기 때문에 매칭 정확도의 손실을 가져오게 된다. 이에 본 논문에서는 Bilateral 접근 방식, Sub-Block 방식 및 적응적 시차 탐색 방식에 대하여 각 방식에서 필요한 메모리 자원과 소모되는 계산량의 비용과 동시에 매칭 결과 정확도 면에서 비교하고 가장 좋은 접근 방식을 도출하고자 한다.

• Proceedings of the KIEE Conference
• /
• 2006.10c
• /
• pp.434-436
• /
• 2006

In a visual driver-assistance system, separating moving objects from fixed objects are an important problem to maintain multiple hypothesis for the state. Color and edge-based tracker can often be "distracted" causing them to track the wrong object. Many researchers have dealt with this problem by using multiple features, as it is unlikely that all will be distracted at the same time. In this paper, we improve the accuracy and robustness of real-time tracking by combining a color histogram feature with a brightness of Optical Flow-based feature under a Sequential Monte Carlo framework. And it is also excepted from Tracking as time goes on, reducing density by Adaptive Particles Number in case of the fixed object. This new framework makes two main contributions. The one is about the prediction framework which separating moving objects from fixed objects and the other is about measurement framework to get a information from the visual data under a partial occlusion.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2017.11a
• /
• pp.84-87
• /
• 2017

주변 픽셀간의 명도 차이가 작을수록 같은 경계를 구성하고 있을 가능성이 크다. 따라서 주변 픽셀간의 명도를 고려하여 경계 추출기를 활용한다면 보다 정확한 경계선 추출이 가능하다. 하지만 한가지의 히스토그램 평활화와 k-means 군집화를 사용하는 기존 알고리듬은 평활화에 의한 이미지 왜곡이나, 명도 차이가 큰 픽셀이 같은 그룹에 속하는 경우 혹은 명도 차이가 작은 픽셀이 각각 다른 그룹에 속하는 경우와 같이 그룹화의 오류가 있기 때문에 원본 이미지에 없던 불필요한 경계선이 발견되었다. 본 논문은 하나의 이미지에 대해서 여러 가지 히스토그램 평활화 방법으로 각각 다른 명도 분포를 얻어내어 적응적으로 경계선을 판단하는 알고리듬을 제안한다. 이는 기존 알고리듬에서 나타나는 불필요한 경계선을 제거하였으며 기본 경계 추출기의 효과를 향상시켰다.