نتایج جستجو برای: post widder transform

تعداد نتایج: 517189  

2000
Shuu Li Masafumi Tominaga Kunihito Kato Kazuhito Murakami Hiroyasu Koshimizu Jun-ichiro Hayashi

We are not free from the side ef'fect caused by the digitization of the image also in Hough transform. Since Hough transform detects lines in the expression of the analog line equation, it is finally needed to extract digital line segments from the analog line equations. In this paper, we propose a new method DTHT(Digita1 Template Hough Transform) to detect digital line segments directly from t...

2000
Yoshihiro Noguchi Hiroyuki Kobayashi Hitoshi Kiya

We proposed a method for embedding binary data into JPEG bitstreams and extracting embedded data from JPEG bitstreams using the standard JPEG decoder. In the proposed method, we can decode the image from JPEG bitstreams into which the binary data is embedded first using the traditional standard JPEG decoder, and then we can extract the embedded binary data perfectly by the post-processing from ...

2010
Hong Liu Yueliang Qian Shouxun Lin

Robust person detection in real-world images is interesting and important for a variety of applications, such as visual surveillance. We address the task of detecting persons in elevator surveillance scenes in this paper. To get more passengers in the lift car, the camera usually installed at the corner of ceiling. However, the high and space of lift car are limited, which makes person occluded...

Journal: :Computer-Aided Design 2006
Joon-Kyung Seong Gershon Elber Myung-Soo Kim

A robust and efficient algorithm for trimming both local and global self-intersections in offset curves and surfaces is presented. Our scheme is based on the derivation of a rational distance map between the original curve or surface and its offset. By solving a bivariate polynomial equation for an offset curve or a system of three polynomial equations for an offset surface, all local and globa...

2014
Aurélie Leborgne Julien Mille Laure Tougne

In order to match shapes using their skeletons, these ones should be thin, robust to noise, homotopic to the shape, consequently, connected. However, these properties are difficult to obtain simultaneously when the shape is defined on a discrete grid. In this paper, we propose a new skeletonization algorithm, which has all these properties. Based on the Euclidean distance map, the algorithm ext...

Journal: :IEEE Trans. Consumer Electronics 2003
Yoon Kim Chun-Su Park Sung-Jea Ko

In this paper, we present a novel postprocessing technique based on the theory of the projection onto convex sets (POCS) in order to reduce the blocking artifacts in digital high definition television (HDTV) images. By detecting and eliminating the undesired high-frequency components, mainly caused by blocking artifacts, we propose a new smoothness constraint set (SCS) and its projection operat...

2009
Andrzej Ruta Yongmin Li Fatih Murat Porikli Shintaro Watanabe Hiroshi Kage Kazuhiko Sumi

In this paper we discuss theoretical foundations and a practical realization of a circular traffic sign detection and recognition system operating on board of a vehicle. To initially detect sign candidates in the scene, we utilize the circular Hough transform with an appropriate post-processing in the vote space. Track of an already established candidate is maintained using a function that enco...

2000
Simona E. Grigorescu Nicolai Petkov Peter Kruizinga

Texture feature extraction operators, which comprise linear filtering, eventually followed by post-processing, are considered. The filters used are Laws’ masks, filters derived from well-known discrete transforms, and Gabor filters. The post-processing step comprises non-linear point operations and/or local statistics computation. The performance is measured by means of the Mahalanobis distance...

Journal: :CoRR 2012
Maxim Vashkevich Alexander A. Petrovsky

A fast Discrete Cosine Transform (DCT) algorithm is introduced that can be of particular interest in image processing. The main features of the algorithm are regularity of the graph and very low arithmetic complexity. The 16-point version of the algorithm requires only 32 multiplications and 81 additions. The computational core of the algorithm consists of only 17 nontrivial multiplications, th...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید