• Asia Marketing Journal
• /
• 제17권1호
• /
• pp.97-121
• /
• 2015

In this research, we examine whether and why temporal distance influences evaluations of two different types of brand extensions: concept-based extensions, defined as extensions primarily based on the importance or relevance of brand concepts to extension products; and similarity-based extensions, defined as extensions primarily based on the amount of feature similarity at the product-category level. In Study 1, we test the hypothesis that concept-based extensions are evaluated more favorably when they are framed to launch in the distant rather than in the near future, whereas similaritybased extensions are evaluated more favorably when they are framed to launch in the near rather than in the distant future. In Study 2, we confirm that this time-dependent differential evaluation is driven by the difference in construal level between the bases of the two types of extensions - i.e., brand-concept consistency and product-category feature similarity. As such, we find that conceptbased extensions are evaluated more favorably under the abstract than concrete mindset, whereas similarity-based extensions are evaluated more favorably under the concrete than abstract mindset. In Study 3, we extend to the case for a broad brand (i.e., brands that market products across multiple categories), finding that making accessible a specific product category of a broad parent brand influences evaluations of near-future, but not distant-future, brand extensions. Combined together, our findings suggest that temporal distance influences brand extension evaluation through its effect on the importance placed on brand concepts and feature similarity. That is, consumers rely on different bases to evaluate brand extensions, depending on their perception of when the extensions take place and on under what mindset they are placed. This research makes theoretical contributions to the brand extension research by identifying one important determinant to brand extension evaluation and also uncovering its underlying dynamics. It also contributes to expanding the scope of the construal level theory by putting forth a novel interpretation of two bases of perceived fit in terms of construal level. Marketers who are about to launch and advertise brand extensions may benefit by considering temporal-distance information in determining what content to deliver about extensions in their communication efforts. Conceptual relation of a parent brand to extensions needs to be emphasized in the distant future, whereas feature similarity should be highlighted in the near future.

• International Journal of Computer Science & Network Security
• /
• 제24권4호
• /
• pp.113-118
• /
• 2024

Pursuance Sentiment Analysis on Twitter is difficult then performance it's used for great review. The present be for the reason to the tweet is extremely small with mostly contain slang, emoticon, and hash tag with other tweet words. A feature extraction stands every technique concerning structure and aspect point beginning particular tweets. The subdivision in a aspect vector is an integer that has a commitment on ascribing a supposition class to a tweet. The cycle of feature extraction is to eradicate the exact quality to get better the accurateness of the classifications models. In this manuscript we proposed Term Frequency-Inverse Document Frequency (TF-IDF) method is to secure Principal Component Analysis (PCA) with Naïve Bayes Classifiers. As the classifications process, the work proposed can produce different aspects from wildly valued feature commencing a Twitter dataset.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2004년도 ICCAS
• /
• pp.2059-2064
• /
• 2004

Texture analysis is an important role for automatic visual insfection. This paper presents an application of wavelet extension and Gray level co-occurrence matrix (GLCM) for detection of defect encountered in textured images. Texture characteristic in low quality images is not to easy task to perform caused by noise, low frequency and small dimension. In order to solve this problem, we have developed a procedure called wavelet image extension. Wavelet extension procedure is used to determine the frequency bands carrying the most information about the texture by decomposing images into multiple frequency bands and to form an image approximation with higher resolution. Thus, wavelet extension procedure offers the ability to robust feature extraction in images. Then the features are extracted from the co-occurrence matrices computed from the sub-bands which performed by partitioning the texture image into sub-window. In the detection part, Mahalanobis distance classifier is used to decide whether the test image is defective or non defective.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권8호
• /
• pp.3984-4005
• /
• 2017

Image recognition has become an increasingly important topic for its wide application. It is highly challenging when facing to large-scale database with large variance. The recognition systems rely on a key component, i.e. the low-level feature or the learned mid-level feature. The recognition performance can be potentially improved if the data distribution information is exploited using a more sophisticated way, which usually a function over hidden variable, model parameter and observed data. These methods are called generative score space. In this paper, we propose a discriminative extension for the existing generative score space methods, which exploits class label when deriving score functions for image recognition task. Specifically, we first extend the regular generative models to class conditional models over both observed variable and class label. Then, we derive the mid-level feature mapping from the extended models. At last, the derived feature mapping is embedded into a discriminative classifier for image recognition. The advantages of our proposed approach are two folds. First, the resulted methods take simple and intuitive forms which are weighted versions of existing methods, benefitting from the Bayesian inference of class label. Second, the probabilistic generative modeling allows us to exploit hidden information and is well adapt to data distribution. To validate the effectiveness of the proposed method, we cooperate our discriminative extension with three generative models for image recognition task. The experimental results validate the effectiveness of our proposed approach.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2008년도 하계종합학술대회
• /
• pp.915-916
• /
• 2008

