• Journal of Computing Science and Engineering
• /
• v.11 no.1
• /
• pp.24-31
• /
• 2017

Face-based video retrieval has become an active and important branch of intelligent video analysis. Face profiling and matching is a fundamental step and is crucial to the effectiveness of video retrieval. Although many algorithms have been developed for processing static face images, their effectiveness in face-based video retrieval is still unknown, simply because videos have different resolutions, faces vary in scale, and different lighting conditions and angles are used. In this paper, we combined content-based and semantic-based image analysis techniques, and systematically evaluated four mainstream local features to represent face images in the video retrieval task: Harris operators, SIFT and SURF descriptors, and eigenfaces. Results of ten independent runs of 10-fold cross-validation on datasets consisting of TED (Technology Entertainment Design) talk videos showed the effectiveness of our approach, where the SIFT descriptors achieved an average F-score of 0.725 in video retrieval and thus were the most effective, while the SURF descriptors were computed in 0.3 seconds per image on average and were the most efficient in most cases.

• Journal of Information Processing Systems
• /
• v.12 no.3
• /
• pp.468-488
• /
• 2016

The paper proposes a novel framework for 3D face verification using dimensionality reduction based on highly distinctive local features in the presence of illumination and expression variations. The histograms of efficient local descriptors are used to represent distinctively the facial images. For this purpose, different local descriptors are evaluated, Local Binary Patterns (LBP), Three-Patch Local Binary Patterns (TPLBP), Four-Patch Local Binary Patterns (FPLBP), Binarized Statistical Image Features (BSIF) and Local Phase Quantization (LPQ). Furthermore, experiments on the combinations of the four local descriptors at feature level using simply histograms concatenation are provided. The performance of the proposed approach is evaluated with different dimensionality reduction algorithms: Principal Component Analysis (PCA), Orthogonal Locality Preserving Projection (OLPP) and the combined PCA+EFM (Enhanced Fisher linear discriminate Model). Finally, multi-class Support Vector Machine (SVM) is used as a classifier to carry out the verification between imposters and customers. The proposed method has been tested on CASIA-3D face database and the experimental results show that our method achieves a high verification performance.

• Journal of the Semiconductor & Display Technology
• /
• v.7 no.4
• /
• pp.13-18
• /
• 2008

This paper explores a content-based image retrieval framework with relevance feedback based on genetic algorithm (GA). This framework adopts GA to learn the user preferences using the similarity functions defined for all available descriptors. The objective of the GA-based learning methods is to learn the user preferences using the similarity functions and to find a descriptor combination function that best represents the user perception. Experiments were performed to validate the proposed frameworks. The experiments employed the natural image databases and color and texture descriptors to represent the content of database images. The proposed frameworks were compared with the other two relevance feedback methods regarding effectiveness in image retrieval tasks. Experiment results demonstrate the superiority of the proposed method.

• The Journal of Korean Association of Computer Education
• /
• v.7 no.5
• /
• pp.111-120
• /
• 2004

The MPEG-7 standard defines a set of descriptors that extracts low-level features such as color, texture and object shape from an image and generates metadata in order to represent these extracted information. But the matching performance for image mining ma y not be satisfactory by u sing only on e of these features. Rather than by combining these features we can achieve a better query performance. In this paper we propose a new image retrieval technique for image mining that combines the features extracted from MPEG-7 visual color and texture descriptors. Specifically, we use only some specifications of Scalable Color Descriptor (SCD) and Non-Homogeneous Texture Descriptor also known as Edge Histogram Descriptor (EHD) for the implementation of the color and edge histograms respectively. MPEG-7 standard defines $l_{1}$-norm based matching in EHD and SCD. But in our approach, for distance measurement, we achieve a better result by using cosine similarity coefficient for color histograms and Euclidean distance for edge histograms. Our approach toward this system is more experimental based than hypothetical.

• Journal of Broadcast Engineering
• /
• v.8 no.1
• /
• pp.91-100
• /
• 2003

In this paper, to improve the retrieval Performance, an efficient combination of the MPEG-7 visual descriptors, such as the edge histogram descriptor (EHD), the color layout descriptor (CLD), and the homogeneous texture descriptor (HTD), is proposed in the framework of the relevance feedback approach. The EHD represents spatial distribution of edges in local image regions and it is considered as an important feature to represent the content of the image. The CLD specifies spatial distribution of colors and is widely used in image retrieval due to its simplicity and fast operation speed. The HTD describes precise statistical distribution of the image texture. Both the feature vector for the query image and the weighting factors among the combined descriptors are adaptively determined during the relevance feedback. Experimental results show that the proposed method improves the retrieval performance significantly tot natural images.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.1
• /
• pp.23-30
• /
• 2014

