• Title/Summary/Keyword: feature coding

Search Result 203, Processing Time 0.025 seconds

A study on enhanced M-ary QT algorithm using collision bits position in RFID system (RFID 시스템에서 충돌비트 위치를 이용한 M-ary QT 알고리즘 향상에 관한 연구)

  • Kim, Kwan-Woong
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.16 no.6
    • /
    • pp.109-117
    • /
    • 2016
  • The most important mission of RFID reader is identify EPC (Electronic Product Code) of RFID tag of products that located within distinguishable range of RFID reader. RFID reader transmits query message to RFID tags through wireless channel and RFID tags send unique EPC to response its query message simultaneously. therefore tag collision occurred frequently. RFID tags collision resolution algorithm required to apply RFID technology to various industries. In this paper, we propose enhanced M-ary algorithm that collision bits location is used by not only RFID reader but also tags. the main feature of the proposed algorithm is that integrate multiple query message of M-ary QT algorithm to the single query message by analyze multiple response messages from tags. the simulation results show that the proposed algorithm give better performance than M-ary QT algorithm in terms of the number of query-response, identification efficiency and communication overhead.

The Study on the Adactive H-ARQ Technique in TD-CDMA 3G System (TD-CDMA 3G 시스템의 적응형 H-ARQ 기법들에 관한 연구)

  • Suk, Kyung-Hyu;Park, Sung-Ho
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.5 no.4
    • /
    • pp.450-456
    • /
    • 2010
  • In the high-speed packet service, next generation mobile communication system has emerged as a major feature. If the fire of these high-speed kit services and non-continuous transmission of data due to the symmetrical nature of daeyiteo traffic for D-CDMA system has been actively studied. Small amounts of data moving in the uplink, but the real-time video downlink transmission, such as downloading large files to move data and services to those with asymmetric traffic characteristics, a system that can efficiently handle the data requirements be. Of 3GPP TDD(Time Division Duplex) scheme based on CDMA and TDMA in a way by introducing the concept through the proper allocation of time slots that can handle asymmetric traffic efficiently, has an advantage. TD-CDMA system by considering the characteristics of the frame configuration of transmission methods, such as physical channel structure and channel coding has been investigated. In addition, the HARQ scheme TD-CDMA system performance is analyzed by comparing them.

An Illumination Invariant Traffic Sign Recognition in the Driving Environment for Intelligence Vehicles (지능형 자동차를 위한 조명 변화에 강인한 도로표지판 검출 및 인식)

  • Lee, Taewoo;Lim, Kwangyong;Bae, Guntae;Byun, Hyeran;Choi, Yeongwoo
    • Journal of KIISE
    • /
    • v.42 no.2
    • /
    • pp.203-212
    • /
    • 2015
  • This paper proposes a traffic sign recognition method in real road environments. The video stream in driving environments has two different characteristics compared to a general object video stream. First, the number of traffic sign types is limited and their shapes are mostly simple. Second, the camera cannot take clear pictures in the road scenes since there are many illumination changes and weather conditions are continuously changing. In this paper, we improve a modified census transform(MCT) to extract features effectively from the road scenes that have many illumination changes. The extracted features are collected by histograms and are transformed by the dense descriptors into very high dimensional vectors. Then, the high dimensional descriptors are encoded into a low dimensional feature vector by Fisher-vector coding and Gaussian Mixture Model. The proposed method shows illumination invariant detection and recognition, and the performance is sufficient to detect and recognize traffic signs in real-time with high accuracy.

Comparisons of Recognition Rates for the Off-line Handwritten Hangul using Learning Codes based on Neural Network (신경망 학습 코드에 따른 오프라인 필기체 한글 인식률 비교)

  • Kim, Mi-Young;Cho, Yong-Beom
    • Journal of IKEEE
    • /
    • v.2 no.1 s.2
    • /
    • pp.150-159
    • /
    • 1998
  • This paper described the recognition of the Off-line handwritten Hangul based on neural network using a feature extraction method. Features of Hangul can be extracted by a $5{\times}5$ window method which is the modified $3{\times}3$ mask method. These features are coded to binary patterns in order to use neural network's inputs efficiently. Hangul character is recognized by the consonant, the vertical vowel, and the horizontal vowel, separately. In order to verify the recognition rate, three different coding methods were used for neural networks. Three methods were the fixed-code method, the learned-code I method, and the learned-code II method. The result was shown that the learned-code II method was the best among three methods. The result of the learned-code II method was shown 100% recognition rate for the vertical vowel, 100% for the horizontal vowel, and 98.33% for the learned consonants and 93.75% for the new consonants.

  • PDF

3D Image Coding Using DCT and Hierarchical Segmentation Vector Quantization (DCT와 계층 분할 벡터 양자화를 이용한 3차원 영상 부호화)

  • Cho Seong Hwan;Kim Eung Sung
    • Journal of Internet Computing and Services
    • /
    • v.6 no.2
    • /
    • pp.59-68
    • /
    • 2005
  • In this paper, for compression and transmission of 3D image, we propose an algorithm which executes 3D discrete cosine transform(DCT) for 3D images, hierarchically segments 3D blocks of an image in comparison with the original image and executes finite-state vector quantization(FSVQ) for each 3D block. Using 3D DCT coefficient feature, a 3D image is segmented hierarchically into large smooth blocks and small edge blocks, then the block hierarchy informations are transmitted. The codebooks are constructed for each hierarchical blocks respectively, the encoder transmits codeword index using FSVQ for reducing encoded bit with hierarchical segmentation information. The new algorithm suggested in this paper shows that the quality of Small Lobster and Head image increased by 1,91 dB and 1.47 dB respectively compared with those of HFSVQ.

  • PDF

