• Title/Summary/Keyword: shape descriptors

Search Result 71, Processing Time 0.027 seconds

3D partial object retrieval using cumulative histogram (누적 히스토그램을 이용한 3차원 물체의 부재 검색)

  • Eun, Sung-Jong;Hyoen, Dae-Hwan;Lee, Ki-Jung;WhangBo, Taeg-Keun
    • 한국HCI학회:학술대회논문집
    • /
    • 2009.02a
    • /
    • pp.669-672
    • /
    • 2009
  • The techniques extract shape descriptors from 3D models and use these descriptors for indices for comparing shape similarities. Most similarity search techniques focus on comparisons of each individual 3D model from databases. However, our similarity search technique can compare not only each individual 3D model, but also partial shape similarities. The partial shape matching technique extends the user's query request by finding similar parts of 3D models and finding 3D models which contain similar parts. We have implemented an experimental partial shape-matching search system for 3D pagoda models, and preliminary experiments show that the system successfully retrieves similar 3D model parts efficiently.

  • PDF

The relation of catchment shape descriptors to lag time (집수형상디스크립터와 지체시간 사이의 관계)

  • Kim, Joo-Cheol;Yoon, Yeo-Jin;Kim, Jae-Han
    • Proceedings of the Korea Water Resources Association Conference
    • /
    • 2005.05b
    • /
    • pp.199-203
    • /
    • 2005
  • One of the most important hydrological response characteristics is the lag time. It is well known as being under the influence of the morphometric properties of the basin, which could be expressed by catchment shape descriptors. In this paper, the geometric characteristics of an equivalent ellipse proposed by Moussa(2003) is applied for the lag time analysis. The lag time is obtained from the rainfall-runoff observed data by the method of moments suggested by Nash(1960) and the relationships between the basin morphometric properties and the lag time are discussed as applied to 3 catchments in Korea. Additionally, the shapes of equivalent ellipse are examined how they are transformed from upstream area to downstream one. As a result, the relationship between descriptors based on a equivalent ellipse a+b and $a+b+{\epsilon}OM$, and the lag time is shown to be close and the shape of ellipse is presented to approach a circle along the river downwards. Also, the notion of compactness which is used to express the shape of an irregular plan-form is tried to apply.

  • PDF

The Analysis of Visual Descriptors for Content-based Video Retrieval (내용기반 비디오 검색을 위한 MPEG-7 비주얼 디스크립터 분석)

  • Kim, Seong-Hee
    • Journal of the Korean BIBLIA Society for library and Information Science
    • /
    • v.16 no.2
    • /
    • pp.157-175
    • /
    • 2005
  • The main purpose of this paper is to explain and analyze visual descriptors of MPEG-7 for representing multimedia content. This study describes MPEG-7 visual descriptors that are made of color, shape, texture, and motion using some examples and application areas in detail. As a result, those visual descriptors can represent the rich and deep features in multimedia contents domain. Also, the use of those descriptors will increase the retrieval effectiveness as well as the interoperability among systems through the consistency of the content representation.

  • PDF

3D Shape Descriptor for Segmenting Point Cloud Data

  • Park, So Young;Yoo, Eun Jin;Lee, Dong-Cheon;Lee, Yong Wook
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.30 no.6_2
    • /
    • pp.643-651
    • /
    • 2012
  • Object recognition belongs to high-level processing that is one of the difficult and challenging tasks in computer vision. Digital photogrammetry based on the computer vision paradigm has begun to emerge in the middle of 1980s. However, the ultimate goal of digital photogrammetry - intelligent and autonomous processing of surface reconstruction - is not achieved yet. Object recognition requires a robust shape description about objects. However, most of the shape descriptors aim to apply 2D space for image data. Therefore, such descriptors have to be extended to deal with 3D data such as LiDAR(Light Detection and Ranging) data obtained from ALS(Airborne Laser Scanner) system. This paper introduces extension of chain code to 3D object space with hierarchical approach for segmenting point cloud data. The experiment demonstrates effectiveness and robustness of the proposed method for shape description and point cloud data segmentation. Geometric characteristics of various roof types are well described that will be eventually base for the object modeling. Segmentation accuracy of the simulated data was evaluated by measuring coordinates of the corners on the segmented patch boundaries. The overall RMSE(Root Mean Square Error) is equivalent to the average distance between points, i.e., GSD(Ground Sampling Distance).

