• Title/Summary/Keyword: Edge distance

Search Result 672, Processing Time 0.028 seconds

Edge Detection Based on Bhattacharyya Distance for Color Images Using Adaptive Boundary and Thresholding

  • Badripour, Afarin;Lee, Chulhee
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2017.11a
    • /
    • pp.944-945
    • /
    • 2017
  • Color image edge detection is an important operation in many image processing areas. This paper presents a new method for edge detection based on the Bhattacharyya distance that can handle arbitrary boundaries by exploring several edge patterns. Experiments show promising results compared to some existing methods.

An Efficient Color Edge Detection Using the Mahalanobis Distance

  • Khongkraphan, Kittiya
    • Journal of Information Processing Systems
    • /
    • v.10 no.4
    • /
    • pp.589-601
    • /
    • 2014
  • The performance of edge detection often relies on its ability to correctly determine the dissimilarities of connected pixels. For grayscale images, the dissimilarity of two pixels is estimated by a scalar difference of their intensities and for color images, this is done by using the vector difference (color distance) of the three-color components. The Euclidean distance in the RGB color space typically measures a color distance. However, the RGB space is not suitable for edge detection since its color components do not coincide with the information human perception uses to separate objects from backgrounds. In this paper, we propose a novel method for color edge detection by taking advantage of the HSV color space and the Mahalanobis distance. The HSV space models colors in a manner similar to human perception. The Mahalanobis distance independently considers the hue, saturation, and lightness and gives them different degrees of contribution for the measurement of color distances. Therefore, our method is robust against the change of lightness as compared to previous approaches. Furthermore, we will introduce a noise-resistant technique for determining image gradients. Various experiments on simulated and real-world images show that our approach outperforms several existing methods, especially when the images vary in lightness or are corrupted by noise.

Weighted Distance De-interlacing Algorithm Based on EDI and NAL (EDI와 NAL 알고리듬을 기반으로 한 거리 가중치 비월주사 방식 알고리듬)

  • Lee, Se-Young;Ku, Su-Il;Jeong, Je-Chang
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.9C
    • /
    • pp.704-711
    • /
    • 2008
  • This paper proposes a new de-interlacing method which results in efficient visual improvement. In the proposed algorithm, the distance weight was considered and the previously developed the EDI (Edge Dependent Interpolation) algorithm and the NAL (New Adaptive Linear interpolation) algorithm were used as a basis. The do-interlacing method was divided into two main parts. First, the edge direction was found by using information of closer pixels. Then, missing pixels were interpolated along with the decided edge direction. In this paper, after predicting the edge through the EDI algorithm, missing pixels were interpolated by using the weighted distance based on the NAL algorithm. Experimental results indicate that the proposed algorithm be superior to the conventional algorithms in terms of the objective and subjective criteria.

An Efficient Video Retrieval Algorithm Using Color and Edge Features

  • Kim Sang-Hyun
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.7 no.1
    • /
    • pp.11-16
    • /
    • 2006
  • To manipulate large video databases, effective video indexing and retrieval are required. A large number of video indexing and retrieval algorithms have been presented for frame-w]so user query or video content query whereas a relatively few video sequence matching algorithms have been proposed for video sequence query. In this paper, we propose an efficient algorithm to extract key frames using color histograms and to match the video sequences using edge features. To effectively match video sequences with low computational load, we make use of the key frames extracted by the cumulative measure and the distance between key frames, and compare two sets of key frames using the modified Hausdorff distance. Experimental results with several real sequences show that the proposed video retrieval algorithm using color and edge features yields the higher accuracy and performance than conventional methods such as histogram difference, Euclidean metric, Battachaya distance, and directed divergence methods.

  • PDF

A Study on the Behavior of an Impacting Droplet on a Wall Having Obstacles (방해물이 존재하는 평판 위 충돌 액적 거동에 관한 연구)

  • Yang, W.J.;Kang, B. S.
    • Journal of ILASS-Korea
    • /
    • v.17 no.1
    • /
    • pp.27-34
    • /
    • 2012
  • In this paper an experimental study is presented to investigate the effect of a step edge and a stationary droplet on the dynamic behavior of impacting droplet on a wall. The main parameters are the distance from the edge and the center-to-center distance between two droplets. Photographic images are presented to show coalescence dynamics, shape evolution and contact line movement. The emphasis is on presenting the spreading length of droplet for the step edge and two coalescing droplets along their original centers. It is clarified that the droplet exhibits much different dynamic behavior depending on the location of the step edge. The momentum of impacting droplet was better transferred to the stationary droplet as the center- to-center distance between two droplets was reduced, which results in more spreading of coalescing droplet.

