• Journal of the Korea Society of Computer and Information
• /
• v.17 no.7
• /
• pp.67-76
• /
• 2012

This paper proposes an efficient method that helps a visually impaired person to detect a pavement borderline. A pedestrian is equipped with a camera so that the front view of a natural scene is captured. Our approach analyzes the captured image and detects the borderline of a pavement in a very robust manner. Our approach performs the task in two steps. In a first step, our approach detects a vanishing point and vanishing lines by applying an edge operator. The edge operator is designed to take a threshold value adaptively so that it can handle a dynamic environment robustly. The second step is to determine the borderlines of a pavement based on vanishing lines detected in the first step. It analyzes the vanishing lines to form VRays that confines the pavement only. The VRays segments out the pavement region in a radial manner. We compared our approach against Canny edge detector. Experimental results show that our approach detects borderlines of a pavement very accurately in various situations.

• The KIPS Transactions:PartB
• /
• v.11B no.2
• /
• pp.133-140
• /
• 2004

Recently, the dental information systems were rapidly developed in order to store and process the data of patients. But, these systems should serve a doctor a good quality information against disease for diagnostic and surgery purpose so as to success in this field. This function of the system it important to persuade patients to undergo proper surgical operation they needed. Hence, 3D teeth model capable of simulating the dental surgery and treatment is necessary Teeth manipulation of dentistry is performed on individual tooth in dental clinic. io, 3D teeth reconstruction system should have the techniques of segmentation and 3D reconstruction adequate for individual tooth. In this paper, we propose the techniques of adaptive optimal segmentation to segment the individual area of tooth, and reconstruction method of tooth based on contour-based method. Each tooth can be segmented from neighboring teeth and alveolar bone in CT images using adaptive optimal threshold computed differently on tooth. Reconstruction of individual tooth using results of segmentation can be manipulated according to user's input and make the simulation of dental surgery and treatment possible.

• The KIPS Transactions:PartB
• /
• v.19B no.4
• /
• pp.209-220
• /
• 2012

In this paper, we propose an adaptive pavement region detection method that is robust to changes of structural patterns in a natural scene. In order to segment out a pavement reliably, we propose two step approaches. We first detect the borderline of a pavement and separate out the candidate region of a pavement using VRays. The VRays are straight lines starting from a vanishing point. They split out the candidate region that includes the pavement in a radial shape. Once the candidate region is found, we next employ the adaptive multi-seed region growing(A-MSRG) method within the candidate region. The A-MSRG method segments out the pavement region very accurately by growing seed regions. The number of seed regions are to be determined adaptively depending on the encountered situation. We prove the effectiveness of our approach by comparing its performance against the performances of seed region growing(SRG) approach and multi-seed region growing(MSRG) approach in terms of the false detection rate.

• Journal of Broadcast Engineering
• /
• v.2 no.1
• /
• pp.56-64
• /
• 1997

An HDTV frame has 4~6 times more pixels than a DTV frame. In order to encode the HDTV image in real time, parallel processing architectures have been widely used in many HDTV codec developments. That is, an HDTV Image is divided into several subbands and each subband is encoded in parallel using some DTV level encoders. In this paper, we adopt an HDTV codec architecture which divides an HDTV frame into 4 subbands and propose a new scene change detection algorithm using local variance. In addition, a new adaptive multichannel rate control scheme which allocate target bits adaptively to each subband of the HDTV image based on the activities of subband images is suggested in this paper. The activities of subband images are calculated at scene change detection part and reused at the adaptive rate control part. The simulation results show that the proposed scene change detection algorithm detects the scene change of HDTV video very accurately. Also the suggested adaptive multichannel rate control scheme shows better performance than the rate control method which allocates target bits equally to each subbands of the HDTV image.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.1
• /
• pp.286-295
• /
• 2000

We present a novel statistically adaptive method using the Minimum Description Length(MDL) principle for unsupervised segmentation of magnetic resonance(MR) images. In the method, Markov random filed(MRF) modeling of tissue region accounts for random noise. Intensity measurements on the local region defined by a window are modeled by a finite Gaussian mixture, which accounts for image inhomogeneities. The segmentation algorithm is based on an iterative conditional modes(ICM) algorithm, approximately finds maximum ${\alpha}$ posteriori(MAP) estimation, and estimates model parameters on the local region. The size of the window for parameter estimation and segmentation is estimated from the image using the MDL principle. In the experiments, the technique well reflected image characteristic of the local region and showed better results than conventional methods in segmentation of MR images with inhomogeneities, especially.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2018.06a
• /
• pp.260-261
• /
• 2018

