• Proceedings of the KOSOMBE Conference
• /
• v.1993 no.11
• /
• pp.194-197
• /
• 1993

A technique for fast image reduction or expansion, in which the reduction(expansion) factor is either any integer or any rational number M/L Is represented. The multiresolution is modeled as an interpolation and filtering followed by a decimation. The model enables frequency domain analysts of the muitiresolution representations as well as convenient design of the Kernels(filters). Using any rin linear phase(Type I) filters a fine to coarse multiresolution structure can be generated.

• The KIPS Transactions:PartB
• /
• v.17B no.1
• /
• pp.63-68
• /
• 2010

In this paper, we propose a multiresolution stereo matching method based on genetic algorithm using edge information. The proposed approach considers the matching environment as an optimization problem and finds the solution by using a genetic algorithm. A cost function composes of certain constraints which are commonly used in stereo matching. We defines the structure of chromosomes using edge pixel information of reference image of stereo pair. To increase the efficiency of process, we apply image pyramid method to stereo matching and calculate the initial disparity map at the coarsest resolution. Then initial disparity map is propagated to the next finer resolution, interpolated and performed disparity refinement. We valid our approach not only reduce the search time for correspondence but alse ensure the validity of matching.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.25 no.6
• /
• pp.523-528
• /
• 2015

In this paper, we propose a new multiresolutional and dynamic approach of the EM algorithm. EM is a very popular and powerful clustering algorithm. EM, however, has problems that indexes multiresolution data and requires a priori information on a proper number of clusters in many applications, To solve such problems, the proposed EM algorithm can impose a multiresolution kd-tree structure in the E-step and allocates a cluster based on sequential data. To validate clusters, we use a merge criteria for cluster merging. We demonstrate the proposed EM algorithm outperforms for texture image segmentation.

• Communications of the Korean Mathematical Society
• /
• v.15 no.2
• /
• pp.285-308
• /
• 2000

We generalize bi-orthogonal (non-orthogona) MRA to frame MRA in which the family of integer translates of a scaling func-tion forms a frame for the initial ladder space V0. We investigate the internal structure of frame MRA and establish the existence of a dual scaling function, and show that, unlike bi-orthogonal MRA, there ex-ists a frame MRA that has no (frame) 'wavelet'. Then we prove the existence of a dual wavelet under the assumption of the existence of a wavelet and present easy sufficient conditions for the existence of a wavelet. Finally we give a new proof of an equivalent condition for the translates of a function in L2(R) to be a frame of its closed linear span.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.9 no.5
• /
• pp.640-647
• /
• 1998

Microstrip patch antennas are analyzed by a multiresolution wavelet method. The spectral Green's dyad of the structure is obtained and its joint spatial-spectral domain representations are presented. Based on the joint spatial-spectral domain representation, we show that the spectral-domain wavelets are useful in the analysis of this problem. We obtain the matrix equations of the integral equations of this Green's dyad by using the method of moment(MoM), and efficiently solve the problem using the spectral domain wavelet transform concepts in conjuction with the conjugate gradient method. The results for a single-layered square patch are compared with those of conventional MoM and CG-FFT.

• 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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.12
• /
• pp.3033-3045
• /
• 1996

In this paper, we propse an object-oriented coding method in low bit-rate channels using pyramid structure and residual image compensation. In the motion estimation step, global motion is estimated using a set of multiresolution images constructed in a pyramid structure. We split an input image into two regions based on the gradient value. Regions with larte motions obtain observation points at low resolution level to guarantee robustness to noise and to satisfy a motion constraint equation whereas regions with local motions such as eye, and lips get observation points at the original resolution level. Local motion variations and intesity variations of an image reconstructed by the golbal motion are compensated additionally by using the previous residual image component. Finally, the model failure (MF) region is compensated by the pyramid mapping of the previous displaced frame difference (DFD). Computer simulation results show that the proposed method gives better performance that the convnetional one in terms of the peak signal to noise ratio (PSNR), compression ratio (CR), and computational complexity.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.7
• /
• pp.3284-3306
• /
• 2018

This study proposes a method to develop an authoring system(GeoMaTree) for diverse trees that constitute a virtual landscape. The GeoMaTree system enables the simple, intuitive production of an efficient structure, and supports real-time processing. The core of the proposed system is a procedural modeling based on a mathematical model and an application that supports digital content creation on diverse platforms. The procedural modeling allows users to control the complex pattern of branch propagation through an intuitive process. The application is a multi-resolution 3D model that supports appropriate optimization for a tree structure. The application and a compatible function, with commercial tools for supporting the creation of realistic synthetic images and virtual landscapes, are implemented, and the proposed system is applied to a variety of 3D image content.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.9 no.4
• /
• pp.12-21
• /
• 2006

Recently, Very large and high resolution geological data from aerial or satellite imagery are available. Many researches and applications require to do realtime visualization of interest geological area or entire planet. Important operation of wide-spreaded terrain realtime visualization technique is the appropriate model resolution selection from pre-processed multi-resolution model hierarchy depend upon participant's view. For embodying such realtime rendering system with large geometric data, Preprocessing multi-resolution hierarchy from large scale geological information of interest area is required. In this research, recent Cubic multiresolution 4-8 tile hierarchy is selected for global planetary applications. Based upon the tile hierarchy, It constructs the selective terminal level tile mesh for original geological information area and starts to sample individual generated tiles for terminal level tiles. It completes the hierarchy by constructing intermediate tiles with low pass filtering in bottom-up direction. This research embodies series of efficient cubic 4-8 tile hierarchy construction mechanism with out-of-core storage. The planetary scale Mars' geographical altitude data and image data were selected for the experiment.

• Journal of Information Processing Systems
• /
• v.13 no.5
• /
• pp.1183-1202
• /
• 2017

Image restoration has been carried out by texture synthesis mostly for large regions and inpainting algorithms for small cracks in images. In this paper, we propose a new approach that allows for the simultaneous fill-in of different structures and textures by processing in a wavelet domain. A combination of structure inpainting and patch-based texture synthesis is carried out, which is known as patch-based inpainting, for filling and updating the target region. The wavelet transform is used for its very good multiresolution capabilities. The proposed algorithm uses the wavelet domain subbands to resolve the structure and texture components in smooth approximation and high frequency structural details. The subbands are processed separately by the prioritized patch-based inpainting with isophote energy driven texture synthesis at the core. The algorithm automatically estimates the wavelet coefficients of the target regions of various subbands using optimized patches from the surrounding DWT coefficients. The suggested performance improvement drastically improves execution speed over the existing algorithm. The proposed patch optimization strategy improves the quality of the fill. The fill-in is done with higher priority to structures and isophotes arriving at target boundaries. The effectiveness of the algorithm is demonstrated with natural and textured images with varying textural complexions.