We propose a clustering based object feature matching for identification of same object in multi-camera system. The method is focused on ease to system initialization and extension. Clustering is used to estimate parameters of Gaussian mixture models of objects. A similarity measure between models are determined by Kullback-Leibler divergence. This method can be applied to occlusion problem in tracking.

• 한국HCI학회:학술대회논문집
• /
• 한국HCI학회 2008년도 학술대회 1부
• /
• pp.504-509
• /
• 2008

Support Vector Machine (SVM) is one of powerful learning machine and has been applied to varying task with generally acceptable performance. The success of SVM for classification tasks in one domain is affected by features which represent the instance of specific class. Given the representative and discriminative features, SVM learning will give good generalization and consequently we can obtain good classifier. In this paper, we will assess the problem of feature choices for human detection tasks and measure the performance of each feature. Here we will consider HOG-family feature. As a natural extension of SVM, we combine SVM with Principal Component Analysis (PCA) to reduce dimension of features while retaining most of discriminative feature vectors.

• 대한전자공학회논문지SP
• /
• 제46권4호
• /
• pp.23-33
• /
• 2009

장면 전환 검출 기술은 대용량 비디오 데이터의 효율적인 관리를 위한 주요 기술로서, 다양한 비디오 데이터에 적용하기 위한 적응적인 검출 알고리즘이 요구된다. 본 논문에서는 확장 참조 구간 동안의 프레임들의 히스토그램 평균값을 이용한 적응적인 장면 전환 검출 알고리즘을 제안한다. 제안하는 방법은 히스토그램을 이용해서 프레임들의 특징값을 계산하고, 확장 참조 구간 동안의 프레임들의 히스토그램 평균값을 이용해서 임계값을 정의하여 특징값과 임계값의 비교를 통해서 장면 전환 발생 여부를 판단한다. 동일한 비디오 데이터를 사용한 실험을 통해서 제안하는 방법이 기존의 방법들보다 검출 정확도에서 최대 15% 이상 향상되었음을 확인하였다. Homecast사의 TVUS HM-900 PLUS 모델의 휴대용 멀티미디어 재생기에서 제안하는 방법을 구현하여 PC보다 성능이 낮은 하드웨어 플랫폼에서도 실시간으로 장면 전환 검출이 동작하는 것을 확인하였다. 본 논문에서 제안하는 방법은 휴대용 미디어 재생 장치나 휴대 전화 등 비교적 낮은 하드웨어 플랫폼에서 유용하게 사용될 수 있다.

• 한국지진공학회:학술대회논문집
• /
• 한국지진공학회 1998년도 추계 학술발표회 논문집 Proceedings of EESK Conference-Spring 1998
• /
• pp.228-234
• /
• 1998

To interpret the relationship between movement of the Yangsan fault and tectonics around the Korean peninsula, the six sequential paleostresses were reconstructed from 1, 033 striated small faults which were measured at 37 outcrops along the strike of the Yangsan fault. And, the relationship between these paleostresses of the Yangsan fault and the tectonic events around the Korean peninsula were compared. As compared with the tectonic history around the Korean peninsula, the movement of the Yangsan fault is interpreted as follows; The initial feature of the Yangsan fault was formed with the development of extension fractures by the NW-SE extension. The fault experienced a right-lateral strike-slip movement continuously. The movements had been continued until the Late Miocene age, which was the most active period in faulting. The left-lateral strike-slip movement was followed by subsequent tectonic events. In the last stage, the fault acted with a slight extension or right-lateral movement.

• 대한수학회논문집
• /
• 제20권2호
• /
• pp.359-364
• /
• 2005

We give another characteristic feature of the set of phantom maps: After constructing an isomorphism between derived functors, we show that the set of homotopy classes of phantom maps could be restated as the extension product of subinverse towers induced by the given inverse towers.

• 한국멀티미디어학회논문지
• /
• 제18권11호
• /
• pp.1281-1288
• /
• 2015

Nongroup Cellular Automata(CA) having two trees in the state transition diagram of a CA is suitable for pattern classifier which divides pattern set into two classes. Maji et al. [1] classified patterns by using multiple attractor cellular automata as a pattern classifier with dependency vector. In this paper we propose a method of generation of a pattern classifier using feature vector which is the extension of dependency vector. In addition, we propose methods for finding nonreachable states in the 0-tree of the state transition diagram of TPMACA corresponding to the given feature vector for the analysis of the state transition behavior of the generated pattern classifier.