Dorsal Hand Vein Identification Based on Binary Particle Swarm Optimization

  • Benziane, Sarah Hachemi;Benyettou, Abdelkader
    • Journal of Information Processing Systems
    • /
    • v.13 no.2
    • /
    • pp.268-284
    • /
    • 2017
  • The dorsal hand vein biometric system developed has a main objective and specific targets; to get an electronic signature using a secure signature device. In this paper, we present our signature device with its different aims; respectively: The extraction of the dorsal veins from the images that were acquired through an infrared device. For each identification, we need the representation of the veins in the form of shape descriptors, which are invariant to translation, rotation and scaling; this extracted descriptor vector is the input of the matching step. The optimization decision system settings match the choice of threshold that allows accepting/rejecting a person, and selection of the most relevant descriptors, to minimize both FAR and FRR errors. The final decision for identification based descriptors selected by the PSO hybrid binary give a FAR =0% and FRR=0% as results.

Application of Fractal Parameter for Morphological Analysis of Wear Particle (마멸입자 형상분석을 위한 프랙탈 파라미터의 적용)

  • 조연상;류미라;김동호;박흥식
    • Tribology and Lubricants
    • /
    • v.18 no.2
    • /
    • pp.147-152
    • /
    • 2002
  • The morphological analysis of wear particle is a very effective means fur machine condition monitoring and fault diagnosis. In order to describe morphology of various wear particle, the wear test was carried out under friction experimental conditions. And fractal descriptors was applied to boundary and surface of wear particle with image processing. These descriptors to analyze shape and surface of wear particle are shape fractal dimension and surface fractal dimension. The boundary fractal dimension can be derived from the boundary profile and surface fractal dimension can be determined by sum of intensity difference of surface pixel. The morphology of wear particles can be effectively obtained by two fractal parameter.

Fast Computation of the Radius of a Bounding Circle in a Binary Image (이진영상에서 바운딩 서클의 빠른 계산방법)

  • Kim Whoi-vul;Ryoo Kwang-seok
    • The Transactions of the Korean Institute of Electrical Engineers D
    • /
    • v.54 no.7
    • /
    • pp.453-457
    • /
    • 2005
  • With the expansion of Internet, a variety of image databases are widely used and it is needed to select the part of an image what he wants. In contents-based image retrieval system, Zernikie moment and ART Descriptors are used fur shape descriptors in MPEC-7. This paper presents a fast computation method to determine the radius of a bounding circle that encloses an object in a binary image. With conventional methods, the whole area of the image should be scanned first and the distance from every pixel to the center point be computed. The proposed 4-directional scan method and fast circle-drawing algorithm is utilized to minimize the scanning area and reduce the number of operations fur computing the distance. Experimental results show that proposed method saves the computation time to determine the radius of a bounding circle efficiently.

Feature information fusion using multiple neural networks and target identification application of FLIR image (다중 신경회로망을 이용한 특징정보 융합과 적외선영상에서의 표적식별에의 응용)

  • 선선구;박현욱
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.40 no.4
    • /
    • pp.266-274
    • /
    • 2003
  • Distance Fourier descriptors of local target boundary and feature information fusion using multiple MLPs (Multilayer perceptrons) are proposed. They are used to identify nonoccluded and partially occluded targets in natural FLIR (forward-looking infrared) images. After segmenting a target, radial Fourier descriptors as global shape features are defined from the target boundary. A target boundary is partitioned into four local boundaries to extract local shape features. In a local boundary, a distance function is defined from boundary points and a line between two extreme points. Distance Fourier descriptors as local shape features are defined by using distance function. One global feature vector and four local feature vectors are used as input data for multiple MLPs to determine final identification result of the target. In the experiments, we show that the proposed method is superior to the traditional feature sets with respect to the identification performance.

Skeleton Tree for Shape-Based Image Retrieval (모양 기반 영상검색을 위한 골격 나무 구조)

  • Park, Jong-Seung
    • The KIPS Transactions:PartB
    • /
    • v.14B no.4
    • /
    • pp.263-272
    • /
    • 2007
  • This paper proposes a skeleton-based hierarchical shape description scheme, called a skeleton tree, for accurate shape-based image retrieval. A skeleton tree represents an object shape as a hierarchical tree where high-level nodes describe parts of coarse trunk regions and low-level nodes describe fine details of boundary regions. Each node refines the shape of its parent node. Most of the noise disturbances are limited to bottom level nodes and the boundary noise is reduced by decreasing weights on the bottom levels. The similarity of two skeleton trees is computed by considering the best match of a skeleton tree to a sub-tree of another skeleton tree. The proposed method uses a hybrid similarity measure by employing both Fourier descriptors and moment invariants in computing the similarity of two skeleton trees. Several experimental results are presented demonstrating the validity of the skeleton tree scheme for the shape description and indexing.