• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.2
• /
• pp.825-836
• /
• 2016

In this paper, a speed-up technique for the non-local means (NLM) image denoising method based on local binary descriptor (LBD) is proposed. In the NLM, most of the computation time is spent on searching for non-local similar patches in the search window. The local binary descriptor which represents the structure of patch as binary strings is employed to speed up the search process in the NLM. The descriptor allows for a fast and accurate preselection of non-local similar patches by bitwise operations. Using this approach, a tradeoff between time-saving and noise removal can be obtained. Simulations exhibit that despite being principally constructed for speed, the proposed algorithm outperforms in terms of denoising quality as well. Furthermore, a parallel implementation on GPU brings NLM-LBD to real-time image denoising.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.9
• /
• pp.4429-4447
• /
• 2018

Local binary descriptors are well-suited for many real-time and/or large-scale computer vision applications, while their low computational complexity is usually accompanied by the limitation of performance. In this paper, we propose a new optimization framework, RLDB (Robust-LDB), to improve a typical region-based binary descriptor LDB (local difference binary) and maintain its computational simplicity. RLDB extends the multi-feature strategy of LDB and applies a more complete region-comparing configuration. A cascade bit selection method is utilized to select the more representative patterns from massive comparison pairs and an online learning strategy further optimizes descriptor for each specific patch separately. They both incorporate LDP (linear discriminant projections) principle to jointly guarantee the robustness and distinctiveness of the features from various scales. Experimental results demonstrate that this integrated learning framework significantly enhances LDB. The improved descriptor achieves a performance comparable to floating-point descriptors on many benchmarks and retains a high computing speed similar to most binary descriptors, which better satisfies the demands of applications.

• ETRI Journal
• /
• v.35 no.6
• /
• pp.1021-1028
• /
• 2013

Automatic facial expression recognition is a widely studied problem in computer vision and human-robot interaction. There has been a range of studies for representing facial descriptors for facial expression recognition. Some prominent descriptors were presented in the first facial expression recognition and analysis challenge (FERA2011). In that competition, the Local Gabor Binary Pattern Histogram Sequence descriptor showed the most powerful description capability. In this paper, we introduce hybrid facial representations for facial expression recognition, which have more powerful description capability with lower dimensionality. Our descriptors consist of a block-based descriptor and a pixel-based descriptor. The block-based descriptor represents the micro-orientation and micro-geometric structure information. The pixel-based descriptor represents texture information. We validate our descriptors on two public databases, and the results show that our descriptors perform well with a relatively low dimensionality.

• Journal of Broadcast Engineering
• /
• v.20 no.4
• /
• pp.641-644
• /
• 2015

In this paper, we propose a precise frame-level near-duplicate video matching algorithm. First, a binary frame descriptor for near-duplicate video matching is proposed. The binary frame descriptor divides a frame into patches and represent the relations between patches in bits. Seconds, we formulate a cost function for the matching, composed of matching costs and compensatory costs. Then, we roughly determine initial matchings and refine the matchings iteratively to minimize the cost function. Experimental results demonstrate that the proposed algorithm provides efficient performance for frame-level near duplicate video matching.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2000.11b
• /
• pp.101-106
• /
• 2000

We propose a method of the efficient injection of the MPEG-4 data into MPEG-2 A/V stream. The proposed method is to transmit MPEG-4 data synchronized with MPEG-2 A/V stream using MPEG-2 Transport Stream Protocol so that the user can decode MPEG-4 data on time at the client side, after extracting IOD (Initia1 Object Descriptor), OD (Object Descriptor), BIFS (Binary Format for Scone) and media data from mp4 file.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2010.04a
• /
• pp.377-380
• /
• 2010

This paper proposes texture descriptor for texture classification called Local Neighbor Differences (LND). LND is a high discriminating texture descriptor and also robust to illumination changes. The proposed descriptor utilizes the sign of differences between surrounding pixels in a local neighborhood. The differences of those pixels are thresholded to form an 8-bit binary codeword. The decimal values of these 8-bit code words are computed and they are called LND values. A histogram of the resulting LND values is created and used as feature to describe the texture information of an image. Experimental results, with respect to texture classification accuracies using OUTEX_TC_00001 test suite has been performed. The results show that LND outperforms LBP method, with average classification accuracies of 92.3% whereas that of local binary patterns (LBP) is 90.7%.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.6
• /
• pp.99-108
• /
• 2004

In this paper, a new fast detection and clutter rejection method is proposed for CCD-image-based Automatic Target Detection System. For defence application, fast computation is a critical point, thus we concentrated on the ability to detect various targets with simple computation. In training stage, 1D template set is generated by regional vertical projection and K-means clustering, and binary tree structure is adopted to reduce the number of template matching in test stage. We also use adaptive skip-width by Correlation-based Adaptive Predictive Search(CAPS) to further improve the detecting speed. In clutter rejection stage, we obtain Fourier Descriptor coefficients from boundary information, which are useful to rejected clutters.

• Journal of Broadcast Engineering
• /
• v.8 no.3
• /
• pp.259-267
• /
• 2003

In this paper, we propose a media processor to provide interactive services in mobile multimedia broadcasting environments. The proposed system Is designed to support various functionalities, such as generation of MPEG-4 IOD (Initial Object Descriptor)/OD(Object Descriptor)/BIFS (Binary Format for Scene) data, encapsulation of MPEG-4 AVC (Advanced Video Coding)/BSAC (Bit Sliced Arithmetic Coding) stream and generated IOD/OD/BIFS data into SL (Sync Layer) packet, packetization of SL packet into TS (Transport Stream) packet and multiplexing. The proposed media processor can provide MPEG-4 based interactive services for users.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2006.11a
• /
• pp.227-230
• /
• 2006

A content-based image retrieval system using MPEG-7 is designed and implemented in this thesis. The implemented system uses existing MPEG-7 Visual Descriptors. In addition, a new descriptor for efficient retrieval of bio images is proposed and utilized in the developed content-based image retrieval system. Comparing proposed CBSD(Compact Binary Shape Descriptor) with Edge Histogram Descriptor(EHD) and Region Shape Descriptor(RSD), it shows good retrieval performance in NMRR. The proposed descriptor is robust to large modification of brightness and contrast and especially improved retrieval performance to search images with similar shapes. Also proposed system adopts distributed architecture to solve increased server overload and network delay. Updating module of client efficiently reduces downloading time for metadata. The developed system can efficiently retrieve images without causing server's overload.

• Journal of the Korean Chemical Society
• /
• v.36 no.4
• /
• pp.485-495
• /
• 1992

The viscosities of organic compounds (alcohols, acetates, alkanes, acids, substituted $NH_2$) in liquid states, gas states and the binary mixtures of n-alkane / 1-chloroalkane were calculated by molecular modeling techniques. The molecular descriptors of molecular modeling technique are Molecular connectivity indices, Wiener indices and ad hoc descriptors, which can encode the information of compound properties about the effect of size, branching, cyclization, unsaturation, heteroatom content, polarizability, and so on. The successful results among method have been Molecular connectivity indices, binary mixtures of n-alkane / 1-chloroalkane, Wiener indices for gas state and ad hoc descriptor for liquid states. Also we obtained the regression equations for viscosities using molecular modeling indices for gas, liquid states and binary mixtures of n-alkane / 1-chloroalkane. The calculated viscosity values for organic compounds are in good agreement with experimental results.