• 한국방송∙미디어공학회:학술대회논문집
• /
• 한국방송공학회 1996년도 학술대회
• /
• pp.195-198
• /
• 1996

In this paper, we introduce the notion of the smoothly perfect 8-connected (SP8C) contour and propose a coding technique for the SP8C contours. Based on the contour simplification using the majority filter proposed by Gu[6], SP8C contours are extracted on the contour lattice from the segmented image. By noting that, unlike the perfect 8-connected contours, the SP8C contours are restricted to travel in only 3 different directions along the contours, we also propose two techniques for encoding the SP8C contours. The one is the modified version of the neighbouring direction segment coding by Kandeko[2], while the other is to employ the notion of the entropy coding. From the comparison in terms of the entropy, it is shown that the proposed SP8C contours require les bits in encoding the diagonal contours than the 4-connected contours employed by Gu. And computer simulations reveal that the contours can be efficiently encoded by the proposed technique.

• International Journal of CAD/CAM
• /
• 제12권1호
• /
• pp.29-37
• /
• 2012

A new algorithm has been developed to construct surface from the contours having branches and the final smooth surface is obtained by the reversible Catmull-Clark subdivision. In branching, a particular layer has more than one contour that correspond with at least one contour at the adjacent layer. In the next step, three-dimensional composite curve is constructed from contours of a layer having correspondence with at least one contour at the adjacent layer by inserting points between them and joining the contours. The points are inserted in such a way that the geometric center of the contours should merge at the center of the contours at the adjacent layer. This process is repeated for all layers having branching problems. Polyhedra are constructed in the next step with the help of composite curves and the contours at adjacent layer. The required smooth surface is obtained in the proposed work by providing the level of smoothness.

• 전자공학회논문지S
• /
• 제35S권1호
• /
• pp.114-121
• /
• 1998

In this paper, we introudce the notion of the smoothly perfect 8-conntected (SP8C) contour and describe a coding technique for the SP8C contours. Based on the simplificationusing the majority filter proposed by Gu, SP8C contours are restricted on the contour lattice from the segmented image. By noting thating SP8C contours are restricted to travel in only 3 different directions along the contours, we attempt to encode the SP8C contours using the following two techniques. The one is the neighbouring direction segmentcoding, while the other is to employ the notion of the entropy endoding. Computer simulations reveal that the contours can be efficiently encoded by the two technique.

• 전자공학회논문지C
• /
• 제34C권3호
• /
• pp.37-47
• /
• 1997

Human observers perceive a contour where no line or edge is given (subject contour), such as the border between gratings of thin lines offset by half a cycle. Subjective contours occur in a wide variety of circumstances in nature. A common factor in all such figures in the perception of a surface(contour) occuluding part of a background, i.e. subject contours are always accompanied by subject surfaces. Some examples about these kinds of figures are given by kanizsa trangle or square. Ph;ysiological observations are reported in which the perceptual phenomenon that some simple examples of subject contours are perceived as images (gigures; contours) through physiological experiments was investgated. In this paper, we proposed a neural network extracting the induce dstimuli for the perception of subject contours based on the visual mechnism. This visual mechnism is proposed by hubel & wiesel's paper.

• Journal of Information Display
• /
• 제2권2호
• /
• pp.32-38
• /
• 2001

PDP(plasma display panel) represents the gray levels by the pulse number modulation technique that results in undesirable dynamic false contours on moving images. This paper proposes a LUT(Look-up table) based error diffusion algorithm for reduction of the dynamic false contours. A quantitative measure of the dynamic false contours is defined first. The measure of the dynamic false contours is calculated through simulation of every gray level combination of two consecutive frames. Based on the calculated measures, a modified gray level for a pair of gray levels of two consecutive frames is chosen to reduce the dynamic false contours. The chosen gray levels serve as contents of a gray level conversion LUT. Given a pair of gray levels of two consecutive frames, the gray level of current frame is modified based on the gray level conversion LUT. The new gray level is displayed on PDP. An error diffusion algorithm is, then, applied to compensate for the differences in the gray levels.

• 한국소음진동공학회:학술대회논문집
• /
• 한국소음진동공학회 2003년도 춘계학술대회논문집
• /
• pp.1009-1009
• /
• 2003

