• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.40 no.2
• /
• pp.1-10
• /
• 2003

This paper presents an efficient method for image segmentation based on a multiresolution application of a wavelet transform and watershed segmentation algorithm. The procedure toward complete segmentation consists of four steps: pyramid representation, image segmentation, region merging and region projection. First, pyramid representation creates multiresolution images using a wavelet transform. Second, image segmentation segments the lowest-resolution image of the pyramid using a watershed segmentation algorithm. Third, region merging merges the segmented regions using the third-order moment values of the wavelet coefficients. Finally, the segmented low-resolution image with label is projected into a full-resolution image (original image) by inverse wavelet transform. Experimental results of the presented method can be applied to the segmentation of noise or degraded images as well as reduce over-segmentation.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.41 no.1
• /
• pp.38-46
• /
• 2004

Image segmentation is the task which partitions the image into meaningful regions and considered to be one of the most important steps in computer vision and image processing. Image segmentation is also widely used in object-based video compression such as MPEG-4 to extract out the object regions from the given frame. Watershed algorithm is frequently used to obtain the more accurate region boundaries. But, it is well known that the watershed algorithm is extremely sensitive to gradient noise and usually results in oversegmentation. To solve such a problem, we propose an image segmentation method which is robust to noise by using stabilized inverse diffusion equation (SIDE) and is more efficient in segmentation by employing multiresolution approach. In this paper, we apply both the region projection method using labels of adjacent regions and the region merging method based on region adjacency graph (RAG). Experimental results on noisy image show that the oversegmenation is reduced and segmentation efficiency is increased.

• Journal of Biomedical Engineering Research
• /
• v.19 no.6
• /
• pp.551-562
• /
• 1998

Amultiresolution filtering algorithm based on the physical SPECT lesion detachability provides and optimal solution for SPECT reconstruction problem. Related to the previous study, we estimated the SPECT lesion detection capability by m minimum detectable lesion sizes (MDLSs), and generated m reconstruction filters which are designed to maximize the smoothing effect at a fixed MDLS-dependent resolution level $\frac{MDLS}{4\sqrt{2In2}}$. The proposed multiresolution filtering algorithm used a coarse-to-fine approach for the m-level resolution filter images obtained from these m filters for a given projection image. First, the local homogeneity is determined for every pixel of the filter images, by comparing the local variance value computed in a window centered at the pixel and the mode determined from the distribution of the local variances. Based on the local homogeneity, the pixels declared as homogeneous are chosen from the filter image of the lowest resolution, and for the other pixels the same process is repeated for the higher resolution filter images. For the non-homogeneous pixels after this pixels after this repetition process ends, the pixel values of the highest resolution filter image are substituted. From the results of the simulated experiments, the proposed multiresolution filtering algorithm showed a strong smoothing effect in the homogeneous regions and a significant resolution improvement near the edge regions of the projection images, and so produced good adaptability effects in the reconstructed images.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.43 no.1 s.307
• /
• pp.55-66
• /
• 2006

We propose a progressive image retrieval method based on an efficient combination of multiresolution color and torture features in wavelet transform domain. As a color feature, color autocorrelogram of the hue and saturation components is chosen. As texture features, BDIP and BVLC moments of the value component are chosen. For the selected features, we obtain multiresolution feature vectors which are extracted from all decomposition levels in wavelet domain. The multiresolution feature vectors of the color and texture features are efficiently combined by the normalization depending on their dimensions and standard deviation vector, respectively, vector components of the features are efficiently quantized in consideration of their storage space, and computational complexity in similarity computation is reduced by using progressive retrieval strategy. Experimental results show that the proposed method yields average $15\%$ better performance in precision vs. recall and average 0.2 in ANMRR than the methods using color histogram color autocorrelogram SCD, CSD, wavelet moments, EHD, BDIP and BVLC moments, and combination of color histogram and wavelet moments, respectively. Specially, the proposed method shows an excellent performance over the other methods in image DBs contained images of various resolutions.

• Korean Journal of Remote Sensing
• /
• v.15 no.2
• /
• pp.147-158
• /
• 1999

Remote sensing technique has offered better understanding of our environment for the decades by providing useful level of information on the landcover. In many applications using the remotely sensed data, digital image processing methodology has been usefully employed to characterize the features in the data and develop the models. Random field models, especially Markov Random Field (MRF) models exploiting spatial relationships, are successfully utilized in many problems such as texture modeling, region labeling and so on. Usually, remotely sensed imagery are very large in nature and the data increase greatly in the problem requiring temporal data over time period. The time required to process increasing larger images is not linear. In this study, the methodology to reduce the computational cost is investigated in the utilization of the Markov Random Field. For this, multiresolution framework is explored which provides convenient and efficient structures for the transition between the local and global features. The computational requirements for parameter estimation of the MRF model also become excessive as image size increases. A Bayesian approach is investigated as an alternative estimation method to reduce the computational burden in estimation of the parameters of large images.