Review of Channel Quality Indicator Estimation Schemes for Multi-User MIMO in 3GPP LTE/LTE-A Systems

  • Abdulhasan, Muntadher Qasim;Salman, Mustafa Ismael;Ng, Chee Kyun;Noordin, Nor Kamariah;Hashim, Shaiful Jahari;Hashim, Fazirulhisham
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.6
    • /
    • pp.1848-1868
    • /
    • 2014
  • Multiple-in multiple-out (MIMO) in long-term evolution (LTE) is an essential factor in achieving high speed data rates and spectral efficiency. The unexpected growth in data rate demand has pushed researchers to extend the benefits of multi-user MIMO. The multi-user MIMO system can take full advantage of channel conditions by employing efficient adjustment techniques for scheduling, and by assigning different modulation and coding rates. However, one of the critical issues affecting this feature is the appropriate estimation of channel quality indicator (CQI) to manage the allocated resources to users. Therefore, an accurate CQI estimation scheme is required for the multi-user MIMO transmission to obtain significant improvements on spectral efficiency. This paper presents overviews of multi-user MIMO in LTE/LTE-advanced systems. The link adaptation, scheduling process, and different factors that affect the reliability of CQI measurements are discussed. State-of-the-art schemes for the post-processing CQI estimation, and the comparisons of various CQI estimation schemes to support multi-user MIMO are also addressed.

Image Coding Using DCT Map and Binary Tree-structured Vector Quantizer (DCT 맵과 이진 트리 구조 벡터 양자화기를 이용한 영상 부호화)

  • Jo, Seong-Hwan;Kim, Eung-Seong
    • The Transactions of the Korea Information Processing Society
    • /
    • v.1 no.1
    • /
    • pp.81-91
    • /
    • 1994
  • A DCT map and new cldebook design algorithm based on a two-dimension discrete cosine transform (2D-DCT) is presented for coder of image vector quantizer. We divide the image into smaller subblocks, then, using 2D DCT, separate it into blocks which are hard to code but it bears most of the visual information and easy to code but little visual information, and DCT map is made. According to this map, the significant features of training image are extracted by using the 2D DCT. A codebook is generated by partitioning the training set into a binary tree based on tree-structure. Each training vector at a nonterminal node of the binary tree is directed to one of the two descendants by comparing a single feature associated with that node to a threshold. Compared with the pairwise neighbor (PPN) and classified VQ(CVQ) algorithm, about 'Lenna' and 'Boat' image, the new algorithm results in a reduction in computation time and shows better picture quality with 0.45 dB and 0.33dB differences as to PNN, 0.05dB and 0.1dB differences as to CVQ respectively.

  • PDF

Design and Implementation of a Data Management System for Mobile Spatio-Temporal Query (모바일 시공간 질의을 위한 데이타 관리 시스템의 설계 및 구현)

  • Lee, Ki-Young;Lim, Myung-Jae;Kim, Joung-Joon;Kim, Kyu-Ho;Kim, Jeong-Lae
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.11 no.1
    • /
    • pp.109-113
    • /
    • 2011
  • Recently, according to the development of ubiquitous computing, the u-GIS which not only used in u-Transport, u-Care, u-Fun, u-Green, u-Business, u-Government, and u-City but also used to provides various spatial information such as the location of user is being the core technology of the ubiquitous computing environment. In this paper, we implemented an mobile spatio-temporal Query Processing Systems for handling the Spatio-Temporal Data in mobile equipment.The mobile spatio-temporal Query Processing Systems provides the spatio-temporal data type and the spatio-temporal operator that is expanded by the spatial data type and the spatial operator from OepenGIS "Simple Feature Specification for SQL". It supports arithmetic coding compression techniques that is considered with a spatio-temporal data specific character. It also provides the function of data cashing for improving the importation and exportation of the spatio-temporal data between a embedded spatio-temporal DBMS and u-GIS server.

Frame Bit-rate Control Method for Low Delay Video Communication (저지연 영상 통신을 위한 화면 비트율 제어 기법)

  • Jin, En-Ji;Park, Min-Cheol;Moon, Joo-Hee;Kwon, Jae-Cheol
    • Journal of Broadcast Engineering
    • /
    • v.12 no.6
    • /
    • pp.574-584
    • /
    • 2007
  • As the real time multimedia service become more popular, the needs of transmission with low delay and high quality are getting more stronger. Among those video compression technologies, the rate control method dose an important role in getting the effective data transmitting and the high image quality. In this paper, we combined the feature of CBR and VBR coding methods to propose a new bit-rate control method witch allows each frame to generates bits in the defined fluctuation range and applies a scene change detection at a part of frame and also can maintain low-delay and high quality even if the perfect VBR transmission environment is not guaranteed. The experiment result shows the proposed algorithm provides more effective method than TMN8 in real time application.

Adaptive Clustering based Sparse Representation for Image Denoising (적응 군집화 기반 희소 부호화에 의한 영상 잡음 제거)

  • Kim, Seehyun
    • Journal of IKEEE
    • /
    • v.23 no.3
    • /
    • pp.910-916
    • /
    • 2019
  • Non-local similarity of natural images is one of highly exploited features in various applications dealing with images. Unique edges, texture, and pattern of the images are frequently repeated over the entire image. Once the similar image blocks are classified into a cluster, representative features of the image blocks can be extracted from the cluster. The bigger the size of the cluster is the better the additive white noise can be separated. Denoising is one of major research topics in the image processing field suppressing the additive noise. In this paper, a denoising algorithm is proposed which first clusters the noisy image blocks based on similarity, extracts the feature of the cluster, and finally recovers the original image. Performance experiments with several images under various noise strengths show that the proposed algorithm recovers the details of the image such as edges, texture, and patterns while outperforming the previous methods in terms of PSNR in removing the additive Gaussian noise.