VIPER a new tool for the VIsual PERception of sound quality and for sound design will be presented. Requirement for the visualization of sound quality is a signal analysis modeling the information processing of the ear. The first step of the signal processing implemented in VIPER, calculates an auditory spectrogram by a filter bank adapted to the time- and frequency resolution of the human ear. The second step removes redundant information by extracting time- and frequency contours from the auditory spectrogram in analogy to contours of the visual system. In a third step contours and/or auditory spectrogram can be resynthesised confirming that only aurally relevant information were extracted. The visualization of the contours in VIPER allows intuitively to grasp the important components of a signal. Contributions of parts of a signal to the overall quality can be easily auralized by editing and resynthesising the contours or the underlying auditory spectrogram. Resynthesis of time contours alone allows e.g. to auralize impulsive components separately from the tonal components. Further processing of the contours determines tonal parts in form of tracks. Audible differences between two versions of a sound can be visually inspected in VIPER through the help of auditory distance spectrograms. Applications are shown for the sound design of several interior noises of cars.

• 한국시뮬레이션학회:학술대회논문집
• /
• 한국시뮬레이션학회 2001년도 The Seoul International Simulation Conference
• /
• pp.223-230
• /
• 2001

This paper proposes a new contour detection method and adaptive reconstruction scheme for the cylindrical organs, such as blood vessels or arteries. Furthermore, we present java-based navigation controller which has been built to examine the inside of cylindrical objects. Tn the preprocessing procedure, a few preprocessing image filters are applied in order to remove unwanted artifacts from the medical images and to estimate threshold values for the object of interest. We define a context-free grammar, which is proper fur properties of contours of cylindrical objects. In the next procedure, we extract contours using advanced radial gradient method and represent contours as context-free grammar derivation trees. We build polygons between two contours efficiently by traversing the derivations trees of the contours. We fly through the reconstructed virtual models using java-based navigation controller and VRML viewer.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1998년도 하계종합학술대회논문집
• /
• pp.661-664
• /
• 1998

Since the region segmentation at high resolution contains most of viable semantic object contours in an image, the bottom-up approach for image segmentation is appropriate for the application such as MPEG-4 which needs to preserve semantic object contours. However, the conventioal region merging methods, that follow the region segmentation, have poor performance in keeping low-contrast semantic object contours. In this paper, we propose an image segmentation algorithm based on classified region merging. The algorithm pre-segments an image with a large number of small regions, and also classifies it into several classes having similar gradient characteristics. Then regions only in the same class are merged according to the boundary weakness or statisticsal similarity. The simulation result shows that the proposed image segmentation preserves semantic object contours very well even with a small number of regions.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제27권1호
• /
• pp.37-55
• /
• 2023

In this paper we propose a new algorithm for detecting and counting flowers in a complex background based on digital images. The algorithm mainly includes the following parts: edge contour extraction of flowers, edge contour determination of overlapped flowers and flower counting. We use a contour detection technique in Computer Vision (CV) to extract the edge contours of flowers and propose an improved algorithm with a concave point detection technique to find accurate segmentation for overlapped flowers. In this process, we first use the polygon approximation to smooth edge contours and then adopt the second-order central moments to fit ellipse contours to determine whether edge contours overlap. To obtain accurate segmentation points, we calculate the curvature of each pixel point on the edge contours with an improved Curvature Scale Space (CSS) corner detector. Finally, we successively give three adaptive judgment criteria to detect and count flowers accurately and automatically. Both experimental results and the proposed evaluation indicators reveal that the proposed algorithm is more efficient for flower counting.

• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 2008년도 International Symposium on Remote Sensing
• /
• pp.7-10
• /
• 2008

We present a technique for constructing a digital elevation model (DEM) from contours. The elevation of each ground point in DEM is computed by interpolating the heights of the two adjacent contours of the point. The technique decomposes each sub-domain between adjacent contours into a set of sub-regions. The decomposition is accomplished by constructing a medial axis of the sub-domain. Each sub-region in the decomposition is classified into a variety of terrain features like hillsides, valleys, ridges, etc. The elevations of points are interpolated with different methods according to terrain features they belong to. For a given point in hillside, an approximate gradient line passing through the point is determined and the elevation of the point is interpolated from the known elevations of the two adjacent contours along the approximate gradient line. The univariate monotone rational Hermite spline is used for the interpolation. The DEM constructed by the technique is to be used to orthorectify the high-resolution KOMPSAT3 imagery.