• Title/Summary/Keyword: Image Representation

Search Result 785, Processing Time 0.021 seconds

Content-Based Image Retrieval System using Feature Extraction of Image Objects (영상 객체의 특징 추출을 이용한 내용 기반 영상 검색 시스템)

  • Jung Seh-Hwan;Seo Kwang-Kyu
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.27 no.3
    • /
    • pp.59-65
    • /
    • 2004
  • This paper explores an image segmentation and representation method using Vector Quantization(VQ) on color and texture for content-based image retrieval system. The basic idea is a transformation from the raw pixel data to a small set of image regions which are coherent in color and texture space. These schemes are used for object-based image retrieval. Features for image retrieval are three color features from HSV color model and five texture features from Gray-level co-occurrence matrices. Once the feature extraction scheme is performed in the image, 8-dimensional feature vectors represent each pixel in the image. VQ algorithm is used to cluster each pixel data into groups. A representative feature table based on the dominant groups is obtained and used to retrieve similar images according to object within the image. The proposed method can retrieve similar images even in the case that the objects are translated, scaled, and rotated.

Adaptive Enhancement Method for Robot Sequence Motion Images

  • Yu Zhang;Guan Yang
    • Journal of Information Processing Systems
    • /
    • v.19 no.3
    • /
    • pp.370-376
    • /
    • 2023
  • Aiming at the problems of low image enhancement accuracy, long enhancement time and poor image quality in the traditional robot sequence motion image enhancement methods, an adaptive enhancement method for robot sequence motion image is proposed. The feature representation of the image was obtained by Karhunen-Loeve (K-L) transformation, and the nonlinear relationship between the robot joint angle and the image feature was established. The trajectory planning was carried out in the robot joint space to generate the robot sequence motion image, and an adaptive homomorphic filter was constructed to process the noise of the robot sequence motion image. According to the noise processing results, the brightness of robot sequence motion image was enhanced by using the multi-scale Retinex algorithm. The simulation results showed that the proposed method had higher accuracy and consumed shorter time for enhancement of robot sequence motion images. The simulation results showed that the image enhancement accuracy of the proposed method could reach 100%. The proposed method has important research significance and economic value in intelligent monitoring, automatic driving, and military fields.

Finding Line Patterns in Synthesized Image

  • Kim, Jin-Woo
    • Journal of information and communication convergence engineering
    • /
    • v.9 no.3
    • /
    • pp.315-318
    • /
    • 2011
  • The orientation space representation is constructed by treating the orientation parameters, which Gabor filters can be turned, as a continuous variable. The problem of multiple orientation line segmentation is dealt with by thresholding 3D images of the orientation space and then detecting the connected components therein. In this way, X-junctions and T-junctions are able to be separated effectively. Experimental results are presented using synthesized image.

A study on the Image Signal Compress using SOM with Isometry (Isometry가 적용된 SOM을 이용한 영상 신호 압축에 관한 연구)

  • Chang, Hae-Ju;Kim, Sang-Hee;Park, Won-Woo
    • Proceedings of the KIEE Conference
    • /
    • 2004.11c
    • /
    • pp.358-360
    • /
    • 2004
  • The digital images contain a significant amount of redundancy and require a large amount of data for their storage and transmission. Therefore, the image compression is necessary to treat digital images efficiently. The goal of image compression is to reduce the number of bits required for their representation. The image compression can reduce the size of image data using contractive mapping of original image. Among the compression methods, the mapping is affine transformation to find the block(called range block) which is the most similar to the original image. In this paper, we applied the neural network(SOM) in encoding. In order to improve the performance of image compression, we intend to reduce the similarities and unnecesaries comparing with the originals in the codebook. In standard image coding, the affine transform is performed with eight isometries that used to approximate domain blocks to range blocks.

  • PDF

Development of 32-Channel Image Acquisition System for Thickness Measurement of Retina (망막 두께 측정을 위한 32채널 영상획득장치 개발)

  • 양근호;유병국
    • Proceedings of the Korea Institute of Convergence Signal Processing
    • /
    • 2003.06a
    • /
    • pp.110-113
    • /
    • 2003
  • In this paper, the multi-channel high speed data acquisition system is implemented. This high speed signal processing system for 3-D image display is applicable to the manipulation of a medical image processing, multimedia data and various fields of digital image processing. In order to convert the analog signal into digital one, A/D conversion circuit is designed. PCI interface method is designed and implemented, which is capable of transmission a large amount of data to computer. In order to, especially, channel extendibility of images acquisition, bus communication method is selected. By using this bus method, we can interface each module effectively. In this paper, 32-channel A/D conversion and PCI interface system for 3-dimensional and real-time display of the retina image is developed. The 32-channel image acquisition system and high speed data transmission system developed in this paper is applicable to not only medical image processing as 3-D representation of retina image but also various fields of industrial image processing in which the multi-point realtime image acquisition system is needed.

  • PDF

PPD: A Robust Low-computation Local Descriptor for Mobile Image Retrieval

  • Liu, Congxin;Yang, Jie;Feng, Deying
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.4 no.3
    • /
    • pp.305-323
    • /
    • 2010
  • This paper proposes an efficient and yet powerful local descriptor called phase-space partition based descriptor (PPD). This descriptor is designed for the mobile image matching and retrieval. PPD, which is inspired from SIFT, also encodes the salient aspects of the image gradient in the neighborhood around an interest point. However, without employing SIFT's smoothed gradient orientation histogram, we apply the region based gradient statistics in phase space to the construction of a feature representation, which allows to reduce much computation requirements. The feature matching experiments demonstrate that PPD achieves favorable performance close to that of SIFT and faster building and matching. We also present results showing that the use of PPD descriptors in a mobile image retrieval application results in a comparable performance to SIFT.

