| ²é¿´: 2068 | »Ø¸´: 5 | |||
| µ±Ç°Ö»ÏÔʾÂú×ãÖ¸¶¨Ìõ¼þµÄ»ØÌû£¬µã»÷ÕâÀï²é¿´±¾»°ÌâµÄËùÓлØÌû | |||
yang3kuiгæ (³õÈëÎÄ̳)
|
[ÇóÖú]
´ó¼Ò°ïæ¿´¿´Õâ¸ö decision letter »¹ÓÐ argueµÄ¿Õ¼äÂð£¿
|
||
|
Reviewer Comments: Reviewer: 1 Recommendation: R - Reject (Paper Is Not Of Sufficient Quality Or Novelty To Be Published In This Transactions) Comments: The two main claims of the authors are: (1) One can use recursions to compute the bilateral filter. (2) DCT kernels are a *better* option than raised cosines. As for (1), it is possible that the authors overlooked the fact that the recursions derived in the paper is just another way of writing the recursions in (**). It all boils down to the fact that as soon we have a constant spatial filter and a shiftable range filter, we can use recursions. The case where the spatial filter is not flat is more challenging. It was proposed in (**) that this can also be accounted for by approximating the spatial filter using shiftable kernels. This is exactly what is observed just before Section 3.2. Coming to point (2), note that it is clear from Fig. 2 that the DCT approximation has the same problem as Taylor polynomials, namely, they are not guaranteed to be monotonic and non-negative, and can oscillate. As was observed in (*) for Taylor polynomials, this can introduce artifacts in the final output, particularly close to edges. Morally speaking, the DCT kernel is just another linear combination of cosines. And so the idea of using DCT over raise cosines cannot be regarded as very original. (*) K. N. Chaudhury, D. Sage, and M. Unser, "Fast O(1) Bilateral Filtering Using Trigonometric Range Kernels," IEEE Trans. Image Process., 2011. (**) K. N. Chaudhury, "Constant-Time Filtering Using Shiftable Kernels," IEEE Signal Process. Lett., vol. 18, 2011. Additional Questions: 1. Is the topic appropriate for publication in these transactions?: Yes 2. Is the topic important to colleagues working in the field?: Yes Explain: 1. Is the paper technically sound?: Yes why not?: 2. Is the coverage of the topic sufficiently comprehensive and balanced?: Treatment somewhat unbalanced, but not seriously so. 3. How would you describe technical depth of paper?: Appropriate for the Generally Knowledgeable Individual Working in the Field or a Related Field 4. How would you rate the technical novelty of the paper?: Somewhat Novel 1. How would you rate the overall organization of the paper?: Could be improved 2. Are the title and abstract satisfactory?: Yes Explain: 3. Is the length of the paper appropriate? If not, recommend how the length of the paper should be amended, including a possible target length for the final manuscript.: Yes 4. Are symbols, terms, and concepts adequately defined?: Yes 5. How do you rate the English usage? : Needs improvement 6. Rate the Bibliography: Satisfactory null: 1. How would you rate the technical contents of the paper?: Fair 2. How would you rate the novelty of the paper?: Slightly Novel 3. How would you rate the "literary" presentation of the paper?: Mostly Accessible 4. How would you rate the appropriateness of this paper for publication in this IEEE Transactions?: Good Match Reviewer: 2 Recommendation: RQ - Review Again After Major Changes Comments: -The whole process if represented in a flow diagram would be better - More examples and more data is necessary - Some grammatical errors in page 1 - As you're concluding that UBF is a better approach than the previous approaches, a more detailed comparison of the complexity, run-time and various factors leading to this conclusion is necessary - More info on how the results were validated would be helpful for the readers Additional Questions: 1. Is the topic appropriate for publication in these transactions?: Perhaps 2. Is the topic important to colleagues working in the field?: Yes Explain: 1. Is the paper technically sound?: Yes why not?: 2. Is the coverage of the topic sufficiently comprehensive and balanced?: Treatment somewhat unbalanced, but not seriously so. 3. How would you describe technical depth of paper?: Appropriate for the Generally Knowledgeable Individual Working in the Field or a Related Field 4. How would you rate the technical novelty of the paper?: Somewhat Novel 1. How would you rate the overall organization of the paper?: Could be improved 2. Are the title and abstract satisfactory?: Yes Explain: 3. Is the length of the paper appropriate? If not, recommend how the length of the paper should be amended, including a possible target length for the final manuscript.: Yes 4. Are symbols, terms, and concepts adequately defined?: Not always 5. How do you rate the English usage? : Satisfactory 6. Rate the Bibliography: Satisfactory null: 1. How would you rate the technical contents of the paper?: Good 2. How would you rate the novelty of the paper?: Sufficiently Novel 3. How would you rate the "literary" presentation of the paper?: Mostly Accessible 4. How would you rate the appropriateness of this paper for publication in this IEEE Transactions?: Good Match ÎÒ¾õµÃµÚÒ»¸öÉó¸åÈ˵ÄÁ½ÌõÒâ¼û£¬ÎÒ¶¼ºÜÄÑÔÞͬ£¬ÌرðÊǵÚÒ»Ìõ¡£ÎÒ¾õµÃËûûÓÐÀí½â ÎÒµÄÂÛÎĺÍ**ÂÛÎÄ£¬ÒÔÖÁÓÚ ´Ó±íÃæÉÏ¿´¸Ð¾õÒ»Ñù£¬ ÆäʵËûÃǵı¾ÖÊÓкܴóµÄ²î±ð¡£ µÚ¶þÌõ Ò²ÓÐÎÊÌ⣬ÎÒ³ÐÈÏûÓнâ¾öËû˵˵µÄÄÇÁ½¸öÎÊÌ⣬µ«ÊÇÖÁ½ñ¶¼Ã»È˽â¾ö¡£¶øÎÒµÄËã·¨±È֮ǰµÄmore efficient¡£²¢ÄÜÊÊÓÃÓÚ¸ü¶à³¡ºÏ¡£ ¾õµÃ²»·þÆø£¬ÏëÒª argue¡£µ«ÊÇû¾Ñ飬Çó¸ßÈË´Í½Ì µÚһƪ IEEE Transaction ²»Ïë±»´ò»÷¡£¡£¡£ |
» ²ÂÄãϲ»¶
265Çóµ÷¼Á
ÒѾÓÐ4È˻ظ´
085700×ÊÔ´Óë»·¾³308Çóµ÷¼Á
ÒѾÓÐ6È˻ظ´
Ò»Ö¾Ô¸¼ªÁÖ´óѧ²ÄÁÏѧ˶321Çóµ÷¼Á
ÒѾÓÐ12È˻ظ´
286·ÖÈ˹¤ÖÇÄÜרҵÇëÇóµ÷¼ÁÔ¸Òâ¿ç¿¼£¡
ÒѾÓÐ3È˻ظ´
329Çóµ÷¼Á
ÒѾÓÐ5È˻ظ´
ÉêÇë»Ø¸åÑÓÆÚÒ»¸öÔ£¬±à¼Í¬ÒâÁË¡£µ«ÏµÍ³ÉϵÄʱ¼äû±ä£¬¸ø±à¼ÓÖдÓʼþÁË£¬Ã»»Ø¸´
ÒѾÓÐ4È˻ظ´
²ÄÁÏѧ˶318Çóµ÷¼Á
ÒѾÓÐ5È˻ظ´
Ò»Ö¾Ô¸Öйúº£Ñó´óѧ£¬ÉúÎïѧ£¬301·Ö£¬Çóµ÷¼Á
ÒѾÓÐ6È˻ظ´
081700»¯¹¤Ñ§Ë¶µ÷¼Á
ÒѾÓÐ3È˻ظ´
Ò»Ö¾Ô¸ËÕÖÝ´óѧ²ÄÁÏÇóµ÷¼Á£¬×Ü·Ö315£¨Ó¢Ò»£©
ÒѾÓÐ3È˻ظ´
» ±¾Ö÷ÌâÏà¹Ø¼ÛÖµÌùÍÆ¼ö£¬¶ÔÄúͬÑùÓаïÖú:
PRL argue Letter ÔõôµÝ½»£¿
ÒѾÓÐ8È˻ظ´
ÕâÖÖÇé¿ö¿ÉÒÔargueÂð£¿Éó¸åÈËÈÏΪ²»ÊʺϷ¢letter£¬Ó¦¸Ãд³É³¤ÎÄÕ¡¡
ÒѾÓÐ8È˻ظ´
ÓоÑéµÄ³æ³æ°ï¿´¿´decision letter£¨JOTE£©£¬ÊÇ·ñÓмÌÐøÐ޸ĵıØÒª£¿
ÒѾÓÐ6È˻ظ´
ÎÄÕ±»¾Ü£¬ÊÇ·ñÉêËߣ¿
ÒѾÓÐ25È˻ظ´
Í·ÌÛ£¬Ôõôargue?
ÒѾÓÐ12È˻ظ´
|
5Â¥2013-05-04 12:06:26
wulishi8
ר¼Ò¹ËÎÊ (ÖªÃû×÷¼Ò)
-