Feature matching using image descriptors is robust method used recently. However, mismatches occur in 3D transformed images, illumination-changed images and repetitive-pattern images. In this paper, we observe that there are a lot of mismatches in the images which have repetitive patterns. We analyze it and propose a method to eliminate these mismatches. MDMF(Multiple Descriptors-based Mismatch Filtering) eliminates mismatches by using descriptors of nearest several features of one specific feature point. In experiments, for geometrical transformation like scale, rotation, affine, we compare the match ratio among SIFT, ASIFT and MDMF, and we show that MDMF can eliminate mismatches successfully.

• Journal of Broadcast Engineering
• /
• v.18 no.2
• /
• pp.319-322
• /
• 2013

Image retrieval research activity has moved its focus from global descriptors to local descriptors of feature point such as SIFT. MPEG is Currently working on standardization of effective coding of location and local descriptors of feature point in the context mobile based image search driven application in the name of MPEG-7 CDVS (Compact Descriptor for Visual Search). The extracted feature points consist of two parts, location information and Descriptor. For efficient image retrieval, we proposed a novel method that is gradual block-based efficient lossy location coding to compress location information according to distribution in images. From experimental result, the number of average bits per feature point reduce 5~6% and the accuracy rate keep compared to state of the art TM 3.0.

• Journal of KIISE:Software and Applications
• /
• v.34 no.1
• /
• pp.1-10
• /
• 2007

This paper proposes a new indexing mechanism for MPEG-7 visual descriptors, especially Dominant Color and Contour Shape descriptors, that guarantees an efficient similarity search for the multimedia database whose visual meta-data are represented with MPEG-7. Since the similarity metric used in the Dominant Color descriptor is based on Gaussian mixture model, the descriptor itself could be transform into a color histogram in which the distribution of the color values follows the Gauss distribution. Then, the transformed Dominant Color descriptor (i.e., the color histogram) is indexed in the proposed indexing mechanism. For the indexing of Contour Shape descriptor, we have used a two-pass algorithm. That is, in the first pass, since the similarity of two shapes could be roughly measured with the global parameters such as eccentricity and circularity used in Contour shape descriptor, the dissimilar image objects could be excluded with these global parameters first. Then, the similarities between the query and remaining image objects are measured with the peak parameters of Contour Shape descriptor. This two-pass approach helps to reduce the computational resources to measure the similarity of image objects using Contour Shape descriptor. This paper also proposes two integration schemes of visual descriptors for an efficient retrieval of multimedia database. The one is to use the weight of descriptor as a yardstick to determine the number of selected similar image objects with respect to that descriptor, and the other is to use the weight as the degree of importance of the descriptor in the global similarity measurement. Experimental results show that the proposed indexing and integration schemes produce a remarkable speed-up comparing to the exact similarity search, although there are some losses in the accuracy because of the approximated computation in indexing. The proposed schemes could be used to build a multimedia database represented in MPEG-7 that guarantees an efficient retrieval.

• Proceedings of the Korean Society for Agricultural Machinery Conference
• /
• 2000.11b
• /
• pp.279-286
• /
• 2000

The objective of this research is to detect the papaya fruits on tree in an orchard. The detection of papaya on natural background is difficult because colors of fruits and background such as leaves are similarly green. We cannot separate it from leaves by color information. Therefore, this research will use shape information instead. First, we detect an interested object by detecting its boundary using edge detection technique. However, the edge detection will detect every objects boundary in the image. Therefore, shape description technique will be used to describe which one is the interested object boundary. The good shape description should be invariant in scaling, rotating, and translating. The successful concept is to use Fourier series, which is called "Fourier Descriptors". Elliptic Fourier Descriptors can completely represent any shape, which is selected to describe the shape of papaya. From the edge detection image, it takes a long time to match every boundary directly. The pre-processing task will reduce non-papaya edge to speed up matching time. The deformable template is used to optimize the matching. Then, clustering the similar shapes by the distance between each centroid, papaya can be completely detected from the background.

• Proceedings of the IEEK Conference
• /
• 2002.07c
• /
• pp.1531-1534
• /
• 2002

Shape description and its corresponding matching algorithm is one of the main concerns in MPEG-7. In this paper, a new method is proposed for shape registration of 2D objects for MPEG-7 Shapes are recognized using the Hu statistical moments in frequency domain. The Hu moments are moment-based descriptors of planar shapes, which are invariant under general translation, rotational, scaling, and reflection transformation. The image is transformed into frequency domain using Fourier Transform. Annular and radial wedge distributions fur the power spectra are extracted. Different statistical features (Hu moments) are found f3r the power spectrum of each selected transformed individual feature. The Euclidean distance of the extracted moment descriptors of the features are found with respect to the shapes in the database. The minimum Euclidean distance is the candidate for the matched shape. The simulation results are performed on the test shapes of MPEG-7.