MPEG과 VCEG은 차세대 비디오 부호화 표준 기술 개발를 위한 JVET(Joint Video Exploration Team)을 구성하여 현재 비디오 표준화인 HEVC 대비 높은 부호화 효율을 목표로 연구를 진행하며 CfP(Call for Proposal) 단계를 진행 중이다. JVET의 공통 플랫폼인 JEM(Joint Exploration Test Model)은 HEVC의 quad-tree 기반 블록 분할 구조를 대신하여 더 많은 유연성을 제공하는 QTBT(Quad-tree plus binary-tree)가 적용되었다. QTBT는 화면 내 부호화 효율을 높이기 위한 하나의 방법으로 휘도와 색차 신호에 대해 분할된 블록 구조를 지원한다. 이러한 방법은 채널 간 블록 분할 모양이 동일하거나 비슷한 경우에 중복되는 블록 분할 신호가 발생할 수 있는 단점이 있다. 따라서 본 논문에서는 화면 내 부호화에서 채널 간 유사도 비교를 이용하여 적응형 색차 블록 방법을 제안한다. 제안한 방법의 실험 결과로 JEM 6.0과 비교하여 CfE(Call for Evidence) 영상에서 평균 0.28%의 Y BD-rate 감소와 함께 평균 124.5%의 부호화 복잡도 증가를 확인하였다.

• Journal of KIISE:Databases
• /
• v.31 no.2
• /
• pp.122-131
• /
• 2004

Traditional works on indexing have been suggested for low dimensional data under dynamic environments. But recent database applications require efficient processing of huge sire of high dimensional data under static environments. Thus many indexing strategies suggested especially in partitioning ones do not adapt to these new environments. In our study, we point out these facts and propose a new partitioning strategy, which complies with new applications' requirements and is derived from analysis. As a preliminary step to propose our method, we apply a packing technique on the one hand and exploit observations on the Minkowski-sum cost model on the other, under uniform data distribution. Observations predict that unbalanced partitioning strategy may be more query-efficient than balanced partitioning strategy for high dimensional data. Thus we propose our method, called CSP (Cyclic Spliced Partitioning method). Analysis on this method explicitly suggests metrics on how to partition high dimensional data. By the cost model, simulations, and experiments, we show excellent performance of our method over balanced strategy. By experimental studies on other indices and packing methods, we also show the superiority of our method.

• Journal of IKEEE
• /
• v.21 no.3
• /
• pp.202-210
• /
• 2017

Recently, some variable length adaptive filters which employ variable lengths taps for the input signal statistics are proposed [1-5]. In this paper, a new subband adaptive filter with variable filter tap length is proposed. The proposed subband variable length adaptive filters can optimize filter length for each subband which can result less computational complexities with respect to the conventional full band adaptive filters. When the signal in the full band has narrow spectrum, the conventional full band adaptive requires very long filter taps, whereas the proposed subband variable filter requires less taps with the spectrum split in subband. The computer simulation results reveals that in many case, in system identification with narrow band system estimation, the proposed adaptive filter has less computational complexities with faster convergence.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.10a
• /
• pp.687-690
• /
• 2015

Forward collision warning systems(FCWS) and lane change assist systems(LCAS) need regions of interest for detecting lanes and objects as road regions. Watershed segmentation is effective algorithm that classify the road. That algorithm is split results appear differently depending on Watershed line with local minimum in the early part of the seed. If not road regions or vehicles combined the road's seed, It segment road with the others. For compensate the that defect, It has to adaptive change by road environment. The method is that image segmentate the several of regions of interest. Then It is set in a straight line that is detected in regions of interest. If It was detected cars on seed, seed is adjusted the location. And If It wasn't include the line, seed is adjusted the length for final decision the seed. We can detect the road region using the final seed that selected according to the road environment.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.42 no.6
• /
• pp.195-202
• /
• 2005

An adaptive segmentation algorithm is used to efficiently target decisions in local non-stationary images. Until now, several adaptive approaches have been proposed as a method of segmentation. However, they can't be directly used for radar target detection because a radar signal has different characteristics from general images. Generally, a histogram of radar signal shows that targets have a relatively small number of frequency functions compared to the background and distribution of background, which have several shapes as the environment changes. In this paper, we propose an adaptive segmentation algorithm using a histogram chord which is a right-down line from maximum pick of frequency function. The proposed method provides thresholds which are optimum for several radar environments because the used chord for threshold search is not significantly effected by interference conditions. Simulation results show that the proposed method is superior to the traditional algorithms, global threshold method and distribution median method, with respect to detection performance.