• 한국식생활문화학회지
• /
• 제24권3호
• /
• pp.286-294
• /
• 2009

The purpose of this study was to determine whether foodservice brand language localization affects consumer attitudes in terms of similar brand image recognition with an original brand. Many global foodservice companies have tried to modify their own brand identity according to local situations in order to attract more consumers. According to this study's results, consumers who similarly recognized both the original brand image and localization brand image tended to have greater purchase intention than those who did not recognize them similarly. In addition, when the original brand identity was changed to the local language, consumers more similarly conceived the original brand image and localization. And for local store marketing, foodservice companies should have a thorough marketing research plan since there can be difference results according to brand name recognition gaps or demographic characteristics. Original brand image similarity recognition by consumers affected their attitudes. In other words, the group that similarly recognized both the original brand company image and the localization brand company image tended to have greater purchase intention. Because brand language plays an important role in consumer attitudes with respect to recognizing a brand and distinguishing another brand, this study suggests that franchise foodservice companies have a local store marketing plan.

• 전기전자학회논문지
• /
• 제22권2호
• /
• pp.491-494
• /
• 2018

본 논문은 표본 기반 단일 영상 초해상도 복원 방식의 성능 개선을 위한 혼합 놈을 이용한 패치 유사도 검색 방식에 대해 제안한다. 초해상도 영상 복원 과정에서 패치의 국부 통계 특성을 반영하기 위해 패치 경사도에 따른 놈의 차수를 결정하고, 놈의 차수를 패치간의 유사도 검색을 위한 함수로 사용하는 방식에 대해 제안한다. 실험 결과를 통해 제안하는 유사도 검색 방식은 기존 검색 방식의 성능을 개선할 수 있는 능력이 있음을 확인할 수 있었다.

• 한국정보과학회논문지:소프트웨어및응용
• /
• 제33권12호
• /
• pp.1090-1102
• /
• 2006

본 논문에서는 대학생들의 프로그래밍 과제물이나 프로그래밍 경진대회에 제출된 프로그램과 같이 동일한 기능을 요구받는 프로그램 소스 집합들에서 표절행위가 있었는지를 탐색하는 새로운 알고리즘을 제시하고 있다. 지금까지 보편적으로 사용되어 온 대표적인 알고리즘은 부분 스트링간의 완전 일치를 통한 Greedy-String-Tiling이나 두 스트링간의 지역정렬(local alignment)을 이용한 유사도 분석이 주된 방법론이었다. 본 논문에서는 해당 프로그램 소스의 집합에서 추출된 키워드들의 빈도수에 기반한 로그 확률값을 가중치로 하는 적응적(adaptive) 유사도 행렬을 만들어 이를 기반으로 주어진 프로그램의 유사구간을 탐색하는 새로운 방법을 소개한다. 우리는 10여개 이상의 프로그래밍 대회에서 제출된 실제 프로그램으로 본 방법론을 실험해 보았다. 실험결과 이 방법은 이전의 고정적 유사도 행렬(match이면 +1, mismatch이면 -1, gap이면 -2)에 의한 유사구간 탐색에 비하여 여러 장점이 있음을 알 수 있었으며, 제시한 적응적 유사도 행렬을 보다 다양한 표절탐색 목적으로 사용할 수 있음을 알 수 있었다.

• 한국멀티미디어학회논문지
• /
• 제22권5호
• /
• pp.580-587
• /
• 2019

In this paper, a plane detection method using depth information is proposed. 3-D characteristics of a pixel are defined as a direction and length of a normal vector whose is calculated from a plane consisting of a local region centered on the pixel. Image coordinates of each pixel are transformed to 3-D coordinates in order to obtain the local planes. Regions of each plane are detected by calculating similarity of the 3-D characteristics. The similarity of the characteristics consists of direction and distance similarities of normal vectors. If the similarity of the characteristics between two adjacent pixels is enough high, the two pixels are regarded as consisting of same plane. Simulation results show that the proposed method using the depth picture is more accurate for detecting plane areas than the conventional method.

• 한국방송∙미디어공학회:학술대회논문집
• /
• 한국방송∙미디어공학회 2018년도 추계학술대회
• /
• pp.73-76
• /
• 2018

A Gaussian noise is caused by surrounding environment or channel interference when transmitting image. The noise reduces not only image quality degradation but also high-level image processing performance. The Non-Local Means (NLM) filter finds similarity in the neighboring sets of pixels to remove noise and assigns weights according to similarity. The weighted average is calculated based on the weight. The NLM filter method shows low noise cancellation performance and high complexity in the process of finding the similarity using weight allocation and neighbor set. In order to solve these problems, we propose an algorithm that shows an excellent noise reduction performance by using Summed Square Image (SSI) to reduce the complexity and applying the weighting function based on a cosine Gaussian kernel function. Experimental results demonstrate the effectiveness of the proposed algorithm.

• ETRI Journal
• /
• 제35권2호
• /
• pp.311-320
• /
• 2013