ר¼Ò¾Ñé: +373 - SEPI: 5
- Ó¦Öú: 1195 (²©ºó)
- ¹ó±ö: 0.888
- ½ð±Ò: 28970.7
- É¢½ð: 4204
- ºì»¨: 517
- Ìû×Ó: 7711
- ÔÚÏß: 1702.7Сʱ
- ³æºÅ: 654606
- ×¢²á: 2008-11-15
- רҵ: Äý¾Û̬ÎïÐÔ II £ºµç×ӽṹ
- ¹ÜϽ: ÂÛÎÄͶ¸å½»Á÷

2Â¥2013-05-04 00:05:52
goslar
ľ³æ (Ö°Òµ×÷¼Ò)
ÎÒ²»ÔÙÓ¦Öú!
- Ó¦Öú: 118 (¸ßÖÐÉú)
- ½ð±Ò: 3592.7
- ºì»¨: 6
- Ìû×Ó: 3115
- ÔÚÏß: 174.5Сʱ
- ³æºÅ: 1547023
- ×¢²á: 2011-12-22
- ÐÔ±ð: MM
- רҵ: ÃâÒßÉúÎïѧ

3Â¥2013-05-04 09:32:09
yang3kui
гæ (³õÈëÎÄ̳)
- Ó¦Öú: 0 (Ó×¶ùÔ°)
- ½ð±Ò: 3.5
- Ìû×Ó: 7
- ÔÚÏß: 9.7Сʱ
- ³æºÅ: 2114214
- ×¢²á: 2012-11-08
- רҵ: µ¼º½¡¢ÖƵ¼Óë´«¸Ð¼¼Êõ
4Â¥2013-05-04 12:05:36













»Ø¸´´ËÂ¥

10