• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.3A
• /
• pp.258-267
• /
• 2002

We present an image retrieval method for improving retrieval performance by effective fusion of entropy features in wavelet region and wavelet moments. In this method, entropy features are sensitive to the local variation of gray level and well extract valley and edges. These features are effectively applied to contend-based image retrieval by well fusing to wavelet moments that represent texture property in multi-resolution. In order to evaluate the performance of the proposed method. We use Corel Draw Photo DB. Experiment results show that the proposed yields 11% better performance for Corel Draw Photo DB over wavelet moments method.

• IEIE Transactions on Smart Processing and Computing
• /
• v.3 no.1
• /
• pp.10-18
• /
• 2014

From the perspective of reducing the sampling cost of color images at high resolution, block-based compressive sensing (CS) has attracted considerable attention as a promising alternative to conventional Nyquist/Shannon sampling. On the other hand, for storing/transmitting applications, CS requires a very efficient way of representing the measurement data in terms of data volume. This paper addresses this problem by developing a measurement-coding method with the proposed customized Huffman coding. In addition, by noting the difference in visual importance between the luma and chroma channels, this paper proposes measurement coding in YCbCr space rather than in conventional RGB color space for better rate allocation. Furthermore, as the proper use of the image property in pursuing smoothness improves the CS recovery, this paper proposes the integration of a low pass filter to the CS recovery of color images, which is the block-based ${\ell}_{20}$-norm minimization. The proposed coding scheme shows considerable gain compared to conventional measurement coding.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.48 no.4
• /
• pp.76-85
• /
• 2011

In this paper, we propose a texture feature-based language identification using Gabor feature and wavelet-domain BDIP (block difference of inverse probabilities) and BVLC (block variance of local correlation coefficients) features. In the proposed method, Gabor and wavelet transforms are first applied to a test image. The wavelet subbands are next denoised by Donoho's soft-thresholding. The magnitude operator is then applied to the Gabor image and the BDIP and BVLC operators to the wavelet subbands. Moments for Gabor magnitude image and each subband of BDIP and BVLC are computed and fused into a feature vector. In classification, the WPCA (whitened principal component analysis) classifier, which is usually adopted in the face identification, searches the training feature vector most similar to the test feature vector. Experimental results show that the proposed method yields excellent language identification with rather low feature dimension for a document image DB.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.16 no.3
• /
• pp.2192-2200
• /
• 2015

In this paper, we propose an efficient vehicle image compensation algorithm based on Histogram Equalization. The proposed a vehicle image compensation algorithm was elimination to the vehicle image shake using motion compensation and motion estimation. And, algorithm was calculated the histogram of pixel values from each sub-image by dividing the image as the constant size areas in order to image enhancement. Also, it had enhancement to the image by adjusting the gradient. The proposed algorithm was evaluate the difference between of performance and time, image by applied to the IP, and were confirmed the image enhancement with removing of vehicle camera image shake. In this paper, the proposed vehicle image enhancement algorithm was demonstrated effectiveness when compared to existing vehicle image stabilization, because the elimination of shake for the vehicle images used real-time processing without using a memory. And it was obtained the reduction effect of the computation time by the calculated through block matching, and obtained the better restoration result for naturalness of the image with the lowest noise.

• Journal of the Korea Society of Computer and Information
• /
• v.8 no.4
• /
• pp.13-20
• /
• 2003

Based on the studies on the motion vector distributions estimated on the image sequences, we proposed constrained diamond search (DS) algorithm for fast block-matching motion estimation. By considering the fact that motion vectors are searched within the 2 pixels distance in vertically and horizontally on average, we confirmed that DS algorithm achieves close performance on error ratio and requires less computation compared with new three-step search (NTSS) algorithm. Also, by applying displaced frame difference (DFD) to DS algorithm, we reduced the computational loads needed to estimate the motion vectors within the stable block that do not have motions. And we reduced the possibilities falling into the local minima in the course of estimation of motion vectors by applying DFD to DS algorithm. So, we knew that proposed constrained DS algorithm achieved enhanced results as aspects of error ratio and the number of search points to be necessary compared with conventional DS algorithm, four step search (FSS) algorithm, and block-based gradient-descent search algorithm

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.8
• /
• pp.2068-2082
• /
• 2023

With the rapid development of deep learning, Depth Map Super-Resolution (DMSR) method has achieved more advanced performances. However, when the upsampling rate is very large, it is difficult to capture the structural consistency between color features and depth features by these DMSR methods. Therefore, we propose a color-image guided DMSR method based on iterative depth feature enhancement. Considering the feature difference between high-quality color features and low-quality depth features, we propose to decompose the depth features into High-Frequency (HF) and Low-Frequency (LF) components. Due to structural homogeneity of depth HF components and HF color features, only HF color features are used to enhance the depth HF features without using the LF color features. Before the HF and LF depth feature decomposition, the LF component of the previous depth decomposition and the updated HF component are combined together. After decomposing and reorganizing recursively-updated features, we combine all the depth LF features with the final updated depth HF features to obtain the enhanced-depth features. Next, the enhanced-depth features are input into the multistage depth map fusion reconstruction block, in which the cross enhancement module is introduced into the reconstruction block to fully mine the spatial correlation of depth map by interleaving various features between different convolution groups. Experimental results can show that the two objective assessments of root mean square error and mean absolute deviation of the proposed method are superior to those of many latest DMSR methods.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.1
• /
• pp.103-109
• /
• 1995

In this paper, we propose a postprocessing method that neatly removes blocking effect but retains visually important image details and edges. The iterative thresholded lowpass filter is basically a low pass filter whose ouput depends on three variable elements. I.e. iteration number, threshold value and passband width. The threshold value restricts the difference between the output of the proposed filter and the original input independent of the iteration number. With this property, the iterative thresholded lowpass filter can retain most of the image details while smoothing the block boundaries. The other two variable elements, i.e. iteration number and passband width, can determine the convergence speed of the proposed filter. In this paper, we also propose several adaptive filtering techniques based on the iterative thresholded lowpass filter with their simulation results.

• Journal of KIISE:Software and Applications
• /
• v.31 no.3
• /
• pp.379-386
• /
• 2004

Video segmentation is a fundamental task in video indexing and it includes two kinds of shot change detections such as the abrupt transition and the gradual transition. The abrupt shot boundaries are detected by computing the image-based distance between adjacent frames and comparing this distance with a pre-determined threshold value. However, the gradual shot boundaries are difficult to detect with this approach. To overcome this difficulty, we propose the method that detects gradual transition in the MPEG compressed video using the HMM (Hidden Markov Model). We take two different HMMs such as a discrete HMM and a continuous HMM with a Gaussian mixture model. As image features for HMM's observations, we use two distinct features such as the difference of histogram of DC images between two adjacent frames and the difference of each individual macroblock's deviations at the corresponding macroblock's between two adjacent frames, where deviation means an arithmetic difference of each macroblock's DC value from the mean of DC values in the given frame. Furthermore, we obtain the DC sequences of P and B frame by the first order approximation for a fast and effective computation. Experiment results show that we obtain the best detection and classification performance of gradual transitions when a continuous HMM with one Gaussian model is taken and two image features are used together.

• Proceedings of the KIEE Conference
• /
• 2007.04a
• /
• pp.38-40
• /
• 2007

In this paper, we propose a novel architecture, which is based on DCT (Discrete Cosine Transform), for ME (Motion Estimation) and MC (Motion Compensation). The traditional algorithms of ME and MC based on DCT did not suffer the advantage of the coarseness of the 2-dimensional DCT (2-D DCT) coefficients to reduce the operational time. Therefore, we derive a recursion equation for transform-domain ME and MC and design the structure by using highly regular, parallel, and pipeline processing elements. The main difference with others is removing the IDCT block by using to transform domain. Therefore, the performance of our algorithm is more efficient in practical image processing such as DVR (Digital Video Recorder) system. We present the simulation result which is compare with the spatial domain methods. it shows reducing the calculation cost. compression ratio. and peak signal to noise ratio (PSNR).

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.42 no.3 s.303
• /
• pp.15-22
• /
• 2005

This paper proposed a object tracking algorithm which can track contour of fast moving object through motion estimation. Since the proposed tracking algorithm is based on the radial representation, the motion estimation of object can be accomplished at the center of object with the low computation complexity. The motion estimation of object makes it possible to track object which move fast more than distance from center point to contour point for each frame. In addition, by introducing both gradient image and difference image into energy functions in the process of energy convergence, object tracking is more robust to the complex background. The results of experiment show that the proposed algorithm can track fast moving object in real-time and is robust under the complex background.