In most spectral clustering approaches, the Gaussian kernel-based similarity measure is used to construct the affinity matrix. However, such a similarity measure does not work well on a dataset with a nonlinear and elongated structure. In this paper, we present a new similarity measure to deal with the nonlinearity issue. The maximum flow between data points is computed as the new similarity, which can satisfy the requirement for similarity in the clustering method. Additionally, the new similarity carries the global and local relations between data. We apply it to spectral clustering and compare the proposed similarity measure with other state-of-the-art methods on both synthetic and real-world data. The experiment results show the superiority of the new similarity: 1) The max-flow-based similarity measure can significantly improve the performance of spectral clustering; 2) It is robust and not sensitive to the parameters.

• 한국컴퓨터정보학회논문지
• /
• 제12권6호
• /
• pp.147-152
• /
• 2007

디지털 영상에서의 얼굴탐색은 얼굴인식을 위한 기본 단계이면서 인식 성능에 큰 영향을 미치는 중요한 처리 단계이다. 템플릿 정합 방식의 객체 검출방식에서 사용되어 얼굴 인식 등에서 좋은 성능을 보이는 Hausdorff 거리는 주어진 점의 집합들 사이에서 기하학적 유사도만을 고려한 측도이므로 원래의 영상이 포함하고 있는 다른 정보들을 추가적으로 이용함으로 효율을 높일 수 있다. 이러한 점에 착안하여 본 논문에서는 점들 사이에 서로 다른 정도를 측정하기 위해서 거리뿐만 아니라 점들 주위의 국지적 계조패턴 정보까지 포함하는 측도를 정의함으로써 보다 정밀한 템플릿 정합결과를 얻는 방법을 제안한다.

• Journal of the Korean Physical Society
• /
• 제73권10호
• /
• pp.1589-1595
• /
• 2018

Similarity index measures the topological proximity of node pairs in a complex network. Numerous similarity indices have been defined and investigated, but the dependency of structure on the performance of similarity indices has not been sufficiently investigated. In this study, we investigated the relationship between the performance of similarity indices and structural properties of a network by employing a two-state random network. A node in a two-state network has binary types that are initially given, and a connection probability is determined from the state of the node pair. The performances of similarity indices are affected by the number of links and the ratio of intra-connections to inter-connections. Similarity indices have different characteristics depending on their type. Local indices perform well in small-size networks and do not depend on whether the structure is intra-dominant or inter-dominant. In contrast, global indices perform better in large-size networks, and some such indices do not perform well in an inter-dominant structure. We also found that link prediction performance and the performance of similarity are correlated in both model networks and empirical networks. This relationship implies that link prediction performance can be used as an approximation for the performance of the similarity index when information about node type is unavailable. This relationship may help to find the appropriate index for given networks.

• 한국CDE학회논문집
• /
• 제9권1호
• /
• pp.51-61
• /
• 2004

Mechanical parts are often grouped into part families based on the similarity of their shapes, to support efficient manufacturing process planning and design modification. The 2-part sequence papers present similarity assessment techniques to support part family classification for machined parts. These exploit the multiple feature decompositions obtained by the feature recognition method using convex decomposition. Convex decomposition provides a hierarchical volumetric representation of a part, organized in an outside-in hierarchy. It provides local accessibility directions, which supports abstract and qualitative similarity assessment. It is converted to a Form Feature Decomposition (FFD), which represents a part using form features intrinsic to the shape of the part. This supports abstract and qualitative similarity assessment using positive feature volumes.. FFD is converted to Negative Feature Decomposition (NFD), which represents a part as a base component and negative machining features. This supports a detailed, quantitative similarity assessment technique that measures the similarity between machined parts and associated machining processes implied by two parts' NFDs. Features of the NFD are organized into branch groups to capture the NFD hierarchy and feature interrelations. Branch groups of two parts' NFDs are matched to obtain pairs, and then features within each pair of branch groups are compared, exploiting feature type, size, machining direction, and other information relevant to machining processes. This paper, the second one of the two companion papers, describes the similarity assessment method using NFD.

• 한국CDE학회논문집
• /
• 제9권1호
• /
• pp.44-50
• /
• 2004

Mechanical parts are often grouped into part families based on the similarity of their shapes, to support efficient manufacturing process planning and design modification. The 2-part sequence papers present similarity assessment techniques to support part family classification for machined parts. These exploit the multiple feature decompositions obtained by the feature recognition method using convex decomposition. Convex decomposition provides a hierarchical volumetric representation of a part, organized in an outside-in hierarchy. It provides local accessibility directions, which supports abstract and qualitative similarity assessment. It is converted to a Form Feature Decomposition (FFD), which represents a part using form features intrinsic to the shape of the part. This supports abstract and qualitative similarity assessment using positive feature volumes. FFD is converted to Negative Feature Decomposition (NFD), which represents a part as a base component and negative machining features. This supports a detailed, quantitative similarity assessment technique that measures the similarity between machined parts and associated machining processes implied by two parts' NFDs. Features of the NFD are organized into branch groups to capture the NFD hierarchy and feature interrelations. Branch groups of two parts' NFDs are matched to obtain pairs, and then features within each pair of branch groups are compared, exploiting feature type, size, machining direction, and other information relevant to machining processes. This paper, the first one of the two companion papers, describes the similarity assessment methods using convex decomposition and FFD.