A Relationship between the Second Largest Eigenvalue and Local Valency of an Edge-regular Graph

  • Park, Jongyook
    • Kyungpook Mathematical Journal
    • /
    • v.61 no.3
    • /
    • pp.671-677
    • /
    • 2021
  • For a distance-regular graph with valency k, second largest eigenvalue r and diameter D, it is known that r ≥ $min\{\frac{{\lambda}+\sqrt{{\lambda}^2+4k}}{2},\;a_3\}$ if D = 3 and r ≥ $\frac{{\lambda}+\sqrt{{\lambda}^2+4k}}{2}$ if D ≥ 4, where λ = a1. This result can be generalized to the class of edge-regular graphs. For an edge-regular graph with parameters (v, k, λ) and diameter D ≥ 4, we compare $\frac{{\lambda}+\sqrt{{\lambda}^2+4k}}{2}$ with the local valency λ to find a relationship between the second largest eigenvalue and the local valency. For an edge-regular graph with diameter 3, we look at the number $\frac{{\lambda}-\bar{\mu}+\sqrt{({\lambda}-\bar{\mu})^2+4(k-\bar{\mu})}}{2}$, where $\bar{\mu}=\frac{k(k-1-{\lambda})}{v-k-1}$, and compare this number with the local valency λ to give a relationship between the second largest eigenvalue and the local valency. Also, we apply these relationships to distance-regular graphs.

Mechanism for Building Approximation Edge Minimum Spanning Tree Using Portals on Input Edges (선분상의 포탈을 이용한 근사 선분 최소 신장 트리의 생성)

  • Kim, In-Bum;Kim, Soo-In
    • The KIPS Transactions:PartA
    • /
    • v.16A no.6
    • /
    • pp.509-518
    • /
    • 2009
  • In this paper, a mechanism that produces an approximation edges minimum spanning tree swiftly using virtual nodes called portals dividing given edges into same distance sub-edges. The approximation edges minimum spanning tree can be used in many useful areas as connecting communication lines, road networks and railroad systems. For 3000 random input edges, when portal distance is 0.3, tree building time decreased 29.74% while the length of the produced tree increased 1.8% comparing with optimal edge minimum spanning tree in our experiment. When portal distance is 0.75, tree building time decreased 39.96% while the tree length increased 2.96%. The result shows this mechanism might be well applied to the applications that may allow a little length overhead, but should produce an edge connecting tree in short time. And the proposed mechanism can produce an approximation edge minimum spanning tree focusing on tree length or on building time to meet user requests by adjusting portal distance or portal discard ratio as parameter.

Shape-based object recognition using Multiple distance images (다중의 거리영상을 이용한 형태 인식 기법)

  • 신기선;최해철
    • Proceedings of the IEEK Conference
    • /
    • 2000.11d
    • /
    • pp.17-20
    • /
    • 2000
  • This paper describes a shape-based object recognition algorithm using multiple distance images. For the images containing dense edge points and noise, previous Hausdorff distance (HD) measures yield a high ms error for object position and many false matchings for recognition. Extended version of HD measure considering edge position and orientation simultaneously is proposed for accurate matching. Multiple distance images are used to calculate proposed matching measure efficiently. Results are presented for visual images and infrared images.

  • PDF

End Edge Cogging Force Minimization according to the Distance between Armatures of Stationary Discontinuous Armature PMLSM with Concentrated Winding (전기자 분산배치 집중권 PMLSM의 전기자 간격에 따른 단부 코깅력 최소화)

  • Kim, Yong-Jae
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.8 no.8
    • /
    • pp.1241-1246
    • /
    • 2013
  • Currently, The general transportation system arranges the armature on the full length of transportation lines. However, when this method is applied to the long distance transportation system, it causes an increase of material cost and manufacturing time. Thus, in order to resolve this problem, discontinuous arrangement method of the armature has been proposed. However, in the method of using stationary discontinuous armatures, mover can stop in the freewheeling section which is non-installations section when disturbance is generated and the mover can not be moved because armature control is impossible. Thus, the distance determination of armature is very important. Also, when the armature is arranged discontinuously the edge always exists due to the structure. Due to this edge, the cogging force is greatly generated during the entry and ejection of the mover to the armature. This cogging force causes thrust force ripple generating noise, vibration and decline of performance, it must be reduced. Therefore, in this paper, we examined the end edge cogging force generated by the stationary discontinuous armatures through 2-D numerical analysis using finite element method (FEM) and we figured out distance of armature for end edge cogging force minimization.

Strengthening of bolted shear joints in industrialized ferrocement construction

  • Ismail, M.;Shariati, M.;Abdul Awal, A.S.M.;Chiong, C.E.;Chahnasir, E. Sadeghipour;Porbar, A.;Heydari, A.;Khorami, M.
    • Steel and Composite Structures
    • /
    • v.28 no.6
    • /
    • pp.681-690
    • /
    • 2018
  • This paper highlights results of some experimental work that deals with strengthening of bolted shear joints in thin-walled ferrocement structure where steel wires, bent into U-shape are considered as simple inserts around the bolt hole. The parameters investigated include the number of layers of wire mesh, edge distance of bolt hole, size and location of the inserts. Test results have shown that for small edge distance, failure occurred either in cleavage or shearing mode, and the strength of the joint increased with an increase in the edge distance. This continued up to an upper limit set by either tension or bearing failure. The experimental study further revealed that for a given edge distance the strength of a joint can significantly be enhanced by using U-inserts. The equations developed for predicting joint strength in ferrocement composites can also be modified to include the effects of the inserts with a good level of accuracy.