Deep Reference-based Dynamic Scene Deblurring

  • Cunzhe Liu;Zhen Hua;Jinjiang Li
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.18 no.3
    • /
    • pp.653-669
    • /
    • 2024
  • Dynamic scene deblurring is a complex computer vision problem owing to its difficulty to model mathematically. In this paper, we present a novel approach for image deblurring with the help of the sharp reference image, which utilizes the reference image for high-quality and high-frequency detail results. To better utilize the clear reference image, we develop an encoder-decoder network and two novel modules are designed to guide the network for better image restoration. The proposed Reference Extraction and Aggregation Module can effectively establish the correspondence between blurry image and reference image and explore the most relevant features for better blur removal and the proposed Spatial Feature Fusion Module enables the encoder to perceive blur information at different spatial scales. In the final, the multi-scale feature maps from the encoder and cascaded Reference Extraction and Aggregation Modules are integrated into the decoder for a global fusion and representation. Extensive quantitative and qualitative experimental results from the different benchmarks show the effectiveness of our proposed method.

An Analysis of Previous Researches on Clothing Image and Make-up Image (의복이미지와 화장이미지에 관한 기존 연구 분석)

  • Lee Hyun-Jung;Kim Mi-Young
    • Journal of the Korean Society of Costume
    • /
    • v.54 no.7
    • /
    • pp.91-106
    • /
    • 2004
  • The purpose of this study was to review the previous researches, analyze the clothing image, the make-up image and compare the analyses of clothing image and make-up image. The previous researches of clothing image and make-up image were reviewed in 6 kinds of Journal. The results of previous research review and analysis were followed as : Measuring mean of image are used to similarly that semantic differential technique and summated rating technique. Attention to proposed researcher abstraction image in make-up image, but there is problem that this hard to explain objectivity of image abstraction. There are a lot of occasions that 4 or 5 image factors were extracted by factor analysis. The make-up image researches that presented image stimulus were more than study that do not present. Image words were classified which were compiled words have similar sub image. Grace, activeness, lively. unique, modernity attractive, feminine. sexy and ripeness clothing images were classified factors. which were representative clothing image. Elegance, Sophisticate. romantic, natural, modern and youthfulness make-up image for factor were representative make-up image factors. However the problems were found that some representative image factor included the sub images which were different from some factor image. Compared with representation image words, same image words were used to not agree what clothing image and make-up image. Standardization of word should be made that show that clothing image and make-up image.

Digital Image Processing Using Tunable Q-factor Discrete Wavelet Transformation (Q 인자의 조절이 가능한 이산 웨이브렛 변환을 이용한 디지털 영상처리)

  • Shin, Jong Hong
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.10 no.3
    • /
    • pp.237-247
    • /
    • 2014
  • This paper describes a 2D discrete-time wavelet transform for which the Q-factor is easily specified. Hence, the transform can be tuned according to the oscillatory behavior of the image signal to which it is applied. The tunable Q-factor wavelet transform (TQWT) is a fully-discrete wavelet transform for which the Q-factor, Q, of the underlying wavelet and the asymptotic redundancy (over-sampling rate), r, of the transform are easily and independently specified. In particular, the specified parameters Q and r can be real-valued. Therefore, by tuning Q, the oscillatory behavior of the wavelet can be chosen to match the oscillatory behavior of the signal of interest, so as to enhance the sparsity of a sparse signal representation. The TQWT is well suited to fast algorithms for sparsity-based inverse problems because it is a Parseval frame, easily invertible, and can be efficiently implemented. The TQWT can also be used as an easily-invertible discrete approximation of the continuous wavelet transform. The transform is based on a real valued scaling factor (dilation-factor) and is implemented using a perfect reconstruction over-sampled filter bank with real-valued sampling factors. The transform is parameterized by its Q-factor and its oversampling rate (redundancy), with modest oversampling rates (e. g. 3-4 times overcomplete) being sufficient for the analysis/synthesis functions to be well localized. Therefore, This method services good performance in image processing fields.

Detection and Recognition of Overlapped Circular Objects based a Signature Representation Scheme (Signature 기반의 겹쳐진 원형 물체 검출 및 인식 기법)

  • Park, Sang-Bum;Hahn, Hern-Soo;Han, Young-Joon
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.14 no.1
    • /
    • pp.54-61
    • /
    • 2008
  • This paper proposes a new algorithm for detecting and recognizing overlapped objects among a stack of arbitrarily located objects using a signature representation scheme. The proposed algorithm consists of two processes of detecting overlap of objects and of determining the boundary between overlapping objects. To determine overlap of objects, in the first step, the edge image of object region is extracted and those areas in the object region are considered as the object areas if an area is surrounded by a closed edge. For each object, its signature image is constructed by measuring the distances of those edge points from the center of the object, along the angle axis, which are located at every angle with reference to the center of the object. When an object is not overlapped, its features which consist of the positions and angles of outstanding points in the signature are searched in the database to find its corresponding model. When an object is overlapped, its features are partially matched with those object models among which the best matching model is selected as the corresponding model. The boundary among the overlapping objects is determined by projecting the signature to the original image. The performance of the proposed algorithm has been tested with the task of picking the top or non-overlapped object from a stack of arbitrarily located objects. In the experiment, a recognition rate of 98% has been achieved.