• Kyungpook Mathematical Journal
• /
• v.51 no.3
• /
• pp.293-300
• /
• 2011

In this paper, we obtain that the space $\mathcal{W}_2$ of minimally supported frequency wavelets, the supports of whose Fourier transforms consist of two intervals, is path-connected.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.1098-1101
• /
• 2004

The ordinary stereo image of an object consists of data of left and right views. Therefore, the left and right image pairs have to be transmitted simultaneously in order to display 3-dimentional video at the remote site. However, due to the twice data in comparing with a monoscopic image of the same object, it needs to be compressed for fast transmission and resource saving. Hence, it needs an effective coding algorithm for compressing stereo image. It was found previously that compressing left and right frames independently will achieve the compression ratio lower than compressing by utilizing the spatial redundancy between both frames. Therefore, in this paper, we study the stereo image compression technique based on the multiresolution wavelet transform using varied disparity-block size for estimation and compensation. The size of disparity-block in the stereo pair subbands are scaling on a coarse-to-fine wavelet coefficients strategy. Finally, the reference left image and residual right image after disparity estimation and compensation are coded by using SPIHT coding. The considered method demonstrates good performance in both PSNR measures and visual quality for stereo image.

• Proceedings of the KOSOMBE Conference
• /
• v.1994 no.12
• /
• pp.31-38
• /
• 1994

This paper proposed signal decomposition and multiresolution representation through wavelet transform using wavelet orthonormal basis. And it suggested most appropriate filter for scaling function in multiresoltion representation and compared two compression method, arithmetic coding and Huffman coding. Results are as follows 1. Daub18 coefficient is most appropriate in computing time, energy compaction, image quality. 2. In case of image browsing that should be small in size and good for recognition, it is reasonable to decompose to 3 scale using pyramidal algorithm. 3. For the case of progressive transmittion where requires most grateful image reconstruction from least number of sampls or reconstruction at any target rate, I embedded the data in order of significance after scaling to 5 step. 4. Medical images such as information loss is fatal have to be compressed by lossless method. As a result from compressing 5 scaled data through arithmetic coding and Huffman coding, I obtained that arithmetic coding is better than huffman coding in processing time and compression ratio. And in case of arithmetic coding I could compress to 38% to original image data.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.4
• /
• pp.758-763
• /
• 2006

In various fields of basic science and engineering, in order to present signals and systems exactly and acquire useful information from spatial and timely changes, many researches have been processed. In these methods, the Fourier transform which represents signal as the combination of the frequency component has been applied to the most fields. But as transform not to consider time information, the Fourier transform has its limitations of application. To overcome this problem, a variety of methods including the wavelet transform have been proposed. As transform to represent signal by using the changing window, according to scale parameter in time-scale domain, the wavelet transform is capable of multiresolution analysis and defines various functions according to the application environments. In this paper, to detect features of signal we analyzed wavelet the spectrum by using the basis function of the fourier transform.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.04b
• /
• pp.592-594
• /
• 2000

변형모델(deformable model)은 볼륨의료영상(volumetric medical image)으로부터 복잡한 인체기관의 3차원적 경계를 분할해내기 위해 효과적인 방법을 제공한다. 그러나, 기존 변형모델은 초기와 의존성, 오목한 경계(concavity) 분할의 비적합성, 그리고 모델내 요소간 자체교차(self-intersection)의 제한점을 가지고 있었다. 본 연구에서는 이러한 제한점을 극복하고, 오목한 구조를 포함하는 복잡한 인체기관의 경계를 분할하기에 적합한 새로운 변형모델을 제안하였다. 제안한 변형모델은 볼륨영상 피라미드(pyramid)를 기반으로 다해상도(multiresolution)의 모델 정제화(refinement)를 수행한다. 다해상도 모델 정제화는 전역적 시셈플링(global resampling) 및 지역적 리샘플링(local resampling)를 통하여 저해상도의 모델로부터 점차 고해상도의 모델로 이동하면서 객체의 경계를 계층적으로 분할해가는 방법이다. 다해상도 모델에 의한 계층적 경계 분할은 초기화 조건에의 의존성을 극복할 수 있게할 뿐 아니라, 빠른 속도로 원하는 객체의 경계에 수렴할 수 있게 한다. 또한 지역적 리샘플링은 모델 구성요소의 정규화를 수행함으로써 객체의 오목한 부분을 성공적으로 분할할 수 있게 한다. 그리고, 제안 모델은 기존 변형모델에서 포함하는 내부 힘(internal force)과 외부 힘(external force)외에 자체교차방지 힘(non-self-intersection force)을 추가함으로서 효과적으로 모델내의 자체교차를 방지할 수 있게 하였다.